题目链接:https://vjudge.net/problem/spoj-high
题目思路:典型的最小生成树计数
AC代码
#include<bits/stdc++.h>
using namespace std;
#define N 100
#define eps 0.00000001
struct Matrix
{
int n;
double matrix[N][N];
friend Matrix operator -(Matrix a,Matrix b)
{
Matrix temp;
temp.n=a.n;
for(int i=1;i<=temp.n;++i)
{
for(int j=1;j<=temp.n;++j)
temp.matrix[i][j]=a.matrix[i][j]-b.matrix[i][j];
}
return temp;
}
void operator =(Matrix b)
{
this->n=b.n;
for(int i=1;i<=this->n;++i)
{
for(int j=1;j<=this->n;++j)
this->matrix[i][j]=b.matrix[i][j];
}
}
void init()
{
n=0;
memset(matrix,0,sizeof(matrix));
}
};
int n,m;
Matrix D,A,C,ans;
double result;
bool isZore(double temp)
{
return temp>=-eps&&temp<=eps;
}
void Gauss_det()
{
int b[N];
for(int i=1;i<=ans.n;++i)
b[i]=i;
for(int i=1;i<=ans.n;++i)
{
if(isZore(ans.matrix[b[i]][i]))
{
int j;
for(j=i+1;j<=ans.n;++j)
{
if(!isZore(ans.matrix[b[j]][i]))
{
swap(b[i],b[j]);
result*=-1;
break;
}
}
if(j>ans.n);
{
result=0;
return;
}
}
result*=ans.matrix[b[i]][i];
for(int j=i+1;j<=ans.n;++j)
{
double mul=1.0*ans.matrix[b[j]][i]/ans.matrix[b[i]][i];
for(int k=1;k<=ans.n;++k)
ans.matrix[b[j]][k]-=mul*ans.matrix[b[i]][k];
}
}
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
A.init();
D.init();
C.init();
A.n=D.n=C.n=n;
for(int i=1;i<=m;++i)
{
int a,b;
scanf("%d%d",&a,&b);
D.matrix[a][a]++;
D.matrix[b][b]++;
A.matrix[a][b]=A.matrix[b][a]=1;
}
C=(D-A);
ans.n=C.n-1;
for(int i=1;i<=ans.n;i++)
{
for(int j=1;j<=ans.n;++j)
ans.matrix[i][j]=C.matrix[i][j];
}
result=1;
Gauss_det();
printf("%.0lf\n",result);
}
}