#include "stdafx.h"
#include <Windows.h>
#include <process.h>
#include <time.h>
#include <iostream>
using namespace std;
int sum;
int sum1,sum2;
int **a,**b;
int n;
CRITICAL_SECTION cs;
HANDLE evFin[2];
int power(int order){
if(order % 2 == 0)
return 1;
else return -1;
}
int cal_matrix(int** m, int n, int row, int col){
int** temp;
int sum = 0;
int temp_row = 0, temp_col = 0;
// EnterCriticalSection(&cs);
if (n == 0)
递归求解N阶行列式
最新推荐文章于 2022-02-14 14:30:40 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)