Pagini recente » Cod sursa (job #139899) | Cod sursa (job #1765765) | Cod sursa (job #3348083) | Cod sursa (job #489712) | Cod sursa (job #3348155)
#include <bits/stdc++.h>
using namespace std;
#define USE_STD_IO 0
#if USE_STD_IO
#define fin cin
#define fout cout
#else
ifstream fin("frac.in");
ofstream fout("frac.out");
#endif // USE_STD_IO
long long n, p, fact[102], nrp;
static inline void DescFactPrimi(long long n) {
long long d = 2;
while(1 < n) {
if(0 == n % d) {
fact[++nrp] = d;
while(0 == n % d) n /= d;
}
d += 1 + (d & 1);
}
}
static inline long long CatePrime(long long n) {
long long nr = 0;
for(long long i = (1 << nrp) - 1; i >= 1; i--) {
long long prod = 1;
long long biti = 0;
for(long long j = 0; j < nrp; j++) {
if(i >> j & 1) {
biti++;
prod *= fact[j + 1];
}
}
if(biti & 1) nr += n / prod;
else nr -= n / prod;
}
return n - nr;
}
int main() {
if(USE_STD_IO) ios_base::sync_with_stdio(false);
fin.tie(NULL);
fout.tie(NULL);
fin >> n >> p;
DescFactPrimi(n);
long long st = 1, dr = 1e15;
long long mij, poz = dr;
while(st <= dr) {
mij = st + (dr - st) / 2;
if(p <= CatePrime(mij)) {
poz = mij;
dr = mij - 1;
}
else st = mij + 1;
}
fout << poz;
return 0;
}