HDU 4772 Zhuge Liang's Password

给你个方块反转三次，

#include<iostream>
#include<string>
#include<stdio.h>
#include<string.h>
#include<map>
#include<math.h>
#include<queue>
#include<algorithm>
#define LL long long
using namespace std;
const int maxn=33;
const int maxm=200210;
const int inf = 0xffffff;
int a[maxn][maxn],c[maxn][maxn];
int b[maxn][maxn];
int main(){
int n;
while(scanf("%d",&n)&&n){
for(int i=0;i<n;++i)
for(int j=0;j<n;++j){
scanf("%d",&a[i][j]);c[i][j]=a[i][j];
}
int ans=0,t=0;
for(int i=0;i<n;++i)
for(int j=0;j<n;++j){
scanf("%d",&b[i][j]);
if(a[i][j]==b[i][j]) t++;
}
ans=max(t,ans);
for(int k=0;k<3;++k){
t=0;
for(int i=0;i<n;++i){
for(int j=0;j<n;++j){
c[i][j]=a[n-j-1][i];
if(c[i][j]==b[i][j]) t++;
}
}
ans=max(ans,t);
for(int i=0;i<n;++i){
for(int j=0;j<n;++j) a[i][j]=c[i][j];
}
}
printf("%d\n",ans);
}
return 0;
}