测试

最新推荐文章于 2024-05-10 10:31:53 发布

stone41123

最新推荐文章于 2024-05-10 10:31:53 发布

阅读量183

点赞数

文章标签：莫比乌斯反演搜索

本文链接：https://blog.csdn.net/stone41123/article/details/84061289

版权

Diffculty

算法难度7，思维难度8，代码难度7

Description

给定A,B,C，求 $\sum_{i=1}^A\sum_{j=1}^B\sum_{k=1}^C d(ijk)$

$1\le A,B,C\le 10^5$

Solution

首先推一波式子：默认A<=B<=C

$Ans=\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_{a| i,b| j,c| k}[a\perp b][a\perp c][b\perp c]$

$=\sum_{a=1}^A\sum_{b=1}^B\sum_{c=1}^C(A/a)(B/b)(C/c) [a\perp b][a\perp c][b\perp c]$

$=\sum_{a=1}^A\sum_{b=1}^B\sum_{c=1}^C(A/a)(B/b)(C/c)\sum_{u|a,u|b}\mu(u)\sum_{v|a,v|c}\mu(v)\sum_{w|b,w|c}\mu(w)$
$=\sum_{u=1}^A\sum_{v=1}^B\sum_{w=1}^C\mu(u)\mu(v)\mu(w)\sum_{lcm(u,v)|a}(A/a)\sum_{lcm(u,w)|b}(B/b)\sum_{lcm(v,w)|c}(C/c)$

$\sum_{x|i}(N/i)=\sum_{i}(N/xi)=F(N/x)$

$F(n)=\sum_{i}(n/i)=\sum_{ij\le n}=\sum_{i=1}^nd(i)$

$Ans=\sum_{u=1}^A\sum_{v=1}^B\sum_{w=1}^C\mu(u)\mu(v)\mu(w)F(\frac{A}{lcm(u,v)})F(\frac{B}{lcm(u,w)})F(\frac{C}{lcm(v,w)})$

然后我们就可以来处理这些东西了，大概就是说首先每个质数不可能选两次，我们就可以枚举每个质数对于三个部分选不选，然后进行dfs，加上一些预处理和剪枝就可以很快了

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<cstring>
#define LL long long
using namespace std;
inline int read(){
    int x=0,f=1;char ch=' ';
    while(ch<'0' || ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0' && ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
    return f==1?x:-x;
}
const int N=8e6+5,M=201;
int cnt,vis[N],prime[N/3],e[N];
unsigned int d[N],F[M][M][M],S[N];
inline void init(){
	d[1]=1;
	for(int i=2;i<N;++i){
		if(!vis[i]){prime[++cnt]=i;d[i]=2;e[i]=1;}
		for(int j=1;j<=cnt && i*prime[j]<N;++j){
			vis[i*prime[j]]=1;
			if(i%prime[j]==0){
				e[i*prime[j]]=e[i]+1;
				d[i*prime[j]]=d[i]/(e[i]+1)*(e[i]+2);
				break;
			}
			else{
				e[i*prime[j]]=1;
				d[i*prime[j]]=d[i]*d[prime[j]];
			}
		}
	}
	for(int i=1;i<N;++i)S[i]+=S[i-1]+d[i];
	for(int i=1;i<M;++i)
		for(int j=1;j<M;++j)
			for(int k=1;k<M;++k)
				F[i][j][k]=F[i-1][j][k]+F[i][j-1][k]+F[i][j][k-1]
					-F[i-1][j-1][k]-F[i-1][j][k-1]-F[i][j-1][k-1]+F[i-1][j-1][k-1]+d[i*j*k];
}
inline unsigned int dfs(int x,int A,int B,int C){
	if(!x)return S[A]*S[B]*S[C];
	int p=prime[x];
	if(p>max(A,max(B,C)) && A<M && B<M && C<M)return F[A][B][C];
	if(!(A && B && C))return 0;
	unsigned int ans=dfs(x-1,A,B,C);
	if(A>=p && B>=p)ans=ans-dfs(x-1,A/p,B/p,C);
	if(A>=p && C>=p)ans=ans-dfs(x-1,A/p,B,C/p);
	if(B>=p && C>=p)ans=ans-dfs(x-1,A,B/p,C/p);
	if(A>=p && B>=p && C>=p)ans=ans+2*dfs(x-1,A/p,B/p,C/p);
	return ans;
}
int main(){
	freopen("exam.in","r",stdin);
	freopen("exam.out","w",stdout);
	init();
	int A=read(),B=read(),C=read();
	int id=cnt;
	while(prime[id]>A && prime[id]>B && prime[id]>C)--id;
	unsigned int ans=dfs(id,A,B,C);
	printf("%u\n",ans);
    return 0;
}