Pagini recente » Cod sursa (job #545932) | Cod sursa (job #2290477) | Cod sursa (job #648170) | Cod sursa (job #436573) | Cod sursa (job #3325800)
#include <bits/stdc++.h>
using namespace std;
const double EROARE = 1e-7;
int n, m, i, j, ord[302];
vector<double> ec[302];
double rasp[302];
static inline double Modul(double a) {
return (a < 0 ? -a : a);
}
int main() {
//ios_base::sync_with_stdio(false);
fin.tie(nullptr);
fout.tie(nullptr);
fin >> n >> m;
for(i = 0; i < n; i++) {
ord[i] = -1;
ec[i].resize(m + 1);
for(j = 0; j <= m; j++) fin >> ec[i][j];
}
i = 0;
j = 0;
while(i < n && j < m) {
bool nule = true;
int linNen = 0;
for(int ii = i; ii < n && nule; ii++) {
if(ec[ii][j] != 0) {
nule = false;
linNen = ii;
}
}
if(!nule) {
ec[i].swap(ec[linNen]);
ord[j] = i;
for(int ii = 0; ii < n; ii++) {
if(ii != i) {
double z = ec[ii][j] / ec[i][j];
for(int jj = j; jj <= m; jj++) ec[ii][jj] -= ec[i][jj] * z;
}
}
i++;
}
j++;
}
for(j = 0; j < m; j++) {
if(ord[j] != -1) rasp[j] = ec[ord[j]][m] / ec[ord[j]][j];
}
for(i = 0; i < n; i++) {
double sum = 0;
for(j = 0; j < m; j++) sum += rasp[j] * ec[i][j];
if(Modul(sum - ec[i][m]) > EROARE) {
fout << "Imposibil";
return 0;
}
}
for(i = 0; i < m; i++) fout << setprecision(10) << fixed << rasp[i] << " ";
/*for(i = 0; i < n; i++) {
for(j = 0; j <= m; j++) fout << ec[i][j] << " ";
fout << "\n";
}*/
return 0;
}