ae cíu tui với=) code bằng C++ nha=)

\begin{array}{c} \color{#db1616}{\texttt{#Khoadang09}} \end{array}

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
ll demcap(ll n, const vector<vector<ll>> & res) {
    vector<ll> dp(1<<n,0);
    dp[0] = 1;
    for (ll i=0;i<n;i++){
        vector<ll> dp_new(1<<n,0);
        for (ll k=0;k<(1<<n);k++){
            for (ll j=0;j<n;j++)
                if ((res[i][j]== 1) and (k&(1<<j)))
                    dp_new[k] = (dp_new[k]+dp[k^(1<<j)]) % MOD;
        }
        dp = dp_new;
    }
    return dp[(1<<n)-1];
}
int main() {
    ll n;
    cin >> n;
    vector<vector<ll>> res(n,vector<ll>(n));
    for (ll i=0;i<n;i++)
        for (ll j=0;j<n;j++) cin >> res[i][j];
    cout << demcap(n,res);
    return 0;
}

#include <bits/stdc++.h>
#define FI first
#define SE second
#define EPS 1e-9
#define ALL(a) a.begin(),a.end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define FORE(i,a,b) for (int i = (a); i >= (b); i--)
#define FORALL(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define WHATIS(x) cout << #x << " is " << x << endl;
#define ERROR(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }

using namespace std;
using ll = long long;
using ld = double;
typedef pair<int, int> II;
typedef pair<II, int> III;
typedef complex<ld> cd;
typedef vector<cd> vcd;

void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
    cout << *it << " = " << a << endl;
    err(++it, args...);
}

const ll MODBASE = 1000000007LL;
const int MAXN = 22;
const int MAXM = 1000010;
const int MAXK = 100010;
const int MAXQ = 200010;

int n, a[MAXN][MAXN];
ll dp[2100000], dp2[2100000];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    cin >> n;
    FOR(i,1,n) FOR(j,1,n) cin >> a[i][j];
    dp[0] = 1;
    FOR(i,1,n) {
        FOR(mask,1,(1<<n)-1) {
            if (__builtin_popcount(mask) != i) continue;
            FOR(j,1,n)
                if (mask & (1<<(j-1)))
                    if (a[i][j]) {
                        int mask2 = mask ^ (1<<(j-1));
                        dp2[mask] = (dp2[mask] + dp[mask2]) % MODBASE;
                    }
        }
        FOR(mask,0,(1<<n)-1) {
            dp[mask] = dp2[mask];
            dp2[mask] = 0;
        }
    }
    cout << dp[(1<<n)-1];
    return 0;
}