The 2015 China Collegiate Programming Contest A. Secrete Master Plan hdu5540

Secrete Master Plan

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 429    Accepted Submission(s): 244

Problem Description

Master Mind KongMing gave Fei Zhang a secrete master plan stashed in a pocket. The plan instructs how to deploy soldiers on the four corners of the city wall. Unfortunately, when Fei opened the pocket he found there are only four numbers written in dots on a piece of sheet. The numbers form 2×2 matrix, but Fei didn't know the correct direction to hold the sheet. What a pity!

Given two secrete master plans. The first one is the master's original plan. The second one is the plan opened by Fei. As KongMing had many pockets to hand out, he might give Fei the wrong pocket. Determine if Fei receives the right pocket.

 

Input

The first line of the input gives the number of test cases, T(1≤T≤104). T test cases follow. Each test case contains 4 lines. Each line contains two integers ai0and ai1 (1≤ai0,ai1≤100). The first two lines stands for the original plan, the 3rd and 4th line stands for the plan Fei opened.

 

Output

For each test case, output one line containing "Case #x: y", where x is the test case number
(starting from 1) and y is either "POSSIBLE" or "IMPOSSIBLE" (quotes for clarity).

 

Sample Input

4
1 2
3 4
1 2
3 4

1 2
3 4
3 1
4 2

1 2
3 4
3 2
4 1

1 2
3 4
4 3
2 1

 

Sample Output

Case #1: POSSIBLE
Case #2: POSSIBLE
Case #3: IMPOSSIBLE
Case #4: POSSIBLE

 

Source

The 2015 China Collegiate Programming Contest

 

题意：问一个矩阵旋转之后是否与另一个矩阵相等。

分析：暴力。

 #include <cstdio>
 #include <iostream>
 using namespace std;

 const int N = ;
 int A[][], B[][], T[][];

 int main()
 {
     int test;
     scanf("%d", &test);
     for(int testnumber = ; testnumber <= test; testnumber++)
     {
         for(int i = ; i < ; i++)
             for(int j = ; j < ; j++)
                 scanf("%d", &A[i][j]);
         for(int i = ; i < ; i++)
             for(int j = ; j < ; j++)
                 scanf("%d", &B[i][j]);

         bool flag = ;
         for(int k = ; k < ; k++)
         {
             T[][] = B[][];
             T[][] = B[][];
             T[][] = B[][];
             T[][] = B[][];

             for(int i = ; i < ; i++)
                 for(int j = ; j < ; j++)
                     B[i][j] = T[i][j];

             /*for(int i = 0; i < 2; i++)
             {
                 for(int j = 0; j < 2; j++)
                     printf("%d ", B[i][j]);
                 printf("\n");
             }*/

             bool okay = ;
             for(int i = ; i <  && !okay; i++)
                 for(int j = ; j < ; j++)
                     if(A[i][j] != B[i][j])
                     {
                         okay = ;
                         break;
                     }
             if(!okay)
             {
                 flag = ;
                 break;
             }
         }
         if(!flag) printf("Case #%d: POSSIBLE\n", testnumber);
         else printf("Case #%d: IMPOSSIBLE\n", testnumber);
     }
     return ;
 }