Cod sursa(job #583134)
Utilizator | Data | 18 aprilie 2011 10:10:14 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include<fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int main()
{const long MAX_N=100;
long long p,i,exista[MAX_N],j,nr;
f>>p;
if(p>=1&&p<=4) {nr=p*5; g<<nr;}
else if(p==0) g<<1;
else
for(i=1;i<=MAX_N;i++)
exista[i]=1;
for(j=5;j<=MAX_N;j+=6)
{exista[j]=-1; if(p==j) g<<exista[j];}
}