A7918 | Cubical Planet
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You can find anything whatsoever in our Galaxy! A cubical planet goes round an icosahedral star. Let us introduce a system of axes so that the edges of the cubical planet are parallel to the coordinate axes and two opposite vertices lay in the points $(0,0,0)$ and $(1,1,1)$ . Two flies live on the planet. At the moment they are sitting on two different vertices of the cubical planet. Your task is to determine whether they see each other or not. The flies see each other when the vertices they occupy lie on the same face of the cube.
输入格式
The first line contains three space-separated integers ( $0$ or $1$ ) — the coordinates of the first fly, the second line analogously contains the coordinates of the second fly.
输出格式
Output "YES" (without quotes) if the flies see each other. Otherwise, output "NO".
输入输出样例
输入 #1
0 0 0 0 1 0
输出 #1
YES
输入 #2
1 1 0 0 1 0
输出 #2
YES
输入 #3
0 0 0 1 1 1
输出 #3
NO
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted