当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5540:Secrete Master Plan

题目描述
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.

输入解释
The first line of the input gives the number of test cases, $T(1≤T≤10^4)$. $T$ test cases follow. Each test case contains 4 lines. Each line contains two integers $a_{i0}$ and $a_{i1}$ ($1≤a_{i0},a_{i1}≤100$). The first two lines stands for the original plan, the $3_{rd}$ and $4_{th}$ line stands for the plan Fei opened.
输出解释
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).
输入样例
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
来自杭电HDUOJ的附加信息
Recommend wange2014

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-5540

最后修改于 2020-10-25T23:23:35+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
3000/1000MS(Java/Others) 65535/65535K(Java/Others)