Pagini recente » Cod sursa (job #247594) | Cod sursa (job #2281240) | Cod sursa (job #1098665) | Cod sursa (job #1130584) | Cod sursa (job #2877368)
#include <fstream>
#define EPS 0.0000001
using namespace std;
ifstream f("gauss.in");
ofstream g("gauss.out");
double a[311][311],x[311];
int n,m,i,j,k,p,l;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m+1;j++)
f>>a[i][j];
i=j=1;
while(i<=n && j<=m)
{
for(k=i;k<=n;k++)
if(a[k][j]<-EPS || a[k][j]>EPS)
break;
if(k==n+1)
{
j++;
continue;
}
if(i!=k)
for(p=1;p<=m+1;p++)
swap(a[i][p],a[k][p]);
for(p=j+1;p<=m+1;p++)
a[i][p]=a[i][p]/a[i][j];
a[i][j]=1;
for(l=i+1;l<=n;l++)
{
for(p=j+1;p<=m+1;p++)
a[l][p]=a[l][p]-a[l][j]*a[i][p];
a[l][j]=0;
}
i++;
j++;
}
for(i=n;i>0;i--)
for(j=1;j<=m+1;j++)
if(a[i][j]<-EPS || a[i][j]>EPS)
{
if(j==m+1)
{
g<<"Imposibil";
return 0;
}
x[j]=a[i][m+1];
for(k=j+1;k<=m;k++)
x[j]=x[j]-x[k]*a[i][k];
break;
}
for(i=1;i<=m;i++)
g<<x[i]<<" ";
return 0;
}