diff --git a/backtracking/n_queens_all_solution_optimised.cpp b/backtracking/n_queens_all_solution_optimised.cpp
index 2c1e4a84a..1db730f63 100644
--- a/backtracking/n_queens_all_solution_optimised.cpp
+++ b/backtracking/n_queens_all_solution_optimised.cpp
@@ -3,15 +3,15 @@
 #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)
+    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)
+    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;
         }
@@ -21,7 +21,7 @@ void PrintSol(int Board[n][n]) {
 
 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;
     }
@@ -43,7 +43,7 @@ void NQueenSol(int Board[n][n], int col) {
         PrintSol(Board);
         return;
     }
-    inc_loop(i,0,n-1,1) {
+    inc_loop(i, 0, n-1) {
         if (CanIMove(Board, i, col)) {
             Board[i][col] = 1;
             NQueenSol(Board, col + 1);