A16260 | Lihmuf Balling
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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 \leq K \leq 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 \times K - 1) \bmod N) + 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.
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 \leq K \leq 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 \times K - 1) \bmod N) + 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 \leq N \leq 10^9$ ; $1 \leq M \leq 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:
1. Pak Chanek chooses the $1$ -st box and gets $1$ ball, then Lihmuf chooses the $1$ -st box and gets $0$ balls.
2. Pak Chanek chooses the $2$ -nd box and gets $2$ balls, then Lihmuf chooses the $2$ -nd box and gets $0$ balls.
3. 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:
1. Pak Chanek chooses the $1$ -st box and gets $1$ ball, then Lihmuf chooses the $3$ -rd box and gets $3$ balls.
2. Pak Chanek chooses the $2$ -nd box and gets $2$ balls, then Lihmuf chooses the $1$ -st box and gets $0$ balls.
3. Pak Chanek chooses the $3$ -rd box and gets $0$ balls, then Lihmuf chooses the $4$ -th box and gets $4$ balls.
4. Pak Chanek chooses the $4$ -th box and gets $0$ balls, then Lihmuf chooses the $2$ -nd box and gets $0$ balls.
5. 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.
1. Pak Chanek chooses the $1$ -st box and gets $1$ ball, then Lihmuf chooses the $1$ -st box and gets $0$ balls.
2. Pak Chanek chooses the $2$ -nd box and gets $2$ balls, then Lihmuf chooses the $2$ -nd box and gets $0$ balls.
3. 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:
1. Pak Chanek chooses the $1$ -st box and gets $1$ ball, then Lihmuf chooses the $3$ -rd box and gets $3$ balls.
2. Pak Chanek chooses the $2$ -nd box and gets $2$ balls, then Lihmuf chooses the $1$ -st box and gets $0$ balls.
3. Pak Chanek chooses the $3$ -rd box and gets $0$ balls, then Lihmuf chooses the $4$ -th box and gets $4$ balls.
4. Pak Chanek chooses the $4$ -th box and gets $0$ balls, then Lihmuf chooses the $2$ -nd box and gets $0$ balls.
5. 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.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted