fork download
copy 
  1. #include <iostream>
  2. #include <vector>
  3. #include <cmath>
  4. using namespace std;
  5.  
  6. bool isValid(const vector<int>& col_queen) {
  7. 	int i, row_id, diff;
  8. 	row_id = col_queen.size() - 1;
  9. 	for(i = 0; i < row_id; ++i) {
  10. 	    diff = abs(col_queen[row_id] - col_queen[i]);
  11. 	    if(diff == 0 || diff == row_id - i) {
  12. 	    	// col conflict or diagonal conflict.
  13. 	    	return false;
  14. 	    }
  15. 	}
  16.     return true;
  17. }
  18.  
  19. void findPlacement(int k, int n, vector<int> &col_queen, vector<vector<int>> &result) {
  20. 	if(k == n) {
  21. 		result.push_back(col_queen);
  22. 	}
  23. 	else {
  24. 		for(int i = 0; i < n; ++i) {
  25. 			col_queen.push_back(i);
  26. 			if(isValid(col_queen)){
  27. 				findPlacement(k+1, n, col_queen, result);
  28. 			}
  29. 			col_queen.pop_back();
  30. 		}
  31. 	}
  32. }
  33.  
  34. vector<vector<int>> QueenPlacement(int n) {
  35. 	vector<vector<int>> result;
  36. 	vector<int> col_queen;
  37. 	findPlacement(0, n, col_queen, result);
  38. 	return result;
  39. }
  40.  
  41. int main() {
  42. 	vector<vector<int>> res;
  43. 	res = QueenPlacement(8);
  44. 	cout << "Placement of queens are as follow : "<<res.size() << endl;
  45. 	for(int i = 0; i < res.size(); ++i) {
  46. 		for(int j = 0; j < res[0].size(); ++j) {
  47. 			cout << res[i][j] << " ";
  48. 		}
  49. 		cout << endl;
  50. 	}
  51. 	return 0;
  52. }
Success #stdin #stdout 0s 4220KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Placement of queens are as follow : 92
0 4 7 5 2 6 1 3 
0 5 7 2 6 3 1 4 
0 6 3 5 7 1 4 2 
0 6 4 7 1 3 5 2 
1 3 5 7 2 0 6 4 
1 4 6 0 2 7 5 3 
1 4 6 3 0 7 5 2 
1 5 0 6 3 7 2 4 
1 5 7 2 0 3 6 4 
1 6 2 5 7 4 0 3 
1 6 4 7 0 3 5 2 
1 7 5 0 2 4 6 3 
2 0 6 4 7 1 3 5 
2 4 1 7 0 6 3 5 
2 4 1 7 5 3 6 0 
2 4 6 0 3 1 7 5 
2 4 7 3 0 6 1 5 
2 5 1 4 7 0 6 3 
2 5 1 6 0 3 7 4 
2 5 1 6 4 0 7 3 
2 5 3 0 7 4 6 1 
2 5 3 1 7 4 6 0 
2 5 7 0 3 6 4 1 
2 5 7 0 4 6 1 3 
2 5 7 1 3 0 6 4 
2 6 1 7 4 0 3 5 
2 6 1 7 5 3 0 4 
2 7 3 6 0 5 1 4 
3 0 4 7 1 6 2 5 
3 0 4 7 5 2 6 1 
3 1 4 7 5 0 2 6 
3 1 6 2 5 7 0 4 
3 1 6 2 5 7 4 0 
3 1 6 4 0 7 5 2 
3 1 7 4 6 0 2 5 
3 1 7 5 0 2 4 6 
3 5 0 4 1 7 2 6 
3 5 7 1 6 0 2 4 
3 5 7 2 0 6 4 1 
3 6 0 7 4 1 5 2 
3 6 2 7 1 4 0 5 
3 6 4 1 5 0 2 7 
3 6 4 2 0 5 7 1 
3 7 0 2 5 1 6 4 
3 7 0 4 6 1 5 2 
3 7 4 2 0 6 1 5 
4 0 3 5 7 1 6 2 
4 0 7 3 1 6 2 5 
4 0 7 5 2 6 1 3 
4 1 3 5 7 2 0 6 
4 1 3 6 2 7 5 0 
4 1 5 0 6 3 7 2 
4 1 7 0 3 6 2 5 
4 2 0 5 7 1 3 6 
4 2 0 6 1 7 5 3 
4 2 7 3 6 0 5 1 
4 6 0 2 7 5 3 1 
4 6 0 3 1 7 5 2 
4 6 1 3 7 0 2 5 
4 6 1 5 2 0 3 7 
4 6 1 5 2 0 7 3 
4 6 3 0 2 7 5 1 
4 7 3 0 2 5 1 6 
4 7 3 0 6 1 5 2 
5 0 4 1 7 2 6 3 
5 1 6 0 2 4 7 3 
5 1 6 0 3 7 4 2 
5 2 0 6 4 7 1 3 
5 2 0 7 3 1 6 4 
5 2 0 7 4 1 3 6 
5 2 4 6 0 3 1 7 
5 2 4 7 0 3 1 6 
5 2 6 1 3 7 0 4 
5 2 6 1 7 4 0 3 
5 2 6 3 0 7 1 4 
5 3 0 4 7 1 6 2 
5 3 1 7 4 6 0 2 
5 3 6 0 2 4 1 7 
5 3 6 0 7 1 4 2 
5 7 1 3 0 6 4 2 
6 0 2 7 5 3 1 4 
6 1 3 0 7 4 2 5 
6 1 5 2 0 3 7 4 
6 2 0 5 7 4 1 3 
6 2 7 1 4 0 5 3 
6 3 1 4 7 0 2 5 
6 3 1 7 5 0 2 4 
6 4 2 0 5 7 1 3 
7 1 3 0 6 4 2 5 
7 1 4 2 0 6 3 5 
7 2 0 5 1 4 6 3 
7 3 0 2 5 1 6 4
https://ideone.com/ZedECe
language:
C++14 (gcc 8.3)
created:
6 years 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!