Pagini recente » Cod sursa (job #1943868) | Cod sursa (job #2275187) | Cod sursa (job #342275) | Cod sursa (job #2227772) | Cod sursa (job #1555056)
#include <cstdio>
#define eps 0.001
using namespace std;
float a[301][301], sol[301], x;
int poz[301], n, m;
bool Sol[301];
int main()
{
int i, j, k, p, nr;
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("%f",&a[i][j]);
if (m>n) {printf("Imposibil"); return 0;}
for (j=1; j<=m; j++)
{
for (i=1; i<=n; i++)
{
if (a[i][j]!=0 && poz[i]==0)
{
poz[i]=j;
break;
}
}
}
for (i=1; i<=n; i++)
{
for (j=1; j<=n; j++)
{
if (j==i) continue;
if (a[j][poz[i]]>-eps && a[j][poz[i]]<eps) continue;
x=a[i][poz[i]]/a[j][poz[i]];
for (k=1; k<=m+1; k++)
{
a[j][k]=a[i][k]-x*a[j][k];
}
}
}
for (i=1; i<=n; i++)
{
nr=0;
for (j=1; j<=m; j++)
if (a[i][j]>eps || a[i][j]<-eps)
{nr++; p=j;}
if (nr==1)
{
if (!Sol[p]) {sol[p]=a[i][m+1]/a[i][p]; Sol[p]=1;}
}
}
for (i=1; i<=m; i++)
if (!Sol[i]) {printf("Imposibil"); return 0;}
for (i=1; i<=m; i++)
{
printf("%.8f ",sol[i]);
}
return 0;
}