-
Notifications
You must be signed in to change notification settings - Fork 0
/
HIGH.cc
101 lines (83 loc) · 1.64 KB
/
HIGH.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
/*
*
* Author : fcbruce <fcbruce8964@gmail.com>
*
* Time : Sun 16 Aug 2015 08:24:36 PM CST
*
*/
#include <cstdio>
#include <iostream>
#include <sstream>
#include <cstdlib>
#include <algorithm>
#include <ctime>
#include <cctype>
#include <cmath>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#define sqr(x) ((x)*(x))
#define LL long long
#define itn int
#define INF 0x3f3f3f3f
#define PI 3.1415926535897932384626
#define eps 1e-16
#ifdef _WIN32
#define lld "%I64d"
#else
#define lld "%lld"
#endif
#define maxm
#define maxn 16
using namespace std;
long double g[maxn][maxn];
long double det(long double a[maxn][maxn], int n)
{
for (int i = 0; i < n; i++)
{
if (fabs(a[i][i]) < eps) return 0;
int r = i;
for (int j = i + 1; j < n; j++)
if (fabs(a[j][i]) > fabs(a[r][i])) r = j;
if (r != i) for (int j = 0; j <= n; j++) swap(a[r][j], a[i][j]);
for (int k = i + 1; k < n; k++)
{
long double f = a[k][i] / a[i][i];
for (int j = i; j <= n; j++) a[k][j] -= f * a[i][j];
}
}
long double res = 1.0;
for (int i = 0; i < n; i++) res *= a[i][i];
return res;
}
int main()
{
#ifdef FCBRUCE
freopen("/home/fcbruce/code/t","r",stdin);
#endif // FCBRUCE
int T_T;
scanf("%d", &T_T);
while (T_T--)
{
int n, m;
scanf("%d%d", &n, &m);
memset(g, 0, sizeof g);
for (int i = 0, u, v; i < m; i++)
{
scanf("%d%d", &u, &v);
u--;
v--;
g[u][v] -= 1;
g[v][u] -= 1;
g[u][u] += 1;
g[v][v] += 1;
}
printf("%.0Lf\n", fabs(det(g, n - 1)));
}
return 0;
}