Tickets FZU - 2112 （欧拉通路）

You have won a collection of tickets on luxury cruisers. Each ticket can be used only once, but can be used in either direction between the 2 different cities printed on the ticket. Your prize gives you free airfare to any city to start your cruising, and free airfare back home from wherever you finish your cruising.

You love to sail and don't want to waste any of your free tickets. How many additional tickets would you have to buy so that your cruise can use all of your tickets?

Now giving the free tickets you have won. Please compute the smallest number of additional tickets that can be purchased to allow you to use all of your free tickets.

Input

There is one integer T (T≤100) in the first line of the input.

Then T cases, for any case, the first line contains 2 integers n, m (1≤n, m≤100,000). n indicates the identifier of the cities are between 1 and n, inclusive. m indicates the tickets you have won.

Then following m lines, each line contains two integers u and v (1≤u, v≤n), indicates the 2 cities printed on your tickets, respectively.

Output

For each test case, output an integer in a single line, indicates the smallest number of additional tickets you need to buy.

Sample Input

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

Sample Output

1
2
0

题意：一共有n座城市，m张（A，B之间的车票），车票只能用一次，求最少再买几张票能够将所有的城市走过

思路：记录每点的度数，最多只能有两个奇度顶点剩余的奇度顶点要通过加边消去

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1e5+10;
int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		int n,m;
		scanf("%d%d",&n,&m);
		int deg[N]={0};
		for(int i=0;i<m;i++){
			int u,v;
			scanf("%d%d",&u,&v);
			deg[u]++;
			deg[v]++;
		}
		int ans=0;
		for(int i=1;i<=n;i++)
		   if(deg[i]&1) ans++;
		if(ans==0) printf("0\n");
		else printf("%d\n",(ans-2)>>1);
	}
	return 0;
}