并查集 求集合个数
依题意,这里集合个数-1为所求
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#define inf 0x3f3f3f3f
#define ll __int64
using namespace std;
int r[1005],n,m,ans;
int root(int a)
{
if(r[a]==a) return a;
else return r[a]=root(r[a]);
}
void merge(int a,int b)
{
int ra,rb;
ra=root(a);
rb=root(b);
if(ra==rb) return;
ans--;
if(ra<rb)
r[rb]=ra;
else r[ra]=rb;
}
int main()
{
int i,j;
while(scanf("%d%d",&n,&m)&&n)
{
for(i=0;i<=n;i++)
r[i]=i;
ans=n-1;
while(m--)
{
scanf("%d%d",&i,&j);
merge(i,j);
}
printf("%d\n",ans);
}
return 0;
}