forked from mrhagrawal/competitive_programming_resources
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Nqueens.cpp
93 lines (69 loc) · 1.23 KB
/
Nqueens.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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
//jatiny17
//Jatin Kumar
#include<bits/stdc++.h>
using namespace std;
//n-queen problem
bool canplace(int board[10][10],int n,int row,int col)
{
for(int i=0;i<row;i++)
{
if(board[i][col]==1)
return false;
}
int i=row,j=col;
while(i>=0&&j>=0)
{
if(board[i][j]==1)
return false;
i--;
j--;
}
i=row,j=col;
while(i>=0&&j<n)
{
if(board[i][j]==1)
return false;
i--;
j++;
}
return true;
}
bool queen(int board[10][10],int n,int row)
{
if(row==n)
{
return true;
}
for(int i=0;i<n;i++)
{
if(canplace(board,n,row,i))
{
board[row][i]=1;
bool next=queen(board,n,row+1);
if(next==true)
return true;
board[row][i]=0;
}
}
return false;
}
int main()
{
int board[10][10]={0},n;
cin>>n;
bool check=queen(board,n,0);
if(check)
{
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if(board[i][j]==1)
cout<<" Q";
else
cout<<" _";
}
cout<<"\n";
}
}
}