P3455 [POI2007]ZAP-Queries
题目大意
求:
∑ i = 1 n ∑ j = 1 m [ gcd ( i , j ) = k ] \large\sum\limits_{i=1}^n\sum\limits_{j=1}^m[\gcd(i,j)=k] i=1∑nj=1∑m[gcd(i,j)=k]
题解
首先将 k k k 从 gcd \gcd gcd 里面分离出来,不然很难处理,也就是照样令 i = i ′ k i=i^\prime k i=i′k。
∑ i = 1 ⌊ n k ⌋ ∑ j = 1 ⌊ m k ⌋ [ gcd ( i , j ) = 1 ] \large\sum\limits_{i=1}^{\lfloor\frac{n}{k}\rfloor}\sum\limits_{j=1}^{\lfloor\frac{m}{k}\rfloor}[\gcd(i,j)=1] i=1∑⌊kn⌋j=1∑⌊km⌋[gcd(i,j)=1]
然后利用 [ n = 1 ] = ∑ d ∣ n μ ( d ) [n=1]=\sum\limits_{d\mid n}\mu(d) [n=1]=d∣n∑μ(d):
∑ i = 1 ⌊ n k ⌋ ∑ j = 1 ⌊ m k ⌋ ∑ d ∣ gcd ( i , j ) μ ( d ) \large\sum\limits_{i=1}^{\lfloor\frac{n}{k}\rfloor}\sum\limits_{j=1}^{\lfloor\frac{m}{k}\rfloor}\sum\limits_{d\mid \gcd(i,j)}\mu(d) i=1∑⌊kn⌋j=1∑⌊km⌋d∣gcd(i,j)∑μ(d)
转化枚举思路:
∑ d = 1 n ∑ i = 1 ⌊ n k ⌋ ∑ j = 1 ⌊ m k ⌋ μ ( d ) × [ d ∣ i and d ∣ j ] \large\sum\limits_{d=1}^n\sum\limits_{i=1}^{\lfloor\frac{n}{k}\rfloor}\sum\limits_{j=1}^{\lfloor\frac{m}{k}\rfloor}\mu(d)\times [d\mid i\;\text{and}\;d\mid j] d=1∑ni=1∑⌊kn⌋j=1∑⌊km⌋μ(d)×[d∣iandd∣j]
同时去除 d d d:
∑ d = 1 n ∑ i = 1 ⌊ n k d ⌋ ∑ j = 1 ⌊ m k d ⌋ μ ( d ) \large\sum\limits_{d=1}^n\sum\limits_{i=1}^{\lfloor\frac{n}{kd}\rfloor}\sum\limits_{j=1}^{\lfloor\frac{m}{kd}\rfloor}\mu(d) d=1∑ni=1∑⌊kdn⌋j=1∑⌊kdm⌋μ(d)
μ ( d ) \mu(d) μ(d) 直接提出去,剩下的 O ( 1 ) \mathcal{O}(1) O(1) 解决:
∑ d = 1 n μ ( d ) ⌊ n k d ⌋ ⌊ m k d ⌋ \large\sum\limits_{d=1}^n\mu(d)\left\lfloor\dfrac{n}{kd}\right\rfloor\left\lfloor\dfrac{m}{kd}\right\rfloor d=1∑nμ(d)⌊kdn⌋⌊kdm⌋
直接整除分块,时间复杂度 O ( n ) \mathcal{O}(\sqrt{n}) O(n)。
代码
//P3455
//你 cnt=1 了吗?
#include<bits/stdc++.h>
#define int long long
#define mid ((l+r)>>1)
#define fir first
#define sec second
#define lowbit(i) (i&(-i))
using namespace std;
const int N=5e4+5;
const int inf=1e18;
struct edge{int to,nxt,l;};
inline int read(){
char op=getchar();
int w=0,s=1;
while(op<'0'||op>'9'){
if(op=='-') s=-1;
op=getchar();
}
while(op>='0'&&op<='9'){
w=(w<<1)+(w<<3)+op-'0';
op=getchar();
}
return w*s;
}
//数论部分
const double pi=acos(-1);
const int mod=1e9+7;
int Mul(int a,int b){return (a%mod*b%mod)%mod;}
int Add(int a,int b){return (a+b)%mod;}
int Dec(int a,int b){return (a-b+mod)%mod;}
int Pow(int a,int k){
int ans=1;
while(k){
if(k&1) ans=Mul(ans,a);
a=Mul(a,a);
k>>=1;
}
return ans;
}
int gcd(int x,int y){return y==0?x:gcd(y,x%y);}
int lcm(int x,int y){return x/gcd(x,y)*y;}
int inv(int x){return Pow(x,mod-2);}
void exgcd(int a,int b,int &x,int &y){
if(b==0){
x=1,y=0;
return;
}
exgcd(b,a%b,x,y);
int t=x;
x=y;
y=t-a/b*y;
}
int mu[N],p[N],cnt,sum[N],vis[N];
void mobius(){
mu[1]=1;
for(register int i=2;i<=N-5;i++){
if(!vis[i]){
mu[i]=-1;
p[++cnt]=i;
}
for(register int j=1;j<=cnt&&i*p[j]<=N-5;j++){
vis[i*p[j]]=1;
if(i%p[j]==0){
mu[i*p[j]]=0;
break;
}
mu[i*p[j]]=-mu[i];
}
}
for(register int i=1;i<=N-5;i++) sum[i]=sum[i-1]+mu[i];
}
int Sqrt(int n,int m,int k){
int ans=0;
for(register int l=1,r;l<=min(n,m);l=r+1){
r=min(n/(n/l),m/(m/l));
ans+=(sum[r]-sum[l-1])*(n/(k*l))*(m/(k*l));
}
return ans;
}
signed main(){
int T=read();
mobius();
while(T--){
int n=read(),m=read(),k=read();
printf("%lld\n",Sqrt(n,m,k));
}
}