-
Notifications
You must be signed in to change notification settings - Fork 0
/
n-queen.cpp
82 lines (57 loc) · 1.03 KB
/
n-queen.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
#include<bits/stdc++.h>
#define N 5
using namespace std;
void printSolution(int board[N][N])
{
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
printf(" %d ", board[i][j]);
printf("\n");
}
}
bool isSafe(int board[N][N], int row, int col)
{
int i, j;
for (i = 0; i < N; i++)
if (board[i][col])
return false;
for (i=row, j=col; i>=0 && j>=0; i--, j--)
if (board[i][j])
return false;
for (i=row, j=col; j>=0 && i<N; i++, j--)
if (board[i][j])
return false;
return true;
}
bool solve(int arr[N][N],int row )
{
if(row == N) return true;
for(int i=0;i<N;i++)
{
if(isSafe(arr,row,i))
{
arr[row][i] = 1;
if(solve(arr,row+1))
return true;
arr[row][i] = 0;
}
}
return false;
}
void nqueen()
{
int arr[N][N];
memset(arr,0,sizeof arr);
if(!solve(arr,0))
{
cout<<"No Solution\n";
return;
}
printSolution(arr);
}
int main()
{
nqueen();
return 0;
}