Cod sursa(job #2047344)
Utilizator | Data | 24 octombrie 2017 19:10:00 | |
---|---|---|---|
Problema | Factorial | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long p,n,s;
int nr0(int n)
{
int a;
a=5;
s=0;
while(n/a>0)
{
s=s+n/a;
a=a*5;
}
return s;
}
int main()
{
f>>p;
n=1;
while(nr0(n)!=p && n<10000000)
n++;
if(nr0(n)==p)
g<<n;
else
g<<"-1";
return 0;
}