RT

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define line cout << endl
#define ll long long
#define MOD 1000000007
using namespace std;
const int NR = 105;
int n;
struct Array
{
    ll a[NR][NR];
    Array() {
        memset(a, 0, sizeof(a));
    }
    void build() {
        for(int i = 1; i <= n; i++) a[i][i]=1;
    }
    void in() {
    	for(int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++) {
			   cin >> array.a[i][j];
			}
	}
	void out() {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				cout << array.a[i][j];
			}
			line;
		}
	}
	Array operator * (const Array &x,const Array &y) const {//这里报错惹 qwq
		Array ans;
		for(int k = 1; k <= n; k++)
			for(int i = 1; i <= n; i++)
				for(int j = 1; j <= n; j++)
					ans.a[i][j] = (ans.a[i][j] + x.a[i][k] * y.a[k][j] % MOD) % MOD;
		return ans;
	}
};


ll k;
int main() {
	cin >> n;
	Array array_a, array_b, array_ans;
	array_ans.build();
	array_a.in();
	array_b.in();
	array_ans = array_a * array_b;
	array_ans.out();
	return 0;
}

报错惹 qwq

请求大佬查查错 QAQ