Pagini recente » Cod sursa (job #2514920) | Cod sursa (job #32247) | Cod sursa (job #1968883) | Cod sursa (job #1753353) | Cod sursa (job #1610484)
#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;
void swap_lines(int l1, int l2)
{
for (int i = 1; i <= M + 1; ++i)
swap(A[l1][i], A[l2][i]);
}
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)
swap_lines(k, i);
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[i][j];
}
A[u][j] = 0;
}
++i, ++j;
}
var[M] = A[M][M + 1] / A[M][M];
for (int i = M - 1; i >= 1; --i)
{
var[i] = A[i][M + 1];
for (int j = M; j > i; --j)
var[i] -= A[i][j] * var[j];
if (var[i] != 0 && A[i][i] == 0)
{
out << "Imposibil";
return 0;
}
var[i] = var[i] / A[i][i];
}
for (int i = 1; i <= M; ++i)
out <<setprecision(10)<<fixed<< var[i] << " ";
return 0;
}