杭电5540 Secrete Master Plan
来源:互联网 发布:联想数据恢复中心电话 编辑:程序博客网 时间:2024/05/20 06:08
Secrete Master Plan
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 525 Accepted Submission(s): 299
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: 5659 5658 5657 5656 5654
问的是,给两个矩阵,问能不能通过旋转让两个矩阵重合:
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int p,a[40],b[40],i,j;int main(){scanf("%d",&p);for(int nn=1;nn<=p;nn++){scanf("%d%d%d%d",&a[0],&a[1],&a[3],&a[2]);scanf("%d%d%d%d",&b[0],&b[1],&b[3],&b[2]);int flag=0;int c[4];for(i=0;i<4;i++){for(j=0;j<4;j++){c[j]=a[(i+j)%4];if(c[j]!=b[j])break;}if(j==4)flag=1;}if(flag)printf("Case #%d: POSSIBLE\n",nn);elseprintf("Case #%d: IMPOSSIBLE\n",nn);}}
0 0
- 杭电5540 Secrete Master Plan
- HDU 5540 Secrete Master Plan
- hdu 5540/Secrete Master Plan
- HDU 5540 Secrete Master Plan
- HDU 5540 Secrete Master Plan(水)
- Secrete Master Plan HDU
- 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铜牌题 用%进行环的旋转)
- BlurringImage 平滑处理
- /bin,/sbin,/usr/sbin,/usr/bin 目录之简单区别
- 随堂笔记160323线程
- ionic $resource.query 访问,Access-Control-Allow-Origin问题
- some java summary
- 杭电5540 Secrete Master Plan
- [HDU 4855] Goddess (极角排序+三分)
- BZOJ 2731: [HNOI2012]三角形覆盖问题
- hibernate关于c3p0数据库连接池和二级缓存详解
- 选择排序
- c语言排序算法源代码
- 拉普拉斯算子
- 腾讯笔试题
- Atitit.web ui 组件化 vs mvc