题意是输入m和k,求第k个和m互素的数,m (1 <= m <= 1000000), K (1 <= K <= 100000000),数据比较大
首先,可以求出m所有的素因子,最多不超过十个。如果我们已知一个x,可以根据容斥原理计算出这个数是第几个质因数,计算量大概就是2^n,n表示m的质因数个数,n<10。然后二分找到x=k就可以了,二分上界我取的十倍的k。
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int pr[100];
int gcd(int a, int b) {
if(b) return gcd(b, a % b);
return a;
}
int main() {
int m, k;
while(~scanf("%d%d", &m, &k)) {
long long ans = k;
long long up = k * 10LL, dw = 1;
int n = 0, p = 2;
while(m > 1) {
if(p * p > m) {
pr[n++] = m;
break;
}
if(m % p == 0) {
pr[n++] = p;
while(m % p == 0) m /= p;
}
p++;
}
// for(int i = 0; i < n; i++) {
// printf("%d ", pr[i]);
// }
// printf("\n");
while(dw <= up) {
// printf("##%lld %lld\n", dw, up);
ans = (up + dw) >> 1;
int nm = (1 << n);
long long num = 0;
for(int i = 1; i < nm; i++) {
int f = -1, x = i;
for(int j = 0; j < n; j++) {
if(x & 1) {
f = pr[j] * f * -1;
}
x >>= 1;
}
num += ans / f;
}
// printf("NN %lld %lld\n", ans, num);
int is = 1;
for(int i = 0; i < n; i++) {
if(ans % pr[i] == 0) is = 0;
}
if(ans - num < k) {
dw = ans + 1;
}
else if(ans - num > k || (ans - num == k && !is)) {
up = ans - 1;
}
else {
printf("%lld\n", ans);
break;
}
}
}
return 0;
}