HDU 5540 Secrete Master Plan
来源:互联网 发布:手机锁机软件 编辑:程序博客网 时间:2024/06/05 18:31
Secrete Master Plan
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1281 Accepted Submission(s): 762
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.
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 ai0 and 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) andy is either "POSSIBLE" or "IMPOSSIBLE" (quotes for clarity).
(starting from 1) and
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: 6079 6078 6077 6076 6075
网上说是水题,但是我对这种题一直有毒,3遍才交上,一切尽在代码中
#include <cstdio>#include <cstring>#include <algorithm>#include <queue>using namespace std;int t,a[5],b[5];int cas=0,tmp;int check(){for(int i=0;i<4;i++){int j;for(j=0;j<4;j++){if(a[(i+j)%4]!=b[j])break ;}if(j==4)return 1;}return 0;}int main(){scanf("%d",&t);while(t--){for(int i=0;i<4;i++){scanf("%d",a+i);}tmp=a[2];a[2]=a[3];a[3]=tmp;for(int i=0;i<4;i++){scanf("%d",b+i);}tmp=b[2];b[2]=b[3];b[3]=tmp;int flag=check();printf("Case #%d: ",++cas);if(flag){printf("POSSIBLE\n");}else{printf("IMPOSSIBLE\n");}}return 0;}
阅读全文
1 0
- HDU 5540 Secrete Master Plan
- hdu 5540/Secrete Master Plan
- HDU 5540 Secrete Master Plan
- Secrete Master Plan HDU
- HDU 5540 Secrete Master Plan(水)
- 杭电5540 Secrete Master Plan
- HDU5540-Secrete Master Plan
- UESTC 1215 Secrete Master Plan
- A - Secrete Master Plan【ccpc】
- 2015 CCPC Secrete Master Plan
- Secrete Master Plan (模拟)
- HDU5540 Secrete Master Plan(模拟)
- hdoj Secrete Master Plan 5540 (矩阵翻转)
- CDOJ 1215--Secrete Master Plan【水题】
- ccpc Secrete Master Plan(水模拟)
- 2015南阳CCPC A - Secrete Master Plan
- hdu5540 Secrete Master Plan--矩阵旋转
- HDOJ 5540 Secrete Master Plan(qwb铜牌题 用%进行环的旋转)
- spring mvc 之mvc:annotation-driven
- 3339: Rmq Problem/3585: mex
- 关于JQuery的post回调函数不执行问题
- switch语句
- LintCode508
- HDU 5540 Secrete Master Plan
- spring框架对 remoting 支持的总结
- 六、基础教程-标题(Title)
- 苦橙花---不喧哗,自有声
- 百度之星2017资格赛 1003 度度熊与邪恶大魔王 完全背包
- OpenCV实现漫水填充(待完善)
- 最小生成树模板 并查集
- Super、Final、this关键字
- BZOJ 2440 [中山市选2011]完全平方数 (容斥)