Cod sursa(job #133518)
Utilizator | Data | 8 februarie 2008 20:25:51 | |
---|---|---|---|
Problema | Factorial | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include<fstream.h>
long long i,j,p,k,l,m,n;
int main(){
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
while((i+j)<p)
{i+=5;
m=i;
k=0;
while(m%5==0)
{
m/=5;j++;k++;
}
}
j-=k;
while(i+j>p)
{i--;
m=i;
while(m%5==0)
{m/=5;
j--;}
}
k=i+j;
if(k==p)
g<<i*5;
else
g<<-1;
f.close();
g.close();
return 0;
}