2020ICPC 江西省大学生程序设计竞赛A Simple Math Problem 莫比乌斯反演

原题链接：https://ac.nowcoder.com/acm/contest/8827/A

题意

$$\sum _{i=1}^n\sum _{j=1}^i[gcd(i,j)=1]F[j]$$
$$F[j]代表j各位数数字之和$$

化简

先给式子变形一下
$$\sum _{i=1}^n\sum _{j=1}^i[gcd(i,j)=1]F[j]$$

$$=\sum _{i=1}^{n}F[i]\sum _{j=i}^n[gcd(i,j)=1]$$

$$=\sum _{i=1}^{n}F[i]\sum _{j=i}^n\sum _{t|i,t|j}\mu (t)$$

$$=\sum _{t=1}^n\mu (t)\sum _{i=1}^{n/t}F[it]\sum _{j=i}^{n/t}1$$

$$=\sum _{t=1}^n\mu (t)\sum _{i=1}^{n/t}F[it](n/t-i+1)$$

接着利用差分可以预处理出答案

#include <bits/stdc++.h>
using namespace std;
//#define ACM_LOCAL
#define re register
#define fi first
#define se second
const int N = 2e5 + 10;
const int M = 1e6 + 10;
const int INF = 0x3f3f3f3f;
const double eps = 1e-4;
const int MOD = 1e9 + 7;
typedef long long ll;
typedef pair<int, int> PII;
ll prime[N], mu[N], k;
ll F[N], ans[N];
int n;
bool is_prime[N];
int get_sum(int x) {
    int ans = 0;
    while (x) {
        ans += x % 10;
        x /= 10;
    }
    return ans;
}
inline void init() {
    memset(is_prime, true, sizeof is_prime);
    mu[1] = 1;
    for (int i = 2; i < N; ++i) {
        if (is_prime[i]) prime[++k] = i, mu[i] = -1;
        for (int j = 1; j <= k && i * prime[j] < N; ++j) {
            is_prime[i * prime[j]] = false;
            if (i % prime[j] == 0) {
                break;
            } else {
                mu[i * prime[j]] = -mu[i];
            }
        }
    }
    for (int i = 1; i <= n; i++) F[i] = get_sum(i);
    for (int t = 1; t <= n; t++) {
        ll tmp = 0;
        for (int T = t; T <= n; T += t) {
            int l = T;
            int r = min(n, l + t - 1);
            tmp += F[T] * (n/t-T/t+1);
            ans[l] += tmp * mu[t];
            ans[r+1] -= tmp * mu[t];
        }
    }
    for (int i = 1; i <= n; i++) ans[i] += ans[i-1];
}

void solve() {
    cin >> n;
    init();
    printf("%lld\n", ans[n]);
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
#ifdef ACM_LOCAL
    freopen("input", "r", stdin);
    freopen("output", "w", stdout);
#endif
    solve();
}