Cod sursa(job #2733957)

Utilizator vlad082002Ciocoiu Vlad vlad082002 Data 31 martie 2021 10:08:16
Problema Algoritmul lui Gauss Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.55 kb
#include <bits/stdc++.h>
using namespace std;

ifstream fin("gauss.in");
ofstream fout("gauss.out");

const double eps = 0.0000001;
int n, m;

int main() {
    fin >> n >> m;
    vector<vector<double> > sist(n, vector<double> (m+1));
    for(int i = 0; i < n; i++)
        for(int j = 0; j <= m; j++)
            fin >> sist[i][j];

    int i = 0, j = 0;
    while(i < n && j < m) {
        int k = n;
        for(int ec = i; ec < n; ec++)
            if(sist[ec][j] < -eps || sist[ec][j] > eps) {
                k = ec;
                break;
            }
        if(k == n) {
            j++;
            continue;
        }
        for(int l = 0; l <= m; l++)
            swap(sist[i][l], sist[k][l]);
        for(int l = j+1; l <= m; l++)
            sist[i][l] /= sist[i][j];
        sist[i][j] = 1;

        for(int u = i+1; u < n; u++) {
            for(int l = j+1; l <= m; l++)
                sist[u][l] -= sist[u][j]*sist[i][l];
            sist[u][j] = 0;
        }
        i++, j++;
    }

    vector<double> ans(m);
    for(int u = n-1; u >= 0; u--) {
        for(int l = 0; l <= m; l++)
            if(sist[u][l] < -eps || sist[u][l] > eps) {
                if(l == m) {
                    fout << "Imposibil\n";
                    return 0;
                }
                ans[l] = sist[u][m];
                for(int k = l+1; k < m; k++)
                    ans[l] -= ans[k]*sist[u][k];
                break;
            }
    }
    for(auto x: ans)
        fout << fixed << setprecision(8) << x << ' ';
}