Cod sursa(job #1057981)
| Utilizator | Data | 14 decembrie 2013 21:55:51 | |
|---|---|---|---|
| Problema | Factorial | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long factorial(int n)
{long long p=1;
for(int i=2;i<=n;i++)p*=i;
return p;
}
int nrcifre(long long n)
{int k=0;
while(n){if(n%10==0)k++;else break;n/=10;}
return k;
}
int main()
{
int P;
f>>P;
for(int i=1;;i++)if(nrcifre(factorial(i))==P){g<<i;break;}
return 0;
}
