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

思路：就是判断有几个环，两个数的祖先相同加1。

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<map>
using namespace std;
int f[1010];
int getf(int v)
{
    if(f[v]==v)
        return v;
    else return f[v]=getf(f[v]);
}
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        int i,t1,t2,a,b;
        for(i=0;i<n;i++)
            f[i]=i;
        int sum=0;
        while(m--)
        {
            scanf("%d%d",&a,&b);
            t1=getf(a);
            t2=getf(b);
            if(t1!=t2)
                f[t2]=t1;
            else sum++;
        }
        printf("%d\n",sum);
    }
    return 0;
}