传统题 1000ms 256MiB

F - Unbranched

该比赛已结束,您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

F - Unbranched

Score : $600$ points

Problem Statement

Find the number of graphs with $N$ labeled vertices and $M$ unlabeled edges, not necessarily simple or connected, that satisfy the following conditions, modulo $(10^9+7)$:

  • There is no self-loop;
  • The degree of every vertex is at most $2$;
  • The maximum of the sizes of the connected components is exactly $L$.

Constraints

  • $2 \leq N \leq 300$
  • $1\leq M \leq N$
  • $1 \leq L \leq N$
  • All values in input are integers.

Input

Input is given from Standard Input in the following format:

NN MM LL

Output

Print the answer.


3 2 3
3

When the vertices are labeled $1$ through $N$, the following three graphs satisfy the condition:

  • The graph with edges $1-2$ and $2-3$;
  • The graph with edges $1-2$ and $1-3$;
  • The graph with edges $1-3$ and $2-3$.

4 3 2
6

300 290 140
211917445

2024春季入门组刷题营(十)

未参加
状态
已结束
规则
IOI
题目
8
开始于
2024-5-19 13:00
结束于
2024-5-19 15:00
持续时间
2 小时
主持人
参赛人数
10