Pagini recente » Cod sursa (job #1830378) | Cod sursa (job #431956) | Cod sursa (job #2831851) | Cod sursa (job #2963949) | Cod sursa (job #2935612)
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define dbg(x) cout << #x <<": " << x << "\n";
#define sz(x) ((int)x.size())
using ll = long long;
const string fn = "gauss";
ifstream fin(fn + ".in");
ofstream fout(fn + ".out");
const int mxn = 300;
const double eps = 2e-10;
int n, m;
double a[mxn + 5][mxn + 5];
double ans[mxn + 5];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie();
fin >> n >> m;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m + 1; ++j)
fin >> a[i][j];
int i, j, k;
i = j = 1;
while(i <= n && j <= m){
for(k = i; k <= n; ++k)
if(a[k][j] < -eps || a[k][j] > eps)
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][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;
}
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;
}
ans[j] = a[i][m + 1];
for(int k = j + 1; k <= m; ++k)
ans[j] -= ans[k] * a[i][k];
break;
}
for(int i = 1; i <= m; ++i)
fout << fixed << setprecision(10) << ans[i] << " ";
fout << '\n';
return 0;
}