BZOJ4128: Matrix 矩阵BSGS

A^x=B(mod C)

令x=im-j

A^(im)=BA^j(mod C)

这就不用求逆元了

#include<bits/stdc++.h>
#include<stdio.h>
#include<algorithm>
#include<queue>
#include<string.h>
#include<iostream>
#include<math.h>
#include<set>
#include<map>
#include<vector>
#include<iomanip>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define FOR(a) for(int i=1;i<=a;i++)
const int inf=0x3f3f3f3f;
const ll Linf=9e18;
const int maxn=1e6+7; 
const ll mod=1e9+7;
const double eps=1e-6;

#define base 231
ll n,p;
struct MATRIX{
	ll x[80][80];
	void init(){memset(x,0,sizeof x);}
	MATRIX operator * (MATRIX a){
		MATRIX ret;
		ret.init();
		FOR(n)for(int j=1;j<=n;j++){
			for(int k=1;k<=n;k++)ret.x[i][j]=ret.x[i][j]+x[i][k]*a.x[k][j];
			ret.x[i][j