Cod sursa(job #137693)
| Utilizator | Data | 17 februarie 2008 12:56:39 | |
|---|---|---|---|
| Problema | Factoriale | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | preONI 2008, Runda 4, Clasele 5-8 | Marime | 0.4 kb |
#include<fstream.h>
#include<math.h>
long fact(int n)
{
long i,m=1;
for(i=2;i<=n;i++)
m=m*i;
return m;
}
int main()
{
ifstream f("factoriale.in");
ofstream g("factoriale.out");
int i,n,k,x; long fac=1;
f>>n;f>>k;
for (i=1;i<=n;i++) {f>>x;
fac=fac*fact(x);
}
int t=1,y=1,v;
while (t){
t=0;
v=fac*y;
if( sqrt(v)==long(sqrt(v)) ) {g<<y;} else t=1;
y++;}
return 0;
}