FZU 2112 Tickets（欧拉路径）

Problem Description

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

本题是一道简单的欧拉路径题目。
具体欧拉路径请自行查询，在这里给出ＡＣ代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int pre[100005];
int main()
{
    int t,n,m;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        memset(pre,0,sizeof(pre));
        for(int i=1;i<=m;i++)
        {
            int a,b;
            scanf("%d%d",&a,&b);
            pre[a]++;
            pre[b]++;
        }
        int sum=0;
        for(int i=1;i<=n;i++)
        {
            if(pre[i]%2!=0)
            {
                sum++;
            }
        }
        sum=(sum-2)/2;
        if(sum<1)
        {
            sum=0;
        }
        printf("%d\n",sum);
    }
    return 0;
}