Cod sursa(job #633927)
Utilizator | Data | 15 noiembrie 2011 09:09:24 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int main()
{
long N,P,i,u,K;
long long M;
f>>P;
f.close();
N=1;
K=0;
M=1;
for(i=1;i<=N;i++)
M=M*i;
while(M!=0)
{
u=M%10;
if(u=0) K=K+1;
M=M/10;
}
if(K==P) {g<<N;
g.close();}
else N=N+1;
return 0;
}