HDU 4772 Zhuge Liang's Password(2013 Asia Hangzhou Regional Contest )
2016-10-07 16:49
411 查看
题目链接: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-10 using 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; }
相关文章推荐
- hdu4772 水题 Zhuge Liang's Password (2013 Asia Hangzhou Regional Contest problem C)
- HDU4772 2013 Asia Hangzhou Regional Contest C Zhuge Liang's Password
- HDU 4739 Zhuge Liang's Mines (2013 ACM/ICPC Asia Regional Hangzhou Online)
- 2013 Asia Hangzhou Regional Contest(HDU 4770 4771 4772 )
- HDU 4772 Zhuge Liang's Password 2013杭州现场赛
- HDU 4770 Lights Against Dudely(2013 Asia Hangzhou Regional Contest A)
- HDU 4770 Lights Against Dudely(2013 Asia Hangzhou Regional Contest)
- hdu 4778 Gems Fight! 2013 Asia Hangzhou Regional Contest
- HDU 4771 Stealing Harry Potter's Precious(2013 Asia Hangzhou Regional Contest )
- HDU 4793 Collision(计算几何)——2013 Asia Changsha Regional Contest
- HDU 4745 Two Rabbits(最长回文子序列)(2013 ACM/ICPC Asia Regional Hangzhou Online)
- HDU 4794 Arnold (Fib数模 n 的应用)——2013 Asia Changsha Regional Contest
- hdu 4772 Zhuge Liang's Password【模拟】水题
- HDU 2013 ACM/ICPC Asia Regional Hangzhou Online ------ Zhuge Liang's Mines
- HDU 3681 Prison Break 二分+搜索 The 35th ACM-ICPC Asia Regional Contest (Hangzhou)
- 2013 Asia Hangzhou Regional Contest
- hdu 4790 Just Random 2013 Asia Chengdu Regional Contest [数学]【思维】
- hdu 4745 Two Rabbits 2013 ACM/ICPC Asia Regional Hangzhou Online
- HDU 4744 Starloop System(最小费用最大流)(2013 ACM/ICPC Asia Regional Hangzhou Online)
- HDU 4798 Skycity (计算几何+推公式) 2013 Asia Changsha Regional Contest