Cod sursa(job #675047)
| Utilizator |  Muresan Ionut ionutzu58 |
Data | 7 februarie 2012 00:28:51 |
|---|---|---|---|
| Problema | Factorial | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.29 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{long n=1,p,c=1,k=1,i=0;
ifstream f("factorial.in");
ofstream g("factorial.out");
f>>p;
for(i=1;i<=p;i++)
c=c*10;
i=1;
while(k==1)
{i++;
n=n*i;
if(n%c==0) k=0;
}
g<<i;
f.close(); g.close();
return 0;
}