Cod sursa(job #1436438)
Utilizator | Data | 15 mai 2015 21:49:20 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int main()
{
int n=0,p,i,cop=5;
f>>p;
if(p==0)
g<<-1;
else
{
n=p*5;
if(n>=25)
for(i=25;i<=n;i+=25)
{
n=n-cop;
cop=cop+5;
}
g<<n;
}
return 0;
}