复变函数课后答案可能是第一版本

# include <math.h>
# define eps 0.5e-4 //给定精度//
# define n 3        //方程组的阶数//
 static double aa[n][n]={{10,-1,-2},{-1,10,2},{-1,-1,5}};
 static double bb[n]={7.2,8.3,4.2};
 main()
 {int i,j,NO;
  double a[n+1][n+1],b[n+1],x[n+1];
  int jcb();
  for (i=1;i<=n;i++)
  {for (j=1;j<=n;j++)
  a[i][j]=aa[i-1][j-1];
  b[i]=bb[i-1];
  }
  printf("\n please enter NO:");
  scanf("%d",&NO); //输入最大迭代次数//
  j=jcb(a,b,x,eps,NO); //调用jcb求解方程组//
  if(j!=0) {for (i=1;i<=n;i++) printf("x[&d]=%f",i,x[i]);}
 }
 int jcb(a,b,x,eps,NO)
 {int NO;
     double a[][n+1],b[],x[],eps;
     int i,j,k=0;
   double x1[n+1],d,s,max;
   for (i=1;i<=n;i++) x[i]=0;
   do
   {max=0.0;
    for (i=1;i<=n;i++)
    {s=0.0;
    for (j=1;j<=n;j++) {if (j!=i) s=s+a[i][j]*x[j];}