Cod sursa(job #1656104)

Utilizator ionut98Bejenariu Ionut Daniel ionut98 Data 18 martie 2016 19:03:24
Problema Algoritmul lui Gauss Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.39 kb
#include<fstream>
#include<iomanip>
using namespace std;
ifstream f("gauss.in");
ofstream g("gauss.out");
#define EPS 0.0000001
int n,m;
double a[310][310];
double x[310];
int main()
{
    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,k;
    double aux;
    while(i<=n&&j<=m)
    {
        for(k=i;k<=n;++k)
          if(a[k][j]<-EPS||a[k][j]>EPS)
            break;
        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)
            {
                g<<"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;
        }
    for(int i=1;i<=m;++i)
      g<<fixed<<setprecision(10)<<x[i]<<" ";
    return 0;
}