Cod sursa(job #2050685)
Utilizator | Data | 28 octombrie 2017 11:00:25 | |
---|---|---|---|
Problema | Factorial | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int main()
{
long long p,j,i,n=0,t=1;
f>>p;
for(i=1;i<=199999999;i++)
{
j=i;
if(j%5==0)
{while(j>0)
{
if(j%5==0)n=n+1;
j=j/5;
}
}
if(n>p){t=0;g<<"-1";break;}
if(n==p)break;
}
if(t==1)g<<i;
return 0;
}