luogu P2257 YY的GCD

 莫比乌斯反演

为什么long long开多了会TLE  QWQ

#include <iostream>
#include <cstdio>
#define LL long long
using namespace std;
int read()
{
	int x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-')  f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+c-'0';
		c=getchar();
	}
	return f*x;
}
const int N=1e7+5;
LL sum[N],ans;
int prime[N],mu[N],n,m,t,num,o[N];
bool pri[N];
int main()
{
	n=10000000; 
	mu[1]=1;  pri[1]=1;
	for(int i=2;i<=n;i++)
	{
		if(!pri[i])
	    {
	    	prime[++num]=i;
	    	mu[i]=-1;
	    }
	    for(int j=1;j<=num&&prime[j]*i<=n;j++)
	    {
	    	pri[i*prime[j]]=1;
	    	mu[i*prime[j]]=-mu[i];
	    	if(i%prime[j]==0)
			{
				mu[i*prime[j]]=0;
				break;
			}
		}
    }
	for(int j=1;j<=num;j++)
	  for(int i=1;i*prime[j]<=n;i++)  o[i*prime[j]]+=mu[i];
	for(int i=1;i<=n;i++)  sum[i]=sum[i-1]+o[i];
	t=read();
	while(t--)
	{
		n=read();  m=read();
		if(n>m)  swap(n,m);
		ans=0;
		for(int i=1,next;i<=n;i=next)
		{
			next=min(n/(n/i),m/(m/i))+1;
			ans+=(sum[next-1]-sum[i-1])*(m/i)*(n/i);
		}
		cout<<ans<<"\n";
	}
	return 0;
}