直接法（高斯）求解线性方程组

#include <iostream>
#include <cmath>
using namespace std;

int main()
{
  double **a = new double *[100];
  int n,N;
  cout<<"palease input the number of unkown variable and the number of equals:"<<endl;
  cin>>n>>N;
  double *x = new double[n+1];
  double *tmp = new double[n+1]; //交换主元用
  double m ;
  //initialized the X and tmp
  for(int i = 1; i <= n; i++ )
       x[i] = 0;
  for(i = 1; i <= n; i++)
	  tmp[i] = 0;
   //create the equation set (A,b)
  for(i = 1; i <= n;i++)
  {
    a[i] = new double[n+2];
    for(int j = 1; j <= n+1; j++)
		cin>>a[i][j];

  }

  //eliminate the equation set(n-1 times )
  for(int k = 1; k < n; k++)
  {
    
	for(int t = k; t < n; t++)
	{ int l = k;
	  for(int v = k; v <= n-1; v++)//从此处开始选择最佳的主元
	  {