Zhuge Liang’s Password

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 59    Accepted Submission(s): 47

Problem Description 　　In the ancient three kingdom period, Zhuge Liang was the most famous and smart military leader. His enemy was Sima Yi, the military leader of Kingdom Wei. Sima Yi always looked stupid when fighting against Zhuge Liang. But it was Sima Yi who laughed to the end. 

　　Zhuge Liang had led his army across the mountain Qi to attack Kingdom Wei for six times, which all failed. Because of the long journey, the food supply was a big problem. Zhuge Liang invented a kind of bull-like or horse-like robot called “Wooden Bull & Floating Horse”(in abbreviation, WBFH) to carry food for the army. Every WBFH had a password lock. A WBFH would move if and only if the soldier entered the password. Zhuge Liang was always worrying about everything and always did trivial things by himself. Since Ma Su lost Jieting and was killed by him, he didn’t trust anyone’s IQ any more. He thought the soldiers might forget the password of WBFHs. So he made two password cards for each WBFH. If the soldier operating a WBFH forgot the password or got killed, the password still could be regained by those two password cards.

　　Once, Sima Yi defeated Zhuge Liang again, and got many WBFHs in the battle field. But he didn’t know the passwords. Ma Su’s son betrayed Zhuge Liang and came to Sima Yi. He told Sima Yi the way to figure out the password by two cards.He said to Sima Yi: 

　　”A password card is a square grid consisting of N×N cells.In each cell,there is a number. Two password cards are of the same size. If you overlap them, you get two numbers in each cell. Those two numbers in a cell may be the same or not the same. You can turn a card by 0 degree, 90 degrees, 180 degrees, or 270 degrees, and then overlap it on another. But flipping is not allowed. The maximum amount of cells which contains two equal numbers after overlapping, is the password. Please note that the two cards must be totally overlapped. You can’t only overlap a part of them.”

　　Now you should find a way to figure out the password for each WBFH as quickly as possible.  

Input 　　There are several test cases.

　　In each test case:

　　The first line contains a integer N, meaning that the password card is a N×N grid(0<N<=30).

　　Then a N×N matrix follows ,describing a password card. Each element is an integer in a cell. 

　　Then another N×N matrix follows, describing another password card. 

　　Those integers are all no less than 0 and less than 300.

　　The input ends with N = 0  

Output 　　For each test case, print the password.  

Sample Input 2 1 2 3 4 5 6 7 8 2 10 20 30 13 90 10 13 21 0  

Sample Output 0 2  

Source
2013 Asia Hangzhou Regional Contest  

水题。。。

写个函数进行旋转就可以了。

 1 /* ***********************************************
 2 Author        :kuangbin
 3 Created Time  :2013-11-9 12:44:06
 4 File Name     :E:\2013ACM\专题强化训练\区域赛\2013杭州\1003.cpp
 5 ************************************************ */
 6 
 7 #include <stdio.h>
 8 #include <string.h>
 9 #include <iostream>
10 #include <algorithm>
11 #include <vector>
12 #include <queue>
13 #include <set>
14 #include <map>
15 #include <string>
16 #include <math.h>
17 #include <stdlib.h>
18 #include <time.h>
19 using namespace std;
20 
21 const int MAXN  = 33;
22 int a[MAXN][MAXN];
23 int b[MAXN][MAXN];
24 int n;
25 void change()
26 {
27     int c[MAXN][MAXN];
28     for(int i = 0;i < n;i++)
29         for(int j = 0;j < n;j++)
30         {
31             c[i][j] = a[n-1-j][i];
32         }
33     for(int i = 0;i < n;i++)
34         for(int j = 0;j < n;j++)
35             a[i][j] = c[i][j];
36 }
37 
38 
39 int main()
40 {
41     //freopen("in.txt","r",stdin);
42     //freopen("out.txt","w",stdout);
43     while(scanf("%d",&n) == 1 && n)
44     {
45         for(int i = 0;i < n;i++)
46             for(int j = 0;j < n;j++)
47                 scanf("%d",&a[i][j]);
48         for(int i = 0;i < n;i++)
49             for(int j = 0;j < n;j++)
50                 scanf("%d",&b[i][j]);
51         int ans = 0;
52         for(int k = 0;k < 4;k++)
53         {
54             int cnt = 0;
55             for(int i = 0;i < n;i++)
56                 for(int j = 0 ;j < n;j++)
57                     if(a[i][j] == b[i][j])
58                         cnt++;
59             ans = max(ans,cnt);
60             change();
61         }
62         printf("%d\n",ans);
63     }
64     return 0;
65 }