No.2528 pop_(backfront or not)
Problem Statement
You are given an integer $N$.
For the integer sequence $A = (1, 2, \ldots, 2N + 1)$, repeat the following operation $N$ times.
- Let the current $A$ be $(A_1, \ldots, A_M)$. Choose a pair of integers $(i, j)$ satisfying $(i, j) = (1, M)$ or $2\leq i\lt j\leq M-1$, and delete $A_i$ and $A_j$ from $A$.
For each of $k = 1, 2, \ldots, 2N+1$, find the number, modulo $998244353$, of operation sequences such that $A = (k)$ after the $N$ operations are finished.
Here, $2$ operation sequences are considered different if there exists some $x\ (1\leq x\leq N)$ such that the pairs $(i, j)$ chosen in the $x$-th operation differ.
Constraints
- $N$ is an integer
- $1\leq N\leq 2000$
Input
$N$
Output
Print $2N+1$ lines. On the $i\ (1\leq i\leq 2N+1)$-th line, print the answer for $k=i$.
Sample
Sample 1
Input
2
Output
0 1 2 1 0
There are no operation sequences that result in $A = (1)$ after the operations.
The operation sequence that results in $A = (2)$ after the operations is $((3, 4),(1, 3))$, which is $1$ sequence.
The operation sequences that result in $A = (3)$ after the operations are $((1, 5),(1, 3))$ and $((2, 4), (1, 3))$, which are $2$ sequences.
The operation sequence that results in $A = (4)$ after the operations is $((2, 3),(1, 3))$, which is $1$ sequence.
There are no operation sequences that result in $A = (5)$ after the operations.
Sample 2
Input
5
Output
0 2520 3576 4378 4896 5076 4896 4378 3576 2520 0
提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。
だれ
SSRS
nok0