Pagini recente » Cod sursa (job #2655216) | Cod sursa (job #2065615) | Cod sursa (job #974946) | Cod sursa (job #2859146) | Cod sursa (job #2230252)
#include <cstdio>
#define nmax 305
#define eps 0.0000001
using namespace std;
double a[nmax][nmax];
double x[nmax];
int main()
{
freopen("gauss.in","r",stdin);
freopen("gauss.out","w",stdout);
int n,m,i,j,k,l,p;
double aux;
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+1) {
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][l]/a[i][j];
a[i][j]=1;
for(p=i+1;p<=n;p++) {
for(l=j+1;l<=m+1;l++)
a[p][l]-=a[p][j]*a[i][l];
a[p][j]=0;
}
i++;
j++;
}
for(i=n;i>0;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");
return 0;
}