BZOJ1101: [POI2007]Zap 莫比乌斯反演

很裸的吧  转换一下就好了

然后统计相同a/d,b/d 的值

#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define LL long long
using namespace std;
char c;
inline void read(int&a)
{
    a=0;do c=getchar();while(c<'0'||c>'9');
    while(c<='9'&&c>='0')a=(a<<3)+(a<<1)+c-'0',c=getchar();
}
 
int check[50005],mu[50005],p[50005],sum[50005];
inline void Mobius()
{
	memset(check,0,sizeof(check));
	mu[1]=1;
	int tot=0;
	for (int i=2;i<=50000;i++)
	{
		if (!check[i])
		{
			p[++tot]=i;
			mu[i]=-1;
		}
		for (int j=1;j<=tot;j++)
		{
			if (i*p[j]>50000) break;
			check[i*p[j]]=1;
			if (i%p[j]==0)
			{
				mu[i*p[j]]=0;
				break;
			}
			else mu[i*p[j]]=-mu[i];
		}
	}
	sum[0]=0;
	for (int i=1;i<=50000;i++)
		sum[i]=sum[i-1]+mu[i];
}
int main()
{
    Mobius();
	int T;
	read(T);
	while (T--)
	{
		int a,b,D;
		read(a),read(b),read(D);
		int pos;
		a/=D,b/=D;
		int x=min(a,b);
		LL ans=0LL;
		for (int d=1;d<=x;d=pos+1)
		{
			pos=min(a/(a/d),b/(b/d));
			ans+=(LL)(sum[pos]-sum[d-1])*(a/d)*(b/d);
		}
		printf("%lld\n",ans);
	}
	return 0;
}