大数模 逆元 矩阵

题意

给一个 n×n的矩阵
并且给出此行列式的绝对值
要求给出一个此矩阵 的正负

思路

正常来讲是不行的(long long 开不了那么大)
所以可以用一个很大质数取模(/ 可以用逆元来运算)
如果结果和之前不一样
那么就是-
反正则是+

AC代码

#include<bits/stdc++.h>
#define endl "\n"
#define INF 0x3f3f3f3f3f3f3f
typedef long long ll;
const ll mod = 1e9 + 7;
const double PI = acos(-1.0);
const double EI = exp(1.0);
const int N = 1e6 + 10;
const double eps = 1e-8;
using namespace std;
ll m[105][105];
int n;
ll fast_pow(ll a, ll b)
{
	ll ans = a, res = 1;
	while (b>0)
	{
		if (b & 1)
			res = (res * ans) % mod;
		ans = (ans * ans) % mod;
		b /= 2;
	}
	return res;
}
ll inv(ll x) { return fast_pow(x, mod - 2); }
ll det()
{
	int ans = 1;
	for (int i = 1; i <= n; i++)
	{
		int flag = i;
		while(m[flag][i] == 0)
		{
			flag++;
		}
		if (flag != i)
		{
			swap(m[flag], m[i]);
			ans = -1 * ans;
		}
		for (int j = i+1; j <= n; j++)
		{
			ll t = (m[j][i] * inv(m[i][i])) % mod;
			for (int k = i; k <= n; k++)
			{
				m[j][k] = (m[j][k] - t * m[i][k]%mod+mod) % mod;
			}
		}
		ans = (ans*m[i][i]%mod+mod)%mod;
	}
	return ans;
}
void solve()
{
	string str;
	ll d=0;
	cin >> n;
	cin >> str;
	for (int i = 0; i < str.size(); i++)
	{
		d = (d * 10 + str[i] - '0') % mod;
	}
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			cin >> m[i][j];
	if (d == det())
		cout << "+" << endl;
	else
		cout << "-" << endl;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(); cout.tie(0);
	int t; cin >> t; while (t--)
	solve();
	return 0;
}