As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
给定两个长度为 $2^n$ 的序列 $A,B$，求另一序列 $C$ 使得 $C_k = \displaystyle \sum_{i \ominus j = k} A_i B_j$。
输入的第一行包含一个整数 $n$。
接下来一行，包含 $2^n$ 个整数，描述序列 $A$。
接下来一行，包含 $2^n$ 个整数，描述序列 $B$。
输出一行 $2^n$ 个整数，描述序列 $C$。答案取模 $998244353$。
2
1 2 3 4
5 6 7 8103 52 73 324
5 8 2 7 1 3 6 4 8 8 1 9 3 3 4 5
8 8 1 6 4 4 3 8 1 9 0 5 3 6 2 71805 1163 269 382 333 171 199 100 460 438 52 133 120 69 46 35对于 $100\%$ 的数据，$n \leq 17$。
The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: