关键点：

1.找到旋转90度的规律

2.如何比较数组相等

tip：采用vector容器代替数组

#include<bits/stdc++.h>
using namespace std;

// 顺时针旋转90度
vector<vector<int>> rotate90(const vector<vector<int>>& a) {
    int n = a.size();
    vector<vector<int>> res(n, vector<int>(n));
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
            res[j][n - 1 - i] = a[i][j];
    return res;
}

int main(){
	
	int n;
	while(cin >> n){
		vector<vector<int>> a(n, vector<int>(n)), b(n, vector<int>(n));
		
		// 读入矩阵a
        for (int i = 0; i < n; ++i)
            for (int j = 0; j < n; ++j)
                cin >> a[i][j];

        // 读入矩阵b
        for (int i = 0; i < n; ++i)
            for (int j = 0; j < n; ++j)
                cin >> b[i][j];

        if (a == b) {
            cout << 0 << '\n';
            continue;
        }

        auto ...