#include<stdio.h>
double num[10][10];
double result;
double ca(int d,int n,int cou)
{
    int a,b,c,e,flag;
    double k;
   
    if(d==n-1)
    {
        result=1;
        for(a=0;a<n;a++)
            result*=num[a][a];
        if(result==0)
            return 0;
        else if(cou%2==0)
            return result;
        else if(cou%2!=0)
            {
                result=-result;
                return result;
            }
    }
    else
    {
        if(num[d][d]==0)
        {
            flag=1;
            for(c=d+1;c<n;c++)
            {
                if(num[d][c]!=0)
                    {
                        for(e=0;e<n;e++)
                        {
                            k=num[e][d];
                            num[e][d]=num[e][c];
                            num[e][c]=k;                           
                        }
                        flag=0;
                        cou++;
                    }
            }
            if(flag==1)
                return 0;            
        }
        for(a=d+1;a<n;a++)
        {
            k=num[a][d]/num[d][d];
            for(b=d;b<n;b++)
                num[a][b]-=k*num[d][b];
        }
        ca(d+1,n,cou);
    }
 }
int main(void)
{
     int a,b,c,n,m;
     scanf("%d",&n);
     for(a=1;a<=n;a++)
    {
         scanf("%d",&m);
         for(b=0;b<m;b++)
             for(c=0;c<m;c++)
                 scanf("%lf",&num[b][c]);
        result=ca(0,m,0);   
        printf("%.0f\n",result);
    }

     return 0;
}

玩大家来找茬吗？
至少有个warning得消除下：
1>c:\users\tr002\documents\visual studio 2015\projects\max.c\max.c\main.c(54): warning C4715: “ca”: 不是所有的控件路径都返回值

讲真，怪我才疏学浅 ，没懂这个错误- ，我自己的是运行起来了，还是复制少了？我看看

有大哥来看下吗 真的不会 结果是对的啊

#include<stdio.h>
double num[10][10];
double result;
double ca(int d,int n,int cou)
{
    int a,b,c,e,flag;
    double k;
   
    if(d==n-1)
    {
        result=1;
        for(a=0;a<n;a++)
            result*=num[a][a];
        if(result==0)
            return 0;
        else if(cou%2==0)
            return result;
        else if(cou%2!=0)
            {
                result=-result;
                return result;
            }
    }
    else
    {
        if(num[d][d]==0)
        {
            flag=1;
            for(c=d+1;c<n;c++)
            {
                if(num[d][c]!=0)
                    {
                        for(e=0;e<n;e++)
                        {
                            k=num[e][d];
                            num[e][d]=num[e][c];
                            num[e][c]=k;                           
                        }
                        flag=0;
                        cou++;
                    }
            }
            if(flag==1)
                return 0;            
        }
        for(a=d+1;a<n;a++)
        {
            k=num[a][d]/num[d][d];
            for(b=d;b<n;b++)
                num[a][b]-=k*num[d][b];
        }
        ca(d+1,n,cou);
    }
 }
int main(void)
{
     int a,b,c,n,m;
     scanf("%d",&n);
     for(a=1;a<=n;a++)
    {
         scanf("%d",&m);
         for(b=0;b<m;b++)
             for(c=0;c<m;c++)
                 scanf("%lf",&num[b][c]);
        result=ca(0,m,0);   
        printf("%.0f\n",result);
    }

     return 0;
}

能有大牛看看吗，，oj过不了难受啊= =

其是我不知道我这个思路正确没正确，但感觉在N阶的行列式下还是可以得，我就是把自己以前记得的如何化简行列式的方法用程序写了出来

啊，真切求个大哥来看看，小弟我水平有限，不知道哪里错误了

为什么！为什么！

帮下忙可以吗0 0