Cod sursa(job #1206159)

Utilizator marcelPFake name marcelP Data 8 iulie 2014 23:02:52
Problema Algoritmul lui Gauss Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.59 kb
#include <iostream>
#include <fstream>
#include <cmath>
#include <iomanip>
using namespace std;
ifstream fin("gauss.in");
//FILE *fin=fopen("gauss.in", "r");
ofstream fout("gauss.out");
#define MAX 302
#define EPS 1e-4

double a[MAX][MAX], g;
double x[MAX];
int p[MAX];
int main()
{
    int n, m, i, j, k, l;
    fin>>n>>m;
    //fscanf(fin, "%d %d\n", &n, &m);
    m++;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            fin>>a[i][j];
            //fscanf(fin, "%lf", &a[i][j]);
        }
    }
    i=1;
    j=1;
    while(i<=n && j<m)
    {
        for(k=i;k<=n;k++)
            if(abs(a[k][j])>=EPS)
            {
                if(k!=i)
                    for(l=j;l<=m;l++)
                    {
                        swap(a[i][l], a[k][l]);
                    }
                break;
            }
        if(k==n+1)
        {
            j++;
            continue;
        }
        for(l=m;l>=j;l--)
            a[i][l]/=a[i][j];

        for(k=i+1;k<=n;k++)
            if(abs(a[k][j])>=EPS)
                for(l=m;l>=j;l--)
                    a[k][l]-=a[i][l]*a[k][j];

        p[i]=j;
        i++;
        j++;
    }

    for(i=n;i>=1;i--)
    {
        j=p[i];
        if(!p[i] && abs(a[i][m])>=EPS)
        {
            fout<<"Imposibil\n";
            return 0;
        }
        if(!p[i])
            continue;
        x[j]=a[i][m];
        for(l=j+1;l<m;l++)
        {
            x[j]-=a[i][l]*x[l];
        }
    }
    for(i=1;i<m;i++)
    {
        fout<<fixed<<setprecision(8)<<x[i]<<" ";
    }
}