Pagini recente » Cod sursa (job #81083) | Cod sursa (job #1917384) | Cod sursa (job #1484120) | Cod sursa (job #1540713) | Cod sursa (job #3154765)
#include <fstream>
#include <iomanip>
using namespace std;
ifstream cin("gauss.in");
ofstream cout("gauss.out");
#define aproapezero 0.0000001
long double mat[301][302],rez[301];
void swapl(int a, int b, int m)
{
for(int j=1;j<=m+1;j++)
swap(mat[a][j],mat[b][j]);
}
int main()
{
int n,m,i,j,k,t;
cin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m+1;j++)
cin>>mat[i][j];
i=1;
j=1;
while(i<=n&&j<=m)
{
if(mat[i][j]==0)
{
for(k=i;k<=n&&mat[k][j]==0;k++);
if(k<=n)
if(k>i)
swapl(i,k,m);
}
if(mat[i][j]!=0)
{
for(k=m+1;k>=j;k--)
mat[i][k]/=mat[i][j];
for(k=i+1;k<=n;k++)
if(mat[k][j]!=0)
{
for(t=m+1;t>=j;t--)
mat[k][t]-=mat[k][j]*mat[i][t];
}
j++;
i++;
}
else
j++;
}
int ok=1;
for(i=n;i>=1&&ok==1;i--)
{
for(j=1;j<=m+1&&abs(mat[i][j])<aproapezero;j++);
if(j==m+1)
ok=0;
else
{
rez[j]=mat[i][m+1];
for(k=m;k>j;k--)
rez[j]-=mat[i][k]*rez[k];
}
}
if(ok==0)
cout<<"Imposibil";
else
for(i=1;i<=m;i++)
cout<<fixed<<setprecision(10)<<rez[i]<<" ";
return 0;
}