Pagini recente » Cod sursa (job #965273) | Cod sursa (job #2642813) | Cod sursa (job #2657408) | Istoria paginii runda/3252352525/clasament | Cod sursa (job #1268454)
#include <iostream>
#include <fstream>
#include <iomanip>
using namespace std;
ifstream f ("gauss.in");
ofstream g ("gauss.out");
const int NMAX = 300 + 1;
const double EPSILON = 0.0000001;
int n, m;
double x[NMAX];
double a[NMAX][NMAX];
void citeste() {
f >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m + 1; j++) f >> a[i][j];
}
void rezolva() {
int i, j, k;
i = j = 1;
while (i <= n && j <= m) {
for (k = i; k <= n; k++)
if (a[k][j] != 0) break;
if (k == n + 1) {j++; continue;}
if (k != i)
for (int l = 1; l <= m + 1; l++) swap(a[i][l], a[k][l]);
for (int l = j + 1; l <= m + 1; 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++;
}
}
void calculeaza_necunoscute() {
for (int i = n; i > 0; i--)
for (int j = 1; j <= m + 1; j++)
if (a[i][j] > EPSILON || a[i][j] < -EPSILON) {
if (j == m + 1) {g << "Imposibil\n"; return;}
x[j] = a[i][m + 1];
for (int k = j + 1; k <= m; k++) x[j] -= x[k] * a[i][k];
break;
}
for (int i = 1; i <= m; i++) g << fixed << setprecision(10) << x[i] << ' ';
}
int main() {
citeste();
rezolva();
calculeaza_necunoscute();
return 0;
}