CF1866L.Lihmuf Balling
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
After working at a factory (Lihmuf Sorting), Lihmuf wants to play a game with his good friend, Pak Chanek. There are N boxes numbered from 1 to N . The i -th box contains i balls. Pak Chanek and Lihmuf will play a game using those boxes.
There will be N turns numbered from 1 to N . On each turn, Pak Chanek chooses one box and takes all balls from that box, then Lihmuf does the same thing for one box he chooses (it is possible that the two chosen boxes are the same).
Given an integer M . Before the game begins, Lihmuf must choose an integer K satisfying 1≤K≤M . It is known that on the j -th turn, Pak Chanek will choose the j -th box, while Lihmuf will choose the y -th box, with y=((j×K−1)modN)+1 . Help Lihmuf choose the correct value of K so that he will get as many balls as possible! If there are more than one possible values of K that result in the maximum total balls, find the minimum such value of K .
Keep in mind that each box can be chosen more than once, but after a box is chosen for the first time, the box becomes empty.
输入格式
The only line contains two integers N and M ( 1≤N≤109 ; 1≤M≤2000 ) — the number of boxes and the maximum limit for the value of K .
输出格式
An integer representing the value of K that will make Lihmuf get as many balls as possible. If there are more than one possible value of K that result in the maximum total balls, find the minimum such value of K .
输入输出样例
输入#1
3 1
输出#1
1
输入#2
5 4
输出#2
3
说明/提示
In the first example, if Lihmuf chooses K=1 , the game will go as follows:
- Pak Chanek chooses the 1 -st box and gets 1 ball, then Lihmuf chooses the 1 -st box and gets 0 balls.
- Pak Chanek chooses the 2 -nd box and gets 2 balls, then Lihmuf chooses the 2 -nd box and gets 0 balls.
- Pak Chanek chooses the 3 -rd box and gets 3 balls, then Lihmuf chooses the 3 -rd box and gets 0 balls.
In total, Lihmuf gets 0+0+0=0 balls.
The maximum total balls that can be earned by Lihmuf is 0 because he can only choose K=1 . Therefore, K=1 is the minimum possible value of K that results in the maximum total balls.
In the second example, if Lihmuf chooses K=3 , the game will go as follows:
- Pak Chanek chooses the 1 -st box and gets 1 ball, then Lihmuf chooses the 3 -rd box and gets 3 balls.
- Pak Chanek chooses the 2 -nd box and gets 2 balls, then Lihmuf chooses the 1 -st box and gets 0 balls.
- Pak Chanek chooses the 3 -rd box and gets 0 balls, then Lihmuf chooses the 4 -th box and gets 4 balls.
- Pak Chanek chooses the 4 -th box and gets 0 balls, then Lihmuf chooses the 2 -nd box and gets 0 balls.
- Pak Chanek chooses the 5 -th box and gets 5 balls, then Lihmuf chooses the 5 -th box and gets 0 balls.
In total, Lihmuf gets 3+0+4+0+0=7 balls.
It can be obtained that 7 is the maximum total balls that can be earned by Lihmuf. The possible values of K that result in 7 total balls are 3 and 4 . Therefore, K=3 is the minimum possible value of K that results in the maximum total balls.