Pagini recente » Cod sursa (job #529279) | Cod sursa (job #1980776) | Cod sursa (job #849522) | Cod sursa (job #1983474) | Cod sursa (job #609790)
Cod sursa(job #609790)
#include<stdio.h>
#include<math.h>
#define N 302
int a[N][N],i,j,m,n,k,x,y,u,v,l;
float b[N][N],z,c[N],s;
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("%d",&a[i][j]),b[i][j]=a[i][j];
i=j=1;
while(i<=n&&j<=m)
{y=0;
for(x=i;x<=n;x++)
if(b[x][j])
y=x;
if(!y)
j++;
else
{for(k=j;k<=m+1;k++)
z=b[y][k],b[y][k]=b[i][k],b[i][k]=z;
for(k=j+1;k<=m+1;k++)
b[i][k]=b[i][k]/b[i][j];
b[i][j]=1;
for(u=i+1;u<=n;u++)
for(v=j+1;v<=m+1;v++)
b[u][v]=b[u][v]-b[i][v]*b[u][j];
for(u=i+1;u<=n;u++)
b[u][j]=0;
i++,j++;}}
for(i=1;i<=n;i++)
{l=0;
for(j=1;j<=m;j++)
if(b[i][j])
l=1;
if(!l&&b[i][m+1])
{printf("Imposibil");
return 0;}}
c[m]=b[n][m+1];
for(i=n;i;i--)
{s=0;
for(j=i+1;j<=m;j++)
s=s+b[i][j]*c[j];
c[i]=b[i][m+1]-s;}
for(i=1;i<=m;i++)
printf("%.8f ",c[i]);
return 0;}