#include<iostream.h>
#include<iomanip.h>
void Output(double a[3][4],int n)
{
	int i,j;
	for(i=0;i<n;i++)
	{
		for(j=0;j<=n;j++)
		{
			cout<<setw(12)<<a[i][j];
		}
		cout<<endl;
	}
}
void main()
{
	int n=3;
	double a[3][4]={

{2,-1,-1,4},
{3,4,-2,11},
{3,-2,4,11}


	};
	double  *b;
	b=new double[n];//b數(shù)組保存解向量
	int i=0,j=0,count=0;
	double k=0,l=0;
	double temp=0,sum=0;
	for(i=0;i<=n-1;i++)
	{
		temp=a[i][i];
		for(j=0;j<=n;j++)
		{
			if(j!=n)a[i][j]=-a[i][j]/temp;
			else a[i][j]=a[i][j]/temp;
		}
	}
	a[0][0]=1;
	a[1][1]=1;
	a[2][2]=1;

	cout<<"構(gòu)造方程組后："<<endl;
	Output(a,n);
	a[0][0]=1;   //賦初始值
	a[1][1]=1;
	a[2][2]=1;
	b[0]=0;b[1]=0;b[2]=0;

	do{
		cout<<"count="<<count<<endl;
		k=a[0][0];
		for(i=0;i<n;i++)b[i]=a[i][i];
		for(i=0;i<=n-1;i++)
		{
			sum=0;
			for(j=0;j<=n;j++)
			{
				if(j!=i&&j<n)
				{
					sum+=a[i][j]*b[j];
				}
				else if(j==n)
				{sum+=a[i][j];}
				a[i][i]=sum;

			}
			cout<<"x"<<i+1<<"="<<b[i]<<'\t';
		}
		cout<<endl;
		count++;
		l=a[0][0];
		}while(l-k>0.0000001||l-k<-0.0000001);
}