Ice_cream's world I

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

题意：这个题的意思就是问墙能围成几组地，实质是求有几个环。

思路：这个题跟小希的迷宫有点像，用并查集做，如果在合并的时候发现二者根节点一样说明已经chen成环了，环数加一即可，最后输出环数。代码如下：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int f[10010],sum;
void init()
{
    for(int i=0;i<10010;i++)
        f[i]=i;
}
int find(int v)     //查找根节点
{
    if(f[v]==v)
        return v;
    else
    {
        f[v]=find(f[v]);
        return f[v];
    }
}
void join(int x,int y)
{
    int t1=find(x);
    int t2=find(y);
    if(t1==t2)
        sum++;    //x,y的根节点一样的话，已经成一个环了，这是求环的个数
    else
        f[t2]=t1;
}
int main()
{
    int a,b,i,m,n;
    while(~scanf("%d %d",&a,&b))
    {
        init();
        sum=0;
        for(i=0; i<b; i++)
        {
            scanf("%d %d",&m,&n);
            join(m,n);
        }
        printf("%d\n",sum);
    }
    return 0;
}