-
Notifications
You must be signed in to change notification settings - Fork 1
/
nQueen.cpp
65 lines (63 loc) · 1.22 KB
/
nQueen.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include<bits/stdc++.h>
using namespace std;
bool isSafe(int** arr,int x,int y,int n){
for (int row = 0; row<x; row++){
if(arr[row][y]==1){
return false;
}
}
int row=x;
int col=y;
while(row>=0 && col>=0){
if(arr[row][col]==1){
return false;
}
row--;
col--;
}
row=x;
col=y;
while(row>=0 && col<n){
if(arr[row][col]==1){
return false;
}
row--;
col++;
}
return true;
}
bool nQueen(int** arr,int x, int n){
if(x>=n){
return true;
}
for(int col=0;col<n;col++){
if(isSafe(arr,x,col,n)){
arr[x][col]=1;
if(nQueen(arr,x+1,n)){
return true;
}
arr[x][col]=0;//backtracking
}
}
return false;
}
int main(){
int n;
cin>>n;
int** arr=new int*[n];
for(int i=0;i<n;i++){
arr[i]=new int[n];
for(int j=0;j<n;j++){
arr[i][j]=0;
}
}
if(nQueen(arr,0,n)){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cout<<arr[i][j]<<" ";
}
cout<<endl;
}
}
return 0;
}