luogu P4449 于神之怒加强版

背景：

又是一道水题。

题目传送门：

https://www.luogu.org/problem/P4449

题意：

求${\sum }_{i=1}^n{\sum }_{j=1}^m\gcd (i,j{)}^k$。

思路：

$$\sum _{i=1}^n\sum _{j=1}^m\gcd (i,j{)}^k$$

$$=\sum _{d=1}^{\min (n,m)}\sum _{i=1}^n\sum _{j=1}^m{d}^k[\gcd (i,j)=d]$$

$$=\sum _{d=1}^{\min (n,m)}\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{d}\rfloor }{d}^k[\gcd (i,j)=1]$$

$$=\sum _{d=1}^{\min (n,m)}\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{d}\rfloor }{d}^k\sum _{t|\gcd (i,j)}\mu (t)$$

$$=\sum _{d=1}^{\min (n,m)}\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{d}\rfloor }{d}^k\sum _{t=1}^{\min (\lfloor \frac{n}{d}\rfloor \lfloor \frac{m}{d}\rfloor )}\mu (t)[t|\gcd (i,j)]$$

$$=\sum _{d=1}^{\min (n,m)}\sum _{t=1}^{\min (\lfloor \frac{n}{d}\rfloor \lfloor \frac{m}{d}\rfloor )}\mu (t)\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{d}\rfloor }{d}^k[t|\gcd (i,j)]$$

$$=\sum _{d=1}^{\min (n,m)}\sum _{t=1}^{\min (\lfloor \frac{n}{d}\rfloor \lfloor \frac{m}{d}\rfloor )}\mu (t)\sum _{i=1}^{\lfloor \frac{n}{dt}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{dt}\rfloor }{d}^k$$

设$T=dt$，则有：

$$=\sum _{T=1}^{\min (n,m)}\sum _{t|T}\mu (t)\sum _{i=1}^{\lfloor \frac{n}{T}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{T}\rfloor }(\frac{T}{t}{)}^k$$

$$=\sum _{T=1}^{\min (n,m)}\sum _{t|T}\mu (t)\lfloor \frac{n}{T}\rfloor \lfloor \frac{m}{T}\rfloor (\frac{T}{t}{)}^k$$

$$=\sum _{T=1}^{\min (n,m)}\lfloor \frac{n}{T}\rfloor \lfloor \frac{m}{T}\rfloor \sum _{t|T}\mu (t)(\frac{T}{t}{)}^k$$

类似埃氏筛预处理后面的$\sum$里的，直接整除分块即可。
卡常，你可以线性筛$k$的次方，判断$\mu$的值来判断是否进入第二重循环，具体看代码。
我不会告诉你正解是线性筛预处理后面的$\sum$。

代码：

#pragma GCC optimize("Ofast")
#include<cstdio>
#include<cstring>
#include<algorithm>
#define mod 1000000007
#define LL long long
#define R register
#define I inline
using namespace std;
	int n,k;
	int prime[5000010],mu[5000010],f[5000010],sum_f[5000010],Pow[5000010];
	bool bz[5000010];
I int ksm(int x,int k)
{
	int tot=1;
	for(;k;k>>=1)
	{
		if(k&1) tot=(LL)tot*x%mod;
		x=(LL)x*x%mod;
	}
	return tot;
}
I void init(int ma)
{
	int t=0;
	mu[1]=1;
	bz[0]=bz[1]=true;
	Pow[0]=1,Pow[1]=1;
	for(R int i=2;i<=ma;i++)
	{
		if(!bz[i]) prime[++t]=i,mu[i]=-1,Pow[i]=ksm(i,k);
		for(R int j=1;j<=t&&i*prime[j]<=ma;j++)
		{
			bz[i*prime[j]]=true;
			Pow[i*prime[j]]=(LL)Pow[i]*Pow[prime[j]]%mod;
			if(!(i%prime[j]))
			{
				mu[i*prime[j]]=0;
				break;
			}
			mu[i*prime[j]]=-mu[i];
		}
	}
	for(R int i=1;i<=ma;i++)
	{
		if(!mu[i]) continue;
		for(R int j=i;j<=ma;j+=i)
			f[j]=((LL)f[j]+mu[i]*Pow[j/i]+mod)%mod;
	}
	for(R int i=1;i<=ma;i++)
		sum_f[i]=(sum_f[i-1]+f[i])%mod;
}
I int work(int n,int m)
{
	int sum=0;
	for(R int l=1,r;l<=min(n,m);l=r+1)
	{
		r=min(n/(n/l),m/(m/l));
		sum=((LL)sum+((LL)n/l)*((LL)m/l)%mod*((sum_f[r]-sum_f[l-1]+mod)%mod)%mod)%mod;
	}
	return sum;
}
int main()
{
	int T;
	int n,m;
	scanf("%d %d",&T,&k);
	init(5000000);
	while(T--)
	{
		scanf("%d %d",&n,&m);
		printf("%d\n",work(n,m));
	}
}