HDU 4772 Zhuge Liang's Password

题目

旋转的公式：

x'=n+1-y

y'=x

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
#define MAXN 50

int n,a[4][MAXN][MAXN],b[MAXN][MAXN];
int main()
{
while (scanf("%d",&n)&&n)
{
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
scanf("%d",&a[0][i][j]);
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
scanf("%d",&b[i][j]);
for (int t=0;t<3;t++)
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
a[t+1][i][j]=a[t][j][n+1-i];
int ans=0;
for (int t=0;t<4;t++)
{
int tmp=0;
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (b[i][j]==a[t][i][j]) tmp++;
ans=max(ans,tmp);
}
printf("%d\n",ans);
}
return 0;
}