POJ 3352 浅谈边双连通分量缩点

世界真的很大
刚刚才刷了一道边双连通的Tarjan
感觉不够，迅速再敲一道练手
然后1A，哇哇哇哇
虽然是一道水题，但我自己不会说出来233

看题先：

description：

给定图G，求最少加多少边可以成为双连通图。

input：

The first line of input will consist of positive integers n and r, separated by a space, where 3 ≤ n ≤ 1000 is the number of tourist attractions on the island, and 2 ≤ r ≤ 1000 is the number of roads. The tourist attractions are conveniently labelled from 1 to n. Each of the following r lines will consist of two integers, v and w, separated by a space, indicating that a road exists between the attractions labelled v and w. Note that you may