P2522 [HAOI2011]Problem b(莫比乌斯反演+容斥原理)

最新推荐文章于 2021-09-14 20:19:07 发布

_九磅十五便士_

最新推荐文章于 2021-09-14 20:19:07 发布

阅读量100

点赞数

分类专栏： # 数论

本文链接：https://blog.csdn.net/m0_51841071/article/details/116375966

版权

数论专栏收录该内容

42 篇文章 1 订阅

订阅专栏

题目传送门
本题题意转化成为：
$\displaystyle\sum_{x=a}^{b}\displaystyle\sum_{y=c}^{d}[ gcd(i,j)==k]$
这道题应该就是比较基础了
容斥原理
$\displaystyle\sum_{x=a}^{b}\displaystyle\sum_{y=c}^{d}[ gcd(i,j)==k] =\displaystyle\sum_{x=1}^{b}\displaystyle\sum_{y=1}^{d}[ gcd(i,j)==k]-\displaystyle\sum_{x=1}^{a-1}\displaystyle\sum_{y=1}^{d}[ gcd(i,j)==k]-\displaystyle\sum_{x=1}^{b}\displaystyle\sum_{y=1}^{c-1}[ gcd(i,j)==k]+\displaystyle\sum_{x=1}^{a-1}\displaystyle\sum_{y=1}^{c-1}[ gcd(i,j)==k]$
也就是求四个这个东西的式子

$\displaystyle\sum_{x=1}^{a}\displaystyle\sum_{y=1}^{b}[ gcd(x,y)==k]$
提取公因数
$\displaystyle\sum_{x=1}^{a/k}\displaystyle\sum_{y=1}^{b/k}ε(gcd(x,y))$
莫比乌斯函数
$\displaystyle\sum_{x=1}^{a/k}\displaystyle\sum_{y=1}^{b/k}\displaystyle\sum_{d|gcd(x,y)}^{}μ(d)$
交换枚举顺序
$\displaystyle\sum_{d=1}^{d<=min(a/k,b/k)}μ(d)\displaystyle\sum_{x=1}^{a/(k*d)}\displaystyle\sum_{y=1}^{b/(k*d)}1$
$\displaystyle\sum_{d=1}^{d<=min(a/k,b/k)}μ(d)*(b/(k*d))*(a/(k*d))$

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 500000;
int mu[N + 5], p[N + 5];
bool flg[N + 5];
void mobius() {
  int tot = 0;
  mu[1] = 1;
  for (int i = 2; i <= N; ++i) {
    if (!flg[i]) {
      p[++tot] = i;
      mu[i] = -1;
    }
    for (int j = 1; j <= tot && i * p[j] <= N; ++j) {
      flg[i * p[j]] = 1;
      if (i % p[j] == 0) {
        mu[i * p[j]] = 0;
        break;
      }
      mu[i * p[j]] = -mu[i];
    }
  }
  //数论分块要用到的前缀和 
  for (int i = 1; i <= N; ++i) mu[i] += mu[i - 1];
}
int lsc(int n,int m){
	int ans=0;
	for(int i=1,j;i<=min(n,m);i=j+1){
		j=min(n/(n/i),m/(m/i));
		ans+=(mu[j]-mu[i-1])*(n/i)*(m/i);
	}
	return ans;
}
int main(){
	mobius();
	int T;
	cin>>T;
	while(T--){
		int a,b,c,d,k;
		cin>>a>>b>>c>>d>>k;
		cout<<lsc(b/k,d/k)-lsc((a-1)/k,d/k)-lsc(b/k,(c-1)/k)+lsc((a-1)/k,(c-1)/k)<<endl;
	} 
}