codeforces 216B-Forming Teams

Description

One day n students come to the stadium. They want to play football, and for that they need to split into teams, the teams must have an equal number of people.

We know that this group of people has archenemies. Each student has at most two archenemies. Besides, if student A is an archenemy to student B, then student B is an archenemy to student A.

The students want to split so as no two archenemies were in one team. If splitting in the required manner is impossible, some students will have to sit on the bench.

Determine the minimum number of students you will have to send to the bench in order to form the two teams in the described manner and begin the game at last.

Input

The first line contains two integers n and m (2 ≤ n ≤ 100, 1 ≤ m ≤ 100) — the number of students and the number of pairs of archenemies correspondingly.

Next m lines describe enmity between students. Each enmity is described as two numbers a_i and b_i (1 ≤ a_i, b_i ≤ n, a_i ≠ b_i) — the indexes of the students who are enemies to each other. Each enmity occurs in the list exactly once. It is guaranteed that each student has no more than two archenemies.

You can consider the students indexed in some manner with distinct integers from 1 to n.

Output

Print a single integer — the minimum number of students you will have to send to the bench in order to start the game.

Sample Input

Input

5 4
1 2
2 4
5 3
1 4

Output

1

Input

6 2
1 4
3 4

Output

0

Input

6 6
1 2
2 3
3 1
4 5
5 6
6 4

Output

2

思路：题目大意就是，要组织足球赛，首先其中的队员都会有仇人，所以他们不能够在同一组，每个人的仇人的个数不超过两个，如果A与B是仇人，那么B与A也是仇人，给定仇人的序列，让你判断需要剔除的最少人数以使足球赛能够进行。

   并查集的题目，用root数组将能够成为一组的人并在一起，使用sex数组记录每个人的敌人，具体见代码（思路可参照本博客中并查集的A bug‘s life！）。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int root[110],sex[110];
int n,m;
void chu()
{
    for(int i=0;i<=n;i++)
        root[i]=i;
        memset(sex,0,sizeof(sex));
}
int look(int a)
{
    if(a!=root[a])
        a=look(root[a]);
    return a;
}
void _union(int a,int b)
{
    a=look(a);
    b=look(b);
    if(a!=b) root[a]=b;
}
int main()
{
     while(scanf("%d%d",&n,&m)!=-1)
     {
         int x,y;
         int i,ans=0;
         chu();
         for(i=0;i<m;i++)
         {
             scanf("%d%d",&x,&y);
             x=look(x);
             y=look(y);
             if(x==y) ans++;
             else if(!sex[x]&&!sex[y])  {sex[x]=y;sex[y]=x;}
                else if(!sex[x])  {sex[x]=y;_union(x,sex[y]);}
                else if(!sex[y])  {sex[y]=x;_union(sex[x],y);}
                else {_union(sex[x],y);_union(x,sex[y]);}
         }
         if((n-ans)%2==1) ans++;
         printf("%d\n",ans);
     }
    return 0;
}