Eight Queen recursive

//递归求解八皇后，回溯深搜
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
int d[8] = {-1,-1,-1,-1,-1,-1,-1,-1};//记录棋盘位置
int IFOK(int column, int row){//判断新增加的皇后是否与之前的皇后碰头，若是则返回
0,否则返回1
    if(column == 0) return 1;
    int i;
    for (i = 0; i < column; i++){
        if (d[i] == row || abs(d[i] - row) == abs(i - column)) return 0;
    }
    return 1;
}
int count = 0;
void search(int column){
        int j;
        for (j = 0; j < 8; j++){
                if (IFOK(column, j) == 1) {
                        d[column] = j;
                        if (column != 7){
                                search(column +1);
                        }
                        else {
                                printf("answer %d\n", ++count);
                                for (int k = 0; k < 8; k++){
                                        printf("(%d,%d)", k, d[k]);
                                }
                                printf("\n");
                        }
                }
        }
        d[column] = -1;
}
int main(){
  search(0);
}