n-queens problem

#include<iostream>
#include<cmath>
using namespace std;
int N;
int QueuePos[100];

void nQueue(int n) {
    // In the 1~n-1 When the two queens have been arranged , Make sure No n A queen's position 
	if (n == N) {
    
		for (int i = 0; i < N; i++) {
    
			cout << QueuePos[i] + 1 << " ";
		}
			cout << endl;
			return;
			
	}
	//else
	for (int i = 0; i < N; i++) {
    // Try step by step k A queen's position 
		int j = 0;
		for (j = 0; j < n; j++) {
    // The Queen's has been arranged 
			if (QueuePos[j] == i || (abs(QueuePos[j] - i) == abs(n - j))) {
    
				break;
			}
		}
			if (j == n) //for The cycle is not due to break sign out , Show that No n The Queen's position and front j The positions of the two queens do not conflict 
			{
    
				QueuePos[n] = i;
				nQueue(n + 1);
			}
		}
}
int main() {
    
	cin >> N;
	nQueue(0);
	return 0;
}