#include <iostream>
#include <cstdio>
using namespace std;
int n, m;
int ans;
int Set[1005];
void init() {
for(int i = 1; i <= n; i++) {
Set[i] = i;
}
}
int Find(int x)
{
return x == Set[x] ? x:Set[x] = Find(Set[x]);
}
void Union(int a, int b) {
int x = Find(a);
int y = Find(b);
if(x != y)
{
ans--;
Set[x] = y;
}
}
int main()
{
int a, b;
while(scanf("%d%d", &n, &m) != EOF && n != 0) {
ans = n;
init();
for(int i = 0; i < m; i++) {
scanf("%d%d", &a, &b);
Union(a, b);
}
printf("%d\n", ans-1);
}
return 0;
}
hdu1232 畅通工程
最新推荐文章于 2021-09-23 13:41:44 发布