hdoj2120Ice_cream's world I

Problem Description

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.

 

Input

In the case, first two integers N, M (N<=1000, M<=10000) is represent the number of watchtower and the number of wall. The watchtower numbered from 0 to N-1. Next following M lines, every line contain two integers A, B mean between A and B has a wall(A and B are distinct). Terminate by end of file.

 

Output

Output the maximum number of ACMers who will be awarded.
One answer one line.

 

Sample Input

  
  

   
   8 10
0 1
1 2
1 3
2 4
3 4
0 5
5 6
6 7
3 6
4 7
  
  

 

Sample Output

  
  

   
   3
  
  

 

这个题跟小希的迷宫思想是差不多一样的，这个题是让求有多少个环，土地只有被圈住才能增送

代码如下：

#include<stdio.h>
#include<string.h>
int par[1100],ans;
int find(int x)
{
	if(x==par[x])
	return x;
	else
	return par[x]=find(par[x]);
}
/*int unite(int x,int y)
{
	int fx=find(x);
	int fy=find(y);
    if(fx==fy)
    ans++;
    par[fx]=fy;
}*/
int main()
{
	int n,m,i,a,b;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		int ans=0;
		for(i=0;i<n;i++)
		par[i]=i;
		for(i=0;i<m;i++)
		{
			scanf("%d%d",&a,&b);
            //unite(a,b);
            	int fx=find(a);
	            int fy=find(b);
                if(fx==fy)
                ans++;
                par[fx]=fy;
		}
		printf("%d\n",ans);
	}
}