题意
n,m<=10000000,T<=10000
分析
bzoj 2154的加强版
再次膜拜Po神
题解
代码
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
const int MAXN=10000000;
const int N=10000005;
const int MOD=100000009;
int n,m,tot,prime[N],f[N];
bool not_prime[N];
void getmu(int n)
{
f[1]=1;
for (int i=2;i<=n;i++)
{
if (!not_prime[i])
{
prime[++tot]=i;
f[i]=1-i;
}
for (int j=1;j<=tot&&i*prime[j]<=n;j++)
{
not_prime[i*prime[j]]=1;
if (i%prime[j]==0)
{
f[i*prime[j]]=f[i];
break;
}
f[i*prime[j]]=f[i]*f[prime[j]]%MOD;
}
}
for (int i=1;i<=n;i++)
f[i]=(f[i-1]+(ll)i*f[i]%MOD)%MOD;
}
int getsum(int n)
{
return (ll)n*(n+1)/2%MOD;
}
int main()
{
getmu(MAXN);
int t;
scanf("%d",&t);
while (t--)
{
scanf("%d%d",&n,&m);
if (n>m) swap(n,m);
int ans=0;
for (int i=1,last;i<=n;i=last+1)
{
last=min(n/(n/i),m/(m/i));
ans=(ans+(ll)getsum(n/i)*getsum(m/i)%MOD*(f[last]-f[i-1])%MOD)%MOD;
}
printf("%d\n",(ans+MOD)%MOD);
}
return 0;
}