Pagini recente » Cod sursa (job #3248093) | Cod sursa (job #2673399) | Cod sursa (job #1091373) | Cod sursa (job #2212339) | Cod sursa (job #1706749)
#include <stdio.h>
#include <math.h>
#include <algorithm>
#define NMax 310
using namespace std;
int N, M;
double Mat[NMax][NMax];
double Rez[NMax];
bool zero( double val ) {
return fabs(val) < 0.1;
}
void gauss() {
int j = 1;
for ( int i = 1; i <= N; ++ i ) {
int max_k = i;
for ( int k = i + 1; k <= N; ++ k )
if ( Mat[max_k][j] > Mat[k][j] )
max_k = k;
if ( i != max_k ) {
for ( int k = 1; k <= M + 1; ++ k)
swap(Mat[i][k], Mat[max_k][k]);
}
if ( Mat[i][j] == 0 ) {
++ j; -- i;
continue;
}
for ( int k = 1; k <= N; ++ k ) if ( k != i ) {
double x = Mat[i][j];
double y = Mat[k][j];
for ( int l = 1; l <= M + 1; ++ l )
Mat[k][l] = Mat[k][l] * x - Mat[i][l] * y;
}
}
for ( int i = N; i > 0; -- i ) {
int j;
for ( j = M; zero(Mat[i][j]) && j > 0; -- j );
if ( j == 0 ) continue;
Rez[j] = Mat[i][M + 1] / Mat[i][j];
}
}
int main() {
freopen("gauss.in", "r", stdin);
freopen("gauss.out", "w", stdout);
scanf("%d%d", &N, &M);
for ( int i = 1; i <= N; ++ i )
for ( int j = 1; j <= M + 1; ++ j )
scanf("%lf", &Mat[i][j]);
gauss();
for ( int i = 1; i <= M; ++ i )
printf("%.10lf ", Rez[i]);
printf("\n");
return 0;
}