Pagini recente » Cod sursa (job #1614110) | Cod sursa (job #2307182) | Cod sursa (job #1645190) | Cod sursa (job #1968487) | Cod sursa (job #1022561)
#include <fstream>
#include <iomanip>
#define maxn 301
using namespace std;
ifstream fin("gauss.in");
ofstream fout("gauss.out");
int n,m,i,j;
double a[maxn][maxn],b[maxn],val[maxn];
void swaplines (int i, int j)
{
for (int k=1; k<=n; ++k)
{
swap (a[i][k],a[j][k]);
}
swap (b[i],b[j]);
}
int main()
{
fin>>n>>m;
for (int i=1; i<=n; ++i)
{
for (int j=1; j<=m; ++j)
{
fin>>a[i][j];
}
fin>>b[i];
}
i=1; j=1;
for (i=1; i<=n; ++i)
{
for (; j<=m; ++j)
{
int ok=0;
if (!a[i][j])
{
for (int k=i+1; k<=m; ++k)
if (a[k][j])
{
swaplines (k,j);
ok = 1;
break;
}
}
else break;
if (ok) break;
}
if (j==m+1)
{
for (int k=i; k<=n; ++k)
{
if (b[k])
{
fout<<"Imposibil";
return 0;
}
}
break;
}
for (int k=j+1; k<=m; ++k)
{
a[i][k] /= a[i][j];
}
b[i] /= a[i][j];
a[i][j] = 1;
for (int ii = i+1; ii <= n; ++ii)
{
for (int jj = j+1; jj <= m; ++jj)
{
a[ii][jj] -= (a[ii][j]*a[i][jj]);
}
b[ii] -= a[ii][j]*b[i];
a[ii][j] = 0;
}
++j;
}
int ii,jj=j-1;
for (ii= i-1; ii>=1; --ii)
{
for (; jj>=1; --jj)
{
if (a[ii][jj]) break;
}
if (jj < 1) break;
val[jj] = b[ii];
for (int k=ii-1; k>=1; --k)
{
b[k] -= (a[k][jj]*b[ii]);
}
--jj;
}
for (int i=1; i<=m; ++i)
{
fout<<fixed<<setprecision(10)<<val[i]<<" ";
}
}