八皇后

#include<stdio.h>
int count = 0;
FILE *fp;

int notDanger(int row,int j,int (*chess)[8]) {
    int i,k,flag1 =0,flag2=0,flag3=0,flag4=0,flag5=0,flag6=0;
    //判断列方向
    for (i = 0; i<8; i++) {
        if(*(*(chess+i)+j) !=0) {
            flag1=1;
            break;
        }
    }
    //判断左上方
    for (i = row , k = j; i>=0 && k>=0 ; i--,k--) {
        if(*(*(chess+i)+k) != 0) {
            flag2 = 1;
            break;
        }
    }

     //判断右下方
    for (i = row , k = j; i<8 && k<8 ; i++,k++) {
        if(*(*(chess+i)+k) != 0) {
            flag3 = 1;
            break;
        }
    }


     //判断右上方
    for (i = row , k = j; i>=0 && k<8 ; i--,k++) {
        if(*(*(chess+i)+k) != 0) {
            flag4 = 1;
            break;
        }
    }


     //判断左下方
    for (i = row , k = j; i<8 && k>=0 ; i++,k--) {
        if(*(*(chess+i)+k) != 0) {
            flag5 = 1;
            break;
        }
    }
    if( flag1 || flag2 || flag3 || flag4 || flag5) {
        return 0;
    }
    else {
        return 1;
    }

}

void EightQueen(int row,int n,int(*chess)[8]) {
    int chess2[8][8];
    int i,j;
    for ( i= 0 ; i<8 ; i++) {
        for (j=0; j<8; j++){
            chess2[i][j] = chess[i][j];
        }
    }
    if(8 == row) {
        printf("第 %d 种
",count+1);
        fprintf(fp,"第 %d 种
",count+1);
        for (i=0 ; i<8 ; i++) {
            for (j=0; j<8 ; j++) {
                printf("%d ", *(*(chess2+i)+j));
                fprintf(fp,"%d ", *(*(chess2+i)+j));
            }
            printf("
");
            fprintf(fp,"
");
        }
        printf("
");
        fprintf(fp,"
");
        count++;
    }

    else {
        for (j=0; j<n; j++) {
            if(notDanger(row,j,chess)) {
                for(i = 0 ; i<8 ; i++) {
                    *(*(chess2+row)+i) =0;
                }
                *(*(chess2+row)+j) = 1;

                EightQueen(row+1,n,chess2);
            }
        }

    }

}

int main() {
    int chess[8][8];
    int i,j;
    fp = fopen("EightQueen.txt","w+a+");
    for (i= 0 ; i<8 ; i++) {
        for (j=0; j<8; j++){
            chess[i][j] = 0;
        }
    }
    EightQueen(0, 8, chess);

    printf("共有%d方案",count);
    fprintf(fp,"共有%d方案",count);
    fclose(fp);


    return  0;
}