Organising the Organisation UVA - 10766

生成树计数， matrix-tree定理

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <cmath>
#include <vector>

using namespace std;

int f[51][51];
long double c[51][51];

long double det(long double a[][51], int n)
{
    long double ans = 1;
    int sign = 0, j;

    for (int i = 0; i < n; i++)
    {
        if (!a[i][i])
        {
            for (j = i + 1; j < n; j++)
                if (a[j][i])
                    break;
            if (j == n)
                return 0;
            for (int k = i; k < n; k++)
                swap(a[i][k], a[j][k]);
            sign++;
        }
        ans *= a[i][i];
        for (j = i + 1; j < n; j++)
            a[i][j] /= a[i][i];
        for (j = i + 1; j < n; j++)
            for (int k = i + 1; k < n; k++)
                a[j][k] -= a[j][i] * a[i][k];
    }
    if (sign % 2)
        ans = -ans;
    return ans;
}

int main()
{
    int n, m, k;
    while (~scanf("%d %d %d", &n, &m, &k))
    {
        memset(f, 0, sizeof(f));
        memset(c, 0, sizeof(c));
        for (int i = 1; i <= m; i++)
        {
            int u, v;
            scanf("%d %d", &u, &v);
            u--, v--;
            f[u][v] = f[v][u] = 1;
        }
        for (int i = 0; i < n; i++)
        {
            int x = 0;
            for (int j = 0; j < n; j++)
                if (!f[i][j] && i != j)
                {
                    x++;
                    c[i][j] = -1;
                }
            c[i][i] = x;
        }

        printf("%0.lf\n", double(det(c, n - 1)));
    }


    return 0;
}