エイトクイーンの問題|クイーンズ問題| C / C ++の実装

Eight Queens Problem Queens Problem C C Implementation

#include #include using namespace std #define N 8 #define FREE -1 #define NOT_FREE 1 int row[N], col[N], dpos[2 * N - 1], dneg[2 * N -1] bool X[N][N] void initialize() { for(int i = 0 i < N i++) { row[i] = FREE, col[i] = FREE } for(int i = 0 i < 2 * N - 1 i++) { dpos[i] = FREE dneg[i] = FREE } } void printBoard() { for(int i = 0 i < N i++) { for(int j = 0 j < N j++) { if(X[i][j]) { if(row[i] != j) return } } } for(int i = 0 i < N i++) { for(int j = 0 j < N j++) { cout<<( (row[i] == j) ? 'Q' : '.') } cout<<endl } } void recursive(int i) { if(i == N) {//Successfully placed the queen printBoard() return } for(int j = 0 j < N j++) //If (i, j) is attacked by other queens, ignore the grid if(NOT_FREE == col[j] } int main(){ initialize() for(int i = 0 i < N i++) for(int j = 0 j < N j++) X[i][j] = false int k cin>>k for(int i = 0 i < k i++) { int r,c cin>>r>>c X[r][c] = true } recursive(0) return 0 }