14060번 - Paths in Multigraph 다국어

Given is an undirected multigraph G without loops.

Write a program disconnect, which determines the minimum number of edges that must be removed from G, so that the resulting multigraph to be disconnected.

The first line of the standard input contains an integer n – the number of vertices in G. The vertices of the multigraph G are numbered from 1 to n. The second line of the standard input contains an integer m – the number of edges in G. The next m lines of the standard input contain the endpoints u and v of the consecutive edge in multigraph G.

The only line of the standard output has to contain one integer – the minimum number of edges that must be removed from G, so that the resulting multigraph to be disconnected.

• 2 ≤ n ≤ 100
• 0 ≤ m ≤ 3000