HDOJ 4135 Co-prime (容斥)

题意

求a和b之间有多少个数和n互斥。

思路

显然问题能转化成a-1之内和b之内与n互斥的个数，然后我们可以求它的反问题也就是m之内与n不互质的数字个数，某个数与n不互质也就是这个数能被n的某一个或多个质因子整除，然后就是经典容斥了。

代码

#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 a, b, n;
vector<LL> p;

LL solve(LL m)
{
    LL ans = 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) ans += m / now;
        else ans -= m / now;
    }
    return m - ans;
}

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int T;
    scanf("%d", &T);
    for (int ncase = 1; ncase <= T; ncase++)
    {
        scanf("%lld%lld%lld", &a, &b, &n);
        p.clear();
        for (int i = 2; i * i <= n; i++) if (n % i == 0)
        {
            p.push_back(i);
            while (n % i == 0)
                n /= i;
        }
        if (n != 1) p.push_back(n);
        printf("Case #%d: ", ncase);
        printf("%lld\n", solve(b) - solve(a - 1));
    }
    return 0;
}