POJ 2773 Happy 2006 (二分+容斥)

题意

求与n互质的第k个数。

思路

显然求计数问题的第k个，我们二分出来mid以内有多少个和n互质的数就可以了。求m以内和n互质的数的个数就是那个比较经典的co prime题了。

代码

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define LL long long
#define Lowbit(x) ((x)&(-x))
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1|1
#define MP(a, b) make_pair(a, b)
const int INF = 0x3f3f3f3f;
const int MOD = 1000000007;
const int maxn = 1e5 + 10;
const double eps = 1e-8;
const double PI = acos(-1.0);
typedef pair<int, int> pii;
LL n, k;

LL solve(LL mid)
{
    vector<LL> p;
    LL m = n;
    for (int i = 2; i * i <= m; i++) if (m % i == 0)
    {
        p.push_back(i);
        while (m % i == 0)
            m /= i;
    }
    if (m != 1) p.push_back(m);
    LL num = 0;
    for (int i = 1; i < (1 << p.size()); i++)
    {
        int cnt = 0;
        LL now = 1;
        for (int j = 0; j < p.size(); j++)
            if (i & (1 << j)) cnt++, now *= p[j];
        if (cnt & 1) num += mid / now;
        else num -= mid / now;
    }
    return mid - num;
}

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    while (cin >> n >> k)
    {
        LL l = 1, r = 1e18;
        while (l < r)
        {
            LL mid = (l + r) >> 1;
            LL t = solve(mid);
            if (t < k) l = mid + 1;
            else r = mid;
        }
        cout << l << endl;
    }
    return 0;
}