题目1164：旋转矩阵

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <stack>
#include <sstream>
using namespace std;
//1164
int m1[10][10],m2[10][10];
bool isSame(int n){
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            if(m1[i][j]!=m2[i][j])
                return false;
    return true;
}
 
void change(int n){
    int tmp[10][10];
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            tmp[i][j]=m1[i][j];
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            m1[i][j]=tmp[n+1-j][i];
}
 
int n;
int main(){
   // freopen("input.txt","r",stdin);
    while(scanf("%d",&n)!=EOF){
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                scanf("%d",&m1[i][j]);
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                scanf("%d",&m2[i][j]);
        int k=0;
        for(k=0;k<=3;k++){
            if(isSame(n)) {printf("%d",k*90);break;}
            else    change(n);
        }
        if(k==4)    printf("-1");
        printf("\n");
    }
    return 0;
}
/**************************************************************
    Problem: 1164
    User: cust123
    Language: C++
    Result: Accepted
    Time:0 ms
    Memory:1520 kb
****************************************************************/