UESTC 1215 (思维题 旋转)
2016-04-23 19:55
585 查看
Secrete Master Plan
Time Limit: 3000/1000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others)Submit Status
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 a 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.
![](http://acm.uestc.edu.cn/images/problem/1215/201510201718056613.png)
Input
The first line of the input gives the number of test cases, TT(1≤T≤1041≤T≤104). TT test cases follow. Each test case contains 44 lines. Each line contains two integers ai0ai0 and ai1ai1 (1≤ai0,ai1≤1001≤ai0,ai1≤100). The first two lines stands for the original plan, the 3rd3rd and 4th4th line stands for the plan Fei opened.Output
For each test case, output one line containingCase #x: y, where xx is the test case number (starting from 11) and yy is either "
POSSIBLE" or "
IMPOSSIBLE" (quotes for clarity).
Sample input and output
Sample Input | Sample Output |
---|---|
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 | Case #1: POSSIBLE Case #2: POSSIBLE Case #3: IMPOSSIBLE Case #4: POSSIBLE |
Source
The 2015 China Collegiate Programming Contest#include <iostream> using namespace std; int main() { int t,a,b,c,d,x,y,z,w,tmp,k=1; cin>>t; while(t--) { int flag=0; cin>>a>>b>>d>>c; cin>>x>>y>>w>>z; while (a!=x||b!=y||d!=w||c!=z) { tmp=a; a=b; b=c; c=d; d=tmp; flag++; if (flag==4) break; } if (flag<4) { cout<<"Case #"<<k++<<": POSSIBLE"<<endl; } else cout<<"Case #"<<k++<<": IMPOSSIBLE"<<endl; } return 0; }
相关文章推荐
- build android N for RPI3
- 项目--Unable to convert MySQL date/time value to System.DateTime
- HDU1297 Children’s Queue (高精度+递推)
- Android 高级UI设计笔记11:Gallery(画廊控件)之Gallery基本使用
- UI组件(思维导图)
- 新人刚开始学习java总结一下StringBuffer和StringBuilder的区别及一些知识,不对的地方还望大家指出让我早日改正
- Masonry适配——(4)UIScrollView的设置
- 共同学习Java源代码--常用工具类--AbstractStringBuilder(五)
- 异步消息处理机制
- easyui-textbox添加validType使maxlength失效
- ios UITableView实现单击提示,滑动删除,多选行等操作
- UI控件--桌面小组件(1)
- androidStudio出现java.exe finished with non-zero eit value 1
- 使用TexturePackerGUI配合NGUI打包图集
- Vue 过渡
- LeetCode *** 60. Permutation Sequence
- 1012 Rescue
- Vue 表单控件绑定
- Rebuild Future
- Vue 方法与事件处理器