【luogu P3389 高斯消元法】 模板

题目链接：

gauss消元求线性方程组的解。

这道题对于多解和无解都输出No solution

 #include <algorithm>

 #include <cstdio>

 #include <cmath>

 #include <iostream>

 using namespace std;

 const int maxn = ;

 const double eps = 1e-;

 double A[maxn][maxn], ans[maxn];

 int n;

 int main()

 {

     scanf("%d",&n);

     for(int i = ; i <= n; i++)

     for(int j = ; j <= n+; j++)

     scanf("%lf", &A[i][j]);

     for(int i = ; i <= n; i++)

     {

         int p = i;

         for(int j = i + ; j <= n; j++)

           if(fabs(A[j][i]) > fabs(A[p][i])) p = j;

         for(int j = ; j <= n + ; j++) swap(A[p][j],A[i][j]);

         if(fabs(A[i][i]) < eps) continue;

         double div = A[i][i];

         for(int j = ; j <= n + ; j++) A[i][j]/=div;

         for(int j = ; j <= n; j++)

         {

             if(i != j)

             {

                 double div = A[j][i];

                 for(int k = ; k <= n + ; k++) A[j][k] -= A[i][k]*div;

             }

         }

     }

     int NoSolution = , ManySolution = ;

     for(int i = ; i <= n; i++)

     {

         int Nonum = , Manynum = ;

         for(int j = ; j <= n +  && fabs(A[i][j]) < eps; j++)

         Nonum++,Manynum++;

         if(Manynum > n) ManySolution = ;

         if(Nonum == n) NoSolution = ;

     }

         if(NoSolution) {printf("No Solution");return ;}

         if(ManySolution) {printf("No Solution");return ;}

     for(int i = n; i >= ; i--)

     {

         ans[i] = A[i][n+];

         for(int j = i - ; j >= ; j--)

         {

             A[j][n+] -= ans[i] * A[j][i];

             A[j][i] = ;

         }

     }

     for(int i = ; i <= n; i++)

     printf("%.2lf\n",ans[i] + eps);

     return ;

 }