#ifdef _MSC_VER # define _CRT_SECURE_NO_WARNINGS # define _USE_MATH_DEFINES # include # define __builtin_popcount __popcnt #endif #include using namespace std; using i32 = int; using i64 = long long int; using f64 = double; using str = string; using u32 = unsigned int; using u64 = unsigned long long int; template using vec = vector; void in() {}; template void in(T &&x, TS &&...xs) { cin >> x; in(move(xs)...); }; template void out(T &&x) { cout << x << "\n"; }; template void out(T &&x, TS &&...xs) { cout << x << " "; out(move(xs)...); } #define indef(t, ...) t __VA_ARGS__; in(__VA_ARGS__) #define get(t) []{ t _; cin >> _; return _; }() #define times(n, i) for (i32 i = 0 ; i < (n); ++i) #define range(a, b, i) for (i32 i = (a); i < (b); ++i) #define upto(a, b, i) for (i32 i = (a); i <= (b); ++i) #define downto(a, b, i) for (i32 i = (a); i >= (b); --i) #define all(xs) (xs).begin(), (xs).end() #define sortall(xs) sort(all(xs)) #define reverseall(xs) reverse(all(xs)) #define even(x) ((abs(x) & 1) == 0) #define odd(x) ((abs(x) & 1) == 1) #define bit(x, i) (((x) >> i) & 1) #define append emplace_back #define findge lower_bound #define findgt upper_bound const i64 MOD = 1000000007ll; const f64 EPS = 1e-10; i32 n; i32 f[24][24]; i32 dp[1<<24]; i32 solve() { in(n); times(n, ni) { times(n, nj) { in(f[ni][nj]); } } times(1<(__builtin_popcount(bi)))) continue; times(n-1, ni) { if (bit(bi, ni) > 0) continue; range(ni+1, n, nj) { if (bit(bi, nj) > 0) continue; i32 bj = bi | ((1<