Cod sursa(job #2438343)
Utilizator | Data | 12 iulie 2019 12:12:19 | |
---|---|---|---|
Problema | Factorial | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream A("fact.in");
ofstream B("fact.out");
long long P,N=1,d,f=0;
A>>P;
while(f>=0)
{
f=0;
for(int i=1;i<=N;++i)
{
d=i;
while(d%5==0)
{
d/=5;
++f;
}
}
if(f==P)
{
B<<N;break;
}
else if(f>P)
{
B<<"-1";break;
}
++N;
}
A.close();
B.close();
return 0;
}