Cod sursa(job #609773)
Utilizator | Data | 23 august 2011 11:54:35 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include<fstream.h>
ifstream f("factorial.in");
ofstream g("factorial.out");
main()
{long int P,i,p=0,j,a,t[100000000],k=1;
f>>P;
for(i=1;i<=P;i++)
{t[i]=1;}
for(i=0;i<=5*P;i=i+5)
{a=i;
for(j=1;j<=9;j++)
{p=p+a/5;}
if(p==P)
{g<<i;
t[i/5]=0;}
else
{t[i/5]=1;}
}
for(i=1;i<=P;i++)
{k=k*t[i];}
if(k==1)
{g<<'-1';}
}