UVA 10583

Ubiquitous Religions

There are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out how many different religions students in your university believe in.

You know that there are n students in your university (0 < n <= 50000). It is infeasible for you to ask every student their religious beliefs. Furthermore, many students are not comfortable expressing their beliefs. One way to avoid these problems is to 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 know what each person believes in, but you can get an idea of the upper bound of how many different religions can be possibly represented on campus. You may assume that each student subscribes to at 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 two integers i and j, specifying that students i and j believe in the same religion. The students are numbered 1 to n. The end of input is specified by a line in which n = m = 0.

Output

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

Sample Input

10 9
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
10 4
2 3
4 5
4 8
5 8
0 0

Sample Output

Case 1: 1
Case 2: 7

题目大意

当今世界有很多不同的宗教,很难通晓他们。你有兴趣找出在你的大学里有多少种不同的宗教信仰。
你知道在你的大学里有n个学生(0 < n <= 50000) 。你无法询问每个学生的宗教信仰。此外,许多学生不想说出他们的信仰。避免这些问题的一个方法是问m(0 <= m <= n(n - 1)/ 2)对学生, 问他们是否信仰相同的宗教( 例如他们可能知道他们两个是否去了相同的教堂) 。在这个数据中,你可能不知道每个人信仰的宗教，但你可以知道校园里最多可能有多少个不同的宗教。假定每个学生最多信仰一个宗教。

Input

第一行第一个数字代表宗教总数，第二个为组数

#include <iostream>#include <stdio.h>#include <string.h>using namespace std;const int N = 50000;int fa[N], deep[N];void init(){    memset(fa, -1, sizeof(fa));    memset(deep, 0, sizeof(deep));}int find(int x){    if (fa[x] == -1) return x;    return fa[x] = find(fa[x]);}void unite(int x, int y){    x = find(x);y = find(y);    if (x == y) return;    if (deep[x]<deep[y])        fa[x] = y;    else    {        fa[y] = x;        if (deep[x] = deep[y])            deep[x]++;    }}bool same(int x, int y){    return find(x) == find(y);}int main(){    int n, m;//n个宗教 m组    int x, y;//学生x 学生y    int fx, fy;//学生x y的父节点    int c = 1;//case 计数    while (scanf_s("%d%d", &n, &m) && n != 0 && m != 0)    {        init();//初始化        while (m--) {            scanf_s("%d%d", &x, &y);            fx = find(x), fy = find(y);//设置x y的父节点            if (fx!=fy) //如果父节点不相等 则合并            {                unite(fx, fy);                n--; //宗教数-1            }        }        printf("Case %d: %d\n", c++, n);    }    return 0;}