#include <iostream>
using namespace std;

int main() {
	int m,n,i,j,j1,start,a,TF;
	cout << "Inserisci il numero di equazioni: ";	
	cin >> m;
	cout << "Inserisci il numero massimo di incognite: ";
	cin >> n;
	n++;
	double A[m][n], cache[n], quoz;
//Input matrice
	for (i=1; i<=m; i++) {
		cout << "eq. " << i;
		for (j=1; j<n; j++) {
			if (j>1){
				cout << "     ";
			}
			cout << " x" << j << " --> ";
			cin >> A[i][j];
			}
		cout << "     " << " b" << i << " --> ";
		cin >> A[i][j];
		}
//Output matrice iniziale
	for (i=1; i<=m; i++) {
		for (j=1; j<n; j++) {
			cout << A[i][j] << "	";
			}
		cout << "|" << A[i][j];
		cout << endl;
		}
//Eliminazione coefficienti con OE3
	RiordinamentoRighe:
	start=1;
	for (j=1; j<=n; j++) {
		for (i=start; i<m and A[i][j]==0; i++) {	}
		for (i=i+1; i<=m; i++) {
			if (A[i][j]==0) {	}
			else {
				quoz=A[i][j]/A[start][j];
				for (j1=j; j1<=n; j1++) {
					A[i][j1]=A[i][j1]-(quoz*A[start][j1]);
				}
			}
		}
		if (A[start][j]!=0) {
			start++;
		}
	}
//Riordinamento righe
	start=1;
	for (j=1; j<=n; j++) {
	mylabel:
		for (i=start; i<m and A[i][j]==0; i++) {	}	
			if (A[i][j] != 0){
				for (j1=1; j1<=n; j1++){
					cache[j1]=A[i][j1];
					A[i][j1]=A[start][j1];
					A[start][j1]=cache[j1];
				}
				start++;
				}
			for (i=start; i<=m; i++)
				if (A[i][j]!=0){
					goto mylabel;
				}
		}
//Controllo se e' a scala
TF=0;
start=1;
	for (j=1; j<n; j++){
		for (i=start; i<m; i++){
			if (A[i][j]!=0 and TF==0)
				TF=1;
			else if (A[i][j]!=0 and TF==1)
				goto RiordinamentoRighe;
		}
		TF=0;
		if (A[start][j]!=0)
			start++;
	}
//Output matrice finale
	cout << "- - - - - -" << endl;
	for (i=1; i<=m; i++) {
		for (j=1; j<n; j++) {
			cout << A[i][j] << "	";
			}
		cout << "|" << A[i][j];
		cout << endl;
		}
	cin>>a;
	return 0;
}