Cod sursa(job #1053884)
Utilizator | Data | 12 decembrie 2013 23:48:37 | |
---|---|---|---|
Problema | Factorial | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int p;
int zerouri (int x)
{
int z=0;
for (int i=5;i<=x;i*=5)
z+=x/i;
return z;
}
int caut (int l,int r)
{
int m,z;
while (l<=r)
{
m=(l+r)/2;
z=zerouri(m);
if (z==p && l==r)
return m;
if (z==p)
r=m;
else
if (z<p)
l=m+1;
else
r=m-1;
}
return -1;
}
int main()
{
f>>p;
g<<caut(1,500000000);
return 0;
}