Pagini recente » Cod sursa (job #2366818) | Cod sursa (job #2433264) | Autentificare | Cod sursa (job #2164779) | Cod sursa (job #1610521)
#include<fstream>
#include<algorithm>
#include<iomanip>
using namespace std;
ifstream in("gauss.in");
ofstream out("gauss.out");
double A[310][310];
double var[310];
int N, M;
#define EPS 0.0000001
int main()
{
int N, M;
in >> N >> M;
for (int i = 1; i <= N; ++i)
for (int j = 1; j <= M + 1; ++j)
in >> A[i][j];
int i = 1, j = 1;
while(i<=N && j<=M)
{
int k;
for (k = i; k <= N; ++k)
if (A[k][j] != 0)
break;
if (k == N + 1)
{
++j;
continue;
}
if (k != i)
{
for (int r = 1; r <= M + 1; ++r)
{
int t = A[i][r];
A[i][r] = A[k][r];
A[k][r] = t;
}
}
for (int l = j + 1; l <= M + 1; ++l)
A[i][l] = A[i][l] / A[i][j];
A[i][j] = 1;
for (int u = i + 1; u <= N; ++u)
{
for (int l = j + 1; l <= M + 1; ++l)
{
A[u][l]-= (A[u][j] * A[i][l]);
}
A[u][j] = 0;
}
++i, ++j;
}
for (int i = N; i >= 1; --i)
for (int j = 1; j <= M + 1;++j)
if (A[i][j]>EPS || A[i][j]<-EPS)
{
if (j == M + 1)
{
out << "Imposibil";
return 0;
}
var[j] = A[i][M + 1];
for (int k = j + 1; k <= M; ++k)
var[j] -= A[i][k] * var[k];
var[j] = var[j] / A[i][j];
break;
}
for (int i = 1; i <= M; ++i)
out <<setprecision(10)<<fixed<< var[i] << " ";
return 0;
}