Difference between revisions of "Training 5: Dynamic Programming"

From EOJ Wiki
Jump to navigation Jump to search
Line 15: Line 15:
 
Solved by Kilo_5723.
 
Solved by Kilo_5723.
  
题意:给定一个 $n$ $(1 \le n \le 16)$ 个点,有重边的无向图,求联通子图的个数。
+
题意:给定一个 $n$ $(1 \le n \le 16)$ 个点,有重边且每条边都不一样的无向图,求联通无重边子图的个数。
  
题解:令 $S$ 是 $\{1,\dots,n\}$ 的子集,$ans(S)$ 代表对 $S \subseteq {1,\dots,n}$ 按从小到大的顺序
+
题解:令 $S$ 是 $\{1,\dots,n\}$ 的子集,$ans(S)$ 代表 $S$
  
 
== Problem E ==
 
== Problem E ==

Revision as of 04:44, 12 September 2019

Problem A

Unsolved.

Problem B

Unsolved.

Problem C

Unsolved.

Problem D

Solved by Kilo_5723.

题意:给定一个 $n$ $(1 \le n \le 16)$ 个点,有重边且每条边都不一样的无向图,求联通无重边子图的个数。

题解:令 $S$ 是 $\{1,\dots,n\}$ 的子集,$ans(S)$ 代表 $S$

Problem E

Unsolved.

Problem F

Unsolved.