Cod sursa(job #504820)
Utilizator | Data | 28 noiembrie 2010 20:43:12 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<stdio.h>
long putere (long n)
{
long k=5,s;
s=0;
while(k<=n)
{
s=s+n/k;
k=k*k;
}
return s;
}
int main()
{
freopen("fact.in","r",stdin);
freopen("fact.out","w",stdout);
long p,i,j,n;
scanf("%ld",&p);
for(n=1;;n++)
if(putere(n)==p)
break;
printf("%ld",n);
printf("\n");
return 0;
}