Cod sursa(job #2279009)
| Utilizator | Data | 8 noiembrie 2018 20:21:28 | |
|---|---|---|---|
| Problema | Factorial | Scor | 15 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long numar(long long x){
long long nr=0,y=5;
while(x>=y)
{
nr+=x/y;
y*=5;
}
return nr;
}
int caut(int a, int b, int x){
long long k;
int m;
while (a < b) {
m = (a + b) / 2;
k=numar(m);
if (k < x)
a = m + 1;
else
b = m;
}
m = (a + b) / 2;
k=numar(m);
if (k < x) m ++;
return m;
}
int main()
{
int n,k;
f>>n;
k=caut(1,1000,n);
g<<k;
return 0;
}
