Cod sursa(job #2698387)
| Utilizator | Data | 21 ianuarie 2021 20:57:00 | |
|---|---|---|---|
| Problema | Factorial | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long p,low=1,high=100000000;
long long mid;
long long functie(long long val)
{
long long rez=0;
for(int i=5; i<=val; i*=5)
rez=rez+val/i;
return rez;
}
int main()
{
f>>p;
if(p==0)
g<<1;
else
{
while(low<high)
{
mid=low+(high-low)/2;
if(functie(mid)>=p)
high=mid;
else low=mid+1;
}
if(functie(low)==p)
g<<low;
else g<<-1;
}
return 0;
}
