Cod sursa(job #2141025)

Utilizator KazvikKokovics Razvan Kazvik Data 24 februarie 2018 07:46:38
Problema Algoritmul lui Gauss Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.46 kb
#include<fstream>
#define NMAX 311
#define EPS 0.0000001
#include<iomanip>

using namespace std;

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

int n,m;
double v[NMAX],a[NMAX][NMAX];

int main()
{
    in>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m+1;j++)
            in>>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){
                    out<<"Imposibil"<<'\n';
                    return 0;
                }
                v[j] = a[i][m+1];
                for(int k=j+1;k<=m;k++)
                    v[j]-=v[k]*a[i][k];
                break;
            }
    for(int i=1;i<=m;i++){
        out<<fixed<<setprecision(8)<<v[i]<<" ";
    }
    return 0;
}