#1166. 连通图变树
-
ID: 1166
Type: Objective
Tried: 30
Accepted: 15
Difficulty: 6
Uploaded By:
连通图变树
1、设G是有n个结点、m条边(n ≤m)的连通图，想要G变成一棵树，则必须删去（{{ input(1) }}）条边。