Cod sursa(job #2418904)

Utilizator Alex_BubBuburuzan Alexandru Alex_Bub Data 6 mai 2019 19:16:59
Problema Algoritmul lui Gauss Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.59 kb
#include <fstream>
#include <cmath>
#include <iomanip>

using namespace std;

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

const int NMax = 300; const double E = 0.0000001;

double A[NMax + 5][NMax + 5], Sol[NMax + 5], T;
int N, M;

bool Solve()
{
    for(int i = 1; i <= M; i++)
    {
        if(A[i][i] == 0)
        {
            for(int j = i + 1; j <= N; j++)
                if(A[j][i] != 0)
                {
                    swap(A[i], A[j]);
                    break;
                }
        }
        for(int j = i + 1; j <= N; j++)
        {
            if(A[j][i] == 0) continue;
            T = A[i][i] / A[j][i];

            for(int k = i; k <= M + 1; k++)
            {
                A[j][k] = T * A[j][k] - A[i][k];
                if(fabs(A[j][k]) < E) A[j][k] = 0;
            }
        }
    }
    for(int i = M; i > 0; i--)
    {
        T = 0;

        for(int j = i + 1; j <= M; j++)
            T += A[i][j] * Sol[j];

        if(A[i][i] == 0) return 0;
        Sol[i] = (A[i][M + 1] - T) / A[i][i];
    }
}

int main()
{
    fin >> N >> M;

    if(N < M) {
        fout << "Imposibil\n";
        return 0;
    }

    for(int i = 1; i <= N; i++)
        for(int j = 1; j <= M + 1; j++)
        {
            fin >> A[i][j];
            if(fabs(A[i][j]) < E) A[i][j] = 0;
        }

    if(Solve() == 0)
        fout << "Imposibil\n";
    else
    {
        for(int i = 1; i <= M; i++)
            fout << fixed << setprecision(11) << Sol[i] << " ";
    }
    fin.close();
    fout.close();

    return 0;
}