Luogu p2398 GCD SUM

题目链接

https://www.luogu.com.cn/problem/P2398

问题分析：

代码如下：

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e5 + 10;
int phi[maxn];
int primes[maxn];
ll sum[maxn];
int cnt = 0;
ll n;
void init()
{
        phi[1] = 1;
        for (int i = 2; i <= n; i++)
        {
                if (!phi[i])
                        primes[++cnt] = i, phi[i] = i - 1; // 性质一，指数为1的情形
                for (int p = 1; p <= cnt && primes[p] * i <= n; p++)
                {
                        if (i % primes[p] == 0)
                        {
                                phi[primes[p] * i] = phi[i] * primes[p]; // 性质二
                                break;
                        }
                        else
                                phi[primes[p] * i] = phi[primes[p]] * phi[i]; // 这时肯定互质，用性质三
                }
        }
        for (int i = 1; i <= n; i++)
                sum[i] = sum[i - 1] + phi[i];
}
int main()
{
        scanf("%lld", &n);
        init();
        ll ans = 0;
        for (ll i = 1; i <= n; i++)
        {
                ans = ans + (sum[n / i] * 2 - 1) * i;
        }
        printf("%lld\n", ans);
        return 0;
}