A

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×22×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(1≤T≤104). TT test cases follow. Each test case contains 4 lines. Each line contains two integers ai0ai0and ai1ai1 (1≤ai0,ai1≤1001≤ai0,ai1≤100). The first two lines stands for the original plan, the 3rd3rdand 4th4th 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 yy is either "POSSIBLE" or "IMPOSSIBLE" (quotes for clarity).

Sample Input

41 23 41 23 41 23 43 14 21 23 43 24 11 23 44 32 1

Sample Output

Case #1: POSSIBLECase #2: POSSIBLECase #3: IMPOSSIBLECase #4: POSSIBLE

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

水题，问你第一个矩阵能不能旋转成第二个矩阵，矩阵保证2*2

代码：

#include <iostream>#include <cstdio>using namespace std;int a[4],b[4];bool check(){if(a[0]==b[0]&&a[1]==b[1]&&a[2]==b[2]&&a[3]==b[3])return 1;if(a[0]==b[2]&&a[1]==b[0]&&a[2]==b[3]&&a[3]==b[1])return 1;if(a[0]==b[3]&&a[1]==b[2]&&a[2]==b[1]&&a[3]==b[0])return 1;if(a[0]==b[1]&&a[1]==b[3]&&a[2]==b[0]&&a[3]==b[2])return 1;return 0;}int main(){    int t;    scanf("%d",&t);    for(int i=1;i<=t;++i)    {for(int j=0;j<4;++j)scanf("%d",&a[j]);for(int j=0;j<4;++j)scanf("%d",&b[j]);printf("Case #%d: ",i);if(check())puts("POSSIBLE");else puts("IMPOSSIBLE");    }    return 0;}