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

formatting source-code for d7af6fdc8c

Browse Source
This commit is contained in:
github-actions
2020-05-29 23:26:30 +00:00
parent edb3d51ec2
commit 7ad1f171c1
176 changed files with 5342 additions and 4288 deletions
Download Patch File Download Diff File Expand all files Collapse all files

68
backtracking/n_queens_all_solution_optimised.cpp
View File

@@ -1,50 +1,60 @@
#include <iostream>
#define n 4
#define inc_loop(var, start, stop) for (int var=start; var <= stop; var++)
#define dec_loop(var, start, stop) for (int var=start; var >= stop; var--)
void PrintSol(int Board[n][n]) {
inc_loop(i, 0, n-1) {
inc_loop(j, 0, n-1)
std::cout << Board[i][j] << " ";
#define inc_loop(var, start, stop) for (int var = start; var <= stop; var++)
#define dec_loop(var, start, stop) for (int var = start; var >= stop; var--)
void PrintSol(int Board[n][n])
{
inc_loop(i, 0, n - 1)
{
inc_loop(j, 0, n - 1) std::cout << Board[i][j] << " ";
std::cout << std::endl;
}
std::cout << std::endl;
if (n%2 == 0 || (n%2 == 1 && Board[n/2+1][0] != 1)) {
inc_loop(i, 0, n-1) {
dec_loop(j, n-1, 0)
std::cout << Board[i][j] << " ";
if (n % 2 == 0 || (n % 2 == 1 && Board[n / 2 + 1][0] != 1))
{
inc_loop(i, 0, n - 1)
{
dec_loop(j, n - 1, 0) std::cout << Board[i][j] << " ";
std::cout << std::endl;
}
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
inc_loop(i, 0, col-1) {
inc_loop(i, 0, col - 1)
{
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;
}
inc_loop(i, 0, n-1) {
if (CanIMove(Board, i, col)) {
inc_loop(i, 0, n - 1)
{
if (CanIMove(Board, i, col))
{
Board[i][col] = 1;
NQueenSol(Board, col + 1);
Board[i][col] = 0;
@@ -52,19 +62,27 @@ void NQueenSol(int Board[n][n], int col) {
}
}
int main() {
int main()
{
int Board[n][n] = {0};
if (n%2 == 0) {
inc_loop(i, 0, n/2-1) {
if (CanIMove(Board, i, 0)) {
if (n % 2 == 0)
{
inc_loop(i, 0, n / 2 - 1)
{
if (CanIMove(Board, i, 0))
{
Board[i][0] = 1;
NQueenSol(Board, 1);
Board[i][0] = 0;
}
}
} else {
inc_loop(i, 0, n/2) {
if (CanIMove(Board, i, 0)) {
}
else
{
inc_loop(i, 0, n / 2)
{
if (CanIMove(Board, i, 0))
{
Board[i][0] = 1;
NQueenSol(Board, 1);
Board[i][0] = 0;