Cod sursa(job #1035874)
Utilizator | Data | 18 noiembrie 2013 20:51:21 | |
---|---|---|---|
Problema | Factorial | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("fact.in");
ofstream g ("fact.out");
int main()
{
long p;
f>>p;
int ok=0,nr=1,n,nrde0,pow;
if(p==0) {n=1;g<<n;}
else
{while(ok==0)
{
pow=5;nrde0=0;
while(pow<=nr)
{
nrde0+=nr/pow;
pow=pow*5;
}
if(nrde0==p)
{
ok=1;
n=nr;
}
nr++;
}
g<<n;
}
f.close();
g.close();
return 0;
}