Cod sursa(job #1051654)
Utilizator | Data | 10 decembrie 2013 13:04:29 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <stdio.h>
using namespace std;
FILE*f=fopen("factorial.in","r");
FILE*g=fopen("factorial.out","w");
long long unsigned n,p,k,ok=1,s;
int main()
{
fscanf(f,"%d",&p);
while (ok)
{
n++;
s=0; k=1;
while (n/k!=0)
{
k*=5;
s+=n/k;
}
if (s==p)
{
fprintf(g,"%d",n);
return 0;
}
}
}