莫比乌斯反演
和NOI2010能量采集很像。
同样设 f(x)=∑ni=1∑mj=1[(i,j)==x],F(x)=∑ni=1∑mj=1[x|(i,j)]=⌊nx⌋⌊mx⌋ f ( x ) = ∑ i = 1 n ∑ j = 1 m [ ( i , j ) == x ] , F ( x ) = ∑ i = 1 n ∑ j = 1 m [ x | ( i , j ) ] = ⌊ n x ⌋ ⌊ m x ⌋
设
p
p
为质数,,则有
令 T=dp T = d p ,则
然后除法分块一下就好了。
代码:
#include<cctype>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 10000005
#define F inline
using namespace std;
typedef long long LL;
int n,m,t,mu[N],p[N],a[N];
bool f[N]; LL ans;
F char readc(){
static char buf[100000],*l=buf,*r=buf;
if (l==r) r=(l=buf)+fread(buf,1,100000,stdin);
return l==r?EOF:*l++;
}
F int _read(){
int x=0; char ch=readc();
while (!isdigit(ch)) ch=readc();
while (isdigit(ch)) x=(x<<3)+(x<<1)+(ch^48),ch=readc();
return x;
}
F void Make(){
mu[1]=1;
for (int i=2;i<N;i++){
if (!f[i]) p[++p[0]]=i,mu[i]=-1;
for (int j=1,v;j<=p[0]&&(v=i*p[j])<N;j++){
f[v]=true,mu[v]=-mu[i];
if (!(i%p[j])){ mu[v]=0; break; }
}
}
for (int i=1;i<N;i++)
for (int j=1;p[j]*i<N&&j<=p[0];j++)
a[i*p[j]]+=mu[i];
for (int i=1;i<N;i++) a[i]+=a[i-1];
}
int main(){
for (Make(),t=_read();t;t--){
n=_read(),m=_read(),ans=0;
if (n>m) swap(n,m);
int r=0;
for (int l=1;l<=n;l=r+1){
r=min(n/(n/l),m/(m/l));
ans+=(1ll*m/l)*(1ll*n/l)*1ll*(a[r]-a[l-1]);
}
printf("%lld\n",ans);
}
return 0;
}