Cod sursa(job #1060106)
| Utilizator |  Popa Mirel mirel |
Data | 17 decembrie 2013 16:35:00 |
|---|---|---|---|
| Problema | Factorial | Scor | 15 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.29 kb |
#include<fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int s,ok;
unsigned long long int n,p,i;
int main()
{f>>p;
if(p==0)
{g<<1;
ok=1;}
for(i=1;ok==0;i++)
{n=i;
while(n%5==0)
{s++;
n=n/5;}
if(s==p)
{g<<i;
ok=1;}
if(i==100000000)
g<<-1;}
return 0;}