codeforces Gym 100338H High Speed Trains （递推，高精度）

递推就好了，用二项式定理算出所有连边的方案数，减去不合法的方案，

每次选出一个孤立点，那么对应方案数就是上次的答案。

枚举选几个孤立点和选哪些，选到n-1个点的时候相当于都不选，只减1。

要用到高精度，直接开100*100的组合数数组会MLE，用滚动数组优化一下就好了。

不会java，python太伤了

#include<bits/stdc++.h>
using namespace std;
 
const int MAXN = ;
struct bign
{
    int len, s[MAXN];
    bign ()
    {
        memset(s, , sizeof(s));
        len = ;
    }
    bign (int num) { *this = num; }
    bign (const char *num) { *this = num; }
    bign operator = (const int num)
    {
        char s[MAXN];
        sprintf(s, "%d", num);
        *this = s;
        return *this;
    }
    bign operator = (const char *num)
    {
        for(int i = ; num[i] == ''; num++) ;
        len = strlen(num);
        for(int i = ; i < len; i++) s[i] = num[len-i-] - '';
        return *this;
    }
    bign operator + (const bign &b) const
    {
        bign c;
        c.len = ;
        for(int i = , g = ; g || i < max(len, b.len); i++)
        {
            int x = g;
            if(i < len) x += s[i];
            if(i < b.len) x += b.s[i];
            c.s[c.len++] = x % ;
            g = x / ;
        }
        return c;
    }
    bign operator += (const bign &b)
    {
        *this = *this + b;
        return *this;
    }
    void clean()
    {
        while(len >  && !s[len-]) len--;
    }
    bign operator * (const bign &b)
    {
        bign c;
        c.len = len + b.len;
        for(int i = ; i < len; i++)
        {
            for(int j = ; j < b.len; j++)
            {
                c.s[i+j] += s[i] * b.s[j];
            }
        }
        for(int i = ; i < c.len; i++)
        {
            c.s[i+] += c.s[i]/;
            c.s[i] %= ;
        }
        c.clean();
        return c;
    }
    bign operator *= (const bign &b)
    {
        *this = *this * b;
        return *this;
    }
    bign operator - (const bign &b)
    {
        bign c;
        c.len = ;
        for(int i = , g = ; i < len; i++)
        {
            int x = s[i] - g;
            if(i < b.len) x -= b.s[i];
            if(x >= ) g = ;
            else
            {
                g = ;
                x += ;
            }
            c.s[c.len++] = x;
        }
        c.clean();
        return c;
    }
    bign operator -= (const bign &b)
    {
        *this = *this - b;
        return *this;
    }
    bign operator / (const bign &b)
    {
        bign c, f = ;
        for(int i = len-; i >= ; i--)
        {
            f = f*;
            f.s[] = s[i];
            while(f >= b)
            {
                f -= b;
                c.s[i]++;
            }
        }
        c.len = len;
        c.clean();
        return c;
    }
    bign operator /= (const bign &b)
    {
        *this  = *this / b;
        return *this;
    }
    bign operator % (const bign &b)
    {
        bign r = *this / b;
        r = *this - r*b;
        return r;
    }
    bign operator %= (const bign &b)
    {
        *this = *this % b;
        return *this;
    }
    bool operator < (const bign &b)
    {
        if(len != b.len) return len < b.len;
        for(int i = len-; i >= ; i--)
        {
            if(s[i] != b.s[i]) return s[i] < b.s[i];
        }
        return false;
    }
    bool operator > (const bign &b)
    {
        if(len != b.len) return len > b.len;
        for(int i = len-; i >= ; i--)
        {
            if(s[i] != b.s[i]) return s[i] > b.s[i];
        }
        return false;
    }
    bool operator == (const bign &b)
    {
        return !(*this > b) && !(*this < b);
    }
    bool operator != (const bign &b)
    {
        return !(*this == b);
    }
    bool operator <= (const bign &b)
    {
        return *this < b || *this == b;
    }
    bool operator >= (const bign &b)
    {
        return *this > b || *this == b;
    }
    string str() const
    {
        string res = "";
        for(int i = ; i < len; i++) res = char(s[i]+'') + res;
        return res;
    }
};
istream& operator >> (istream &in, bign &x)
{
    string s;
    in >> s;
    x = s.c_str();
    return in;
}
ostream& operator << (ostream &out, const bign &x)
{
    out << x.str();
    return out;
}
 
bign fpow(bign a,int b)
{
    bign ret = ;
    while(b){
        if(b&) ret *= a;
        a *= a;
        b >>= ;
    }
    return ret;
}
const int maxn = ;
bign tab[maxn];
 
//typedef long long ll;
bign C[][maxn];
 
int main()
{
    freopen("trains.in","r",stdin);
    freopen("trains.out","w",stdout);
    tab[] = ;
    int n;
    scanf("%d",&n);
    C[&][]  = C[&][] = ;
    for(int i = ; i <= n; i++){
        bign Full = fpow(,i*(i-)/);
        int pre = i&,cur = pre^;
        C[cur][] = ;
        for(int j = ; j <= i; j++) C[cur][j] = C[pre][j-] + C[pre][j];
 
        for(int j = ; j < i; j++){
            Full -= tab[j]*C[cur][j];
        }
        tab[i] = Full - ;
    }
    cout<<tab[n]<<endl;
    return ;
}