Cod sursa(job #1121488)
Utilizator | Data | 25 februarie 2014 12:59:24 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.26 kb |
#include<iostream>
using namespace std;
int fact(int n)
{int k=0; int d=0;
for(int i=1;i<=n;i++)
{int x=i;
while(x%5==0){k++;x=x/5;}
}
return k;
}
int main()
{ long n=1;int p;
cin>>p;
while ( fact(n) <= p)n++;
cout << n;}