BZOJ2820【莫比乌斯函数】

构造一个新的函数.

/* I will wait for you */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<string>
#define make make_pair
#define fi first
#define se second

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;

const int maxn=10000010;
const int maxm=1010;
const int maxs=26;
const int INF=1<<29;
const int P=1000000007;
const double error=1e-9;

int m,n,t,mu[maxn],pri[maxn],vis[maxn];LL f[maxn];

void init()
{
	mu[1]=1,pri[1]=1,f[1]=0;
	
	for(int i=2;i<maxn;i++) if(!vis[i])
		for(int j=2*i;j<maxn;j+=i) vis[j]=1,pri[j]=i;
	for(int i=2;i<maxn;i++)
		mu[i]=vis[i]?(i/pri[i]%pri[i]?-mu[i/pri[i]]:0):-1;
	for(int i=2;i<maxn;i++) if(!vis[i])
		for(int j=i;j<maxn;j+=i) f[j]+=(LL)mu[j/i];
	
	for(int i=1;i<maxn;i++) f[i]+=f[i-1];
}
	

int main()
{
	init();scanf("%d",&t);
	
	while(t--)
	{
		LL ans=0;scanf("%d%d",&n,&m);
		for(int i=1,pos;i<=min(n,m);i=pos+1)
		{
			pos=min(n/(n/i),m/(m/i));
			ans+=(f[pos]-f[i-1])*(n/i)*(m/i);
		}
		printf("%lld\n",ans);
	}
	
	return 0;
}