2020 ICPC 济南 F.Gcd Product（经典反演）

Weblink

https://ac.nowcoder.com/acm/problem/216176

Problem

Solution


Code

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 5e5 + 7, mod = 998244353;

int n, m;
int a[N], b[N], c[N];
int primes[N], cnt, mu[N], phi[N];
bool vis[N];
int f[N], g[N], h[N];

void init(int n)
{
    mu[1] = phi[1] = 1;
    for(int i = 2; i <= n; ++ i) {
        if(vis[i] == 0) {
            primes[ ++ cnt] = i;
            phi[i] = i - 1;
            mu[i] = -1;
        }
        for(int j = 1; j <= cnt && i * primes[j] <= n; ++ j) {
            vis[i * primes[j]] = true;
            if(i % primes[j] == 0) {
                phi[i * primes[j]] = phi[i] * primes[j];
                break;
            }
            phi[i * primes[j]] = phi[i] * (primes[j] - 1);
            mu[i * primes[j]] -= mu[i];
        }
    }
}

int ans = 0;

signed main()
{

    init(N - 7);
    scanf("%lld", &n);
    for(int i = 1; i <= n; ++ i) {
        scanf("%lld", &a[i]);
    }

    for(int i = 1; i <= n; ++ i) {
        scanf("%lld", &b[i]);
    }

    for(int i = 1; i <= n; ++ i) {
        for(int j = i; j <= n; j += i) {
            if(mu[i] == 0) continue;
            f[j] = ((f[j] + mu[i] * a[j / i]) % mod + mod) % mod;
            g[j] = ((g[j] + mu[i] * b[j / i]) % mod + mod) % mod;
        }
    }

    for(int i = 1; i <= n; ++ i) {
        for(int j = i; j <= n; j += i) {
            if(phi[i] * phi[j / i] == phi[j]) {
            //if(__gcd(i, j / i) == 1) {
                h[j] = (h[j] + f[i] * g[j / i] % mod) % mod;
            }
        }
    }

    for(int i = 1; i <= n; ++ i) {
        for(int j = i; j <= n; j += i) {
            c[j] = (c[j] + h[i] * j / i % mod) % mod;
        }
    }
    for(int i = 1; i <= n; ++ i) {
        ans = (ans ^ c[i]);
    }
    printf("%lld\n", ans);
    return 0;
}