c语言计算整数型行列式

#include <stdio.h>

void showDet(int n,int d[n][n]);
int getVal(int n,int d[n][n]);
int getA(int n,int d[n][n],int x,int y);
 
int main(int argc, char *argv[])
{ 
    do{
        int n,i,j;
        printf("请输入行列式的阶数(输入0退出):
");
        scanf("%d",&n);
        if(n==0) break; 
        printf("请输入行列式(空格分隔):
");    
        int d[n][n];
        for(i=0;i<n;i++){
            for(j=0;j<n;j++){
                scanf("%d",&d[i][j]);
            }
        }        
        printf("
输入行列式如下:
");
        showDet(n,d);    
        printf("
该行列式的值为:
%d


",getVal(n,d)); 
            
    }while(1);
    return 0;
}

void showDet(int n,int d[n][n]){
    int i,j;
    for(i=0;i<n;i++){
        for(j=0;j<n;j++){
            printf("%d	",d[i][j]);            
        }
        printf("
"); 
    }
}

int getVal(int n,int d[n][n]){
    if(n == 1) return d[0][0];
    int i,j,sum=0;
    
    for(i=0;i<n;i++){
        sum=sum+d[0][i]*getA(n,d,1,i+1);        
    }         
    return sum;    
}

int getA(int n,int d[n][n],int x,int y){
    int a[n-1][n-1],i,j;
    for(i=0;i<n;i++){
        if(i==x-1) continue; 
        for(j=0;j<n;j++){            
            if(j==y-1) continue;
            else if(i<x-1 && j<y-1){
                a[i][j]=d[i][j];
            } else if(i<x-1 && j>y-1){
                a[i][j-1]=d[i][j];
            }else if(i>x-1 && j<y-1){
                a[i-1][j]=d[i][j];
            }else if(i>x-1 && j>y-1){
                a[i-1][j-1]=d[i][j];
            }                        
        }
    }
    int t;
     t = (x+y)%2 == 0 ? 1:-1; 
    return t*getVal(n-1,a);    
}