📄 3.c
字号:
#include "stdlib.h"
#include "math.h"
#include "stdio.h"
#include "conio.h"
int gaus(a,b,n)
int n;
double a[],b[];
{ int *js,l,k,i,j,is,p,q;
double d,t;
js=malloc(n*sizeof(int));
l=1;
for (k=0;k<=n-2;k++)
{ d=0.0;
for (i=k;i<=n-1;i++)
for (j=k;j<=n-1;j++)
{ t=fabs(a[i*n+j]);
if (t>d) { d=t; js[k]=j; is=i;}
}
if (d+1.0==1.0) l=0;
else
{ if (js[k]!=k)
for (i=0;i<=n-1;i++)
{ p=i*n+k; q=i*n+js[k];
t=a[p]; a[p]=a[q]; a[q]=t;
}
if (is!=k)
{ for (j=k;j<=n-1;j++)
{ p=k*n+j; q=is*n+j;
t=a[p]; a[p]=a[q]; a[q]=t;
}
t=b[k]; b[k]=b[is]; b[is]=t;
}
}
if (l==0)
{ free(js); printf("fail\n");
return(0);
}
d=a[k*n+k];
for (j=k+1;j<=n-1;j++)
{ p=k*n+j; a[p]=a[p]/d;}
b[k]=b[k]/d;
for (i=k+1;i<=n-1;i++)
{ for (j=k+1;j<=n-1;j++)
{ p=i*n+j;
a[p]=a[p]-a[i*n+k]*a[k*n+j];
}
b[i]=b[i]-a[i*n+k]*b[k];
}
}
d=a[(n-1)*n+n-1];
if (fabs(d)+1.0==1.0)
{ free(js); printf("fail\n");
return(0);
}
b[n-1]=b[n-1]/d;
for (i=n-2;i>=0;i--)
{ t=0.0;
for (j=i+1;j<=n-1;j++)
t=t+a[i*n+j]*b[j];
b[i]=b[i]-t;
}
js[n-1]=n-1;
for (k=n-1;k>=0;k--)
if (js[k]!=k)
{ t=b[k]; b[k]=b[js[k]]; b[js[k]]=t;}
free(js);
return(1);
}
int main()
{
int i;
static double a[12][12]=
{{1,0,3,2,5,4,0,5,2,1,4,7},
{3,2,4,7,3,1,3,7,9,0,5,9},
{1,5,3,2,8,4,9,11,22,69,35,8},
{4,7,9,2,3,5,9,4,5,2,8,5},
{21,26,3,4,6,9,2,4,6,6,4,3},
{8,4,54,74,22,12,4,57,3,1,5,9},
{3,4,47,27,79,4,13,31,21,6,7,3},
{4,43,45,5,3,3,3,56,2,3,5,7},
{6,7,3,4,6,8,6,9,17,21,32,35},
{56,6,8,4,9,2,14,67,38,92,15,23},
{12,61,71,42,5,9,2,1,13,52,7,2},
{13,15,1,24,35,42,5,24,2,1,35,1}};
static double b[12]={2,3,6,4,1,2,8,3,6,4,7,4};
if (gaus(a,b,12)!=0)
for(i=0;i<=11;i++)
printf("x(%d)=%e\n",i,b[i]);
getch();
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -