题解 | 旋转矩阵

#include<iostream>
#include<vector>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<vector<int>> v(n, vector<int>(n));
	vector<vector<int>> v2(n, vector<int>(n));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cin >> v[i][j];
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cin >> v2[i][j];
		}
	}
	int count1 = 0;
	int count2 = 0;
	int count3 = 0;
	int count4 = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (v2[j][n - i - 1] == v[i][j]) {
				count1++;
			}
			if (v2[n - j - 1][i] == v[i][j]) {
				count2++;
			}
			if (v2[n - i - 1][n - j - 1] == v[i][j]) {
				count3++;
			}
			if (v2[i][j] == v[i][j]) {
				count4++;
			}
		}
	}
	if (count4 == n * n) {
		cout << 0;
	}
	else if (count2 == n * n) {
		cout << 270;
	}
	else if (count3 == n * n) {
		cout << 180;
	}
	else if (count1 == n * n) {
		cout << 90;
	}
	else {
		cout << -1;
	}

}