Cod sursa(job #1596913)
Utilizator | Data | 11 februarie 2016 15:09:22 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
#define nmax 100000000
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
unsigned long long fact(int n)
{
if(n==0)return 1;
else return n*fact(n-1);
}
int main()
{
int n,i,nr=0,k;
f>>n;
for(i=1;i<=nmax;i++)
{
k=fact(i);nr=0;
while(k%10==0)
{k/=10;nr++;}
if(nr==n)break;
}
g<<i;
return 0;
}