代码

#include <cstdio>
#include <cstring>
using namespace std;
typedef long long ll;

const int N = 3e5 + 5;
const ll P = 998244353;

int n, m, lim = 1, pos[N];
ll a[N], b[N];

template <typename T>
inline void read(T &X) {
	X = 0; char ch = 0; T op = 1;
	for (; ch > '9' || ch < '0'; ch = getchar())
		if(ch == '-') op = -1;
	for (; ch >= '0' && ch <= '9'; ch = getchar())
		X = (X << 3) + (X << 1) + ch - 48;
	X *= op;
}

template <typename T>
inline void swap(T &x, T &y) {
	T t = x; x = y; y = t;
}

inline ll fpow(ll x, ll y) {
	ll res = 1LL;
	for (; y > 0; y >>= 1) {
		if (y & 1) res = res * x % P;
		x = x * x % P;
	}
	return res;
}

inline void prework() {
	int l = 0;
	for (; lim <= n + m + 1; ++l, lim <<= 1);
	for (int i = 0; i <= lim; i++)
		pos[i] = (pos[i >> 1] >> 1) | ((i & 1) << (l - 1));
}

inline void NTT(ll *c, int opt) {
	for (int i = 0; i < lim; i++)
		if(i < pos[i]) swap(c[i], c[pos[i]]);
	for (int i = 1; i < lim; i <<= 1) {
		ll wn = fpow(3, (P - 1) / (i << 1));
		if(opt == -1) wn = fpow(wn, P - 2);
		for (int len = i << 1, j = 0; j < lim; j += len) {
			ll w = 1;
			for(int k = 0; k < i; k++, w = w * wn % P) {
				ll x = c[j + k], y = w * c[j + k + i] % P;
				c[j + k] = (x + y) % P, c[j + k + i] = (x - y + P) % P;
			}
		}
	}
}

int main() {
	read(n), read(m);
	for (int i = 0; i <= n; i++) read(a[i]);
	for (int i = 0; i <= m; i++) read(b[i]);
	
	prework();
	NTT(a, 1), NTT(b, 1);
	for (int i = 0; i < lim; i++) a[i] = a[i] * b[i] % P;
	NTT(a, -1);
	
	ll inv = fpow(lim, P - 2);
	for (int i = 0; i <= n + m; i++) {
		a[i] = a[i] * inv % P;
		printf("%lld%c", a[i], i == n + m ? '\n' : ' ');
	}
	
	return 0;
}

评测结果