题意:(又一次)略
懒得写过程:lych大大的题解
帖程序:
#include <bits/stdc++.h>
#define gc getchar()
#define N 10000009
#define ll long long
using namespace std;
int T,n,m,pri[N],pd[N],cnt,Min[N],Min_p[N];
ll ans,f[N];
int read()
{
int x=1;
char ch;
while (ch=gc,ch<'0'||ch>'9') if (ch=='-') x=-1;
int s=ch-48;
while (ch=gc,ch>='0'&&ch<='9') s=s*10+ch-48;
return s*x;
}
int main()
{
pd[1]=1;
for (int i=2;i<N;i++)
{
if (!pd[i]) pri[++cnt]=i,f[i]=Min[i]=1,Min_p[i]=i;
for (int j=1;j<=cnt&&pri[j]*i<N;j++)
{
pd[pri[j]*i]=1;
if (i%pri[j]==0)
{
Min[pri[j]*i]=Min[i]+1;
Min_p[pri[j]*i]=Min_p[i]*pri[j];
int rest=i/Min_p[i];
if (rest==1) f[pri[j]*i]=1;
else
f[pri[j]*i]=(Min[pri[j]*i]==Min[rest])?-f[rest]:0;
break;
}
Min[pri[j]*i]=1;
Min_p[pri[j]*i]=pri[j];
f[pri[j]*i]=(Min[i]==1)?-f[i]:0;
}
}
for (int i=1;i<N;i++)
f[i]+=f[i-1];
T=read();
while (T--)
{
ans=0;
n=read(),m=read();
if (n>m) swap(n,m);
for (int i=1,j;i<=n;i=j+1)
{
j=min(n/(n/i),m/(m/i));
ans=ans+(ll)(f[j]-f[i-1])*(n/i)*(m/i);
}
printf("%lld\n",ans);
}
return 0;
}