HDU - 6706
题解看图。
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+5;
const int mod=1e9+7;
const int inv6=166666668;
const int inv2=500000004;
int cnt,prime[N],phi[N],vis[N];
void init()
{
phi[1]=1;
for(int i=2;i<=N-5;i++){
if(!vis[i]) {
prime[cnt++]=i;
phi[i]=i-1;
}
for(int j=0;j<cnt&&i*prime[j]<=N-5;j++){
vis[i*prime[j]]=1;
if(i%prime[j]==0){
phi[i*prime[j]]=phi[i]*prime[j];
break;
}else phi[i*prime[j]]=phi[i]*(prime[j]-1);
}
}
for(int i=1;i<=N-5;i++) phi[i]=(phi[i-1]+1LL*i%mod*phi[i]+mod)%mod;
}
unordered_map<int,int> mp;
int S(int x)
{
if(x<N) return phi[x];
if(mp.find(x)!=mp.end()) return mp[x];
int r,res=x*(x+1)%mod*(2*x+1)%mod*inv6%mod;
for(int l=2;l<=x;l=r+1){
r=x/(x/l);
res-=((r+l)*(r-l+1+mod)%mod*inv2%mod*(S(x/l)))%mod;
res=(res+mod)%mod;
}
mp[x]=res;
return mp[x];
}
signed main()
{
init();
int t; scanf("%lld",&t);
while(t--){
int n,a,b; scanf("%lld%lld%lld",&n,&a,&b);
int res=((S(n)-1+mod)%mod*inv2%mod+mod)%mod;
printf("%lld\n",res);
}
return 0;
}