c++实现矩阵类矩阵行列式，伴随矩阵，逆矩阵

 //Matrix ver1.0
 //只支持矩阵内部（方阵）的运算
 #include<iostream>
 #include<math.h>
 using namespace std;
 class matrix
 {
     double**num;
     int **e;//单位矩阵
     int r;
     int c;
     unsigned int *array;//为全排序原矩阵列标提供初始顺序模板
     unsigned int*arr;//为全排序伴随矩阵列标提供初始顺序模板
     int**b;//存放原矩阵列标
     int j;//计数变量，原矩阵的全排列
     int po;//计数变量，伴随矩阵的全排列

     double **comp;//伴随矩阵
     double**s;//存放每一个num的余子式
     int**sb;//存放每一个余子式的列标

 public:
     double caculate();
     matrix(int n, int m);//nrow
     void setmat();
     bool checkcomp() { if (po)return true; return false; }
     void showm();
     void showinver(double k);
     void swap(unsigned int* array, int i, int j);
     void FullArray(int n, int index);
     int func(int n) { if (n == )return ; else return n*func(n - ); }
     int ni(int a[], int n);
     void sets(int a, int b);
     double cacu(int a, int b);
     void setcomp();
     void showcomp();
     void fullArray(int n, int index = );
     void shows();
     void showsb();

 };
 void matrix::shows()//r
 {
     for (int i = ; i < r - ; i++)
     {
         for (int j = ; j < c - ; j++)
             cout << s[i][j] << " ";
         cout << endl;
     }
 }
 void matrix::showcomp()
 {
     for (int i = ; i < r; i++)
     {
         for (int j = ; j < c; j++)
             cout << comp[i][j] << " ";
         cout << endl;
     }
 }
 void matrix::setcomp()
 {
     for (int i = ; i < r; i++)
         for (int j = ; j < c; j++)
             comp[i][j] = pow(-, j + i)*cacu(i, j);

 }
 double matrix::cacu(int a, int b)//计算每一位的代数余子式
 {
     sets(a, b);
     double sum = ;
     double *p = new double[c - ];
     for (int i = ; i < func(c - ); i++)
     {
         p[i] = ;
         for (int j = ; j < c - ; j++)
             p[i] *= s[j][sb[i][j]];
         p[i] = p[i] * pow(-, ni(sb[i], c - ));
         sum += p[i];
     }
     return sum;
 }
 void  matrix::sets(int a, int b)//把(a,b)的余子式存入**s
 {
     int t = ;
     int *cun = new int[(c - )*(r - )];
     for (int i = ; i < r; i++)
         for (int j = ; j < c; j++)
         {
             if (i != a&&j != b)
             {
                 cun[t] = num[i][j];
                 t++;
             }
         }
     for (int i = ; i < r - ; i++)
         for (int j = ; j < c - ; j++)
             s[i][j] = cun[i*(r - ) + j];
 }
 void  matrix::showm()//r
 {
     for (int i = ; i < r; i++)
     {
         for (int j = ; j < c; j++)
             cout << num[i][j] << " ";
         cout << endl;
     }
 }
 int matrix::ni(int a[], int n)//逆序数
 {
     int s = ;
     for (int j = n - ; j >= ; j--)
         for (int i = ; i < j; i++)
         {
             if (a[j] < a[i])
                 s++;
         }
     return s;
 }
 void matrix::swap(unsigned int*array, int i, int j)//r
 {
     int t = array[i];
     array[i] = array[j];
     array[j] = t;
 }
 void  matrix::showsb()
 {
     for (int i = ; i < func(r - ); i++)
     {
         for (int j = ; j < c - ; j++)
             cout << sb[i][j];
         cout << endl;
     }
 }
 void  matrix::fullArray(int n, int index)//对于伴随矩阵全排列
 {
     if (index >= n)
     {
         for (int i = ; i <n; ++i)
         {
             sb[po][i] = arr[i];
         }
         po++;
         //return;
     }

     for (int i = index; i < n; ++i)
     {
         swap(arr, index, i);
         fullArray(n, index + );
         swap(arr, index, i);
     }
 }
 void  matrix::FullArray(int n, int index)//r
 {
     if (index >= n)
     {
         for (int i = ; i <n; ++i)
         {
             b[j][i] = array[i];//把全排列存入b[][]中
         }
         j++;
     }

     for (int i = index; i < n; ++i)
     {
         swap(array, index, i);
         FullArray(n, index + );
         swap(array, index, i);
     }
 }

 void matrix::showinver(double k)
 {
     for (int i = ; i < r; i++)
     {
         for (int j = ; j < c; j++)
             cout << comp[i][j] / k << " ";
         cout << endl;
     }
 }
 matrix::matrix(int n, int m) :r(n), c(m)//r
 {
     j = ;
     array = new unsigned int[c];
     for (int i = ; i < c; i++)
         array[i] = i;
     arr = new unsigned int[c - ];
     for (int i = ; i < c - ; i++)
         arr[i] = i;
     num = new double*[n];
     b = new int*[func(c)];
     for (int i = ; i < r; i++)
         num[i] = new double[c];
     for (int i = ; i < func(c); i++)
         b[i] = new int[c];
     e = ;

     sb = ;
     s = ;
     po = ;
     if (r == c)
     {
         sb = new int*[func(c - )];
         for (int i = ; i < func(c - ); i++)
             sb[i] = new int[c - ];
         s = new double*[r - ];
         for (int i = ; i < r; i++)
             s[i] = new double[c - ];
         comp = new double*[r];

         for (int i = ; i < r; i++)
             comp[i] = new double[c];

         e = new int*[r];
         for (int i = ; i < r; i++)
             e[i] = new int[c];
         for (int i = ; i < r; i++)
             for (int j = ; j < c; j++)
             {
                 if (i == j)
                     e[i][j] = ;
                 else
                     e[i][j] = ;
             }
     }
 }
 void matrix::setmat()
 {
     cout << "请按行输入你的矩阵：" << endl;
     for (int i = ; i < r; i++)
         for (int j = ; j < c; j++)
             cin >> num[i][j];
     //num[i][j] = i*r + j;
 }
 double matrix::caculate()//计算原矩阵行列式
 {
     FullArray(c, );
     double sum = ;
     double *p = new double[c];
     for (int i = ; i < func(r); i++)
     {
         p[i] = ;
         for (int j = ; j < c; j++)
             p[i] *= num[j][b[i][j]];
         p[i] = p[i] * pow(-, ni(b[i], c));
         sum += p[i];
     }
     return sum;
 }
 void main()
 {
     int C, R;
     int choice = ;
     matrix *p = ;
     double k;//储存行列式的值
     while (choice)
     {
         cout << "1:创建一个矩阵对象\n2:输出矩阵行列式的值\n3：输出伴随矩阵\n4：输出逆矩阵\n5:结束" << endl;
         cout << "请输入你的选择" << endl;
         cin >> choice;
         switch (choice)
         {
         case :
             cout << "请输入矩阵的行与列：" << endl;
             cin >> C >> R;
             p = new matrix(C, R);
             p->setmat();
             break;
         case :
             if (C == R)
             {
                 k = p->caculate();
                 cout << "矩阵行列式的值：" << k << endl;
             }
             else
                 cout << "非方阵，无法计算" << endl;
             break;
         case :
             if (C == R)
             {
                 p->fullArray(C - , );//先给下标全排序好，存入相应数组
                 p->setcomp();
                 p->showcomp();
             }
             else
                 cout << "非方阵，无法计算" << endl;
             break;
         case :
             if (C == R)
                     if (p->checkcomp())
                         p->showinver(k);
                     else
                         cout << "请先计算伴随矩阵。" << endl;
             else
                 cout << "非方阵，无法计算" << endl;
             break;
         case :
             choice = ;
             break;
         }
     }
 }

=====================6.18update&BUG已改===========================