HDU 4772 Zhuge Liang's Password(2013 Asia Hangzhou Regional Contest )

来源:互联网 发布:linux运行shell脚本 编辑:程序博客网 时间:2024/06/05 19:35

题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=4772

#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<string>#include<algorithm>#include<queue>#include<stack>#include<vector>#include<set>#include<map>#include<list>#define mem(x,y)memset(x,y,sizeof(x))#define max(a,b)(a)>(b)?(a):(b)#define min(a,b)(a)<(b)?(a):(b)#define INF 0x1f1f1f1f#define M 10000007#define eps 1e-10using namespace std;typedef long long int LL;typedef __int64 ll;const int maxn=1005;int aa[32][32];int bb[32][32];int cc[32][32];int dd[32][32];int main(){    int n,m,k;    while(~scanf("%d",&n)&&n)    {        for(int i=1; i<=n; i++)        {            for(int j=1; j<=n; j++)            {                scanf("%d",&aa[i][j]);            }        }        for(int i=1; i<=n; i++)        {            for(int j=1; j<=n; j++)            {                scanf("%d",&bb[i][j]);            }        }        int ans=-1;        int sum=0;        for(int i=1; i<=n; i++)        {            for(int j=1; j<=n; j++)            {                if(aa[i][j]==bb[i][j])                    sum++;            }        }        ans=max(ans,sum);        sum=0;        for(int i=1; i<=n; i++)        {            for(int j=1; j<=n; j++)            {                cc[i][j]=bb[j][n+1-i];                if(cc[i][j]==aa[i][j])                    sum++;            }        }        ans=max(ans,sum);        sum=0;        for(int i=1; i<=n; i++)        {            for(int j=1; j<=n; j++)            {                dd[i][j]=cc[j][n+1-i];                if(dd[i][j]==aa[i][j])                    sum++;            }        }        ans=max(ans,sum);        sum=0;        for(int i=1; i<=n; i++)        {            for(int j=1; j<=n; j++)            {                cc[i][j]=dd[j][n+1-i];                if(cc[i][j]==aa[i][j])                    sum++;            }        }        ans=max(ans,sum);        printf("%d\n",ans);    }    return 0;}
0 0
原创粉丝点击