Pagini recente » Cod sursa (job #355885) | Cod sursa (job #2945639) | Cod sursa (job #153292) | Cod sursa (job #2458651) | Cod sursa (job #1388952)
#include <fstream>
#include <iomanip>
#include <algorithm>
#define NMAX 305
using namespace std;
ifstream f("gauss.in");
ofstream g("gauss.out");
int n,m,k,kk;
double sol[NMAX],a[NMAX][NMAX],a1[NMAX][NMAX];
int main()
{
f>>n>>m;m++;
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
{
f>>a[i][j];
a1[i][j]=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=m-1;i>=1;i--)
{
int j;
for (j=i+1;j<=m;j++)
if (a[i][j]>0.000000001 || a[i][j]<-0.000000001)
break;
if (j==m+1)
{
g<<"Imposibil";
return 0;
}
sol[i]=a[i][m];
for (int j=i+1;j<=m;j++)
sol[i]-=sol[j]*a[i][j];
sol[i]/=a[i][i];
}
for (int i=1;i<m;i++)
g<<setprecision(8)<<fixed<<sol[i]<<" ";
}