問題一覧 > 通常問題

No.2528 pop_(backfront or not)

レベル : / AI推定難易度 : 1550 / 実行時間制限 : 1ケース 2.000秒 / メモリ制限 : 512 MB / 標準ジャッジ問題
タグ : (AC するまで非表示) / 解いたユーザー数 100
作問者 : だれ / テスター : SSRS nok0
お気に入りにしたユーザー ProblemId : 9796 / 自分の提出
問題文最終更新日: 2025-10-14 00:35:06
This statement was translated by AI (claude-opus-5-5, effort medium) and may contain errors or differ in nuance from the original. The original statement takes precedence. Back to the original
yukicoder contest 411 オムニバスコンテスト (順位表) の他の問題:

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もしくは右上の雲マークをクリックしてアカウントを作成してください。