Problem B. Fake NP

时间限制 1000 ms   内存限制 256 MB

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 ≤ 109).

输出数据

Print single integer, the integer that appears maximum number of times in the divisors.

If there are multiple answers, print any of them.

样例

样例说明

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}.

"); $(this).append($copy); var clipboard = new Clipboard('#' + cpyId, { text: function(trigger) { return document.querySelector('#' + preId).innerText; } }); var isInput = $(this).parent().hasClass("input"); clipboard.on('success', function(e) { if (isInput) { Codeforces.showMessage("The example input has been copied into the clipboard"); } else { Codeforces.showMessage("The example output has been copied into the clipboard"); } e.clearSelection(); }); }); autosize($('.test-explanation textarea')); });

提交

请先 登录

© 2025 FAQs Contact About