Cod sursa(job #1107066)
| Utilizator | Data | 13 februarie 2014 16:59:01 | |
|---|---|---|---|
| Problema | Factorial | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
using namespace std;
int P, nrz;
long N, MAX = 9999999;
int zero(int k){
long m = 5;
int z = 0;
while(k/m != 0){
z+=k/m;
m*=5;
}
return z;
}
/*int searchN(){
return N;
}
*/
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
f>>P;
while(nrz != P){
nrz = zero(N);
N++;
}
g<<N-1;
return 0;
}
