DarkBZOJ传送门
解析:
好像就是多组询问版本的Crash的数字表格。整除分一下块就行了。
代码:
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define re register
#define gc get_char
#define pc putchar
#define cs const
namespace IO{
namespace IOONLY{
cs int Rlen=1<<18|1;
char buf[Rlen],*p1,*p2;
}
inline char get_char(){
using namespace IOONLY;
return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1++;
}
inline int getint(){
re int num;
re char c;
while(!isdigit(c=gc()));num=c^48;
while(isdigit(c=gc()))num=(num+(num<<2)<<1)+(c^48);
return num;
}
inline void outint(ll a){
static char ch[23];
if(a==0)pc('0');
while(a)ch[++ch[0]]=a-a/10*10,a/=10;
while(ch[0])pc(ch[ch[0]--]^48);
}
}
using namespace IO;
cs int P=10000007;
cs ll mod=100000009,inv2=mod-mod/2;
bool mark[P];
int prime[P],pcnt,F[P];
inline void linear_sieves(int len=P-7){
F[1]=1;
for(int re i=2;i<=len;++i){
if(!mark[i])prime[++pcnt]=i,F[i]=1-i;
for(int re j=1;i*prime[j]<=len;++j){
mark[i*prime[j]]=true;
if(i%prime[j]==0){F[i*prime[j]]=F[i];break;}
F[i*prime[j]]=F[i]*(1-prime[j]);
}
F[i]=((ll)i*F[i]%mod+F[i-1]+mod)%mod;
}
}
inline ll S(cs ll m){
return m*(m+1)%mod*inv2%mod;
}
inline ll solve(int n,int m){
if(n>m)swap(n,m);
ll ans=0;
for(int re i=1,j;i<=n;i=j+1){
j=min(n/(n/i),m/(m/i));
ans=(ans+S(n/i)*S(m/i)%mod*(F[j]-F[i-1]+mod)%mod)%mod;
}
return ans;
}
signed main(){
linear_sieves();
for(int re T=getint();T--;outint(solve(getint(),getint())),pc('\n'));
return 0;
}