Cod sursa(job #2303952)
Utilizator | Data | 17 decembrie 2018 12:00:03 | |
---|---|---|---|
Problema | Factorial | Scor | 15 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long solve(long long val)
{
int p = 5, cont = 0;
while(p <= val)
{
cont += (val / p);
p *= 5;
}
return cont;
}
int main()
{
long long p, i = 1;
f>>p;
while(solve(i) < p)
{
i++;
}
g<<i;
return 0;
}