Cod sursa(job #1936552)
Utilizator | Data | 23 martie 2017 10:48:49 | |
---|---|---|---|
Problema | Factorial | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int n,p,k,f2,f5;
int main()
{
f>>p;
if(p==0)
{
g<<1;
return 0;
}
for(n=2;;n++)
{
k=n;
while(k%2==0)
k/=2,f2++;
while(k%5==0)
k/=5,f5++;
if(min(f2,f5)==p)
{
g<<n;
return 0;
}
if(min(f2,f5)>p)
{
g<<-1;
return 0;
}
}
return 0;
}