fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. class Solution
  5. {
  6. public:
  7.     bool col[11] = {};
  8.     bool d1[21] = {};
  9.     bool d2[21] = {};
  10.     int backtrack(int i, int n, bool col[], bool d1[], bool d2[])
  11.     {
  12.         int cnt = 0;
  13.         if(i == (n+1))
  14.         {
  15.             return 1;
  16.         }
  17.  
  18.         for(int j = 1; j <= n; j++)
  19.         {
  20.             if(!col[j] && !d1[n + i - j] && !d2[i + j - 1])
  21.             {
  22.                 col[j] = d1[n + i - j] = d2[i + j - 1] = 1;
  23.                 cnt += backtrack(i + 1, n, col, d1, d2);
  24.                 col[j] = d1[n + i - j] = d2[i + j - 1] = 0;
  25.             }
  26.         }
  27.         return cnt;
  28.     }
  29.  
  30.     int totalNQueens(int n)
  31.     {
  32.         if(n == 1) return 1;
  33.         return backtrack(1, n, col, d1, d2);
  34.     }
  35. };
  36.  
  37. int total_test;
  38.  
  39. int main()
  40. {
  41.     ios::sync_with_stdio(0);
  42.     cin.tie(0); cout.tie(0);
  43.  
  44.     Solution Solver;
  45.  
  46.     cin>>total_test;
  47.     while(total_test--)
  48.     {
  49.         int n;
  50.         cin>>n;
  51.         cout<<Solver.totalNQueens(n)<<endl;
  52.     }
  53. }
  54.  
Success #stdin #stdout 0.01s 5284KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/HnZvPR
language:
C++14 (gcc 8.3)
created:
10 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!