矩阵计算器

一个简单的矩阵计算器，目前支持加减乘除、行列式的值、秩、转置。（寒假慢慢填坑，线代课本上的应该都会有吧）。
操作逻辑貌似有点小问题。

#include "pch.h"
#include <iostream>
#include<cmath>

using namespace std;
int guide(int&,int&);
int guide(int&, int&,int&,int&);
int matrix_set(int **&, int, int);
int matrix_in(int **&,int ,int );
int matrix_out(int **, int, int);
int matrix_add(int **, int **, int **, int , int );
int matrix_sub(int **, int **, int **, int, int);
int matrix_mul(int **, int **, int **, int, int);
int matrix_cof(int **, int **, int, int, int);
int matrix_det(int **, int);
int matrix_tra(int **, int **, int, int);
int matrix_ran(int **, int, int, int);

int main()
{
	int s,m1,n1,m2,n2,m,n,**p1,**p2,**p3;
l1:;
	cout << "\nchoose the type of operation" << endl;
	cout << "0:exit\n1:addition\n2:subtraction\n3:multiplication\n4:cofactor\n5:determinant\n6:transposed\n7:Rank\n";
	cin >> s;
	switch (s)
	{
	case 0:
		goto l2;
	case 1:
		guide(m1, n1, m2, n2);
		matrix_in(p1, m1, n1);
		matrix_in(p2, m1, n1);
		matrix_set(p3, m1, n1);
		matrix_add(p1, p2, p3, m1, n1);
		cout << "result:\n";
		matrix_out(p3, m1, n1);
		break;
	case 2:
		guide(m1, n1, m2, n2);
		matrix_in(p1, m1, n1);
		matrix_in(p2, m1, n1);
		matrix_set(p3, m1, n1);
		matrix_sub(p1, p2, p3, m1, n1);
		cout << "result:\n";
		matrix_out(p3, m1, n1);
		break;
	case 3:
		guide(m1, n1, m2, n2);
		matrix_in(p1, m1, n1);
		matrix_in(p2, m1, n1);
		matrix_set(p3, m1, n2);
		matrix_mul(p1, p2, p3, m1, n2);
		cout << "result:\n";
		matrix_out(p3, m1, n2);
		break;
	case 4:
		guide(m1, n1);
		cout << "input the row and line you want to remove";
		cin >> m >> n;
		matrix_in(p1, m1, n1);
		matrix_set(p3, m1-1, m1-1);
		matrix_cof(p1, p3, m1, m, n);
		cout << "result:\n";
		matrix_out(p3, m1-1, n1-1);
		break;
	case 5:
		guide(m1, n1);
		matrix_in(p1, m1, n1);
		cout << "result:\n";
		cout << matrix_det(p1, m1);
		break;
	case 6:
		guide(m1, n1);
		matrix_in(p1, m1, n1);
		matrix_set(p3, n1, m1);
		matrix_tra(p1, p3, m1, n1);
		cout << "result:\n";
		matrix_out(p3, n1, m1);
		break;
	case 7:
		guide(m1, n1);
		matrix_in(p1, m1, n1);
		cout << "result:\n";
		cout<<matrix_ran(p1, m1, n1, n1);
		break;
	}
	goto l1;
l2:;
	cout << "\nthank for your use .\ndesigned by your Zmm\n";
}

int guide(int &m,int &n)
{
	cout << "input the row and line of the matrix" << endl;
	cin >> m >> n;
	return 0;
}
int guide(int &m1, int &n1,int &m2,int &n2)
{
	cout << "input the row and line of the first matrix" << endl;
	cin >> m1 >> n1;
	cout << "input the row and line of the second matrix" << endl;
	cin >> m2 >> n2;
  	return 0;
}
int matrix_set(int **&p, int m, int n)
{
	p = new int*[m];
	for (int i = 0; i < m; i++) p[i] = new int[n];
	return 0;
}
int matrix_in(int **&p, int m, int n)
{
	cout  << "now input your matrix"<< '\n';
	p = new int*[m];
	for (int i = 0; i < m; i++) p[i] = new int[n];
	for (int i = 0; i < m; i++)
	{
		for (int j = 0; j < n; j++) cin >> p[i][j];
	}
	return 0;
}
int matrix_add(int **p1, int **p2,int **p3,int m,int n)
{
	for (int i = 0; i <m ; i++)
	{
		for (int j = 0; j < n; j++) p3[i][j] = p1[i][j] + p2[i][j];
	}
	return 0;
}
int matrix_sub(int **p1, int **p2, int **p3, int m, int n)
{
	for (int i = 0; i < m; i++)
	{
		for (int j = 0; j < n; j++) p3[i][j] = p1[i][j] - p2[i][j];
	}
	return 0;
}
int matrix_mul(int **p1, int **p2, int **p3, int m, int n)
{
	for (int i = 0; i < m; i++)
	{
		for (int j = 0; j < n; j++)
		{
			int s = 0;
			for (int k = 0; k < n; k++)
			{
				s+= p1[i][k] * p2[k][j];
			}
			p3[i][j] = s;
		}
	}
	return 0;
}
int matrix_cof(int **p1, int **p, int m1, int m, int n)
{
	for (int i = 0,i1=0; i < m1; i1++, i++)
	{
		if (i == m)
		{
			i1--;
			goto l1;
		}
		for (int j1=0,j = 0; j < m1; j1++, j++)
		{
			if (j == n)
			{
				j1--;
				goto l2;
			}
			p[i1][j1] = p1[i][j];
		l2:;
		}
	l1:;
	}
	return 0;
}
int matrix_det(int **p1, int m)
{
	int s = 0;
	if (m == 1) return p1[0][0];
	if (m == 2) return(p1[0][0] * p1[1][1] - p1[1][0] * p1[0][1]);
	int **p2;
	matrix_set(p2, m - 1, m - 1);
	for (int i = 0; i < m; i++)
	{
		matrix_cof(p1, p2, m, 0, i);
		s += pow(-1, i)*(p1[0][i] * matrix_det(p2, m - 1));
	}
	return s;
}
int matrix_out(int **p3,int m,int n)
{
	for (int j = 0; j < m; j++)
	{
		for (int k = 0; k < n; k++)
		{
			cout << p3[j][k]<<ends;
		}
		cout << endl;
	}
	return 0;
}
int matrix_tra(int **p1, int **p3,int m,int n)
{
	for (int i = 0; i < m; i++)
	{
		for (int j = 0; j < n; j++)
		{
			p3[j][i] = p1[i][j];
		}
	}
	return 0;
}
int matrix_ran(int **p1, int m, int n,int n1)
{
	if(m<n)
	{
		int **p = new int*[n];
		for (int i = 0; i < n; i++) p[i] = new int[m];
		matrix_tra(p1, p, m, n);
		return matrix_ran(p, n, m, m);
	}
	if (n1 == 0) return 0;
	int **p = new int*[n1];
	for (int i = 0; i < n1; i++) p[i] = new int[n1];
	for (int j = 0; j <= m-n1; j++)
	{
		for (int k = 0; k <= n-n1; k++)
		{
			for (int a = 0; a < n1; a++)
			{
				for (int b = 0; b < n1; b++)
				{
					p[a][b] = p1[a + j][b + k];
				}
			}
			if (matrix_det(p,n1)!=0) return n1;
		}
		return matrix_ran(p1, m, n, n1 - 1);
	}
	
}