Description
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 91 21 41 31 51 81 6 1 7 1 91 10 10 4 2 5 4 8 5 8 0 034
Sample Output
Case 1: 1
Case 2: 7
#include
<stdio.h>
int pre
[
100000
];
int
find
(
int r
)
{
int x
=r
,y
;
while
(pre
[r
]!=r
)
//寻根节点
r
=pre
[r
];
while
(pre
[x
]!=r
)
//路径压缩
{
y
=pre
[x
];
pre
[x
]=r
;
x
=y
;
}
return r
;
}
void
join
(
int x
,
int y
)
//两点间的连接
{
int fx
,fy
;
fx
=
find
(x
);
fy
=
find
(y
);
if
(fx
!=fy
)
pre
[fx
]=fy
;
//!!!!!!!!!!!!!!!!!!!
}
int
main
()
{
int n
,m
,k
=
1
;
while
(
scanf
(
"%d %d"
,&n
,&m
)!=EOF
&&
(m
!=
0
|| n
!=
0
))
{
int i
;
int x
,y
;
for
(i
=
1
;i
<=n
;i
++)
//initial
pre
[i
]=i
;
for
(i
=
1
;i
<=m
;i
++)
//各点连接
{
scanf
(
"%d %d"
,&x
,&y
);
join
(x
,y
);
}
int sum
=
0
;
for
(i
=
1
;i
<=n
;i
++)
//判断分支数
{
if
(pre
[i
]==i
)
sum
++;
}
printf
(
"Case %d: %d
\n
"
,k
++,sum
);
}
return
0
;
}