

BondsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 848 Accepted Submission(s): 377 Problem Description Given an undirected connected graph with N points and M edges. ?? wants to know the number of occurrence in all bonds of graph for every edge.The index of points starts from 0. An edge cut E of a Graph G is a set of edges of G and the G would be disconnected after deleting all the edges of E. A bond of a graph is an edge cut does not have any other edge cut as a proper subset. Input The first line of the input gives the number of test cases T; T test cases follow. Each test case consists of two integers: N, M, followed by M lines, each line contains two integers u, v, implying an undirected edge between u and v. limits T <= 20 2 <= N <= 20 N1 <= M <= N*(N1)/2 Edges are distinct. No edge connects to the point itself. N is larger than 10 in no more than 5 cases. Output For each test case output ˇ°Case #x: y1 y2 ˇ yNˇ± (without quotes), where x is the test case number (starting from 1), and yi is the occurrence times in all bonds of ith edge. Sample Input
Sample Output
Hint In first case, {(0,1),(0,2)} , {(0,1),(1,2)} , {(0,2),(1,2)} are bonds. In second case, {(0,1)},{(0,2)} is bond. Author FZU Source  
