线性代数求行列式的值（C++）

#include<stdio.h>
#include<iostream>
#include<algorithm> 
using namespace std;
int a[105];
int b[105][105];
int n;
int xx() {
	int c = 0;
	for (int i = 1; i < n; i++) {
		for (int j = i + 1; j <= n; j++) {
			if (a[i]> a[j])
				c++;
		}
	}
	c %= 2;
	return c;
}
int main() {
	int m;
	cout << "请输入一个正整数，表示行列式的阶数(不超过99)" << endl;
	cout << "4" << endl;
	cout << "输入行列式" << endl;
	cout << "1 2 3 4" << endl;
	cout << "2 3 4 1" << endl;
	cout << "3 4 1 2" << endl;
	cout << "4 1 2 3" << endl;
	cout << "答案是160" << endl << endl;
	cout << "请按上面的格式输入" << endl;
	cout << "请输入一个正整数，表示行列式的阶数(不超过99)" << endl;
	cin >> n;
	cout << "输入行列式" << endl;
	for (int i = 1; i <= 100; i++) {
		a[i] = i;
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			cin >> m;
			b[i][j] = m;
		}
	}
	int frequency = 1;
	for (int i = 1; i <= n; i++) {
		frequency *= i;
	}
	int sum = 0;
	for (int bb = 1; bb <= frequency; bb++) {
		int m_sum = 1;
		for (int i = 1; i <= n; i++) {
			m_sum *= b[a[i]][i];
		}
		int c = xx();
		c == 1 ? m_sum = -m_sum : m_sum = m_sum;
		sum += m_sum;
		next_permutation(a + 1, a + n + 1);
	}
	cout << "答案是" << sum << endl;
	system("pause"); 
	return 0;
}