Cod sursa(job #1435707)
Utilizator | Data | 14 mai 2015 09:47:07 | |
---|---|---|---|
Problema | Factorial | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
long n=4, nr, p;
int k=0;
f >> p;
if(p==0){
g << 1;
return 0;
}
while(nr!=p){
nr=0;
n++;
for(long i=5; i<=n; i=i+5){
long a=i;
while(a%5==0){
nr=nr+1;
a=a/5;
}
}
if(nr>p){
nr=p;
k=1;
}
}
if(k==0) g << n;
else g << -1;
f.close();
g.close();
return 0;
}