backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-27 12:04:49 +08:00
Code Issues Projects Releases Wiki Activity

formatting source-code for 153fb7b8a5

Browse Source
This commit is contained in:
github-actions
2020-05-30 04:02:09 +00:00
parent 92fe9495ec
commit 8a2de9842b
175 changed files with 1671 additions and 3460 deletions
Download Patch File Download Diff File Expand all files Collapse all files

36
backtracking/nqueen_print_all_solutions.cpp
View File

@@ -1,12 +1,9 @@
#include <iostream>
#define n 4
void PrintSol(int Board[n][n])
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
void PrintSol(int Board[n][n]) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
std::cout << Board[i][j] << " ";
}
std::cout << std::endl;
@@ -14,40 +11,32 @@ void PrintSol(int Board[n][n])
std::cout << std::endl;
}
bool CanIMove(int Board[n][n], int row, int col)
{
bool CanIMove(int Board[n][n], int row, int col) {
/// check in the row
for (int i = 0; i < col; i++)
{
for (int i = 0; i < col; i++) {
if (Board[row][i] == 1)
return false;
}
/// check the first diagonal
for (int i = row, j = col; i >= 0 && j >= 0; i--, j--)
{
for (int i = row, j = col; i >= 0 && j >= 0; i--, j--) {
if (Board[i][j] == 1)
return false;
}
/// check the second diagonal
for (int i = row, j = col; i <= n - 1 && j >= 0; i++, j--)
{
for (int i = row, j = col; i <= n - 1 && j >= 0; i++, j--) {
if (Board[i][j] == 1)
return false;
}
return true;
}
void NQueenSol(int Board[n][n], int col)
{
if (col >= n)
{
void NQueenSol(int Board[n][n], int col) {
if (col >= n) {
PrintSol(Board);
return;
}
for (int i = 0; i < n; i++)
{
if (CanIMove(Board, i, col))
{
for (int i = 0; i < n; i++) {
if (CanIMove(Board, i, col)) {
Board[i][col] = 1;
NQueenSol(Board, col + 1);
Board[i][col] = 0;
@@ -55,8 +44,7 @@ void NQueenSol(int Board[n][n], int col)
}
}
int main()
{
int main() {
int Board[n][n] = {0};
NQueenSol(Board, 0);
}