https://www.luogu.org/problemnew/show/P2257
学习资料:https://wenku.baidu.com/view/fbec9c63ba1aa8114431d9ac.html
https://wenku.baidu.com/view/fbe263d384254b35eefd34eb.html
反思:推公式的做得少,而且莫比乌斯貌似有套路的,主要是会构造F(n),使得F(n)=sum(f(d)),F(n)容易求,而答案所需的f(n)难求;
所以反演后f(i)=sum(u(d/i)*F(d)) 其中(d%i==0);
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=1e7+9;
const int mod=10007;
inline ll read()
{
ll f=1,x=0;
char ss=getchar();
while(ss<'0'||ss>'9')
{
if(ss=='-')f=-1;ss=getchar();
}
while(ss>='0'&&ss<='9')
{
x=x*10+ss-'0';ss=getchar();
} return f*x;
}
bool check[maxn+10];
int prime[maxn+10];
int mu[maxn+10];
ll sum[maxn+10];
ll g[maxn+10];
void Moblus()
{
mem(check,0);
mu[1]=1;
int tot=0;
for(int i=2;i<=maxn;i++)
{
if(!check[i])
{
prime[tot++]=i;
mu[i]=-1;
}
for(int j=0;j<tot;j++)
{
if(i*prime[j]>maxn) break;
check[i*prime[j]]=true;
if(i%prime[j]==0)
{
mu[i*prime[j]]=0;
break;
}
else
{
mu[i*prime[j]]=-mu[i];
}
}
}
for(int i=0;i<tot;i++)
{
for(int j=1;j*prime[i]<=maxn;j++) g[j*prime[i]]+=mu[j];
}
for(int i=1;i<=maxn;i++) sum[i]=sum[i-1]+g[i];
}
int main()
{
FAST_IO;
//freopen("input.txt","r",stdin);
Moblus();
//for(int i=1;i<=10;i++)cout<<sum[i]<<" ";
int T;
cin>>T;
while(T--)
{
int n,m;
cin>>n>>m;
if(n>m) swap(n,m);
ll ans=0;
for(int l=1,r;l<=n;l=r+1)//整除分块
{
r=min(n/(n/l),m/(m/l));
ans+=1LL*(n/l)*(m/l)*(sum[r]-sum[l-1]);
}
cout<<ans<<endl;
}
return 0;
}