// Jacobiova metoda

#include <iostream>

#include <math.h>

#include <conio.h>

#define N 10

using namespace std;



double a[N][N];			//matice soustavy

double b[N];			//vektor pravych stran

double x[N];			//reseni rovnice

double xold[N];			//predchozi priblizeni

double delta,aii;

double eps=0.0001;		//pripustna chyba

int i,j,k,n;



int main()

{

//nacteni vstupu   cti:

cti:cout << "   Zadejte dimenzi soustavy - pocet rovnic ( do 10):\n";

	cin >> n;

	if (n>N)

	{

		cout << "   Pozor, n nesmi byt vetsi nez N! N=10 Znovu zadavej!\n ";

		goto cti;

	}

	cout << "Zadejte matici po radcich (leve strany):\n";

	for(i=0;i<n;i++)

		for(j=0;j<n;j++)

			cin >> a[i][j];

	cout << "Zadejte prave strany rovnic:\n";

	for(i=0;i<n;i++)

	{

		cin >> b[i];

	}

		// uprava

	cout << "uprava\n";

	for(i=0;i<n;i++)

	{

		aii=a[i][i];

		b[i]=b[i]/aii;

		for(j=0;j<n;j++)

		{

			a[i][j]=a[i][j]/aii ;

		}

		x[i]=b[i]; xold[i]=b[i];

	}



	// iteracni postup

	cout << "iteracni postup\n";

	do

	{

		delta=0;

		for(i=0;i<n;i++)

		{

			x[i]=b[i];

			for(j=0;j<n;j++)

			{

				if (i!=j)

				{

					x[i]=x[i]-a[i][j]*xold[j];

				}

			}

			if (delta < fabs(x[i]-xold[i])) delta=fabs(x[i]-xold[i]);

			xold[i]=x[i];

		}

		for(i=0;i<n;i++)

			cout << "x" <<i <<"=" << x[i] << endl;

	}

	while (delta > eps);

// tisk vysledku

for(i=0;i<n;i++)

	cout << "x" <<i <<"=" << x[i] << endl;

	getch();

	return 0;

}