Pagini recente » Cod sursa (job #2255424) | Cod sursa (job #1917170) | Cod sursa (job #425519) | Cod sursa (job #631364) | Cod sursa (job #2037892)
#include <bits/stdc++.h>
using namespace std;
ifstream f("gauss.in");
ofstream g("gauss.out");
const double EPS=1e-8;
int n,m,i,j,k;
double X[305],S[305][305];
int main()
{
f>>n>>m;
for(i=1;i<=n;++i)
for(j=1;j<=m+1;++j) f>>S[i][j];
int L=1,C=1;
while(L<=n&&C<=m)
{
for(i=L;i<=n;++i)
if(abs(S[i][C])>EPS) break;
if(i==n+1)
{
C++;
continue;
}
if(i!=L) for(j=1;j<=m+1;++j) swap(S[i][j],S[L][j]);
for(j=C+1;j<=m+1;++j) S[L][j]/=S[L][C];
S[L][C]=1;
for(i=L+1;i<=n;++i)
{
for(j=C+1;j<=m+1;++j)
S[i][j]-=S[i][C]*S[L][j];
S[i][C]=0;
}
++L;
++C;
}
for(i=n;i>0;--i)
for(j=1;j<=m+1;++j)
if(abs(S[i][j])>EPS)
{
if(j==m+1)
{
g<<"Imposibil";
return 0;
}
X[j]=S[i][m+1];
for(k=j+1;k<=m;++k)
X[j]-=S[i][k]*X[k];
break;
}
for(i=1;i<=m;++i) g<<fixed<<setprecision(8)<<X[i]<<' ';
return 0;
}