CF1750D Count GCD

Hardy_Lee

已于 2022-11-07 09:28:06 修改

阅读量192

点赞数

分类专栏：数学文章标签：算法 c++ 开发语言

于 2022-11-07 09:27:15 首次发布

本文链接：https://blog.csdn.net/Hardy_Lee/article/details/127724890

版权

数学专栏收录该内容

3 篇文章 0 订阅

订阅专栏

原题链接
易知 $b_1 = a_1,$
$\forall 2 \le i \le n,$ 若 $a_{i - 1}$ 不能被 $a_i$ 整除 $,$ 则答案为 $0.$
否则需满足 $gcd(a_{i - 1}, b_{i}) = a_i,$ 即 $:$
$gcd(\frac {a_{i - 1}} {a_{i}}, \frac {b_i} {a_{i}}) = 1, \frac {b_i} {a_{i}} \le \frac {m} {a_{i}}.$
得到 $\frac {a_{i - 1}} {a_{i}}$ 的质因子, 用容斥原理求解即可.
时间复杂度 $O(T\cdot(2^9\cdot9\cdot\log M+\sqrt{M})).$
代码如下：

#include <bits/stdc++.h>

using namespace std;

#define ll long long

inline ll read() {
	ll x = 0, f = 0; char ch = getchar();
	while (!isdigit(ch)) f = ch == '-', ch = getchar();
	while (isdigit(ch)) x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}

const int N = 2e5 + 10; 
const ll mod = 998244353; 
int n; ll m, a[N]; 

void MulMod(ll &p, ll k) { p = p * k % mod; }
void AddMod(ll &p, ll k) { p = ((p + k) % mod + mod) % mod; }

vector<int> fac;  

void get_prim_fac(ll x) {
	fac.clear(); 
	for (int i = 2; i * i <= x; ++i) {
		if (!(x % i)) fac.push_back(i);
		while (!(x % i)) x /= i; 
	}
	if (x != 1) fac.push_back(x); 
}

void work() {
	n = read(); m = read(); 
	for (int i = 1; i <= n; ++i) a[i] = read(); 
	ll res = 1ll; 
	for (int i = 2; i <= n; ++i) {
		if (a[i - 1] % a[i]) {
			printf("0\n"); 
			return; 
		}
		else {
			ll x = a[i - 1] / a[i]; 
			get_prim_fac(x); 
			int sz = fac.size(); 
			ll mul = m / a[i] % mod; 
			for (int j = 1; j < (1 << sz); ++j) {
				int cnt = 0; 
				ll prod = 1ll; 
				for (int k = 0; k < sz; ++k) {
					if ((j >> k) & 1) {
						prod *= fac[k]; 
						++cnt; 
					}
				}
				if (cnt & 1) {
					AddMod(mul, -m / a[i] / prod % mod);
				} else {
					AddMod(mul, m / a[i] / prod % mod);
				}
			}
			MulMod(res, mul); 
		} 
	}
	printf("%lld\n", res); 
}

int main() {
	int t = read(); 
	while (t--) work(); 
}