CF805A.Fake NP

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

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.

输入格式

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.

输入输出样例

输入#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}$ .

首页