Pagini recente » Cod sursa (job #3176689) | Cod sursa (job #2859831) | Cod sursa (job #2734077) | Cod sursa (job #697226) | Cod sursa (job #1556323)
#include <algorithm>
#include <fstream>
#include <cstring>
#include <iomanip>
using namespace std;
const int NMAX = 305;
const double eps = 1e-10;
double A[NMAX][NMAX];
double X[NMAX];
double aux[NMAX];
void swapLines(int x, int y) {
if (x != y) {
memcpy(aux, A[x], sizeof aux);
memcpy(A[x], A[y], sizeof A[x]);
memcpy(A[y], aux, sizeof A[y]);
}
}
int main() {
ifstream fin("gauss.in");
ofstream fout("gauss.out");
int n, m;
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 k;
for (k = i; k <= n; ++k) {
if (A[k][j] < -eps || A[k][j] > eps) {
break;
}
}
if (k == n + 1) {
i--;
continue;
}
swapLines(i, k);
for (int k = j + 1; k <= m + 1; ++k)
A[i][k] /= A[i][j];
A[i][j] = 1;
for (int k = i + 1; k <= n; ++k) {
for (int p = j + 1; p <= m + 1; ++p) {
A[k][p] -= A[k][j] * A[i][p];
}
A[k][j] = 0;
}
}
for (int i = n; i > 0; --i) {
for (int j = 1; j <= m + 1; ++j) {
if (A[i][j] > eps || A[i][j] < -eps) {
if (j == m + 1) {
fout << "Imposibil\n";
return 0;
}
double sol = A[i][m + 1];
for (int k = j + 1; k <= m; ++k)
sol -= X[k] * A[i][k];
X[j] = sol;
break;
}
}
}
fout << setprecision(10) << fixed;
for (int i = 1; i <= m; ++i)
fout << X[i] << ' ';
fout << '\n';
fin.close();
fout.close();
}