不相交 LIS - Problem

#834. 不相交 LIS

Statistics

This problem is prepared by 300iq .

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

令一個排列的 LIS 為其最長遞增子序列（Longest Increasing Subsequence）的長度。

若一個排列可以找到兩條長度皆為 LIS 且不包含任何共同元素的遞增子序列，則稱該排列為「好的」（good）。

給定 $n$，請計算長度為 $n$ 的好的排列數量。由於答案可能很大，你只需要輸出其對 $998\,244\,353$ 取模後的結果。

輸入格式

輸入的第一行包含一個整數 $n$ ($1 \le n \le 75$)：元素的數量。

輸出格式

輸出一個整數：長度為 $n$ 的好的排列數量，對 $998\,244\,353$ 取模。

範例

範例輸入 1

範例輸出 1

Discussions

About Discussions

The discussion section is only for posting: 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.

Open Discussions 0

No discussions in this category.

Issues

About Issues

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:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0