Pagini recente » Cod sursa (job #953776) | Cod sursa (job #2199263) | Cod sursa (job #1457703) | Cod sursa (job #43728) | Cod sursa (job #3183570)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("gauss.in");
ofstream fout("gauss.out");
const long double EPS=1e-12;
int n,m;
double v[355][355];
bool have[355];
double sol[355];
int main()
{
ios_base::sync_with_stdio(false);
fin.tie(0);
fin>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m+1;j++)
fin>>v[i][j];
int j=1;
int i=1;
while(j<=m)
{
int poz=0;
for(int l=i;l<=n;l++)
if(v[l][j]!=0)
{
poz=l;
break;
}
if(poz==0)
{
j++;
continue;
}
if(poz!=i)
swap(v[i],v[poz]);
double z=v[i][j];
for(int k=1;k<=m+1;k++)
v[i][k]/=z;
bool ok=0;
if(j==2)
ok=1;
for(int l=i+1;l<=n;l++)
{
double u=v[l][j];
for(int k=1;k<=m+1;k++)
v[l][k]-=u*v[i][k];
}
j++;
i++;
}
/*for(int i=1;i<=n;i++,fout<<'\n')
for(int j=1;j<=m+1;j++)
fout<<v[i][j]<<' ';*/
for(int i=n;i>=1;i--)
{
int who=0;
double rez=v[i][m+1];
for(int j=1;j<=m;j++)
{
if(fabs(v[i][j])<=EPS)
continue;
if(have[j])
{
rez-=sol[j]*v[i][j];
continue;
}
if(who==0)
{
who=j;
continue;
}
else
{
sol[j]=0;
have[j]=1;
continue;
}
}
if(who==0&&fabs(rez)>EPS)
{
fout<<"Imposibil";
return 0;
}
if(who!=0)
{
have[who]=1;
sol[who]=rez/v[i][who];
}
}
for(int i=1;i<=m;i++)
{
if(sol[i]==0)
fout<<0<<' ';
else
fout<<fixed<<setprecision(12)<<sol[i]<<' ';
}
return 0;
}