Cod sursa(job #1362108)
Utilizator | Data | 26 februarie 2015 10:27:19 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
int nr=0,q,n,x,i;
long long p;
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
if (p==1) {nr=1;g<<nr;}
else
while (p!=0)
{
nr=nr+5;
if (nr%25==0) p=p-2;
else p=p-1;
if (p==0) {g<<nr;break;}
}
return 0;
}