Cod sursa(job #2735261)

Utilizator vlad082002Ciocoiu Vlad vlad082002 Data 2 aprilie 2021 09:44:41
Problema Algoritmul lui Gauss Scor 80
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.5 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> > s(n, vector<double> (m+1));
    for(int i = 0; i < n; i++)
        for(int j = 0; j <= m; j++)
            fin >> s[i][j];

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

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

    vector<double> ans(m);
    for(int u = n-1; u >= 0; u--) {
        for(int v = 0; v <= m; v++)
            if(s[u][v] > eps || s[u][v] < -eps) {
                if(v == m) {
                    fout << "Imposibil\n";
                    return 0;
                }
                ans[v] = s[u][m];
                for(int k = v+1; k < m; k++)
                    ans[v] -= ans[k]*s[u][k];

                break;
            }
    }
    for(auto x: ans)
        fout << fixed << setprecision(10) << x << ' ';

}