The Preliminary Contest for ICPC Asia Nanjing 2019 E K Sum

The Preliminary Contest for ICPC Asia Nanjing 2019

E题 K Sum

题意：定义
$f_n(k)=\sum _{l_1=1}^n\sum _{l_2=1}^n\dots \sum _{l_k=1}^n(gcd(l_1,l_2,\dots ,l_k){)}^2$
计算：$\sum _{i=2}^k{f}_n(i)modulo10^9+7,1\le n\le 10^9,2\le k\le 10^{10^5}$
题解：
$f_n(i)=\sum _{l_1=1}^n\sum _{l_2=1}^n\dots \sum _{l_i=1}^n(gcd(l_1,l_2,\dots ,l_i){)}^2$
$=\sum _{d=1}^n{d}^2\sum _{l_1=1}^n\sum _{l_2=1}^n\dots \sum _{l_i=1}^n[gcd(l_1,l_2,\dots ,l_i)=d]$
$=\sum _{d=1}^n{d}^2\sum _{l_1=1}^{\frac{n}{d}}\sum _{l_2=1}^{\frac{n}{d}}\dots \sum _{l_i=1}^{\frac{n}{d}}[gcd(l_1,l_2,\dots ,l_i)=1]$
$=\sum _{d=1}^n{d}^2\sum _{l_1=1}^{\frac{n}{d}}\sum _{l_2=1}^{\frac{n}{d}}\dots \sum _{l_i=1}^{\frac{n}{d}}\sum _{t|gcd(l_1,l_2,\dots ,l_i)}\mu (t)$
$=\sum _{d=1}^n{d}^2\sum _{t=1}^{\frac{n}{d}}\mu (t){\lfloor \frac{n}{td}\rfloor }^i$
$=\sum _{T=1}^n{\lfloor \frac{n}{T}\rfloor }^i\sum _{d|T}{d}^2\mu (\frac{T}{d})$
$\sum _{i=2}^k{f}_n(i)=\sum _{i=2}^k\sum _{T=1}^n{\lfloor \frac{n}{T}\rfloor }^i\sum _{d|T}{d}^2\mu (\frac{T}{d})$
$=\sum _{T=1}^n\sum _{i=2}^k{\lfloor \frac{n}{T}\rfloor }^i\sum _{d|T}{d}^2\mu (\frac{T}{d})$
记$f=\sum _{d|T}{d}^2\mu (\frac{T}{d})=i{d}^2\ast \mu ，g=1,h=f\ast g=i{d}^2$
由于杜教筛公式：
$g(1)S(n)=\sum _{i=1}^{n}h(i)-\sum _{d=2}^{n}g(d)S(\lfloor \frac{n}{d}\rfloor )$
可以构造解决这个前缀和。
$\sum _{i=2}^k{\lfloor \frac{n}{T}\rfloor }^i$,记$q=\lfloor \frac{n}{T}\rfloor ,\sum _{i=2}^k{\lfloor \frac{n}{T}\rfloor }^i=\frac{q^2(q^{k-1}-1)}{q-1}$
然后按照$\lfloor \frac{n}{T}\rfloor$整数分块就行了
对于$f=i{d}^2\ast \mu$，需要预处理$1e6$之内的前缀和，
两个积性函数卷积的线性筛法：

vis[1] = low[1] = 1; H[1] = 初始化 
for(int i = 2; i <= N; i++) {
    if(!vis[i]) prime[++tot] = i, mu[i] = -1, H[i] = 质数的情况, low[i] = i;
    for(int j = 1; j <= tot && i * prime[j] <= N; j++) {
        vis[i * prime[j]] = 1;
        if(!(i % prime[j])) {
            low[i * prime[j]] = (low[i] * prime[j]); 
            if(low[i] == i) H[i * prime[j]] = 特殊判断;
            else H[i * prime[j]] = H[i / low[i]] * H[prime[j] * low[i]];
            break;
        } 
        H[i * prime[j]] = H[i] * H[prime[j]];
        low[i * prime[j]] = prime[j];
    }
}

#include<cstdio>
#include<map>
#include<cstring>
#define ll long long
using namespace std;
const int mod = 1e9+7;
const int maxn = 1e6+10;
bool vis[maxn];
map<int ,ll> mp;
ll low[maxn],H[maxn],sum[maxn];
int prime[maxn];
int tot,T;
char k[100010];
ll inv6;
ll f_g_sum(int n){
	return (ll)n%mod*(n+1)%mod*(2*n+1)%mod*inv6%mod;
}
ll g_sum(int n){
	return n%mod;
}
void f_sum(int n){
	tot=0;
	vis[1]=low[1]=1;
	H[1]=1;
	for(int i=2;i<=n;i++){
		if(!vis[i]){
			prime[++tot]=i;
			H[i]=(i*i-1)%mod;
			low[i]=i;
		}
		for(int j=1;j<=tot&&(ll)i*prime[j]<=n;j++){
			vis[i*prime[j]]=1;
			if(!(i%prime[j])){
				low[i*prime[j]]=(low[i]*prime[j]);
				if(low[i]==i)H[i*prime[j]]=(ll)prime[j]*prime[j]*H[i]%mod;
				else H[i*prime[j]]=H[i/low[i]]*H[prime[j]*low[i]];
				break;
			}
			H[i*prime[j]]=H[i]*H[prime[j]];
			low[i*prime[j]]=prime[j];
		}
	}
	sum[0]=0;
	for(int i=1;i<=n;i++)
		sum[i]=(sum[i-1]+H[i])%mod;
}
ll qpow(ll a,ll b){
	ll res=1;
	while(b){
		if(b&1)res=res*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return res;
}
ll GetSum(int n){
	if(n<=1000000)return sum[n];
	if(mp[n]!=0)return mp[n];
	ll ans = f_g_sum(n)%mod;
	for(ll l = 2, r; l <= n; l = r + 1) {
		r = (n / (n / l)); 
		ans = (ans - (g_sum(r) - g_sum(l - 1)) * GetSum(n / l) + mod)%mod;
	}
	mp[n]=ans;
	return ans; 
}
ll inv(int n){
	return qpow(n,mod-2);
}
int main(){
	int n,m,len;
	m=mod-1;
	inv6=qpow(6,mod-2);
	f_sum(1000000);
	scanf("%d",&T);
	while(T--){
		scanf("%d%s",&n,k);
		len=strlen(k);
		int pow=0,K=0;
		for(int i=0;i<len;i++){
			pow=(int)(((ll)pow*10+k[i]-'0')%m);
			K=(int)(((ll)K*10+k[i]-'0')%mod);
		}
		pow=(pow-1+m)%m;
		K=(K-1+mod)%mod;
		ll ans=0;
		for(int l=1,r;l<=n;l=r+1){
			r=n/(n/l);
			ll q=n/l;
			ll val;
			if(q!=1)
				val=q*q%mod*(qpow(q,pow)-1+mod)%mod*inv(q-1)%mod;
			else val=K;
			ans=(ans+(val*(GetSum(r)-GetSum(l-1)+mod)%mod)%mod)%mod;
		}
		printf("%lld\n",ans);
	}
	return 0;
}