AcWing 3527. 旋转矩阵

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

const int N = 15;

int n;
int a[N][N], b[N][N], t[N][N];
int k;

int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= n; j ++ )
            scanf("%d", &a[i][j]);

    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= n; j ++ )
            scanf("%d", &t[i][j]);

    bool flag;
    for (k = 0; k <= 3; k ++ ) {
        flag = true;
        for (int i = 1; i <= n; i ++ ) {
            for (int j = 1; j <= n; j ++ ) {
                if (a[i][j] != t[i][j]) {
                    flag = false;
                    break;
                }
            }
            if (!flag) break;
        }

        if (flag) break;

        for (int i = 1, j = n; i <= n; i ++ , j -- )
            for (int p = 1; p <= n; p ++ )
                b[p][j] = a[i][p];

        for (int i = 1; i <= n; i ++ )
            for (int j = 1; j <= n; j ++ )
                a[i][j] = b[i][j];
    }

    if (flag) printf("%d\n", 90 * k);
    else printf("-1\n");

    return 0;
}