Codeforces 235 E Number Challenge 题解（Mobius反演）

题目：CF 235 E.
题目大意：给定$a,b,c$，设$d(n)={\sum }_{d|n}1$，求${\sum }_{i=1}^a{\sum }_{j=1}^b{\sum }_{k=1}^{c}d(ijk)$.
$1\le a,b,c\le 2000$.

我们考虑SDOI2015 约数个数和中的那个性质：
$$d(ab)=\sum _{i|a}\sum _{j|b}[gcd(i,j)=1]$$

考虑现在我们有的这个式子：
$$\begin{gathered} d(abc)=d(a\ast bc) \\ =\sum _{i|a}\sum _{j|bc}[gcd(i,j)=1] \\ =\sum _{i|a}\sum _{j|b}\sum _{k|c}[gcd(i,j)=gcd(i,k)=gcd(j,k)=1] \\ ≠\sum _{i|a}\sum _{j|b}\sum _{k|c}[gcd(i,j,k)=1] \end{gathered}$$

注意后面的不等于！！！

有了上面的等式，我们可以开始推导：
$$\begin{gathered} \sum _{i=1}^a\sum _{j=1}^b\sum _{k=1}^{c}d(ijk) \\ =\sum _{i=1}^a\sum _{j=1}^b\sum _{k=1}^c\sum _{x|i}\sum _{y|j}\sum _{z|k}[gcd(x,y)=gcd(x,z)=gcd(y,z)=1] \\ =\sum _{x=1}^a\sum _{y=1}^b\sum _{z=1}^c\lfloor \frac{a}{x}\rfloor \lfloor \frac{b}{y}\rfloor \lfloor \frac{c}{z}\rfloor [gcd(x,y)=1][gcd(x,z)=1][gcd(y,z)=1] \\ =\sum _{x=1}^a\sum _{y=1}^b\sum _{z=1}^c\lfloor \frac{a}{x}\rfloor \lfloor \frac{b}{y}\rfloor \lfloor \frac{c}{z}\rfloor \sum _{t|x\wedge t|y}\mu (t)[gcd(x,z)=1][gcd(y,z)=1] \\ =\sum _{z=1}^c\lfloor \frac{c}{z}\rfloor \sum _{t=1}^{min(a,b)}\mu (t)\sum _{x=1}^a[t|x]\lfloor \frac{a}{x}\rfloor [gcd(x,z)=1]\sum _{y=1}^b[t|y]\lfloor \frac{b}{y}\rfloor [gcd(y,z)=1] \\ =\sum _{z=1}^c\lfloor \frac{c}{z}\rfloor \sum _{t=1}^{min(a,b)}\mu (t)\sum _{x=1}^{\lfloor \frac{a}{t}\rfloor }\lfloor \frac{a}{tx}\rfloor [gcd(tx,z)=1]\sum _{y=1}^{\lfloor \frac{b}{t}\rfloor }\lfloor \frac{b}{ty}\rfloor [gcd(ty,z)=1] \end{gathered}$$

发现我们只需要预处理出$gcd$和$\mu$函数即可做到$O(n^2\log n)$解决这个问题.

代码如下：

#include<bits/stdc++.h>
  using namespace std;

#define Abigail inline void
typedef long long LL;

const int N=2000;
const LL mod=1LL<<30;

int pr[N+9],tp,b[N+9];
LL mu[N+9],ans;

void sieve(int n){
  for (int i=2;i<=n;++i) b[i]=1;
  mu[1]=1;int v;
  for (int i=2;i<=n;++i){
  	if (b[i]) pr[++tp]=i,mu[i]=-1;
  	for (int j=1;j<=tp&&i*pr[j]<=n;++j){
  	  b[v=i*pr[j]]=0;
  	  if (i%pr[j]==0){mu[v]=0;break;}
  	  mu[v]=-mu[i];
  	}
  }
}

int A,B,C,gcd[N+9][N+9];

int GCD(int a,int b){return b?GCD(b,a%b):a;}

void pre_gcd(int n,int m){
  for (int i=1;i<=n;++i)
    for (int j=1;j<=m;++j)
      gcd[i][j]=GCD(i,j);
}

Abigail into(){
  scanf("%d%d%d",&A,&B,&C);
}

Abigail work(){
  sieve(min(A,B));
  pre_gcd(C,max(A,B));
  LL t1,t2,t3;
  for (int z=1;z<=C;++z){
  	t1=0;
  	for (int t=1;t<=min(A,B);++t){
  	  t2=t3=0;
  	  for (int x=t;x<=A;x+=t)
  	    t2=(t2+(LL)A/x*(gcd[z][x]==1))%mod;
  	  for (int y=t;y<=B;y+=t)
  	    t3=(t3+(LL)B/y*(gcd[z][y]==1))%mod;
  	  t1=(t1+mu[t]*t2*t3)%mod+mod;
  	  if (t1>=mod) t1-=mod;
  	}
  	ans=(ans+C/z*t1)%mod;
  }
}

Abigail outo(){
  printf("%I64d\n",ans);
}

int main(){
  into();
  work();
  outo();
  return 0;
}