Pagini recente » Cod sursa (job #2982745) | Cod sursa (job #1687267) | Cod sursa (job #392934) | Cod sursa (job #1156008) | Cod sursa (job #2375325)
#include <cstdio>
using namespace std;
#define MAXN 310
#define eps 0.0000001
int n, m, i, j, k, l, u;
double a[MAXN][MAXN],aux;
double x[MAXN];
int main()
{
freopen("gauss.in", "r", stdin);
freopen("gauss.out", "w", stdout);
scanf("%d%d", &n, &m);
for(i=1;i<=n;i++)
for(j=1;j<=m+1;j++)
scanf("%lf", &a[i][j]);
i=1;j=1;
while(i<=n&&j<=m)
{
for(k=i;k<=n;k++)
if(a[k][j]<-eps||a[k][j]>eps)
break;
if(k>n)
{
++j;
continue;
}
if(k!=i)
for(l=1;l<=m+1;l++)
{
aux=a[i][l];
a[i][l]=a[k][l];
a[k][l]=aux;
}
for(l=j+1;l<=m+1;l++)
a[i][l] /= a[i][j];
a[i][j]=1;
for(u = i+1; u <= n; ++u)
{
for(l = j+1; l <= m+1; ++l)
a[u][l] -= a[u][j] * a[i][l];
a[u][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)
{
if(j==m+1)
{
printf("Imposibil\n");
return 0;
}
x[j]=a[i][m+1];
for(k=j+1;k<=m;k++)
x[j]-=x[k]*a[i][k];
break;
}
for(i=1;i<=m;i++)
printf("%.8lf ", x[i]);
printf("\n");
}