P4389 付公主的背包 [生成函数+多项式Exp]

传送门

直接弄出每一种物品的生成函数 

几个F乘起来不好做，我们考虑先求 ln，然后加起来，再 exp 回去

设 

x ^ v 乘进去相当于平移一下

然后可以枚举每一个 v，然后调和级数处理出 g(x)，然后求 exp 就可以了

---

#include<bits/stdc++.h>
#define N 1000050
using namespace std;
typedef long long ll;
const int Mod = 998244353, G = 3;
ll add(ll a, ll b){ return (a + b) % Mod;}
ll mul(ll a, ll b){ return a * b % Mod;}
ll power(ll a, ll b){
	ll ans = 1; for(;b;b>>=1){
		if(b&1) ans = mul(ans, a); a = mul(a, a);
	} return ans;
}
int n, m, v[N], cnt[N];
ll A[N], B[N], C[N], D[N], F[N], f[N], g[N]; 
int up, bit, rev[N];
void Init(int len){
	up = 1; bit = 0; while(up < (len << 1)) up <<= 1, bit++;
	for(int i = 0; i < up; i++) rev[i] = (rev[i>>1] >> 1) | ((i&1) << (bit-1));
}
void NTT(ll *a, int flag){
	for(int i = 0; i < up; i++) if(i < rev[i]) swap(a[i], a[rev[i]]);
	for(int i = 1; i < up; i <<= 1){
		ll wn = power(G, (Mod - 1) / (i << 1));
		if(flag == -1) wn = power(wn, Mod - 2);
		for(int j = 0; j < up; j += (i<<1)){
			ll w = 1;
			for(int k = 0; k < i; k ++, w = mul(w, wn)){
				ll x = a[k + j], y = mul(w, a[k + j + i]);
				a[k + j] = add(x, y); a[k + j + i] = add(x, Mod - y);
			}
		}
	}
	if(flag == -1){
		ll inv = power(up, Mod - 2);
		for(int i = 0; i < up; i++) a[i] = mul(a[i], inv);
	}
}
void Inv(ll *a, ll *b, int len){
	if(len == 1){ b[0] = power(a[0], Mod-2); return;}
	Inv(a, b, len>>1);
	Init(len);
	for(int i=0; i<len; i++) C[i] = a[i]; 
	for(int i=len; i<up; i++) C[i] = 0;
	NTT(C, 1); NTT(b, 1);
	for(int i = 0; i < up; i++) b[i] = add(mul(2, b[i]), Mod - mul(mul(b[i], b[i]), C[i]));
	NTT(b, -1);
	for(int i=len; i<up; i++) b[i] = 0;
}
void Ln(ll *a, ll *b, int len){
	for(int i = 1; i < len; i++) A[i-1] = mul(a[i], i); A[len - 1] = 0;
	Inv(a, B, len);
	Init(len);
	NTT(A, 1); NTT(B, 1);
	for(int i = 0; i < up; i++) A[i] = mul(A[i], B[i]);
	NTT(A, -1);
	for(int i = 1; i < up; i++) b[i] = mul(A[i-1], power(i, Mod-2));
	b[0] = 0;
	for(int i = 0; i < up; i++) A[i] = B[i] = 0;
}
void Exp(ll *a, ll *b, int len){
	if(len == 1){ b[0] = 1; return;}
	Exp(a, b, len >> 1);
	Ln(b, F, len);
	F[0] = add(a[0] + 1, Mod - F[0]);
	for(int i = 1; i < len; i++) F[i] = add(a[i], Mod - F[i]);
	Init(len);
	NTT(b, 1); NTT(F, 1);
	for(int i = 0; i < up; i++) b[i] = mul(b[i], F[i]);
	NTT(b, -1);
	for(int i = len; i < up; i++) b[i] = F[i] = 0;
}
int main(){
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= n; i++){
		scanf("%d", &v[i]); cnt[v[i]]++;
	}
	for(int i = 1; i <= m; i++){
		if(!cnt[i]) continue;
		for(int j = 1; i * j <= m; j++){
			f[i * j] = add(f[i * j], mul(cnt[i], power(j, Mod - 2)));
		}
	} 
	up = 1; while(up < (m<<1)) up <<= 1;
	Exp(f, g, up); 
	for(int i = 1; i <= m; i++) cout << g[i] << '\n';
	return 0;
}