Pagini recente » Cod sursa (job #44058) | Cod sursa (job #2525424) | Cod sursa (job #1075156) | Cod sursa (job #2066254) | Cod sursa (job #2657373)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("fact.in");
ofstream cout("fact.out");
#define ull unsigned long long
#define DIM 1000000
ull p, x, nr2, nr5;
int v[DIM + 1];
int CautareBinara(int p) {
ull st = 1, dr = 1 << 18;
ull x = -1;
while(st <= dr) {
ull mid = (st + dr) / 2;
if(v[mid] == p) {
x = mid;
dr = mid - 1;
}else if(v[mid] > p)
dr = mid - 1;
else st = mid + 1;
}
return x;
}
int main() {
cin >> p;
for(int i = 1; i <= DIM; i++) {
if(i % 5 == 0)
v[i]++;
v[i] += v[i - 1];
}
cout << CautareBinara(p);
return 0;
}