int Jacobi(float A[][MAX_n],float x[],int n){
float x_former[MAX_n];
	int i,j,k;
	printf("\n請輸入初始的 x0:\n");
	Input(x,n);
	k=0;
	do{
		for(i=1;i<=n;++i)
		{
			printf("\nx[%d]=%f",i,x[i]);
			x_former[i]=x[i];
		}
		printf("\n");
		for(i=1;i<=n;++i)
		{
			x[i]=A[i][n+1];
			for(j=1;j<=n;++j) if(j!=i) x[i]-=A[i][j]*x_former[j];
			if(fabs(A[i][i])>PRECISION)	x[i]/=A[i][i];
			else return 1;
		}
		++k;
	}while(Is(x,x_former,n) && k<MAX_Number);
	if(k>=MAX_Number)
		return 1;
	else
	{
		printf("\n雅可比共迭代了 %d 次!",k);
		return 0;
	}
}