有什么答案为5201314的高阶行列式（四阶以上）? 第1页

       #include <cstdlib> #include <algorithm> #include <iostream> #include <mutex> #include <vector> #include <thread>  using i64 = long long;  template <typename T> T solve(const T* data, std::size_t n) {     std::vector<std::size_t> v(n);     for(std::size_t i = 0; i < n; ++i)         v[i] = i;     T result = 0;     do {         T x = 1;         for(std::size_t i = 0; i < n; ++i)             x *= data[i * n + v[i]];         bool sign = false;         for(std::size_t i = 0; i < n - 1; ++i)             for(std::size_t j = i + 1; j < n; ++j)                 sign ^= v[i] > v[j];         if(sign) result -= x;         else result += x;     } while(std::next_permutation(v.begin(), v.end()));     return result; }  const int N = 4; const int TABLE[] = {1, 11, 114, 5, 51, 514};  std::mutex mutex;  void dfs(int depth, i64* arr) {     if(depth == N * N) {         if(solve(arr, N) == 5201314) {             std::lock_guard<std::mutex> lock(mutex);             std::cout << ">=======
";             for(int i = 0; i < N * N; ++i)                 std::cout << arr[i] << " 
"[i % N == N - 1];             std::cout << "<=======
";             std::cout << std::endl;         }         return;     }     if(arr[depth] != 0) dfs(depth + 1, arr);     else         for(int x : TABLE) {             arr[depth] = x;             dfs(depth + 1, arr);             arr[depth] = 0;         } }  int main() {     std::vector<std::thread> threads;     for(int x : TABLE)         threads.emplace_back([=]() {             i64 arr[N * N] = {                 x, 0, 0, 0,                 0, 0, 0, 0,                 0, 0, 0, 0,                 19, 19, 8, 10,             };             dfs(0, arr);         });     for(auto&& thread : threads)         thread.join(); }