题库练习 Three Garlands
← 上一题 下一题 →

A11532 | Three Garlands

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Mishka is decorating the Christmas tree. He has got three garlands, and all of them will be put on the tree. After that Mishka will switch these garlands on.

When a garland is switched on, it periodically changes its state — sometimes it is lit, sometimes not. Formally, if $i$ -th garland is switched on during $x$ -th second, then it is lit only during seconds $x$ , $x+k_{i}$ , $x+2k_{i}$ , $x+3k_{i}$ and so on.

Mishka wants to switch on the garlands in such a way that during each second after switching the garlands on there would be at least one lit garland. Formally, Mishka wants to choose three integers $x_{1}$ , $x_{2}$ and $x_{3}$ (not necessarily distinct) so that he will switch on the first garland during $x_{1}$ -th second, the second one — during $x_{2}$ -th second, and the third one — during $x_{3}$ -th second, respectively, and during each second starting from $max(x_{1},x_{2},x_{3})$ at least one garland will be lit.

Help Mishka by telling him if it is possible to do this!

输入格式

The first line contains three integers $k_{1}$ , $k_{2}$ and $k_{3}$ ( $1<=k_{i}<=1500$ ) — time intervals of the garlands.

输出格式

If Mishka can choose moments of time to switch on the garlands in such a way that each second after switching the garlands on at least one garland will be lit, print YES.

Otherwise, print NO.

输入输出样例

输入 #1
2 2 3
输出 #1
YES
输入 #2
4 2 3
输出 #2
NO
C++ 编辑器
输入
输出