Step:
1.求基尔霍夫矩阵(=度数矩阵-图的邻接矩阵)
2.高斯消元求n-1阶主子式的行列式,答案就是生成树个数。
n-1阶主子式就是n阶方阵去掉任意一个元素所在的行和列的所有元素,就变成了一个n-1阶的方阵。我把中心的那个点给去掉了。
兢兢业业写完之后发现这个要用高精度,默默改用JAVA但是高斯消元的时候用BigDecimal要不就精度不够WA要不就T。后来找了一个用BigInteger的高斯消元。还不会高斯消元。气哭。
import java.io.BufferedInputStream;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;
import org.omg.CosNaming.BindingIteratorPOA;
public class Main{
static final double eps=1e-3;
public static void main(String[] args) {
int[][] mp=new int[105][105];
int n;
BigInteger[][] mat=new BigInteger[105][105];
Scanner input=new Scanner(new BufferedInputStream(System.in));
n=input.nextInt();
for (int i = 0; i < n + 1; i++){
for (int j = 0; j < n + 1; j++)
mat[i][j] = BigInteger.ZERO;
}
if(n==1){
System.out.println("1");
System.exit(0);
}else if(n==2){
System.out.println("5");System.exit(0);
}
for(int i=0;i<n;i++){
mp[i][n]=mp[n][i]=1;
}
for(int i=0;i<n;i++){
mp[i][(i+1)%n]=mp[(i+1)%n][i]=1;
}
for(int i=0;i<=n;i++){
if(i<n) mat[i][i]=BigInteger.valueOf(3-mp[i][i]);
else mat[i][i]=BigInteger.valueOf(n-mp[i][i]);
for(int j=0;j<=n;j++){
if(i!=j){
mat[i][j]=BigInteger.valueOf(-mp[i][j]);
}
}
}
n++;
BigInteger tot=Gauss(n-1,n-1,mat);
BigInteger ans = BigInteger.ONE;
for (int i = 0; i < n; i++) ans = ans.multiply(mat[i][i]);
System.out.println(ans.divide(tot).abs().divide(BigInteger.valueOf(n-1)));
}
static boolean zero(BigInteger a){
return a.compareTo(BigInteger.ZERO)==0;
}
static BigInteger lcm(BigInteger x,BigInteger y){
return x.divide(x.gcd(y)).multiply(y);
}
static BigInteger Gauss(int equ,int var,BigInteger[][] a){
int i,j,k;
int max_r;
int col;
BigInteger ta,tb;
BigInteger LCM;
BigInteger tot = BigInteger.ONE;
int temp; col = 0;
for (k = 0; k < equ && col < var; k++ ,col ++){
max_r = k; for (i = k + 1; i < equ; i++){
if (a[i][col].abs().compareTo(a[max_r][col].abs()) > 0) max_r = i;
}
if (max_r != k){
for (j = k; j < var + 1; j++) {
BigInteger t;
t = a[k][j];
a[k][j] = a[max_r][j];
a[max_r][j] = t;
}
}
if (a[k][col].equals(BigInteger.ZERO)) {
k--; continue;
}
for (i = k + 1; i < equ; i++){
if (!a[i][col].equals(BigInteger.ZERO)) {
LCM = lcm(a[i][col].abs(),a[k][col].abs());
ta = LCM.divide(a[i][col].abs());
tb = LCM.divide(a[k][col].abs());
tot = tot.multiply(ta);
if (a[i][col].multiply(a[k][col]).compareTo(BigInteger.ZERO) < 0)
tb = tb.multiply(BigInteger.valueOf(-1));
for (j = col; j < var + 1; j++){
a[i][j] = a[i][j].multiply(ta).subtract(a[k][j].multiply(tb));
}
}
}
}
return tot;
}
}