Cod sursa(job #901186)
| Utilizator | Data | 1 martie 2013 06:59:55 | |
|---|---|---|---|
| Problema | Factorial | Scor | 15 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<fstream>
using namespace std;
long int n,p;
ifstream f("fact.in");
ofstream g("fact.out");
long int nrzero(long int x)
{long int n2=0,n5=0,p2=0,p5=0;
if(x<5)return 0;
for(int i=2;i<=x;i+=2){p2=i;while(p2%2==0){n2++;p2=p2/2;}}
for(int i=5;i<=x;i+=5){p5=i;while(p5%5==0){n5++;p5=p5/5;}}
if(n2<n5)return n2;
else return n5;
}
int main()
{f>>p;
for(long int i=1;i<=500000;i++)if(nrzero(i)==p){g<<i;break;}
f.close();
g.close();
return 0;}