Pagini recente » Cod sursa (job #1491521) | Cod sursa (job #1000515) | Cod sursa (job #2754187) | Cod sursa (job #662416) | Cod sursa (job #1414046)
#include<fstream>
#include<vector>
#include<cmath>
#include<iomanip>
#include<cstring>
using namespace std;
typedef int var;
ifstream fin("gauss.in");
ofstream fout("gauss.out");
#define MAXN 500
#define eps 1e-3
#define eq(a, b) (abs(a-b)<eps)
var m, n;
double A[MAXN][MAXN];
double X[MAXN];
void read() {
fin>>n>>m;
for(var i=1; i<=n; i++) {
for(var j=1; j<=m+1; j++) {
fin>>A[i][j];
}
}
}
void diag() {
for(var step=1; step<=n; step++) {
if(eq(A[step][step], 0.0)) {
var i;
for(i=step+1; i<=n && eq(A[i][step], 0); i++);
if(i > n) continue;
swap(A[i], A[step]);
}
for(var i=m+1; i>=step; i--) {
A[step][i] /= A[step][step];
}
for(var i=step+1; i<=n; i++) {
var inm = A[i][step];
for(var j=step; j<=m+1; j++) {
A[i][j] -= A[step][j] * inm;
}
}
}
}
void findX() {
for(var i=n; i>=1; i--) {
double rez = A[i][m+1];
for(var j=m; j>i; j--) {
rez -= A[i][j]*X[j];
}
X[i] = rez;
}
}
int main() {
read();
diag();
findX();
for(var i=1; i<=n; i++) {
double rez = 0.0;
for(var j=1; j<=m; j++) {
rez += A[i][j] * X[j];
}
if(!eq(rez, A[i][m+1])) {
fout<<"Imposibil";
return 0;
}
}
fout<<fixed<<setprecision(10);
for(var i=1; i<=m; i++) {
fout<<X[i]<<" ";
}
return 0;
}