洛谷3389 【模板】高斯消元法

将方程组写成一个矩阵，将这个矩阵消成对角矩阵。

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pr;
const double pi=acos(-1);
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define Rep(i,u) for(int i=head[u];i;i=Next[i])
#define clr(a) memset(a,0,sizeof a)
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
ld eps=1e-9;
ll pp=1000000007;
ll mo(ll a,ll pp){if(a>=0 && a<pp)return a;a%=pp;if(a<0)a+=pp;return a;}
ll powmod(ll a,ll b,ll pp){ll ans=1;for(;b;b>>=1,a=mo(a*a,pp))if(b&1)ans=mo(ans*a,pp);return ans;}
ll read(){
	ll ans=0;
	char last=' ',ch=getchar();
	while(ch<'0' || ch>'9')last=ch,ch=getchar();
	while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
	if(last=='-')ans=-ans;
	return ans;
}
//head
int n;
double a[200][200];
int main()
{
	n=read();
	rep(i,1,n)
	 rep(j,1,n+1) a[i][j]=read();
	int flag=0;
	rep(i,1,n)
	{
		int t=i;
		while(a[t][i]==0&&t<=n)t++;
		if(t==n+1)
		{
			flag=1;printf("No Solution\n");
			return 0;
		}
		rep(j,1,n+1)swap(a[i][j],a[t][j]);
		double kk=a[i][i];
		rep(j,1,n+1)a[i][j]/=kk;
		rep(j,1,n)
		if(i!=j)
		{
			double kk=a[j][i];
			rep(k,1,n+1)
			{
				a[j][k]-=kk*a[i][k];
			}
		}
	}
	rep(i,1,n)
	{
	  double kk=a[i][n+1]/a[i][i];
		printf("%.2f\n",kk);
	}
	return 0;
}