牛客小白月赛12 D 月月给华华出题 莫比乌斯反演

原题链接：https://ac.nowcoder.com/acm/contest/392/D

题意

$$求\sum _{i=1}^n\frac{i}{gcd(i,n)}$$

化简

$$\sum _{i=1}^n\frac{i}{gcd(i,n)}$$

$$=\sum _{d|n}\sum _{i=1}^n\frac{i}{d}[gcd(i,n)=d]$$

$$=\sum _{d|n}\sum _{i=1}^{n/d}i[gcd(i,\frac{n}{d})=1]$$

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

$$=\sum _{d|n}\sum _{i=1}^{d}i\sum _{t|i,t|d}\mu (t)$$

$$=\sum _{d|n}\sum _{t|d}\mu (t)\sum _{i=1}^{d/t}it$$

$$=\sum _{d|n}\sum _{t|d}\mu (t)t\frac{d/t(d/t+1)}{2}$$

$$=\frac{1}{2}\sum _{d|n}(\sum _{t|d}\mu (t)\frac{d^2}{t}+\sum _{t|d}\mu (t)d)$$

$$=\frac{1}{2}\sum _{d|n}d(\sum _{t|d}\mu (t)\frac{d}{t}+\sum _{t|d}\mu (t))$$

$$=\frac{1}{2}\sum _{d|n}d(\varphi (d)+ϵ(d))$$

Code

#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
//#define ACM_LOCAL
#define re register
#define fi first
#define se second
#define please_AC return 0
const int N = 1e6 + 10;
const int M = 1e6 + 10;
const int INF = 1e9;
const double eps = 1e-4;
const int MOD = 1e9 + 7;
typedef long long ll;
typedef unsigned long long ull;
ll prime[N], k, phi[N], f[N];
bool is_prime[N];
inline void init(int n) {
    
    
    memset(is_prime, true, sizeof is_prime);
    phi[1] = 1;
    for (int i = 2; i < n; ++i) {
    
    
        if (is_prime[i]) prime[++k] = i, phi[i] = i-1;
        for (int j = 1; j <= k && i * prime[j] < n; ++j) {
    
    
            is_prime[i * prime[j]] = false;
            if (i % prime[j] == 0) {
    
    
                phi[i * prime[j]] = phi[i] * prime[j];
                break;
            } else {
    
    
                phi[i * prime[j]] = phi[i] * (prime[j] - 1);
            }
        }
    }
    for (int d = 1; d <= n; d++) {
    
    
        for (int i = d; i <= n; i += d) {
    
    
            f[i] += d * (phi[d] + (d == 1)) / 2;
        }
    }
}
void solve() {
    
    
    init(N);
    int n; cin >> n;
    for (int i = 1; i <= n; i++) printf("%lld\n", f[i]);

}

signed main() {
    
    
#ifdef ACM_LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#endif
    solve();
    return 0;
}