Pagini recente » Cod sursa (job #2020059) | Cod sursa (job #215833) | Istoria paginii runda/oni2014ziua1_11 | Cod sursa (job #1112855) | Cod sursa (job #1384868)
#include <iostream>
#include <fstream>
using namespace std;
int zero(int n)
{
int x=0;
while(n>=5)
{
x+=n/5;
n/=5;
}
return x;
}
long long fc(int p)
{
long long i=0;
int pas=1<<30;
while(pas!=0)
{
if(zero(i+pas)<p)
i+=pas;
pas/=2;
}
if(zero(i+1)==p)
return i+1;
return -1;
}
int main()
{
int p;
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
g<<fc(p);
return 0;
}