#include<stdio.h>
int main()
{
    void judge(int *a,int n);
    int a[8][8];
    int n,i,j;
    scanf("%d\n",&n);
    for(i=0;i<n;i++)
      for(j=0;j<n;j++)
    {
        scanf("%d",&a[i][j]);
    }
      judge(*a,n);
return 0;
}
void judge(int *a,int n)
{
    int *m,*p;
    int z=0;
    int i,j;
    for(i=0;i<n;i++)
        for(j=0;j<n;j++)
        {
            if(a[i][j]==0)
                break;
            if(a[i][j]==1)
            {
                if(*a+j==1||a[i]==1||i==j||i+j==n-1)
                    break;
                 z=z+1;
            }
        }
    printf("%d\n",z);
}

你这根本不对啊，递归回溯都没有。。。

收到的鲜花

• 啦啦啦VL 于 2014-05-28 19:51 送鲜花  3朵   附言：刚学c++,后面的程序想不清楚怎么办？

网上也有很多这样的源代码，下载下来仔细看下

能帮我解释一下这段程序吗？真心看不懂谢谢
int go(int* a, int* b, int* c, int m, int n)
{
    if (m == n)
        return 1;
        
    int i, j, k, count = 0;
    for (i = 0; i < n; i++)
    {
        if (a[m * n + i] == 0)
            continue;
        for (j = 0; j < m; j++)
            if (b[j] == i || b[j] - i == j - m || b[j] + j == i + m)
                break;
        if (j == m)
        {
            b[m] = i;
            for (k = 0; k < n; k++)
            {
                if (a[m * n + k] == 0 || k == i)
                    continue;
                for (j = 0; j < m; j++)
                    if (c[j] == k || c[j] - k == j - m || c[j] + j == k + m)
                        break;
                if (j == m)
                {
                    c[m] = k;
                    count += go(a, b, c, m + 1, n);
                }
            }
        }
    }
    return count;
}