Cod sursa(job #1985403)
Utilizator | Data | 27 mai 2017 20:40:51 | |
---|---|---|---|
Problema | Factorial | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <stdio.h>
FILE *f1 = fopen("fact.in","r");
FILE *f2 = fopen("fact.out","w");
long long n,sol,pas,x;
long long zeroNum(long long x)
{
long long sol = 0;
while(x)
{
x/=5;
sol+=x;
}
return sol;
}
int main()
{
fscanf(f1,"%lld",&n);
pas = 1<<30;
while(pas)
{
if(zeroNum(sol + pas) < n)
sol += pas;
pas>>=1;
}
fprintf(f2,"%lld",sol+1);
return 0;
}