题意:
给出A,B,考虑所有满足l<=a<=A,l<=b<=B,且不存在n>1使得n^2同时整除a和b的有序数对(a,b),求其lcm(a,b)之和。
题解:
一开始想了个容斥做法,就是bzoj 2440+bzoj 2693
成功卡过了4659,2694T了。
膜题解,发现不用容斥,预处理枚举
μ
不为0的值就能过了,要写自然溢出,不然很慢。
题解
code(TLE):
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#define LL long long
using namespace std;
LL prime[4000010],pr=0,h[4000010],n,m,mu[4000010];
const LL mod=1<<30;
bool v[4000010];
void pre()
{
h[1]=mu[1]=1;
memset(v,true,sizeof(v));
for(LL i=2;i<=4000000;i++)
{
if(v[i]) prime[++pr]=i,h[i]=(i-i*i)%mod,mu[i]=-1;
for(LL j=1;j<=pr&&i*prime[j]<=4000000;j++)
{
v[i*prime[j]]=false;
if(i%prime[j]==0) {h[i*prime[j]]=h[i]*prime[j]%mod;mu[i*prime[j]]=0;break;}
h[i*prime[j]]=h[i]*h[prime[j]]%mod;mu[i*prime[j]]=-mu[i];
}
}
for(LL i=1;i<=4000000;i++) (h[i]+=h[i-1])%=mod;
}
LL sum(LL x,LL y)
{
x%=mod;y%=mod;
x=(x*(x+1)>>1)%mod;
y=(y*(y+1)>>1)%mod;
return x*y%mod;
}
LL solve(LL n,LL m)
{
LL j,ans=0;
for(LL i=1;i<=min(n,m);i=j+1)
{
j=min(n/(n/i),m/(m/i));
ans+=sum(n/i,m/i)*(h[j]-h[i-1])%mod;ans%=mod;
}
return ans;
}
int main()
{
LL T;scanf("%lld",&T);
pre();
while(T--)
{
scanf("%lld %lld",&n,&m);
if(n>m) swap(n,m);
LL ans=0;
for(LL i=1;i*i<=n;i++)
if(mu[i]!=0) ans+=mu[i]*solve(n/(i*i),m/(i*i))*i%mod*i%mod,ans%=mod;
printf("%lld\n",(ans+mod)%mod);
}
}
code:(AC)
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#define LL long long
using namespace std;
LL prime[4000010],pr=0,h[4000010],n,m,mu[4000010];
const LL mod=1<<30;
bool v[4000010];
void pre()
{
mu[1]=1;
memset(v,true,sizeof(v));
for(LL i=2;i<=4000000;i++)
{
if(v[i]) prime[++pr]=i,mu[i]=-1;
for(LL j=1;j<=pr&&i*prime[j]<=4000000;j++)
{
v[i*prime[j]]=false;
if(i%prime[j]==0) {mu[i*prime[j]]=0;break;}
mu[i*prime[j]]=-mu[i];
}
}
for(int i=1;i<=4000000;i++)
if(mu[i])
{
int t=i;
for(int j=1;j*t<=4000000;j++) h[j*t]=h[j*t]+mu[j]*j*j*i;
}
for(LL i=1;i<=4000000;i++) h[i]+=h[i-1];
}
LL sum(LL x,LL y)
{
x=x*(x+1)>>1;
y=y*(y+1)>>1;
return x*y;
}
int main()
{
LL T;scanf("%lld",&T);
pre();
while(T--)
{
scanf("%lld %lld",&n,&m);
if(n>m) swap(n,m);
LL ans=0;
for (int i=1,j;i<=n;i=j+1)
{
j=min(n/(n/i),m/(m/i));
ans=ans+(h[j]-h[i-1])*sum(n/i,m/i);
}
printf("%lld\n",(ans%mod+mod)%mod);
}
}