[NOI2010]能量采集

题目描述

传送门

思路

根据题意$$ans=\sum _{i=1}^n\sum _{j=1}^m(2\ast gcd(i,j)-1)$$

$$=2\sum _{i=1}^n\sum _{j=1}^{m}gcd(i,j)-n\ast m$$

设$f(d)={\sum }_{i=1}^n{\sum }_{j=1}^m[gcd(i,j)==1]$

$$f(d)=\sum _{i=1}^n\sum _{j=1}^m\sum _{d|gcd(i,j)}\mu (d)=\sum _{d=1}^{min(n,m)}\mu (d)\ast \lfloor \frac{n}{d}\rfloor \ast \lfloor \frac{m}{d}\rfloor$$

AC code

#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cmath>
#define ll long long
using namespace std;
const int N=1e5+10;
const int M=5e4+10;
const int inf=1e5;
int prime[N],phi[N],m;ll sum[N];bool v[N];
void g_p()
{
	m=0;phi[1]=1;sum[0]=0;
	for(int i=2;i<=inf;i++)
	{
		if(!v[i])prime[++m]=i,phi[i]=i-1;
		for(int j=1;j<=m&&i*prime[j]<=inf;j++)
		{
			v[i*prime[j]]=1;
			if(i%prime[j]==0){phi[i*prime[j]]=phi[i]*prime[j];break;}
			phi[i*prime[j]]=phi[i]*(prime[j]-1);
		}
	}
	for(int i=1;i<=inf;i++)sum[i]=sum[i-1]+phi[i];
}
ll solve(int a,int b)
{
	if(a>b)swap(a,b);ll ans=0;
	for(int x=1,gx;x<=a;x=gx+1)
	{
		gx=min(a/(a/x),b/(b/x));
		ans+=(ll)(sum[gx]-sum[x-1])*(a/x)*(b/x);
	}
	return 2*ans-(ll)a*b;
}
int main()
{
	g_p();int a,b;scanf("%d%d",&a,&b);
	printf("%lld\n",solve(a,b));
	return 0;
}