先记个模板，以后再写。
题目链接

#include <algorithm>
#include <iostream>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <map>
#include <set>

#define fi first
#define se second
#define U unsigned
#define P std::pair
#define Re register
#define LL long long
#define pb push_back
#define MP std::make_pair
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(Re int i = a;i <= b;++i)
#define ROF(i,a,b) for(Re int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl

const int MAXN = 2000+5;

int n,m;
LL aMAXN;

LL det(){
    LL ret = 1;
    FOR(i,1,n-1){
        FOR(j,i+1,n-1){
            while(aj){
                LL t = ai/aj;
                FOR(k,i,n-1) ai -=  aj*t;
                FOR(k,i,n-1) std::swap(ai,aj);
                ret *= -1;
            }
        }
        ret *= ai;
    }
    return ret;
}

inline void Solve(){
    CLR(a,0);
    scanf("%d%d",&n,&m);
    FOR(i,1,m){
        int u,v;scanf("%d%d",&u,&v);--u;--v;
        au = av = -1;
        au++;av++;
    }
    printf("%lldn",det());
}

int main(){
    int T;scanf("%d",&T);
    while(T--) Solve();
    return 0;
}
Last modification：April 7th, 2020 at 10:14 pm
© 允许规范转载
如果觉得我的文章对你有用，请随意赞赏