模意义下的逆矩阵

该代码是在多表代换密码解码求模意义下逆矩阵写的，原理就是在逆矩阵的基础上加了扩欧求逆元

#include <bits/stdc++.h>
#include <unordered_set>
#include <unordered_map>
#define _for(i, a, b) for(int i = a; i < b; ++i)
#define _rep(i, a, b) for(int i = a; i <= b; ++i)
#define _dim(i, a, b) for(int i = a; i >= b; --i)
#define closeIO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug cout << "******************" << endl
#define FREE freopen("in.txt", "r", stdin)
#define FREO freopen("out.txt", "w", stdout)
#define ls l, m, rt << 1
#define rs m + 1, r, rt << 1 | 1
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> pii;
typedef long double LD;
const int MAXN = 1e5 + 10;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const LD PI = acos(-1);
const LD eps = 1e-10;
int n, mod;
struct Matrix {
   
	int a[100][100];
	Matrix() {
    memset(a, 0, sizeof(a)); }
	int* operator[](int i) {
    return a[i]; }
	Matrix operator* (Matrix& A