Pagini recente » Cod sursa (job #1453719) | Istoria paginii runda/porc2 | Cod sursa (job #660035) | Cod sursa (job #2388601) | Cod sursa (job #1750142)
#include<fstream>
#include<iomanip>
#define eps 0.0000000001
using namespace std;
int n, m, i, j, ii, jj;
double a[305][305], v[305], x;
ifstream fin("gauss.in");
ofstream fout("gauss.out");
double modul(double x){
if(x > 0){
return x;
}
return -x;
}
int main(){
fin>> n >> m;
for(i = 1; i <= n; i++){
for(j = 1; j <= m + 1; j++){
fin>> a[i][j];
}
}
i = j = 1;
while(i <= n && j <= m){
for(ii = i; ii <= n; ii++){
if(modul(a[ii][j]) >= eps){
break;
}
}
if(ii == n + 1){
j++;
continue;
}
if(i != ii){
for(jj = j; jj <= m + 1; jj++){
swap(a[i][jj], a[ii][jj]);
}
}
for(jj = j + 1; jj <= m + 1; jj++){
a[i][jj] /= a[i][j];
}
a[i][j] = 1;
for(ii = i + 1; ii <= n; ii++){
for(jj = j + 1; jj <= m + 1; jj++){
a[ii][jj] -= a[i][jj] * a[ii][j];
}
a[ii][j] = 0;
}
i++;
j++;
}
for(i = n; i >= 1; i--){
for(j = 1; j <= m + 1; j++){
if(modul(a[i][j]) >= eps){
break;
}
}
if(j == m + 1){
fout<<"Imposibil\n";
return 0;
}
if(j != m + 2){
x = a[i][m + 1];
for(jj = m; jj > j; jj--){
x -= a[i][jj] * v[jj];
}
v[j] = x;
}
}
for(i = 1; i <= m; i++){
fout<< setprecision(10) << fixed << v[i] <<" ";
}
return 0;
}