Cod sursa(job #1488472)
| Utilizator | Data | 19 septembrie 2015 01:58:43 | |
|---|---|---|---|
| Problema | Factorial | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("fact.in");
ofstream out("fact.out");
int no_0(int n)
{
int k=0;
int x=5;
while(x<=n)
{
k+=n/x;
x*=5;
}
return k;
}
int main()
{
int p;
in>>p;
int r = -1;
int st = 0;
int dr = 5*100000000;
int q;
while(st < dr)
{
q = (st+dr)/2;
if(no_0(q)==p)
{
r = q;
break;
}
else if(no_0(q) < p) st = q + 1;
else dr=q-1;
}
for(int i = 3; i>=0; i--)
{
if(r%5==0)break;
r--;
}
out<<r;
return 0;
}
