Cod sursa(job #306805)
Utilizator | Data | 21 aprilie 2009 22:50:41 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
using namespace std;
int main() {
int p,m,i,n,k,t,nr;
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
if (p==0)
g<<1;
else{
m=25; i=1; nr=2;
n=5;
k=1;
while (k<p) {
n=n+5;
if (n==m) {
k=k+nr;
m=m+25;
t=m;
nr=0;
while (t>0) {
t=t/5;
nr++;
}
}
else
k++;
}
if (k==p)
g<<n;
else
g<<-1;
}
g.close();
f.close();
return 0;
}