Pagini recente » Cod sursa (job #3345013) | Cod sursa (job #893619) | Cod sursa (job #475308) | Cod sursa (job #3358877) | Cod sursa (job #2209149)
#include <bits/stdc++.h>
using namespace std;
ifstream f("gauss.in");
ofstream g("gauss.out");
const int MAXN = 310;
const int EPS = 0.0000001;
int N, M, A[MAXN][MAXN],X[MAXN];
int main()
{
f>>N>>M;
for(int i = 1; i <= N; ++i)
for(int j = 1; j <= M+1; ++j)
f>>A[i][j];
int i = 1, j = 1, k;
double aux;
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(k != i)
for(int l = 1; l <= M+1; ++l)
{
aux = A[i][l];
A[i][l] = A[k][l];
A[k][l] = aux;
}
}
for(int i = 1; i <= M; ++i)
g<< X[i]<<" ";
return 0;
}