Cod sursa(job #1399802)
| Utilizator | Data | 24 martie 2015 22:05:54 | |
|---|---|---|---|
| Problema | Factorial | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long p;
long long ok(long long x)
{
long long rez=0;
for(long long i=5;i<=x;i*=5) rez+=x/i;
return rez;
}
int main()
{
f>>p;
long long st=1,dr=p*5,mj=0;
while(st<=dr)
{
mj=(st+dr)/2;
if(ok(mj)<p) st=mj+1;
else dr=mj-1;
}
if(ok(st)==p) g<<st;
else g<<"-1";
return 0;
}
