SPOJ HIGH Highways

　　In some countries building highways takes a lot of time... Maybe that's because there are many possiblities to construct a network of highways and engineers can't make up their minds which one to choose. Suppose we have a list of cities that can be connected directly. Your task is to count how many ways there are to build such a network that between every two cities there exists exactly one path. Two networks differ if there are two cities that are connected directly in the first case and aren't in the second case. At most one highway connects two cities. No highway connects a city to itself. Highways are two-way.

Input

The input begins with the integer t, the number of test cases (equal to about 1000). Then t test cases follow. The first line of each test case contains two integers, the number of cities (1<=n<=12) and the number of direct connections between them. Each next line contains two integers a and b, which are numbers of cities that can be connected. Cities are numbered from 1 to n. Consecutive test cases are separated with one blank line.

Output

The number of ways to build the network, for every test case in a separate line. Assume that when there is only one city, the answer should be 1. The answer will fit in a signed 64-bit integer.

Example

Sample input:
4
4 5
3 4
4 2
2 3
1 2
1 3

2 1
2 1

1 0

3 3
1 2
2 3
3 1

Sample output:
8
1
1
3

 

图论 生成树 Matrix-Tree定理

按照给出的边关系建立邻接矩阵和度数矩阵，直接套用矩阵树定理。

给出的图可能不连通……无解时候要输出0

↑天真的我压根儿没想到无解的情况，WA了一串

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<cmath>
using namespace std;
const double eps=1e-3;
const int mxn=20;
int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0' && ch<='9'){x=x*10-'0'+ch;ch=getchar();}
    return x*f;
}
double G[mxn][mxn],A[mxn][mxn];
int n,m;
void Solve(){
    int i,j;
    double ans=1;
    for(i=1;i<n;i++){
        int p=i;
        if(fabs(G[i][i])<eps){
            for(j=i+1;j<n;j++){
                if(fabs(G[j][i])>eps)p=j;
            }
            if(p==i){
                printf("0\n");return;
            }
            for(j=1;j<n;j++)swap(G[i][j],G[p][j]);
            ans=-ans;
        }
        for(j=i+1;j<n;j++){
            double c=G[j][i]/G[i][i];
            for(int k=i;k<n;k++){
                G[j][k]-=c*G[i][k];
            }
        }
        ans*=G[i][i];
    }
    printf("%.0f\n",ans);
    return;
}
int main(){
    int i,j,u,v;
    int T;
    scanf("%d",&T);
    while(T--){
        memset(G,0,sizeof G);
        memset(A,0,sizeof A);
        scanf("%d%d",&n,&m);
        for(i=1;i<=m;i++){
            scanf("%d%d",&u,&v);
            ++G[u][u];
            ++G[v][v];
            ++A[u][v];++A[v][u];
        }
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++){
                G[i][j]-=A[i][j];
        }
        Solve();
    }
    return 0;
}