Cod sursa(job #281353)
Utilizator | Data | 14 martie 2009 18:24:06 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.24 kb |
#include<fstream.h>
ifstream f("fact.in");
ofstream g("fact.out");
int main ()
{
long n,p,i,k;
f>>p;
for (n=1; n<=p; n++)
{
k=0; i=1;
while (pow(5,i)<=n)
{
k+=n/pow(5,i);
i++;
}
if (k==p) g<<n;
}
}