Cod sursa(job #2133037)

Utilizator lixiLixandru Andrei lixi Data 16 februarie 2018 14:45:55
Problema Algoritmul lui Gauss Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.61 kb
#include<iostream>
#include<fstream>
#include<cmath>
#include<iomanip>
using namespace std;
ifstream f("gauss.in");
ofstream g("gauss.out");

const double  EPS = 1e-10;

int N, M;
double A[310][310];
double X[310];
void citire()
{
    f >> N >> M;
    for(int i = 1; i <= N; ++i)
        for(int j = 1; j <= M + 1; ++j)
            f >> A[i][j];
}
void gauss()
{
    int i = 1, j = 1, k;

    while(i <= N && j <= M)
    {
        for(k = i; k <= N; k++)
            if(abs(A[k][j]) > EPS)
                break;
        if(k == N + 1)
        {
            j++;
            continue;
        }
        if(k != i)
            swap(A[i], A[k]);
        for(int l = j + 1; l <= M + 1; l++)
            A[i][l] /=   A[i][j];
        A[i][j] = 1;
        for(int u = i + 1; u <= N; u++)
        {
            for(int l = j + 1; l <= M + 1; l++)
                A[u][l] -= A[u][j] * A[i][l];
            A[u][j] = 0;
        }
        i++;
        j++;
    }
}
int  solutie()
{
    for(int i = N; i > 0; i--)
        for(int j = i; j <= M + 1; j++)
            if(abs(A[i][j]) > EPS)
            {
                if(j == M + 1)
                    return 0;
                X[j] = A[i][M + 1];
                for(int k = j + 1; k <= M; k++)
                    X[j] -= X[k] * A[i][k];
                break;
            }
    return 1;
}
int main()
{
    citire();
    gauss();
    if(solutie() == 0)
        g << "Imposibil";
    else
    {
        g << fixed << setprecision(8);
        for(int i = 1; i <= M; i++)
            g << X[i] << ' ';
    }
    return 0;
}