Cod sursa(job #913535)

Utilizator Mihai22eMihai Ionut Enache Mihai22e Data 13 martie 2013 16:50:41
Problema Algoritmul lui Gauss Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 1.51 kb
#include <fstream>

using namespace std;

const int MAX_N = 302;
const double EPS = 0.01;

int N, M, ok = 1;
double A[ MAX_N ][ MAX_N ], sol[ MAX_N ];

int main()
{
    ifstream f("gauss.in");
    ofstream g("gauss.out");

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

    int i = 1, j = 1;
    while(i <= N && j <= M)
    {
        int k = 0;
        for(k = i; k <= N; ++k)
            if(A[k][j] > EPS || A[k][j] < -EPS)
                break;
        if(k > N)
        {
            ++j;
            continue;
        }

        double tmp = 0;
        if(k != i)
            for(int q = 1; q <= M; ++q)
                tmp = A[i][q], A[i][q] = A[k][q], A[k][q] = tmp;

        for(int q = M + 1; q >= j; --q)
            A[i][q] /= A[i][j];
        for(k = i + 1; k <= N; ++k)
            for(int q = M + 1; q >= j; --q)
                A[k][q] -= A[k][j] * A[i][q];
        ++i, ++j;
    }

    for(int i = N; i; --i)
    {
        int j = 1;
        while(A[i][j] < EPS && A[i][j] > -EPS && j <= M)
            ++j;
        if(j > M)
        {
            ok = 0;
            break;
        }
        sol[j] = A[i][M+1];
        for(int q = M; q > j; --q)
            sol[j] -= A[i][q] * sol[q];
    }

    if(ok)
    {
        for(int i = 1; i <= M; ++i)
            g << sol[i] << " ";
        g << '\n';
    }
    else g << "Imposibil" << '\n';

    f.close();
    g.close();

    return 0;
}