AcWing 221. 龙哥的问题

 

代码如下:

#include <bits/stdc++.h>
// #define LOCAL
#define INF 0x3f3f3f3f3f3f3f3f
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define int long long
#define debug(a) cout << #a << "=" << a << endl;
using namespace std;
const int N = 2e5 + 10, M = 2e6 + 5;
int n;
int divid[M], cnt, primes[M], phi[M], v[M], cntp;

void get_d(){
    for (int i = 1; i <= n / i; ++i){
        if(n % i == 0){
            divid[++cnt] = i;
            if(i != n / i)
                divid[++cnt] = n / i;
        }
    }
}

void get_phi(int x){
    phi[1] = 1;
    for (int i = 2; i <= x; ++i){
        if(v[i] == 0){
            v[i] = i, primes[++cntp] = i;
            phi[i] = i - 1;
        }
        for (int j = 1; j <= cntp; ++j){
            if(primes[j] > v[i] || primes[j] > x / i)
                break;
            v[i * primes[j]] = primes[j];
            phi[i * primes[j]] = phi[i] * (i % primes[j] ? primes[j] - 1 : primes[j]);
        }
    }
}

int euler(int x){
    int ans = x;
    for (int i = 2; i <= x / i; ++i){
        if(x % i == 0){
            ans = ans / i * (i - 1);
            while(x % i == 0)
                x /= i;
        }
    }
    if(x > 1)
        ans = ans / x * (x - 1);
    return ans;
}

signed main(){
    #ifdef LOCAL
        freopen("input.in", "r", stdin);
        freopen("output.out", "w", stdout);
    #endif
    // IOS;
    cin >> n;
    get_phi(M - 5);
    get_d();
    long long ans = 0;
    for (int i = 1; i <= cnt; ++i){
        int d = divid[i];
        int n_d = n / d;
        if(n_d < M - 5)
            ans += d * phi[n_d];
        else
            ans += d * euler(n_d);
    }
    cout << ans << '\n';
}