Pagini recente » Cod sursa (job #2808073) | Cod sursa (job #472163) | Cod sursa (job #2643824) | Cod sursa (job #3187587) | Cod sursa (job #2506288)
#include <iostream>
#include <cstdio>
#include <iomanip>
using namespace std;
#define kicsi 0.0001
//ifstream cin("gauss.in");
//ofstream cout("gauss.out");
int n,m,i,j,k,l;
double a[305][305],x[305],r;
bool ok;
int main()
{
freopen("gauss.in", "r", stdin);
freopen("gauss.out", "w", stdout);
scanf("%d%d", &n, &m);
//cin>>n>>m;
for(i=1;i<=n;++i)
for(j=1;j<=m+1;++j)
{
scanf("%lf", &a[i][j]);
//cout<<a[i][j]<<"\n";
}
i=1;
j=1;
while(i<=n && j<=m)
{
for(k=i;k<=n;++k)
if(a[k][j]!=0) break;
if(k!=i)
for(l=i;l<=m+1;++l)
{
r=a[i][l];
a[i][l]=a[k][l];
a[k][l]=r;
}
for(k=i+1;k<=m+1;++k)
a[i][k]/=a[i][j];
a[i][j]=1;
for(k=i+1;k<=n;++k)
{
for(l=i+1;l<=m+1;++l)
a[k][l]-=a[k][j]*a[i][l];
a[k][i]=0;
}
++i;
++j;
}
for(i=n;i>=1;--i)
for(j=1;j<=m+1;++j)
if(a[i][j]>kicsi || a[i][j]<-kicsi)
{
if(j==m+1)
{
printf("Imposibil\n");
//cout<<"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("%.8f ", x[i]);
//cout<<fixed<<setprecision(8)<<x[i]<<" ";
//cout<<"\n";
printf("\n");
return 0;
}