Cod sursa(job #1614907)

Utilizator mucenic_b101Bogdan Mucenic mucenic_b101 Data 26 februarie 2016 11:49:05
Problema Algoritmul lui Gauss Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.73 kb
#include <fstream>
#include <iomanip>
#define MAXN 310
#define EPS 0.0000001

using namespace std;

double A[MAXN][MAXN];
double X[MAXN];

int main()
{

    ifstream cin("gauss.in");
    ofstream cout("gauss.out");
    int N, M;

    cin >> N >> M;
    for(int i = 1; i <= N; ++i)
        for(int j = 1; j <= M+1; ++j)
            cin >> A[i][j];

    int i = 1, j = 1, k;
    double aux;

    while (i <= N && j <= M)
    {
        k = i;
        while (k <= N && A[k][j] >= -EPS && A[k][j] <= EPS)
            ++k;

        if (k == N + 1)
        {
            ++j;
            continue;
        }

        if (k != i)
            for (int l = 1; l <= M + 1; ++l)
            {
                aux = A[i][l];
                A[i][l] = A[k][l];
                A[k][l] = aux;
            }

        for (int l = j + 1; l <= M + 1; ++l)
            A[i][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;
    }

    for (int i = N; i > 0; --i)
        for (int j = 1; j <= M + 1; ++j)
            if (A[i][j] > EPS || A[i][j] < -EPS)
            {
                if(j == M+1)
                {
                    cout << "Imposibil\n";
                    return 0;
                }

                X[j] = A[i][M+1];
                for(int k = j+1; k <= M; ++k)
                    X[j] -= X[k] * A[i][k];

                break;
            }

    cout << fixed;
    for(int i = 1; i <= M; ++i)
       cout << setprecision(10) << X[i] << " ";
    cout << "\n";

    return 0;
}