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!
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.
Otherwise, print NO.
输入输出样例
输入 #1
2 2 3
输出 #1
YES
输入 #2
4 2 3
输出 #2
NO
In the first example Mishka can choose $x_{1}=1$ , $x_{2}=2$ , $x_{3}=1$ . The first garland will be lit during seconds $1,3,5,7,...$ , the second — $2,4,6,8,...$ , which already cover all the seconds after the $2$ -nd one. It doesn't even matter what $x_{3}$ is chosen. Our choice will lead third to be lit during seconds $1,4,7,10,...$ , though.
In the second example there is no way to choose such moments of time, there always be some seconds when no garland is lit.
In the second example there is no way to choose such moments of time, there always be some seconds when no garland is lit.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted