HDU5540 Secrete Master Plan(模拟)
来源:互联网 发布:淘宝店家联系方式 编辑:程序博客网 时间:2024/06/08 19:40
Secrete Master Plan
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1179 Accepted Submission(s): 694
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
/*思路:输入两组数据,每一组都是2*2的矩阵,是否可以通过第二个2*2的矩阵旋转得到第一个。注意输入的时候,要控制下,看这个例子1 23 4旋转一次以后为3 14 2可以发现,在输入的时候输入的顺序为1,2,4,3。即2*2矩阵对应的位置,然后旋转即可。注意旋转的最多次数,一个点只可能出现在四个位置,所以只需要旋转四次就可以了。*/#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#define ll long long#define PI acos(-1)#define M(n, m) memset(n, m, sizeof(n));const int INF = 1e9 + 7;const int maxn = 1e5 + 100;using namespace std;int main(){ int a[22], b[22]; int num; scanf("%d", &num); for (int k = 1; k <= num; k ++) { // 按照圈输入 cin >> a[1] >> a[2] >> a[4] >> a[3]; cin >> b[1] >> b[2] >> b[4] >> b[3]; bool flag = false; for (int i = 0;i <= 4;i ++) { if (a[1] == b[1] && a[2] == b[2] && a[3] == b[3] && a[4] == b[4]) { flag = true; printf("Case #%d: POSSIBLE\n", k); break; } // 交换位置 else { int t = b[1]; b[1] = b[2]; b[2] = b[3]; b[3] = b[4]; b[4] = t; } } if (!flag) printf("Case #%d: IMPOSSIBLE\n", k); } return 0;}
0 0
- HDU5540 Secrete Master Plan(模拟)
- HDU5540-Secrete Master Plan
- hdu5540 Secrete Master Plan--矩阵旋转
- HDU5540 Secrete Master Plan(水题)(2015CCPC)
- Secrete Master Plan (模拟)
- ccpc Secrete Master Plan(水模拟)
- 【HDU5540 2015 CCPC 南阳国赛A】【水题】Secrete Master Plan 矩形旋转
- hdu5540 Secrete Master Plan(The 2015 China Collegiate Programming Contest )
- Secrete Master Plan HDU
- UESTC 1215 Secrete Master Plan
- A - Secrete Master Plan【ccpc】
- HDU 5540 Secrete Master Plan
- 2015 CCPC Secrete Master Plan
- hdu 5540/Secrete Master Plan
- HDU 5540 Secrete Master Plan
- CDOJ 1215--Secrete Master Plan【水题】
- 2015南阳CCPC A - Secrete Master Plan
- 杭电5540 Secrete Master Plan
- 消息队列
- Dynamics CRM2016 通过web api来调用自定义action之global action
- hebernate提示主键ID这一列不能为null
- HDFS --操作命令详解
- jQuery Ajax Post 回调函数不执行问题的解决方法
- HDU5540 Secrete Master Plan(模拟)
- 使用cuda计算灰度图像
- Java应用Tomcat执行过程之性能调优
- Java Web 强制用户下线,在线用户数量
- Popupwindow里用EditText获取焦点弹出软键盘的问题
- 四款消息队列的比较
- 文本情感分析+python+正面和负面新闻+新浪微博+情感字典+机器学习
- 不得不看的Java代码性能优化总结
- Educational Codeforces Round 20 Maximal Binary Matrix