Pagini recente » Cod sursa (job #636316) | Cod sursa (job #1780570) | Cod sursa (job #849403) | Cod sursa (job #948532) | Cod sursa (job #1388814)
#include <cstdio>
#include <algorithm>
#define NMAX 305
#define MAX 1>>5
using namespace std;
int n,m,k,kk;
float sol[NMAX],a[NMAX][NMAX];
int main()
{
freopen("gauss.in","r",stdin);
freopen("gauss.out","w",stdout);
scanf("%d %d",&n,&m);m++;
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
scanf("%f ",&a[i][j]);
for (int i=1,j=1;i<=n && j<m;i++,j++)
{
for (k=i;k<=n;k++)
if (a[k][j])break;
if (k==n+1){i--;continue;}
if (k!=i)
for (int kk=j;kk<=m;kk++)
swap(a[i][kk],a[k][kk]);
for (k=j+1;k<=m;k++)
a[i][k]/=a[i][j];
a[i][j]=1;
for (k=i+1;k<=n;k++)
{for (kk=j+1;kk<=m;kk++)
a[k][kk]-=a[i][kk]*a[k][j];
a[k][j]=0;
}
}
for (int i=n;i>=1;i--)
for (int j=m-n+i-1;j;j--)
if (a[i][j]>MAX || a[i][j]<-MAX)
{
if (j==m+1)
{
printf("Imposibil");
return 0;
}
sol[j]=a[i][m];
for (int k=j+1;k<m;k++)
sol[j]-=sol[k]*a[i][k];
}
for (int i=1;i<m;i++)
printf("%f ",sol[i]);
fclose(stdin);
fclose(stdout);
}