After the Cold War ended, the UNO decided that the world should be connected. It should not again be bipolar. So, it decided to ensure the well-being of critical relationships between nations. By critical, UNO means that upsetting such realtionships will divide the world into two groups of nation(s).
There are N countries numbered from 0 to N-1. All friendships are mutual (friendship from both sides or no relationship). There are M friendly pairs in the world. So, UNO gave you the list of pairs of friendly countries and asks you to count the number of critical relationships in the world so that it work upon ensuring World Peace.
First line contains two integers N and M. M lines follow each containing a pair of two friendly countries (Ci1,Ci2). Each test case is followed by a blank line. Read till EOF.
For every test case, output an integer giving the count of number of critical relationships.
Test Cases < 20
0 < N <= 105
0 < M <= 105
0 <= Ci1,Ci1 < N
Case 1 : No critical relationships.
Case 2 : Critical relationships are (0,1), (3,4) and (4,5)
Read about Bridges from GeeksforGeeks.
Problem Setter : Shikhar Sharad
Problem Tester : Dhruva Bhaswar