N皇后问题

// Created by ljs on 2018/8/27.
//
#include <iostream>
using namespace std;
#define MAX 100
int cols[MAX];

bool isValid(int n, int cur, int row){
    if(cur >= n || cur < 0) return false;
    for(int i = 0; i < cur; i++){
        if(cols[i] == row || abs(cols[i] - row) == (cur - i)) return false;
    }
    return true;
}

void Solve(int cur, int n, int& flag){
    //cout<<"cur "<<cur<<endl;
    if(cur == n){
        cout<<"[";
        for(int i = 0 ; i < n; i++){
            cout<<cols[i] + 1<<" ";
        }
        cout<<"] ";
        flag = 1;
    }
    else{
        for(int i = 0; i < n ;i++){
            if(isValid(n, cur, i)){
                cols[cur] = i;
                Solve(cur + 1, n, flag);
            }
        }
    }
}
int main(){
    int t, n;
    cin>>t;
    while(t--){
        cin>>n;
        int flag = 0;
        Solve(0, n , flag);
        if(!flag) cout<<-1;
        cout<<endl;
    }
    return 0;
}