Pagini recente » Cod sursa (job #2687772) | Cod sursa (job #735760) | Cod sursa (job #2625495) | Cod sursa (job #2728114) | Cod sursa (job #1082231)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("gauss.in");
ofstream fout("gauss.out");
const int Nmax = 310;
const double EPS = 0.0000000000001;
int N, M;
double A[Nmax][Nmax], sol[Nmax];
int main()
{
fin >> N >> M;
for(int i=1; i <= N; i++)
for(int j = 1; j <= M + 1; j++)
fin >> A[i][j];
int i = 1, j = 1, k;
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;}
else if(i != k) swap(A[i], A[k]);
for(int jj = j + 1; jj <= M + 1; jj++)
A[i][jj] /= A[i][j];
A[i][j] = 1;
for(int ii = i + 1; ii <= N; ii++)
{
for(int jj = j + 1; jj <= M + 1; jj++)
A[ii][jj] -= A[i][jj] * A[ii][j];
A[ii][j] = 0;
}
i++; j++;
}
for(int i=N; i; i--)
for(int j=1; j <= M + 1; j++)
if(A[i][j] > EPS || A[i][j] < -EPS)
{
if(j == M + 1)
{
fout<<"Imposibil\n";
return 0;
}
sol[j] = A[i][M + 1];
for(int jj = j + 1; jj <= M; jj++)
sol[j] -= sol[jj] * A[i][jj];
break;
}
for(int i=1; i <= M; i++)
{
fout.precision(13);
fout<<fixed<<sol[i]<<' ';
}
return 0;
}