求c语言求矩阵的行列式和逆天天向哪儿

求c语言求矩阵的行列式和逆天天向哪儿

引用型参数应该在能被定义为const的情况下，尽量定义为const 。
#define N 5
#include "stdio.h"
#include "conio.h"


int js(s,n)
int s[][N],n;
{int z,j,k,r,total=0;
int b[N][N];
if(n>2) {for(z=0;z{for(j=0;jfor(k=0;kif(k>=z) b[j][k]=s[j+1][k+1];
else b[j][k]=s[j+1][k];
if(z%2==0) r=s[0][z]*js(b,n-1);
else r=(-1)*s[0][z]*js(b,n-1);
total=total+r;
}
}
else if(n==2) total=s[0][0]*s[1][1]-s[0][1]*s[1][0];
return total;
}


void n_1(s,b,n)
int s[][N],n;
float b[][N];
{int z,j,k,l,m,g,a[N][N];
for(z=0;z{l=z;
for(j=0;j{ m=j;
for (k=0;kfor(g=0;g{ if(g>=m&&kelse if(k>=l&&gelse if(k>=l&&g>=m) a[k][g]=s[k+1][g+1];
else a[k][g]=s[k][g];
}
b[z][j]=js(a,n-1);
}
}
}

main()
{int a[N][N];
float b[N][N];
int r,z,j;
float temp;
//clrscr();
printf("Input original data:\n");
for(z=0;zfor(j=0;jscanf("%d",&a[z][j]);
printf("\nPress Enter continue......");
getchar();
//gotoxy(1,1);
printf("The original matrix is:\n");
for(z=0;z{for(j=0;jprintf("%5d",a[z][j]);
printf("\n");
}
r=js(a,N);
printf("\nThe original matrix hanglieshi is:|A|==%d\n",r);
if (r==0) printf("Because |A|==0,the original matrix have no nijuzhen!");
else
{n_1(a,b,N);
for(z=0;zfor(j=0;jif((z+j)%2!=0 && b[z][j]!=0) b[z][j]=-b[z][j];
for(z=0;zfor(j=z+2;j{temp=b[z][j];
b[z][j]=b[j][z];
b[j][z]=temp;
}
printf("Because |A|!=0,the original matrix have nijuzhen!\n");
printf("The bansuijuzhen A* is:\n");
for(z=0;z{for(j=0;jprintf("%4.0f\t",b[z][j]);
printf("\n");
}

for(z=0;zfor(j=0;jb[z][j]=b[z][j]/r;
printf("\nThe nijuzhen is:(A*)/|A|(|A|=%d)\n",r);
for(z=0;z{for(j=0;jprintf("%8.3f",b[z][j]);
printf("\n");
}
}
}