Arbiter

Problem Description

Arbiter is a kind of starship in the StarCraft science-fiction series. The Arbiter-class starship is a Protoss warship specializing in providing psychic support. Arbiters were crewed exclusively by Judicators; unlike other warships that were manned predominantly by Templar. The Judicator used the Arbiter as a base to provide support using space-time manipulation.
Arbiters could weaken space-time, tearing rifts in the fabric of space-time, creating a vortex linking another location to the Arbiter’s location. This could be used to move personnel over long distances between stars.
In the meantime of widely used Arbiter to transfer, KMXS, the captain of one Arbiter, was warning that some person had got a serious mental disorder after the trip on his Arbiter. By using mice as model animals, he found the sake, it’s because of chirality!
Every person has chirality, either left-handed or right-handed. Actually all the persons must live with the food which has the same chirality. When one person took Arbiter from one star to another one, his chirality will be changed (from left-handed to right-handed or from right-handed to left-handed). If a person took a long trip and finally got back to his own star, however, his chirality might be changed to the opposite state other than his original, which would cause fatal mental disorder, or even death.
KMXS has the channels map among the starts and he need to prohibit minimum number of channels from traveling so that wherever a person starts his traveling from when he gets his original star he’ll be safe. KMXS turns to your help.

Input

The first line of input consists of an integer T, indicating the number of test cases.
The first line of each case consists of two integers N and M, indicating the number of stars and the number of channels. Each of the next M lines indicates one channel (u, v) which means there is a bidirectional channel between star u and star v (u is not equal to v).

Output

Output one integer on a single line for each case, indicating the minimum number of channels KMXS must prohibit to avoid mental disorder.

Constraints
0 < T <= 10
0 <= N <= 15 0 <= M <= 300
0 <= u, v < N and there may be more than one channel between two stars.

Sample Input

1
3 3
0 1
1 2
2 0

Sample Output

1
题意：一个人从通道一个星球到另一个星球他的左手变右手，右手变左手，如果存在回到原来的星球他的左右手不是原来的状态的话，这是致命的，为了使这种情况不能发生，最少需要册除多少条边。 也就是可以理解成：删去最少的边，使图中不存在奇圈。
二分图的定义：在无向图G中，至少有两个点且如果存在回路，那么回路必须为偶回路。这样才是二分图。
所以根据定义可知：把n个点分成两部分，每一部分内的点集任意两点不相连。把相连的边就册除。这样的分法有2^n种。 最后找出册除边数最少的就是所要求的。
#include<stdio.h>
#include<queue>
#include<string.h>
#include<iostream>
using namespace std;
int map[20][20],n;
int deletEdg(int k)
{
    int ans=0;
    for(int i=0;i<n;i++)
    for(int j=i+1;j<n;j++)
    {
        if((k&(1<<i))==0&&(k&(1<<j))==0)ans+=map[i][j];//在同一部分的点它们相连的边数全部册除
        else if((k&(1<<i))!=0&&(k&(1<<j))!=0)ans+=map[i][j];
    }
    return ans;
}
int main()
{
    int m,t,a,b;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        memset(map,0,sizeof(map));
        while(m--)
        {
            scanf("%d%d",&a,&b);
            map[a][b]++; map[b][a]++;//必须这样才能对
        }
        int MIN=99999999;
        if(n==0||m==0)printf("0\n");
        else{
            for(int k=1;k<(1<<n);k++)//把n个数分成两部分有2^n种状态，每种状态为k，在该状态和第i位同为0的为第一部分，同为1的为另一部分
            {
                int t=deletEdg(k);
                if(t<MIN)MIN=t;
            }
            printf("%d\n",MIN);
        }
    }
}