/* Include Libraries */
#include <stdio.h>
#include <math.h>

/* Function Prototypes */
void inpt (double a[][10], double b[], int *n);
int checkdeviation (double x[], double x_new[], int n);

/* Define Constants */
#define GUESS 1

main()
{
	/* Declare Variables */
	double a[10][10], b[10], x[10], x_new[10], sum=0;
	int n, i, j, k, test=1;

	/* Read data */
	inpt (a, b, &n);
	
	/* Initialize x, x_new */
	for (k=0; k < n; k++)
	{
		x[k]=GUESS;
		x_new[k]=GUESS;
	}

	/* Print headings */	
	printf("\n\n\nIteration\t");
	for (k=0; k<n; k++)
	{
		printf("x_new[%d]\t",k);
	}
	printf("\n");
	
	/* Start iterations at 0 */
	k=0;
	
	/* Run loop while checkdeviation returns 1 */
	while (test!=0)
	{
		/* Print and increment iteration number */
		printf("%d\t\t",k);
		k++;

		for (i=0; i < n; i++)
		{
			for (j=0; j < n; j++)
			{
				if (i != j)
				{
					/* Calculate each array element times appropriate
					   x-value when i!=j */
					sum += (a[i][j] * x[j]);
				}
			}
			/* Set new x-value, print, and reset sum */
			x_new[i] = (b[i] - sum)/a[i][i];
			printf("%lf\t", x_new[i]);
			sum=0;
		}
		printf("\n");

		test=checkdeviation(x,x_new,n);		

		/* Replace x[i] with x[i] from previous iteration */
		for (i=0; i<n; i++)
		{
			x[i]=x_new[i];
		}
	}
	printf("\n\n");		
}

/* Function to read data */
void inpt (double a[][10], double b[], int *n)
{
	int i, j;

	/* Read size of matrix */	
	scanf("%d", n);
	
	for (i=0; i<(*n); i++)
	{
		for (j=0; j<((*n)+1); j++)
		{
			if (j<((*n)))
			{
				/* Read matrix co-efficients for a */
				scanf("%lf", &a[i][j]);
			}
			else
			{
				/* Read matrix co-efficients for b */
				scanf("%lf", &b[i]);
			}
		}
	}
}

/* Function to check difference between current and previous
   values for x */

int checkdeviation (double x[], double x_new[], int n)
{
	int i, continue_flag=0;
		
	for (i=0;i<n;i++)
	{
		/* if difference is < 0.0001, increase continue_flag */
		if(fabs(x_new[i]-x[i])<0.0001)
			continue_flag+=1;
	}
	
	/* When all differences are < 0.0001, stop */
	if (continue_flag==(n))
		return 0;
	else
		return 1;
}