Pagini recente » Cod sursa (job #2362668) | Cod sursa (job #2092443) | Cod sursa (job #20583) | Cod sursa (job #2603845) | Cod sursa (job #1333563)
#include <iostream>
#include <fstream>
#include <iomanip>
#define eps 0.0000001
using namespace std;
ifstream f("gauss.in");
ofstream g("gauss.out");
double a[305][305],val[305],aux;
int n,m,lin;
int main()
{ int i,j,lin,col,l,c;
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m+1;j++)
f>>a[i][j];
i=1; j=1;
while (i<=n && j<=m)
{
for(lin=i;lin<=n;lin++)
if (a[lin][j]>eps || a[lin][j]<-eps) break;
if (lin>n) {j++; continue; }
if (lin!=i)
for(col=1;col<=m+1;col++)
{ aux=a[i][col];
a[i][col]=a[lin][col];
a[lin][col]=aux;
}
for(col=j+1;col<=m+1;col++)
a[i][col]=a[i][col]/a[i][j];
a[i][j]=1;
for(l=i+1;l<=n;l++)
{
for(c=j+1;c<=m+1;c++)
a[l][c]-=a[l][j]*a[i][c];
a[l][j]=0;
}
i++; j++;
}
for(i=n;i>=1;i--)
{
for(j=1;j<=m+1;j++)
if (a[i][j]>eps || a[i][j]<-eps) break;
if (j==m+1) {g<<"Imposibil"; return 0;}
if (j!=m+2)
{ val[j]=a[i][m+1];
for(c=j+1;c<=m;c++)
val[j]-=a[i][c]*val[c];
}
}
for(i=1;i<=m;i++)
g<<fixed<<setprecision(10)<<val[i]<<" ";
return 0;
}