Cod sursa(job #2780188)

Utilizator MateiAruxandeiMateiStefan MateiAruxandei Data 6 octombrie 2021 12:47:16
Problema Algoritmul lui Gauss Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.69 kb
#include <bits/stdc++.h>

using namespace std;

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

const int NMAX(1005), EPS(0.00000000001);
double mat[NMAX][NMAX], sol[NMAX];
int n, m;

inline void Gauss()
{
    int i = 1, j = 1;
    while(i <= n && j <= m)
    {
        int k = i;
        for(; k <= n; ++k)
            if(mat[k][j] != 0)
                break;
        if(k == n + 1)
        {
            ++j;
            continue;
        }
        if(k != i)
        {
            for(int c = 1; c <= m + 1; ++c)
            {
                int aux = mat[i][c];
                mat[i][c] = mat[k][c];
                mat[k][c] = aux;
            }
        }
        for(int c = j + 1; c <= m + 1; ++c)
            mat[i][c] /= mat[i][j];
        mat[i][j] = 1;
        for(int u = i + 1; u <= n; ++u)
        {
            for(int c = j + 1; c <= m + 1; ++c)
                mat[u][c] -= mat[i][c] * mat[u][j];
            mat[u][j] = 0;
        }
        ++i, ++j;
    }
    for(i = n; i >= 1; --i)
        for(j = 1; j <= m + 1; ++j)
            if(mat[i][j] > EPS || mat[i][j] < - EPS)
            {
                if(j == m + 1){
                    sol[0] = -1;
                    return;
                }
                sol[j] = mat[i][m + 1];
                for(int k = j + 1; k <= m; ++k)
                    sol[j] -= sol[k] * mat[i][k];
                break;
            }
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m + 1; ++j)
            fin >> mat[i][j];

    Gauss();

    for(int i = 1; i <= m; ++i)
        fout << fixed << setprecision(10) << sol[i] << ' ';
    return 0;
}