求互质数对的两种方法:欧拉函数和容斥原理

1.HDU4135

首先,我们可以先求出1 ~ a - 1内与n互质的数,再求出1 ~ b内与n互质的数.最后利用前缀和算出来即可.

#include <iostream>
#include <algorithm>
#include <queue>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <time.h>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define PII pair<int, int>
#define PDI pair<double, int>
#define int long long
#define ll long long
#define ull unsigned long long
#define eps 1e-6
#define MOD 1000000007
#define debug(a) cout << #a << "=" << a << endl;
#define all(x) (x).begin(), (x).end()
#define mem(x, y) memset((x), (y), sizeof(x))
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
const int N = 100;
int primes[N], cnt;
void p(int x) {
    cnt = 0;
    for (int i = 2; i <= x / i; ++i) 
        if (x % i == 0) {
            primes[++cnt] = i;
            while (x % i == 0)
                x /= i;
        }
    if (x > 1)
        primes[++cnt] = x;
}
int solve(int r, int x) {
    p(x);
    int res = 0;
    for (int i = 1; i < (1 << cnt); ++i) {
        int bits = 0, temp = 1;
        for (int j = 1; j <= cnt; ++j) 
            if (i >> (j - 1) & 1) {
                ++bits;
                temp *= primes[j];
            }
        if (bits % 2 == 0)
            res -= r / temp;
        else
            res += r / temp;
    }
    return r - res;
}

signed main() {
#ifdef LOCAL
    freopen("input.in", "r", stdin);
    freopen("output.out", "w", stdout);
#endif
    IOS;
    int T, Case = 0;
    cin >> T;
    while (T--) {
        int a, b, n;
        cin >> a >> b >> n;
        cout << "Case #" << ++Case << ": "  << solve(b, n) - solve(a - 1, n) << "\n";
    }
}

2. HDU 1695

1. 首先,求区间[1, r]之间gcd值为k的数对个数,即gcd(a, b) = k,我们可以转化为gcd(a / k, b / k) = 1,即求1 ~ r / k中,有多少数对是互质的,转化一下,就是求1 ~ r的欧拉函数和.对于对于1 ~ a / k(a < b)这个区间,我们可以直接求欧拉函数前缀和.

2. 对于[a / k + 1, b / k]这个区间,我们用容斥原理求解.转化一下问题,实际上就是求1 ~ a / k中有多少个数与i互质,其中a / k + 1 <= i <= b / k.如果两个数互质,说明没有共同的质因数.对于i,我们预处理出他的质因数,比如对于质因数2,1 ~ a / k中一共有 (a / k) / 2个数不是跟i互质的,....最后将结果累加即可.

我们使用欧拉函数前缀和与容斥原理解决问题,用到了贡献的思想,就是考虑每个数对答案的贡献.

#include <iostream>
#include <algorithm>
#include <queue>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <time.h>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define PII pair<int, int>
#define PDI pair<double, int>
#define int long long
#define ll long long
#define ull unsigned long long
#define eps 1e-6
#define MOD 1000000007
#define debug(a) cout << #a << "=" << a << endl;
#define all(x) (x).begin(), (x).end()
#define mem(x, y) memset((x), (y), sizeof(x))
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
const int N = 1e5 + 10;
int l, r, k;
int phi[N], sum[N];
vector<int> primes[N];
void euler(int n) {
    for (int i = 1; i <= n; ++i)
        phi[i] = i;
    primes[1].emplace_back(1);
    sum[1] = 1;
    for (int i = 2; i <= n; ++i) {
        //初始化phi[i] = i时,i为质数,故phi[i] = i - 1
        //用质数筛除每个数,反过来看就是求每个数的所有质因数,然后根据欧拉函数的解析式可以求出phi值
        if (phi[i] == i) {
            primes[i].emplace_back(i);
            phi[i] = i - 1;
            for (int j = i + i; j <= n; j += i) {
                phi[j] = phi[j] / i * (i - 1);
                primes[j].emplace_back(i);
            }
        }
        sum[i] = sum[i - 1] + phi[i];
    }
}
signed main() {
#ifdef LOCAL
    freopen("input.in", "r", stdin);
    freopen("output.out", "w", stdout);
#endif
    IOS;
    euler(100000);
    int T, Kase = 0;
    cin >> T;
    while (T--) {
        cin >> l >> l >> r >> r >> k;
        if (k == 0) {
            cout << "Case " << ++Kase << ": " << 0 << "\n";
            continue;
        }
        if (l > r)
            swap(l, r);
        l /= k, r /= k;
        //先求出[1, l/k]中互质的数的对数,即求(1<=i<=n-1)∑[gcd(i, n) == 1] = ∑phi(i)
        int ans = sum[l];
        //再用容斥求出[1, l/k]中与i(l/k+1<=i<=r/k)互质的数的个数
        for (int _ = l + 1; _ <= r; ++_) {
            int res = 0;
            for (int i = 1; i < (1 << (int)primes[_].size()); ++i) {
                int temp = 1, bits = 0;
                for (int j = 0; j < (int)primes[_].size(); ++j) 
                    if (i >> j & 1) {
                        ++bits;
                        temp *= primes[_][j];
                    }
                if (bits % 2 == 0)
                    res -= l / temp;
                else
                    res += l / temp;
            }
            ans += l - res;
        }
        cout << "Case " << ++Kase << ": " << ans << "\n";
    }   
}