A8104 | Panoramix's Prediction
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
A prime number is a number which has exactly two distinct divisors: one and itself. For example, numbers $2$ , $7$ , $3$ are prime, and $1$ , $6$ , $4$ are not.
The next prime number after $x$ is the smallest prime number greater than $x$ . For example, the next prime number after $2$ is $3$ , and the next prime number after $3$ is $5$ . Note that there is exactly one next prime number after each number. So $5$ is not the next prime number for $2$ .
One cold April morning Panoramix predicted that soon Kakofonix will break free from his straitjacket, and this will be a black day for the residents of the Gallic countryside.
Panoramix's prophecy tells that if some day Asterix and Obelix beat exactly $x$ Roman soldiers, where $x$ is a prime number, and next day they beat exactly $y$ Roman soldiers, where $y$ is the next prime number after $x$ , then it's time to wait for Armageddon, for nothing can shut Kakofonix up while he sings his infernal song.
Yesterday the Gauls beat $n$ Roman soldiers and it turned out that the number $n$ was prime! Today their victims were a troop of $m$ Romans ( $m>n$ ). Determine whether the Gauls should wait for the black day after today's victory of Asterix and Obelix?
The next prime number after $x$ is the smallest prime number greater than $x$ . For example, the next prime number after $2$ is $3$ , and the next prime number after $3$ is $5$ . Note that there is exactly one next prime number after each number. So $5$ is not the next prime number for $2$ .
One cold April morning Panoramix predicted that soon Kakofonix will break free from his straitjacket, and this will be a black day for the residents of the Gallic countryside.
Panoramix's prophecy tells that if some day Asterix and Obelix beat exactly $x$ Roman soldiers, where $x$ is a prime number, and next day they beat exactly $y$ Roman soldiers, where $y$ is the next prime number after $x$ , then it's time to wait for Armageddon, for nothing can shut Kakofonix up while he sings his infernal song.
Yesterday the Gauls beat $n$ Roman soldiers and it turned out that the number $n$ was prime! Today their victims were a troop of $m$ Romans ( $m>n$ ). Determine whether the Gauls should wait for the black day after today's victory of Asterix and Obelix?
输入格式
The first and only input line contains two positive integers — $n$ and $m$ ( $2<=n<m<=50$ ). It is guaranteed that $n$ is prime.
Pretests contain all the cases with restrictions $2<=n<m<=4$ .
Pretests contain all the cases with restrictions $2<=n<m<=4$ .
输出格式
Print YES, if $m$ is the next prime number after $n$ , or NO otherwise.
输入输出样例
输入 #1
3 5
输出 #1
YES
输入 #2
7 11
输出 #2
YES
输入 #3
7 9
输出 #3
NO
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted