hdu4772 Zhuge Liang's Password

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <set>
#include <stack>
#include <map>
using namespace std;
const int maxn = 50;
int a[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]);
        for(int i=0;i<n;i  )
            for(int j=0;j<n;j  )
                scanf("%d",&b[i][j]);
        int ans = 0;
        int tmp = 0;
        for(int i=0;i<n;i  )
        {
            for(int j=0;j<n;j  )
            {
                if(a[i][j]==b[i][j])
                    tmp  ;
            }
        }
        ans = max(ans,tmp);
        tmp = 0;
        for(int i=0;i<n;i  )
        {
            for(int j=0;j<n;j  )
            {
                if(a[i][j]==b[j][n-1-i])
                    tmp  ;
                //printf("%d ",b[j][n-1-i]);
            }
            //puts("");
        }
        ans = max(ans,tmp);
        tmp = 0;
        for(int i=0;i<n;i  )
        {
            for(int j=0;j<n;j  )
            {
                if(a[i][j]==b[n-1-i][n-1-j])
                    tmp  ;
                //printf("%d ",b[n-1-i][n-1-j]);
            }
            //puts("");
        }
        ans = max(ans,tmp);
        tmp = 0;
        for(int i=0;i<n;i  )
        {
            for(int j=0;j<n;j  )
            {
                if(a[i][j]==b[n-1-j][i])
                    tmp  ;
                //printf("%d ",b[n-1-j][i]);
            }
            //puts("");
        }
        ans = max(ans,tmp);
        printf("%d\n",ans);
    }
    return 0;
}