CF39D.Cubical Planet

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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
```

首页