萌新刚学线性代数,求助,没过样例

P3389 【模板】高斯消元法

QNDMX,连矩阵树都会了
by 神山识 @ 2020-01-23 19:41:10


膜 zdy
by Aestas16 @ 2020-01-23 19:43:02


@[我不是箭毒蛙](/user/238572) 会矩阵树不会高消?/jk
by kkksx @ 2020-01-23 19:47:12


@[御坂20001号](/user/115482) 不是,窝看了矩阵树发现我不会高斯消元就回来学(
by GIFBMP @ 2020-01-23 19:48:12


``` double k=a[i][i]; for(int j=1;j<=n+1;j++) a[i][j]=a[i][j]/k; for(int j=1;j<=n;j++) if(i!=j) for(int l=1;l<=n+1;l++) a[j][l]=a[j][l]-(a[j][i]*a[i][l]); } for(int i=1;i<=n;i++) printf("%.2lf\n",a[i][n+1]); ``` 这里貌似有问题
by Silent_E @ 2020-01-23 19:52:48


试试这样? ``` for (int j = 1;j <= n; ++j) { if (i == j) continue; double rate = a[j][i] / a[i][i]; for (int k = 1;k <= n + 1; ++k) { a[j][k] -= rate * a[i][k]; } } } for(int i=1;i<=n;i++) printf("%.2lf\n",a[i][n + 1]/a[i][i]); ```
by Silent_E @ 2020-01-23 19:56:32


@[Silent_E](/user/111674) 谢谢,过了QwQ
by GIFBMP @ 2020-01-23 20:04:08


|