#include<bits/stdc++.h>
#define mem(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;
const ll maxn=1e3+10;
const ll mod=1e9+7;
const ll inf=0x7f7f7f7f;
const double eps=1e-10;
template<typename T>void read(T &x)
{
x = 0;char ch = getchar();ll f = 1;
while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
template<typename T>void write(T x)
{
if(x<0)
{
putchar('-');
x=-x;
}
if(x>9)
{
write(x/10);
}
putchar(x%10+'0');
}
ll T,n;
bool flag;
typedef double Matrix[maxn][maxn];
Matrix x;
bool gauss_elimination(Matrix A,int n)
{
int i,j,k,r;
double maxp;
for(i=0;i<n;i++)
{
r=i;
maxp=A[i][i];
for(j=i+1;j<n;j++)
{
if(fabs(A[j][i]>fabs(A[r][i])))
{
r=j;
maxp=A[r][i];
}
}
if(fabs(maxp)<eps)
{
return false;
}
if(r!=i)
{
for(j=0;j<=n;j++)
{
swap(A[r][j],A[i][j]);
}
}
for(j=n;j>=i;j--)
{
for(k=i+1;k<n;k++)
{
A[k][j]-=A[k][i]/A[i][i]*A[i][j];
}
}
}
for(i=n-1;i>=0;i--)
{
for(j=i+1;j<n;j++)
{
A[i][n]-=A[i][j]*A[j][n];
}
A[i][n]/=A[i][i];
}
return true;
}
int main()
{
read(n);
for(int i=0;i<n;i++)
{
for(int j=0;j<=n;j++)
{
read(x[i][j]);
}
}
if(!gauss_elimination(x,n))
{
printf("No Solution\n");
return 0;
}
for(int i=0;i<n;i++)
{
printf("%.2lf\n",x[i][n]);
}
return 0;
}
【模板】高斯消元洛谷P3389
最新推荐文章于 2023-08-18 23:15:55 发布