Cod sursa(job #1324793)
Utilizator | Data | 22 ianuarie 2015 20:11:00 | |
---|---|---|---|
Problema | Factorial | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int n,i,j,p;
int main()
{
f>>n;
if(n==0)
g<<"1"<<'\n';
else
{
for(i=1;i<=n;i++)
{
if(i==n)
{
g<<(j+1)*5<<'\n';
p=1;
}
j++;
if(i%5==0)
i++;
}
if(!p)
g<<"-1"<<'\n';
}
return 0;
}