bzoj4804: 欧拉心算

题目链接
$$给出n，计算\sum _{i=1}^n\sum _{j=1}^n\phi (\gcd (i,j))$$
$$f(n)=\sum _{i=1}^n\sum _{j=1}^n\phi (\gcd (i,j))=\sum _{d=1}^n\phi (d)\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{k|\gcd (i,j)}\mu (k)=\sum _{d=1}^n\phi (d)\sum _{k=1}^{\lfloor \frac{n}{d}\rfloor }\lfloor \frac{n}{dk}{\rfloor }^2\mu (k)$$
$$令T=dk，则f(n)=\sum _{T=1}^n\lfloor \frac{n}{T}{\rfloor }^2\sum _{d|T}\phi (d)\mu (\frac{T}{d})$$
$$令g(T)=\sum _{d|T}\phi (d)\mu (\frac{T}{d})，易知g(T)是积性函数$$
$$\begin{gathered} 设T=\prod _{i=1}^t{p}_i^{a_i},其中p_i为互不相等的质数 \\ 则g(T)=\prod _{i=1}^{t}g(p_i^{a_i})=\prod _{i=1}^t(\mu (1)\phi (p_i^{a_i})+\mu (p_i)\phi (p_i^{a_i-1}))=\prod _{i=1}^t(\phi (p_i^{a_i})-\phi (p_i^{a_i-1})) \end{gathered}$$
线性筛出$g(T)$及其前缀和，最后分块计算$f(n)$。

#include <vector>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

typedef long long ll;
const int N = 10000010, maxn = 10000000;

char buf;
inline int read() {
	register int rst = 0;
	do buf = getchar(); while (! isdigit(buf));
	while (isdigit(buf)) rst = rst*10 + buf - '0', buf = getchar();
	return rst;
}

int T, n;
ll g[N];//80MB
bool isNotPrime[N];
vector<int> ls;

inline void init() {
	g[1] = 1;
	for (int i = 2; i <= maxn; i++) {
		if (! isNotPrime[i]) {
			ls.push_back(i), g[i] = i - 2;
		}
		for (vector<int>::iterator it = ls.begin(); it != ls.end(); ++it) {
			int j = *it, t = i*j;
			if (t > maxn) break;
			isNotPrime[t] = true;
			if (i % j == 0) {
				if ((i / j) % j == 0) g[t] = g[i]*j;
				else g[t] = g[i/j]*(j-1)*(j-1);
				break;
			} else g[t] = g[i]*(j-2);
		}
	}
	for (int i = 2; i <= maxn; i++)
		g[i] += g[i-1];
}

inline void work() {
	ll rst = 0;
	for (int i = 1, j; i <= n; i = j + 1) {
		j = min(n/(n/i), n);
		rst += (g[j] - g[i-1])*(n/i)*1LL*(n/i);
	} printf("%lld\n", rst);
}

int main() {
	T = read();
	init();
	while (T--) {
		n = read();
		work();
	} return 0;
}