Cod sursa(job #1081889)
| Utilizator | Data | 13 ianuarie 2014 22:31:58 | |
|---|---|---|---|
| Problema | Factorial | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int n, k, v[100005], st, dr, out;
long long sum, mid, mx=1<<29;
void check(int a)
{
sum=0;
while(a)
{
sum+=a/5;
a/=5;
}
}
int bin_src()
{
st=1, dr=mx;
while(st<=dr)
{
mid=(st+dr)/2;
check(mid);
if(sum==k)
out=mid;
if(sum>=k) dr=mid-1;
else st=mid+1;
}
}
int main()
{
f>>k;
bin_src();
if(out) g<<out;
else g<<-1;
return 0;
}
