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.
有一条 $n+1$ 个点的链，设其从一端到另一端的编号依次为 $0,1,\dots,n$。忆艾想知道有多少条从 $0$ 出发，又回到原点的欧拉回路，满足：经过 $(i-1,i)$ 这条边的次数恰为 $2d_i$。你只需要输出答案对 $998244353$ 取模的结果。
第一行输入一个正整数 $n$。
接下来一行输入 $n$ 个正整数，第 $i$ 个为 $d_i$。
输出一个整数表示方案数同余 $998244353$。
2 2 1
2
走一步后，可以选择继续前进或者折返，再往后都只有唯一选择。
4 200 30 8 11
812059605
对于 $100\%$ 的数据，保证 $1\le n,d_i\le 10^5$。
时间限制 $1\,\mathrm{s}$，空间限制 $512\,\mathrm{MB}$。
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: