Edges removal#3642
The undirected graph without loops and multiple edges is given. Find the minimum number of edges that need to be removed to make a graph disconnected.
Two numbers and (2 \leq n \leq 100, 0 \leq k \leq n\cdot(n-1)/2) — the number of vertices and edges in a graph. Then given lines, each contains two numbers — and (1 \leq a, b \leq n) — the numbers of the vertices, connected with an edge.
One number — the minimum number of edges that need to be removed to make a graph disconnected.
Example 1