Pagini recente » Cod sursa (job #52500) | Cod sursa (job #2264651) | Cod sursa (job #676215) | Cod sursa (job #1100385) | Cod sursa (job #1455574)
#include <cmath>
#include <fstream>
#include <iomanip>
#include <algorithm>
using namespace std;
const double eps = 1e-6;
int N, M;
double A[302][302], V[302];
int main()
{
ifstream fin("gauss.in");
ofstream fout("gauss.out");
fin >> N >> M;
for (int i = 1; i <= N; ++i)
for (int j = 1; j <= M + 1; ++j)
fin >> A[i][j];
for (int i = 1, j = 1; i <= N && j <= M; ++i, ++j)
{
int w = 0;
for (int k = i; k <= N; ++k)
if (fabs(A[k][j]) > eps)
{
w = k;
break;
}
if (w == 0)
{
--i;
continue;
}
for (int k = 1; k <= M + 1; ++k)
swap(A[i][k], A[w][k]);
for (int k = M + 1; k >= j; --k)
A[i][k] /= A[i][j];
for (int k = i + 1; k <= N; ++k)
if (fabs(A[k][j]) > eps)
for (int l = M + 1; l >= j; --l)
A[k][l] -= A[i][l] * A[k][j];
}
for (int i = N; i >= 1; --i)
for (int j = 1; j <= M + 1; ++j)
if (fabs(A[i][j]) > eps)
{
if (j == M + 1)
{
fout << "Imposibil\n";
fin.close();
fout.close();
return 0;
}
V[j] = A[i][M + 1];
for (int k = i - 1; k >= 1; --k)
{
A[k][M + 1] -= V[j] * A[k][j];
A[k][j] = 0;
}
break;
}
for (int i = 1; i <= M; ++i)
fout << fixed << setprecision(8) << V[i] << ' ';
fin.close();
fout.close();
}