问题 AU: Network
内存限制：128 MB
时间限制：1.000 S
评测方式：文本比较
命题人：
提交：2
解决：1
题目描述
A network administrator manages a large network. The network consists of N computers and M links between pairs of computers. Any pair of computers are connected directly or indirectly by successive links, so data can be transformed between any two computers. The administrator finds that some links are vital to the network, because failure of any one of them can cause that data can't be transformed between some computers. He call such a link a bridge. He is planning to add some new links one by one to eliminate all bridges.
You are to help the administrator by reporting the number of bridges in the network after each new link is added.
You are to help the administrator by reporting the number of bridges in the network after each new li
输入
The input consists of multiple test cases. Each test case starts with a line containing two integers N(1≤N≤100,000) and M(N−1≤M≤200,000).
Each of the following M lines contains two integers A and B (1≤A≠B≤N), which indicates a link between computer A and B. Computers are numbered from 1 to N. It is guaranteed that any two computers are connected in the initial network.
The next line contains a single integer Q(1≤Q≤1,000), which is the number of new links the administrator plans to add to the network one by one.
The i-th line of the following Q lines contains two integer A and B (1≤A≠B≤N), which is the i-th added new link connecting computer A and B.
The last test case is followed by a line containing two zeros.
Each of the following M lines contains two integers A and B (1≤A≠B≤N), which indicates a li
The next line contains a single integer Q(1≤Q≤1,000), which is the number of new li
The i-th line of the following Q lines contains two integer A and B (1≤A≠B≤N), which is the i-th added new li
The last test case is followed by a line containing two zeros.
输出
For each test case, print a line containing the test case number( beginning with 1) and Q lines, the i-th of which contains a integer indicating the number of bridges in the network after the first i new links are added. Print a blank line after the output for each test case.
样例输入 复制
3 2
1 2
2 3
2
1 2
1 3
4 4
1 2
2 1
2 3
1 4
2
1 2
3 4
0 0样例输出 复制
Case 1:
1
0
Case 2:
2
0