CCPC-Wannafly Winter Camp Day3 小清新数论*(莫比乌斯反演)

思路：依旧是简单的gcd，套路的用莫比乌斯反演即可，最后用整数分块优化下复杂度即可

推公式先填坑

#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<string>
#include<iostream>
#include<map>
#include<vector>
#include<set>
#include<map>
#include<queue>
using namespace std;
#define ll long long
const int maxn = 10000000 + 5;
const int mod = 998244353;
bool vis[maxn];
int prime[maxn], mu[maxn];
int sum[maxn];
void init_mu(int n) {
	int cnt = 0;
	mu[1] = 1;
	for (int i = 2; i < n; i++) {
		if (!vis[i]) {
			prime[cnt++] = i;
			mu[i] = -1;
		}
		for (int j = 0; j < cnt&&i*prime[j] < n; j++) {
			vis[i*prime[j]] = 1;
			if (i%prime[j] == 0) { mu[i*prime[j]] = 0; break; }
			else { mu[i*prime[j]] = -mu[i]; }
		}
	}
	sum[0] = 0;
	for (int i = 1; i <= n; i++) {
		sum[i] = sum[i - 1] + mu[i];
	}
}

ll solve(int n) {
	ll ans = 0;
	for (int l = 1, r; l <= n; l = r + 1) {
		r = n / (n / l);
		ans += 1ll*(n/l)*(n/l) % mod*((sum[r] - sum[l-1]+mod)%mod) % mod;
		ans %= mod;
	}
	return ans;

}
int main(void) {
	int n;
	scanf("%d", &n);
	init_mu(n + 1);
	ll ans = 0;
	for (int l = 1, r; l <= n; l = r + 1) {
		r = n / (n / l);
		ans += 1ll*solve(n/l)%mod*((sum[r] - sum[l-1]+mod)%mod)%mod;
		ans %= mod;
	}
	printf("%lld\n", ans);
}