#P7364. 有标号二分图计数

    ID: 8242 远端评测题 2000ms 512MiB 尝试: 0 已通过: 0 难度: 9 上传者: 标签>O2优化生成函数快速傅里叶变换 FFT快速数论变换 NTT

有标号二分图计数

Problem Description

Find the number of labeled bipartite graphs with nn vertices. Output the answer for each 1n1051 \le n \le 10^5.

Take the result modulo 998244353998244353.

Input Format

There is no input.

Output Format

Print a total of 10510^5 lines. The ii-th line should be the number of labeled bipartite graphs with ii vertices modulo 998244353998244353.

没有输入。
答案的前八行:
1
2
7
41
376
5177
103237
2922446

Hint

Translated by ChatGPT 5