HDU 6588（HDU多校第一场1011）：Function（莫比乌斯反演 + __int128输入输出模板）

题目大意：
让你求：${\sum }_{i=1}^{n}gcd(\lfloor \sqrt[3]{n}\rfloor ,i)\mathrm{m}\mathrm{o}\mathrm{d}998322353$

$n\le 10^{21}$

---

题解：
明显可以按$\sqrt[3]{n}$分块，将式子拆成两部分：$$\sum _{T=1}^{\lfloor \sqrt[3]{n}\rfloor -1}\sum _{i=T^3}^{(T+1{)}^3-1}gcd(T,i)+\sum _{i=(\lfloor \sqrt[3]{n}\rfloor {)}^3}^{n}gcd(\lfloor \sqrt[3]{n}\rfloor ,i)$$反演右边：$$\sum _{i=l}^{r}gcd(a,i)=\sum _{d|a}\sum _{i=l}^{r}d\ast [gcd(a,i)=d]$$$$=\sum _{i=l}^{r}gcd(a,i)=\sum _{d|a}d\sum _{i=\lceil \frac{l}{d}\rceil }^{\lfloor \frac{r}{d}\rfloor }[gcd(\frac{a}{d},i)=1]$$$$=\sum _{d|a}d\sum _{i=\lceil \frac{l}{d}\rceil }^{\lfloor \frac{r}{d}\rfloor }\sum _{p|\frac{a}{d},p|i}\mu (p)=\sum _{d|a}d\sum _{p|\frac{a}{d}}\mu (p)\sum _{i=\lceil \frac{l}{d\ast p}\rceil }^{\lfloor \frac{r}{d\ast p}\rfloor }$$$$=\sum _{T|a}\sum _{d|T}d\ast \mu (\frac{T}{d})(\lfloor \frac{r}{T}\rfloor -\lfloor \frac{l-1}{T}\rfloor )$$$$=\sum _{T|a}\varphi (T)\ast (\lfloor \frac{r}{T}\rfloor -\lfloor \frac{l-1}{T}\rfloor )$$于是右边可以在$\sqrt[6]{n}$时间内求出
反演左边
（这里用个小技巧，不用莫比乌斯反演，直接应用欧拉函数的性质：${\sum }_{d|x}\varphi (d)=x$）：$$\sum _{T=1}^{\lfloor \sqrt[3]{n}\rfloor -1}\sum _{i=T^3}^{(T+1{)}^3-1}gcd(T,i)$$$$=\sum _{T=1}^{\lfloor \sqrt[3]{n}\rfloor -1}\sum _{i=T^3}^{(T+1{)}^3-1}\sum _{p|gcd(T,i)}\varphi (p)$$$$=\sum _{T=1}^{\lfloor \sqrt[3]{n}\rfloor -1}\sum _{p|T}\varphi (p)\sum _{i=\lceil \frac{T^3}{p}\rceil }^{\lfloor \frac{(T+1{)}^3-1}{p}\rfloor }$$$$=\sum _{T=1}^{\lfloor \sqrt[3]{n}\rfloor -1}\sum _{p|T}\varphi (p)(\lfloor \frac{(T+1{)}^3-1}{p}\rfloor -\lfloor \frac{T^3-1}{p}\rfloor )$$$$=\sum _{p=1}^{\lfloor \sqrt[3]{n}\rfloor -1}\varphi (p)\sum _{T=1}^{\lfloor \frac{\lfloor \sqrt[3]{n}\rfloor -1}{p}\rfloor }(\lfloor \frac{(T\ast p+1{)}^3-1}{p}\rfloor -\lfloor \frac{(T\ast p{)}^3-1}{p}\rfloor )$$$$=\sum _{p=1}^{\lfloor \sqrt[3]{n}\rfloor -1}\varphi (p)\sum _{T=1}^{\lfloor \frac{\lfloor \sqrt[3]{n}\rfloor -1}{p}\rfloor }((T^3\ast p^2+3\ast T^2\ast p+3\ast T)-(T^3\ast p^2-1))$$$$=\sum _{p=1}^{\lfloor \sqrt[3]{n}\rfloor -1}\varphi (p)\sum _{T=1}^{\lfloor \frac{\lfloor \sqrt[3]{n}\rfloor -1}{p}\rfloor }(3\ast T^2\ast p+3\ast T+1)$$
${\sum }_{i=1}^{n}i=\frac{i\ast (i+1)}{2},{\sum }_{i=1}^n{i}^2=\frac{i\ast (i+1)\ast (2\ast i+1)}{6}$
线性筛预处理一下$\varphi (i)\ast i和\varphi (i)$的前缀和
将式子分成三部分后分块做（也可以直接暴力，因为组数比较少）
复杂度$O(\sqrt[3]{n}+T\ast \sqrt[6]{n})$

---

#include<bits/stdc++.h>
using namespace std;
#define int128 __int128
const int maxn = 1e7 + 10;
const int mod = 998244353;
typedef long long ll;
inline __int128 read() {
 	__int128 x=0,f=1;
 	char ch=getchar();
 	while(ch<'0'||ch>'9') {
 		if(ch=='-')
 			f=-1;
 		ch=getchar();
 	}
 	while(ch>='0'&&ch<='9') {
 		x=x*10+ch-'0';
 		ch=getchar();
 	}
 	return x*f;
}
void print(__int128 x)
{
	if (!x) return ;
	if (x < 0) putchar('-'),x = -x;
	print(x / 10);
	putchar(x % 10 + '0');
}
bool ispri[maxn];
int pri[maxn],phi[maxn],t;
ll sum[maxn];
ll val[maxn];
__int128 n;
void sieve(int n) {
	ispri[0] = ispri[1] = true;
	phi[1] = 1;pri[0] = 0;
	for(int i = 2; i <= n; i++) {
		if(!ispri[i]) pri[++pri[0]] = i,phi[i] = i - 1;
		for(int j = 1; j <= pri[0] && i * pri[j] <= n; j++) {
			ispri[i * pri[j]] = true;
			if(i % pri[j] == 0) {
				phi[i * pri[j]] = phi[i] * pri[j];
				break;
			}
			phi[i * pri[j]] = phi[i] * (pri[j] - 1);
		}
	}
	sum[0] = val[0] = 0;
	for(int i = 1; i <= n; i++)
		sum[i] = (sum[i - 1] + 1ll * phi[i] * i % mod) % mod;
	for(int i = 1; i <= n; i++)
		val[i] = (val[i - 1] + phi[i]) % mod;
}
ll inv2,inv6;
ll fpow(ll a,ll b) {
	ll r = 1;
	while(b) {
		if(b & 1) r = r * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return r;
}
ll cal1(ll x) {
	x %= mod;
	return x * (x + 1) % mod * (x + x + 1) % mod * inv6 % mod;
}
ll cal2(ll x) {
	x %= mod;
	return x * (x + 1) % mod * inv2 % mod;
}
int main() {
	sieve(10000000);
	inv2 = fpow(2,mod - 2);
	inv6 = fpow(6,mod - 2);
	scanf("%d",&t);
	while(t--) {
		n = read();
		if(n <= 7) {
			printf("%d\n",(int)n);
			continue;
		}
		int r = 1;
		for(r = 1; (__int128)(r + 2) * (r + 2) * (r + 2) - 1 <= n; r++);
		int i,j;
		ll res = 0;
		for(i = 1; i <= r; i = j + 1) {
			j = r / (r / i);
			res = (res + (sum[j] - sum[i - 1] + mod) % mod * 3 % mod * cal1(r / i) % mod) % mod;
			res = (res + (val[j] - val[i - 1] + mod) % mod * 3 % mod * cal2(r / i) % mod) % mod;
			res = (res + (val[j] - val[i - 1] + mod) % mod * (r / i) % mod) % mod;
		}
		ll a = r + 1;
		__int128 L = (__int128)a * a * a - 1;
		for(int i = 1; 1ll * i * i <= a; i++) {
			if(a % i == 0) {
				ll t = (n / i - L / i) % mod;
				res = (res + 1ll * phi[i] * t % mod) % mod;
				if(a / i != i) {
					ll t = (n / (a / i) - L / (a / i)) % mod;
					res = (res + 1ll * phi[a / i] * t % mod) % mod;
				}
			}
		} 
		printf("%lld\n",res);
	}
	return 0;
}