HDU5540 Secrete Master Plan(水题)（2015CCPC）

题目：

Secrete Master Plan

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

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

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

 

Source

The 2015 China Collegiate Programming Contest

 

Recommend

wange2014   |   We have carefully selected several similar problems for you:  6022 6021 6020 6019 6018 

 

Statistic | Submit | Discuss | Note思路：

题意就是给了你两组数，每组数两排，问你上面的那一排数能不能通过顺时针或者逆时针旋转得到下一组数，水题，直接上队友代码

代码：

#include <cstdio>#include <cstring>#include <cctype>#include <string>#include <set>#include <iostream>#include <stack>#include <cmath>#include <queue>#include <vector>#include <algorithm>#define mem(a,b) memset(a,b,sizeof(a))#define inf 0x3f3f3f3f#define mod 10000007#define debug() puts("what the fuck!!!")#define N 200200#define M 1000000#define ll long longusing namespace std;int main(){    int t,k=0;    scanf("%d",&t);    while(t--)    {        printf("Case #%d: ",++k);        int a[5],b[5];        scanf("%d%d%d%d",&a[1],&a[2],&a[3],&a[4]);        scanf("%d%d%d%d",&b[1],&b[2],&b[3],&b[4]);        if(a[1]==b[1]&&a[2]==b[2]&&a[4]==b[4]&&a[3]==b[3])            printf("POSSIBLE\n");        else if(a[1]==b[2]&&a[2]==b[4]&&a[4]==b[3]&&a[3]==b[1])            printf("POSSIBLE\n");        else if(a[1]==b[4]&&a[2]==b[3]&&a[4]==b[1]&&a[3]==b[2])            printf("POSSIBLE\n");        else if(a[1]==b[3]&&a[2]==b[1]&&a[4]==b[2]&&a[3]==b[4])            printf("POSSIBLE\n");        else            printf("IMPOSSIBLE\n");    }    return 0;}