Noip Eve: Noi.openjudge,ubiquitous Religions

Ubiquitous Religions

Total Time Limit:5000msmemory limit:65536kb

Description

There is, many different religions in the world today that it's difficult to keep track of them all. You is interested in finding-many different religions students in your university believe in.

You know that there is n students in your university (0 < n <= 50000). It is infeasible for your to ask every student their religious beliefs. Furthermore, many students is not comfortable expressing their beliefs. One-to-avoid these problems is-ask m (0 <= m <= N (n-1)/2) pairs of students and ask them whether they believe In the same religion (e.g they may know if they both attend the same church). From this data, you may not be know what is believes in, but can get a idea of the the upper bound of how many diff Erent religions can is possibly represented on campus. You may assume the student subscribes to the most one religion.

Input

The input consists of a number of cases. Each case starts with a line specifying the integers n and M. The next m lines each consists of both integers I and j, specifying that students I and J believe in the same religion. The students is numbered 1 to N. The end of input is specified by a line in which n = m = 0.

Output

For each test case, print to a single line the case number (starting with 1) followed by the maximum number of different R Eligions the students in the university believe in.

Sample Input

10 91 21 31 41 51 61 71 81 91 1010 42 34 54 85 80 0

Sample Output

Case 1:1case 2:7

Hint

Huge input, scanf is recommended.

A problem classified as graph theory is actually a collection;

Finally judge how many trees can be;

The path compression and query of the main investigation and check set

Find and Union

Code

var iJK: Longint; Father:Array[1..50000]of Longint; Used:Array[1..50000]OfBoolean; NM: Longint; XY: Longint; Ans: Longint; C: Longint;functionFind(x: Longint): Longint;BeginIf X=father[x]ThenExit(x)ElseBegin Father[x]:=Find(Father[x]);Exit(Father[x]);End;End;ProcedureUnion(xY: Longint);Begin Father[Find(x)]:=Find(Father[Y]);End;Begin C:=0;Readln(nM);While(n<>0)and(M<>0)DoBeginInc(c);For I:=1to nDo father[I]:=i;For I:=1to MDoBeginReadln(xY);IfFind(x) <>Find(Y)ThenUnion(xY);End; Ans:=0;Fillchar(Used,sizeof(Used),True);For I:=1to nDoBeginIf used[Find(I)]ThenBegin used[find (Ifalse; inc (Ansend; end; writeln ( ' case ' ,c, ': ' ,ans< Span class= "Sh_symbol"); readln (N,mend; End             

Noip Eve: noi.openjudge,ubiquitous Religions