本质就是找去掉最少的边使得图中没有奇环。。。。二进制枚举判断就好了。。。
#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 5000005
#define maxm 4000005
#define eps 1e-10
#define mod 1000000007
#define INF 1e9
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid
#define rson o<<1 | 1, mid+1, R
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
struct Line
{
int u, v;
}line[maxn];
int n, m;
void read(void)
{
scanf("%d%d", &n, &m);
for(int i = 1; i <= m; i++) scanf("%d%d", &line[i].u, &line[i].v);
}
void work(void)
{
int ans = m;
for(int i = 0; i < (1 << n); i++) {
int t = m;
for(int j = 1; j <= m; j++) {
int t1 = (i >> line[j].u) & 1;
int t2 = (i >> line[j].v) & 1;
t -= t1 ^ t2;
}
ans = min(ans, t);
}
printf("%d\n", ans);
}
int main(void)
{
int _;
while(scanf("%d", &_)!=EOF) {
while(_--) {
read();
work();
}
}
return 0;
}