#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cmath>
#include<map>
#include<string>
#include<functional>
using namespace std;
const int maxn = 12;
struct Dmt {
int x;
int y;
int a[maxn][maxn];
};
int determinant_1(Dmt tmp)
{
int a_1 = tmp.a[1][1];
return a_1;
}
int determinant_2(Dmt tmp)
{
int a_1 = tmp.a[1][1] * tmp.a[2][2];
int a_2 = tmp.a[1][2] * tmp.a[2][1];
return a_1 - a_2;
}
int determinant_3(Dmt tmp)
{
int a_1 = tmp.a[1][1] * tmp.a[2][2] * tmp.a[3][3];
int a_2 = tmp.a[1][2] * tmp.a[2][3] * tmp.a[3][1];
int a_3 = tmp.a[1][3] * tmp.a[2][1] * tmp.a[3][2];
int a_4 = tmp.a[1][3] * tmp.a[2][2] * tmp.a[3][1];
int a_5 = tmp.a[1][1] * tmp.a[2][3] * tmp.a[3][2];
int a_6 = tmp.a[1][2] * tmp.a[2][1] * tmp.a[3][3];
return a_1 + a_2 + a_3 - a_4 - a_5 - a_6;
}
int get_determinant(Dmt tmp,int ans)//ans——当前行列式的值
{
Dmt newtmp;
if (tmp.x == 1 && tmp.y == 1)
return determinant_1(tmp);
if (tmp.x == 2 && tmp.y == 2)
return determinant_2(tmp);
if (tmp.x == 3 && tmp.y == 3)
return determinant_3(tmp);
//按照最后一行的代数余子式展开~
newtmp.x = tmp.x - 1;
//cout << newtmp.x << endl;
newtmp.y = tmp.y - 1;
//cout << newtmp.y << endl;
int cnt = ans;
for (int i = 1; i <= tmp.x; i++)//按照最后一行展开成代数余子式!
{
for (int j = 1; j <= tmp.x-1; j++)
{
int cs = 1;
for (int k = 1; k <= tmp.y; k++)
{
if (k == i)
continue;
newtmp.a[j][cs] = tmp.a[j][k];
cs++;
}
}
cnt+=pow(-1,tmp.y+i)*tmp.a[tmp.y][i]*get_determinant(newtmp,0);
}
return cnt;
}
int main()
{
Dmt test;
int x; int y;
while (cin >> test.x >> test.y)
{
for (int i = 1; i <= test.x; i++)
{
for (int j = 1; j <= test.y; j++)
{
cin >> test.a[i][j];
}
}
cout<<get_determinant(test, 0)<<endl;
}
system("pause");
return 0;
}
行列式求解【线性代数】
最新推荐文章于 2024-01-02 21:14:41 发布