行列式计算器
#include<iostream>
#include<algorithm>
using namespace std;
const int N=10000;
double a[N][N];
int juzheng2(int n)
{
for (int i = 1; i <= n; ++i)
for (int j = 1; j <=n ; ++j)cin>>a[i][j];
return a[1][1]*a[2][2]-a[1][2]*a[2][1];
}
int juzheng3(int n)
{
for (int i = 1; i <= n; ++i)
for (int j = 1; j <=n ; ++j)cin>>a[i][j];
return (a[1][1]*a[2][2]*a[3][3]+a[1][2]*a[2][3]*a[3][1]+a[1][3]*a[2][1]*a[3][2]
-a[1][3]*a[2][2]*a[3][1]-a[1][2]*a