Pagini recente » Cod sursa (job #2774361) | Cod sursa (job #710953) | Cod sursa (job #3272804) | Cod sursa (job #2533132) | Cod sursa (job #1721415)
#include <cstdio>
using namespace std;
#define EPS 0.0000001
int n,m;
double a[310][310],v[310];
int main()
{
freopen("gauss.in", "r", stdin);
freopen("gauss.out", "w", stdout);
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i)
for(int j=1;j<=m+1;++j)
scanf("%lf",&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)
{
printf("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)
printf("%.8lf ",v[i]);
printf("\n");
return 0;
}