CF760B.Frodo and pillows
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
n hobbits are planning to spend the night at Frodo's house. Frodo has n beds standing in a row and m pillows ( n<=m ). Each hobbit needs a bed and at least one pillow to sleep, however, everyone wants as many pillows as possible. Of course, it's not always possible to share pillows equally, but any hobbit gets hurt if he has at least two pillows less than some of his neighbors have.
Frodo will sleep on the k -th bed in the row. What is the maximum number of pillows he can have so that every hobbit has at least one pillow, every pillow is given to some hobbit and no one is hurt?
输入格式
The only line contain three integers n , m and k ( 1<=n<=m<=109 , 1<=k<=n ) — the number of hobbits, the number of pillows and the number of Frodo's bed.
输出格式
Print single integer — the maximum number of pillows Frodo can have so that no one is hurt.
输入输出样例
输入#1
4 6 2
输出#1
2
输入#2
3 10 3
输出#2
4
输入#3
3 6 1
输出#3
3
说明/提示
In the first example Frodo can have at most two pillows. In this case, he can give two pillows to the hobbit on the first bed, and one pillow to each of the hobbits on the third and the fourth beds.
In the second example Frodo can take at most four pillows, giving three pillows to each of the others.
In the third example Frodo can take three pillows, giving two pillows to the hobbit in the middle and one pillow to the hobbit on the third bed.