Cod sursa(job #1022581)

Utilizator Impaler_009Mihai Nitu Impaler_009 Data 5 noiembrie 2013 19:07:54
Problema Algoritmul lui Gauss Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.7 kb
#include <fstream>
#include <iomanip>
#include <cmath>

#define maxn 301
#define eps 1e-10

using namespace std;

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

int n,m,i,j;
double a[maxn][maxn],b[maxn],val[maxn];

void swaplines (int i, int j)
{
    for (int k=1; k<=n; ++k)
    {
        swap (a[i][k],a[j][k]);
    }
    swap (b[i],b[j]);
}

int main()
{
    fin>>n>>m;

    for (int i=1; i<=n; ++i)
    {
        for (int j=1; j<=m; ++j)
        {
            fin>>a[i][j];
        }
        fin>>b[i];
    }

    for (i=1; i<=n; ++i)
    {
        int j=i,ok=0;

        for (int k=i; k<=n; ++k)
        if (a[k][j])
            {
                swaplines (k,j);
                ok=1;
                break;
            }

        if (!ok) continue;

        for (int k=i+1; k<=m; ++k)
        {
            a[i][k] /= a[i][j];
        }
        b[i] /= a[i][j];
        a[i][j] = 1;

        for (int ii = i+1; ii <= n; ++ii)
        {
            for (int jj = j+1; jj <= m; ++jj)
            {
                a[ii][jj] -= (a[ii][j]*a[i][jj]);
            }
            b[ii] -= a[ii][j]*b[i];
            a[ii][j] = 0;
        }
    }

    for (i= n; i>=1; --i)
    {
        int j = i;
        if (fabs(a[i][j]) > eps && fabs(b[i]) > eps)
        {
            val [j] = b[i];

            for (int k=i-1; k>=1; --k)
            {
                b[k] -= (a[k][j]*b[i]);
            }
        }

        else if (fabs (a[i][j]) < eps && fabs(b[i]) > eps)
        {
            fout<<"Imposibil";
            return 0;
        }
    }

    for (int i=1; i<=m; ++i)
    {
        fout<<fixed<<setprecision(10)<<val[i]<<" ";
    }
}