No.2135 C5
タグ : / 解いたユーザー数 25
作問者 :
hamamu
taiga0629kyopro
Problem Statement
Find the number, modulo $998244353$, of undirected simple graphs $G=(V, E)$ with $N$ vertices and $M$ edges, whose vertices are numbered $1, 2, \cdots, N$ and whose edges are unnumbered, that satisfy the following condition.
Note
For an undirected graph $G=(V,E)$ and a subset $V'$ of its vertices, the induced subgraph of $V$ by $V'$ is the undirected graph $G'=(V',E')$ satisfying the following condition.
Input
$N$ $M$
Output
Print a newline at the end.
Sample
Sample 1
Input
5 6
Output
60
The answer is $60$.
For example, Graph 1 and Graph 2 below both satisfy the condition. In this case, the only $V'$ to consider is $\{1, 2, \cdots, 5\}$, and in both graphs the vertices $1, 2, \cdots, 5$ form a cycle of length $5$. Since the vertices are numbered, these two graphs are counted as different.
Sample 2
Input
7 13
Output
0
There may be no graph satisfying the condition.
Sample 3
Input
8 22
Output
49056
Sample 4
Input
300 44687
Output
203359716
Print the answer modulo $998244353$.
提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。