#include<stdio.h>
#include<math.h>
#include<malloc.h>
#define Stacksize 8
#define STACK_INIT_SIZE 100
int solution=0;
typedef struct
{
    int *base;
    int *top;
    int stacksize;
}Sqstack;
void Push(Sqstack Q,int e);
void Pop(Sqstack Q,int e);
void Initstack(Sqstack Q);
void Placequeen(int c,Sqstack Q);
int Judgement(int i,int c,Sqstack Q);
void output(Sqstack Q,int solution);
int main()
{
    Sqstack Q;
    Initstack(Q);
    printf("There are %d solutions in total.",solution);
    Placequeen(0,Q);
    return 0;
}

void Push(Sqstack Q,int e)
{
    Q.top=Q.base+Q.stacksize;
    *Q.top++=e;
}

void Pop(Sqstack Q,int e)
{
    e=*--Q.top;
}

void Initstack(Sqstack Q)
{
    Q.base=(int *)malloc(STACK_INIT_SIZE * sizeof(int));
    Q.top=Q.base;
    Q.stacksize=STACK_INIT_SIZE;
}

void Placequeen(int c,Sqstack Q)
{
    int i=0;
    for(i=0;i<Stacksize;i++)
    {
        Push(Q,i);
        if(Judgement(i,c,Q))
        {
            if(c<Stacksize)
            Placequeen(c+1,Q);
            else
            {
                solution++;
                output(Q,solution);
            }
        }
        Pop(Q,i);
    }
}

int Judgement(int i,int c,Sqstack Q)
{
    int j;
    for(j=0;j<i;j++)
    {
        if((i==*(Q.base+j))||(abs(c-j)==abs(i-*(Q.base+j))))
        {
            return 0;
            break;
        }
        else return 1;
    }
}

void output(Sqstack Q,int solution)
{
    printf("NO. %d",solution);
    int e;
    int i;
    int j;
    int a[Stacksize][Stacksize];
    for(i=0;i<Stacksize;i++)
    {
        Pop(Q,e);
        for(j=0;j<Stacksize;j++)
        {
            if(j==e) a[i][j]=1;
            else a[i][j]=0;
            printf("%d ",a[i][j]);
        }
        printf("\n");
    }
}

void output(Sqstack Q,int solution)
{
    printf("NO. %d",solution);
    int e;
    int i;
    int j;
    int a[Stacksize][Stacksize];
    for(i=0;i<Stacksize;i++)
    {
        Pop(Q,e);                //我想知道这个时候e的值是多少，没赋值就直接用
        for(j=0;j<Stacksize;j++)
        {
            if(j==e) a[i][j]=1;  //这个时候的e又是从哪给它的值，看了一眼 Pop(Q,e);貌似像是给e赋值，不过看参数也不是引用，它也不能给e传值啊。
                                 //所以从开始使用e到这，e从来都没有值（如果有也是垃圾数字）。程序能运行起来才怪
            else a[i][j]=0;
            printf("%d ",a[i][j]);
        }
        printf("\n");
    }
}

[此贴子已经被作者于2016-10-29 09:01编辑过]

//慢慢体会一下吧。
//还有写代码的时候把注释也一并写上，这样自己和别人要好理解一点。。。
#include<stdio.h>
#include<math.h>
#include<malloc.h>
#include<stdlib.h>
#define Stacksize 8
#define STACK_INIT_SIZE 100
int solution=0;
typedef struct
{
    int *base;
    int *top;
    int stacksize;
}Sqstack;
void Push(Sqstack &Q,int e);
void Pop(Sqstack &Q,int &e);
void Initstack(Sqstack &Q);
void Placequeen(int c,Sqstack Q);
int Judgement(int i,int c,Sqstack Q);
void output(Sqstack Q,int solution);
int main()
{
    Sqstack Q;
    Initstack(Q);
    //printf("There are %d solutions in total.",solution);
    Placequeen(0,Q);
    return 0;
}

void Push(Sqstack &Q,int e)
{
    *Q.top++=e;
}

void Pop(Sqstack &Q,int &e)
{
    e=*--Q.top;
}

void Initstack(Sqstack &Q)
{
    Q.base=(int *)malloc(STACK_INIT_SIZE * sizeof(int));
    if(!Q.base){
        printf("error\n");
        exit(0);
    }
    Q.top=Q.base;
    Q.stacksize=STACK_INIT_SIZE;
}

void Placequeen(int c,Sqstack Q)
{
    int i=0,e;
    for(i=0;i<Stacksize;i++)//尝试该行的每一列
    {
        Push(Q,i);
        //printf("----------%d\n",i);
        if(Judgement(i,c,Q))
        {
            if(c<Stacksize-1)//若c为6,满足，构造完下一行(第7行)结束
            Placequeen(c+1,Q);//构造下一行
            else
            {
                solution++;
                output(Q,solution);
            }
        }
        Pop(Q,e);
        //printf("***********%d\n",e);
    }
}

int Judgement(int i,int c,Sqstack Q)
{
    int j;
    for(j=0;j<c;j++)
    {
        if((i==*(Q.base+j))||(abs(c-j)==abs(i-*(Q.base+j))))//和之前行逐一比较,判断是否在同一列或对角线上
        {
            return 0;
        }
    }
    return 1;
}

void output(Sqstack Q,int solution)
{
    printf("NO. %d\n",solution);
    int e;
    int i;
    int j;
    int a[Stacksize][Stacksize];
    for(i=0;i<Stacksize;i++)
    {
        Pop(Q,e);          //最后一行先输出，所以你的图和构造的时候是反的
        for(j=0;j<Stacksize;j++)
        {
            if(j==e) a[i][j]=1;
            else a[i][j]=0;
            printf("%d ",a[i][j]);
        }
        printf("\n");
    }
}

想问一下，judgement函数里面的return1为什么要写在for循环的外面

必须要全部都不满足，即和上面都没有冲突，才能放