Cod sursa(job #904139)
| Utilizator | Data | 3 martie 2013 19:37:19 | |
|---|---|---|---|
| Problema | Factorial | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long na,b,c,a,m,P,i;
int main()
{ f>>P;
na=1;
c=26;
if (P==0) g<<1;
else {//if (P>=1000000){na=4000004;c=999999;}
for (i=125;c<=P;i=i+125) {m=i; c=c+28; while(m%5==0) {c++;m=m/5;} }
}
while (c!=P) {c--;i=i-5; }
g<<i+5;
return 0;
}
