Cod sursa(job #686640)
Utilizator | Data | 21 februarie 2012 19:15:58 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include <fstream>
#include <math.h>
using namespace std;
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
long P,K,nr,copie;
f>>P;
K=0;
if(P==0) g<<1;
else
{
nr=5;
while(K<P)
{ if(sqrt(nr)==int(sqrt(nr))) K=K+2;
else K++;
copie=nr;
nr=nr+5;
}
g<<copie;
}
f.close();
g.close();
return 0;
}