Cod sursa(job #3338312)

Utilizator rares89_Dumitriu Rares rares89_ Data 2 februarie 2026 17:09:08
Problema Algoritmul lui Gauss Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.75 kb
#include <bits/stdc++.h>
#define EPS 0.0000001

using namespace std;

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

int n, m;
double v[305][305], x[305];

int main() {
    fin >> n >> m;
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= m + 1; ++j) {
            fin >> v[i][j];
        }
    }
    fin.close();
    
    int i = 1, j = 1;
    while(i <= n && j <= m) {
        int k = i;
        for(; k <= n; ++k) {
            if(v[k][j] < -EPS || v[k][j] > EPS) {
                break;
            }
        }
        
        if(k == n + 1) {
            ++j;
            continue;
        }
        
        if(k != i) {
            for(int l = 1; l <= m + 1; ++l) {
                swap(v[i][l], v[k][l]);
            }
        }
        
        for(int l = j + 1; l <= m + 1; ++l) {
            v[i][l] /= v[i][j];
        }
        v[i][j] = 1;
        
        for(int u = i + 1; u <= n; ++u) {
            for(int l = j + 1; l <= m + 1; ++l) {
                v[u][l] -= v[u][j] * v[i][l];
            }
            v[u][j] = 0;
        }
        
        ++i;
        ++j;
    }
    
    for(int i = n; i > 0; --i) {
        for(int j = 1; j <= m + 1; ++j) {
            if(v[i][j] < -EPS || v[i][j] > EPS) {
                if(j == m + 1) {
                    fout << "Imposibil\n";
                    return 0;
                }
                x[j] = v[i][m + 1];
                for(int k = j + 1; k <= m; ++k) {
                    x[j] -= x[k] * v[i][k];
                }
                break;
            }
        }
    }
    
    for(int i = 1; i <= m; ++i) {
        fout << fixed << setprecision(8) << x[i];
        fout << " ";
    }
    fout << "\n";
    return 0;
}