POJ-2524-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
Hint
Huge input, scanf is recommended.
这道题目和HDU-1213-Ignatius’ birthday一模一样。
这里是详解链接：HDU-1213-Ignatius’ birthday
附上AC代码：

#include <iostream>

using namespace std;
int n,m,f[50005],a,b,cnt;//f【】记录第i个人的祖先，cnt记录宗教数量
int findf(int i)//递归找到第i个人的祖先
{
    if(f[i]!=i)
        return findf(f[i]);
    return f[i];
}
void setf(int x,int y)//设置关系
{
    int a=findf(x),b=findf(y);
    if(a!=b)//如果x和y的祖先不相同，则令y的祖先就是x的祖先
         f[b]=a;
    else return;
}
int main()
{
    ios::sync_with_stdio(false);
    int cas=1;
    while(cin>>n>>m,(n||m))
    {
        cout<<"Case "<<cas++<<": ";
        cnt=0;
        for(int i=1;i<=n;i++)
        {
            f[i]=i;
        }//初始化每一个人都认识自己，把自己当做自己的祖先
        for(int i=1;i<=m;i++)
        {
            cin>>a>>b;
            setf(a,b);//设置关系
        }
        for(int i=1;i<=n;i++)
        {
            findf(i);
            if(findf(i)==i)//如果此人的祖先就是自己，则需要加一中宗教
                cnt++;
        }
        cout<<cnt<<endl;
    }
    return 0;
}

欢迎评论！