Pagini recente » Cod sursa (job #1697427) | Cod sursa (job #2149354) | Cod sursa (job #1986883) | Cod sursa (job #2004310) | Cod sursa (job #1998885)
#include <bits/stdc++.h>
#define ld long double
#define eps 0.0000001
using namespace std;
ifstream f("gauss.in");
ofstream g("gauss.out");
ld a[301][301];
ld sol[301];
int main()
{
int n,m,i,j,k,l,ll;
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m+1;j++)
f>>a[i][j];
for(j=1;j<=m;++j)
{
for(i=j;i<=n;++i)
if(a[i][j]>eps or a[i][j]<-eps)
break;
if(i>n)
continue;
if(i!=j)
for(k=1;k<=m+1;++k)
swap(a[i][k],a[j][k]);
for(k=j+1;k<=m+1;++k)
a[j][k]/=a[j][j];
a[j][j]=1;
for(k=j+1;k<=n;++k)
{
for(l=j+1;l<=m+1;++l)
a[k][l]-=a[j][l]*a[k][j];
a[k][j]=0;
}
}
for(i=n;i;i--)
for(j=1;j<=m+1;j++)
if(a[i][j]>eps or a[i][j]<-eps)
{
if(j==m+1)
{
g<<"Imposibil";
return 0;
}
sol[j]=a[i][m+1];
for(l=j+1;l<=m;l++)
sol[j]-=(sol[l]*a[i][l]);
break;
}
for(i=1;i<=m;i++)
g<<fixed<<setprecision(9)<<sol[i]<<' ';
return 0;
}