ice_cream's world is a rich country, it has many fertile lands. Today, the queen of ice_cream wants award land to diligent ACMers. So there are some watchtowers are set up, and wall between watchtowers be build, in order to partition the ice_cream’s world. But how many ACMers at most can be awarded by the queen is a big problem. One wall-surrounded land must be given to only one ACMer and no walls are crossed, if you can help the queen solve this problem, you will be get a land.
One answer one line.
8 10 0 1 1 2 1 3 2 4 3 4 0 5 5 6 6 7 3 6 4 7
3
#include<cstdio>
int par[1005];
int n,toal;
int init()
{
int i;
for(i=0;i<=n;i++)
par[i]=i;
}
int find(int x)
{
if(x!=par[x])
return par[x]=find(par[x]);
return x;
}
void unite(int a,int b)
{
int fa=find(a);
int fb=find(b);
if(fa!=fb)
par[fa]=fb;
else
toal++;
}
int main()
{
int m,i,a,b;
while(~scanf("%d %d",&n,&m))
{
init();
toal=0;
for(i=1;i<=m;i++)
{
scanf("%d %d",&a,&b);
unite(a,b);
}
printf("%d\n",toal);
}
}