-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathnqueenproblem.cpp
More file actions
59 lines (59 loc) · 904 Bytes
/
nqueenproblem.cpp
File metadata and controls
59 lines (59 loc) · 904 Bytes
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
#include<iostream>
using namespace std;
bool isSafe(int n,int x,int y,int **arr){
for(int row=0;row<x;row++)
{
if(arr[row][y]==1)
return false;
}
int row=x,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 placequeen(int n,int x,int **arr){
if(x>=n)
return true;
for(int col=0;col<n;col++)
{
if(isSafe(n,x,col,arr))
{
arr[x][col]=1;
if(placequeen(n,x+1,arr)){
return true;
}
arr[x][col]=0;
}
}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 i=0;i<n;i++){
for(int j=0;j<n;j++){
arr[i][j]=0;
}
}
if(placequeen(n,0,arr)){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cout<<arr[i][j]<<" ";
}cout<<endl;
}}
return 0;
}