Cod sursa(job #1326999)
| Utilizator | Data | 26 ianuarie 2015 11:57:54 | |
|---|---|---|---|
| Problema | Factorial | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | procopiu_9_oji2015 | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
#include <cstdio>
using namespace std;
ofstream g("factorial.out");
int P,m,s,p,nr,nr0,i,n;
int main()
{
freopen("factorial.in","r",stdin);
scanf("%d", &P);
s=0,
nr0=1,
nr=10,
i=5;
if(p==0) g<<1;
while(s<=p){
if(i==nr*10){nr=nr*10;
nr0++;
}
if(i%10==0) s+=nr0;
else {
long n=i;
while(n%5==0){s++;
n/=5;
}
}
if(s==p) g<<i;
i+=5;
}
g<<-1;
return 0;
}
