A11067 | Fake NP
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Tavak and Seyyed are good friends. Seyyed is very funny and he told Tavak to solve the following problem instead of longest-path.
You are given $l$ and $r$ . For all integers from $l$ to $r$ , inclusive, we wrote down all of their integer divisors except $1$ . Find the integer that we wrote down the maximum number of times.
Solve the problem to show that it's not a NP problem.
You are given $l$ and $r$ . For all integers from $l$ to $r$ , inclusive, we wrote down all of their integer divisors except $1$ . Find the integer that we wrote down the maximum number of times.
Solve the problem to show that it's not a NP problem.
输入格式
The first line contains two integers $l$ and $r$ ( $2<=l<=r<=10^{9}$ ).
输出格式
Print single integer, the integer that appears maximum number of times in the divisors.
If there are multiple answers, print any of them.
If there are multiple answers, print any of them.
输入输出样例
输入 #1
19 29
输出 #1
2
输入 #2
3 6
输出 #2
3
Definition of a divisor: <https://www.mathsisfun.com/definitions/divisor-of-an-integer-.html>
The first example: from $19$ to $29$ these numbers are divisible by $2$ : ${20,22,24,26,28}$ .
The second example: from $3$ to $6$ these numbers are divisible by $3$ : ${3,6}$ .
The first example: from $19$ to $29$ these numbers are divisible by $2$ : ${20,22,24,26,28}$ .
The second example: from $3$ to $6$ these numbers are divisible by $3$ : ${3,6}$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted