任意模数求行列式

void Guass(int n){
    int ans = 1;

    For(i, 1, n){
        For(j, i + 1, n){
            while(a[j][i]){
                int t = a[i][i] / a[j][i];
                For(k, i, n){
                    a[i][k] = Mod(a[i][k] - Mul(t, a[j][k]));
                    swap(a[i][k], a[j][k]);
                }
                ans = P - ans;
            }
        }
        ans = Mul(ans, a[i][i]);
    }

    printf("%d\n", ans);
}