Cod sursa(job #104121)
Utilizator | Data | 15 noiembrie 2007 22:17:21 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream.h>
long p;
int a[100000];
int main()
{ ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
a[1]=5;
if(p==0)
{ g<<1;
f.close();
g.close();
return 0;
}
long i;
for(i=2;i<=100000;i++)
{ a[i]=a[i-1]+5;
if(i%6==0)
{ a[i]=a[i-1];
a[i-1]=0;
}
}
if(a[p]!=0) g<<a[p];
else g<<-1;
f.close();
g.close();
return 0;
}