G. GCD Festival（莫比乌斯、欧拉函数）

最新推荐文章于 2024-11-07 23:24:07 发布

_lifehappy_

最新推荐文章于 2024-11-07 23:24:07 发布

阅读量572

点赞数 2

分类专栏：数论文章标签：算法概率论线性代数

本文链接：https://blog.csdn.net/weixin_45483201/article/details/120640854

版权

数论专栏收录该内容

107 篇文章 6 订阅

订阅专栏

G. GCD Festival

$\sum_{i = 1} ^{n} \sum_{j = 1} ^{n} \gcd(a_i, a_j) \gcd(i, j)\\ \sum_{d = 1} ^{n} d \sum_{i = 1} ^{\frac{n}{d}} \sum_{j = 1} ^{\frac{n}{d}} \gcd(a_{id}, a_{jd})[\gcd(i, j) = 1]\\ \sum_{d = 1} ^{n} d \sum_{k = 1} ^{\frac{n}{d}} \mu(k) \sum_{i = 1} ^{\frac{n}{kd}} \sum_{j = 1} ^{\frac{n}{kd}} \gcd(a_{i kd}, a_{jkd})\\ T = kd\\ \sum_{T = 1} ^{n} \sum_{i = 1} ^{\frac{n}{T}} \sum_{j = 1} ^{\frac{n}{T}} \gcd(a_{iT}, a_{jT}) \sum_{d \mid T} d \mu(\frac{T}{d})\\ \sum_{T = 1} ^{n} \phi(T) \sum_{i = 1} ^{\frac{n}{T}} \sum_{j = 1} ^{\frac{n}{T}} \gcd(a_{iT}, a_{jT})\\$
我们考虑设 $\sum\limits_{i = 1} ^{\frac{n}{T}} \sum\limits_{j = 1} ^{\frac{n}{T}} \gcd(a_{iT}, a_{jT})$ ， $g (x)$ 为 $\in [T, 2T, \dots, \frac{n}{T} T]$ 时 $x$ 的出现次数。
$\sum_{i = 1} ^{m} \sum_{j = 1} ^{m} g(i) g(j) \gcd(i, j), (m = 10 ^ 5)\\ \sum_{d = 1} ^{m} d \sum_{i = 1} ^{\frac{m}{d}} \sum_{j = 1} ^{\frac{m}{d}} g(id) g(jd) [\gcd(i, j) = 1]\\ \sum_{d = 1} ^{m} d \sum_{k = 1} ^{\frac{n}{d}} \mu(k) \left( \sum_{i = 1} ^{\frac{m}{kd}} g(ikd) \right) ^ 2\\ T = kd\\ \sum_{T = 1} ^{m} \phi(T) \left( \sum_{i = 1} ^{\frac{m}{T}} g(iT) \right) ^ 2\\$
考虑重新定义 $g (n)$ 表示为是 $n$ 的倍数的数字有多少个，则上式可以直接写成：
$\sum_{T = 1} ^{m} \phi(T) g(T) ^ 2\\$
由此我们可以在 $O(n \log ^ 2n)$ 的时间内完成这题。

#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10, mod = 1e9 + 7;

int prime[N], phi[N], a[N], n, cnt;

int sum[N], m;

bool st[N];

vector<int> fac[N];

inline int add(int x, int y) {
  return x + y < mod ? x + y : x + y - mod;
}

inline int sub(int x, int y) {
  return x >= y ? x - y : x - y + mod;
}

void init() {
  phi[1] = 1;
  for (int i = 2; i < N; i++) {
    if (!st[i]) {
      prime[++cnt] = i;
      phi[i] = i - 1;
    }
    for (int j = 1; j <= cnt && 1ll * i * prime[j] < N; j++) {
      st[i * prime[j]] = 1;
      if (i % prime[j] == 0) {
        phi[i * prime[j]] = phi[i] * prime[j];
        break;
      }
      phi[i * prime[j]] = phi[i] * (prime[j] - 1);
    }
  }
  for (int i = 1; i < N; i++) {
    for (int j = i; j < N; j += i) {
      fac[j].push_back(i);
    }
  }
}

int f(int n, int T) {
  int ans = 0;
  for (int i = T; i <= n; i += T) {
    for (auto it : fac[a[i]]) {
      ans = sub(ans, 1ll * phi[it] * sum[it] % mod * sum[it] % mod);
      sum[it]++;
      ans = add(ans, 1ll * phi[it] * sum[it] % mod * sum[it] % mod);
    }
  }
  for (int i = T; i <= n; i += T) {
    for (auto it : fac[a[i]]) {
      sum[it]--;
    }
  }
  return ans;
}

int main() {
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  init();
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  int ans = 0;
  for (int T = 1; T <= n; T++) {
    ans = add(ans, 1ll * phi[T] * f(n, T) % mod);
  }
  printf("%d\n", ans);
  return 0;
}