CodeForces - 760B补题

最新推荐文章于 2024-11-10 18:35:30 发布

huatian5

最新推荐文章于 2024-11-10 18:35:30 发布

阅读量501

点赞数 2

CC 4.0 BY-SA版权

分类专栏：模拟构造规律二分三分文章标签：二分

本文链接：https://blog.youkuaiyun.com/huatian5/article/details/70262961

模拟构造规律二分三分专栏收录该内容

111 篇文章

订阅专栏

在本篇博客中，我们探讨了一个有趣的算法问题——Frodo和他的朋友们如何公平地分配枕头，确保每个人都能舒适地睡觉，同时Frodo能得到最多的枕头。文章详细介绍了问题背景、输入输出格式以及示例解释。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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?

Input

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.

Output

Print single integer — the maximum number of pillows Frodo can have so that no one is hurt.

Examples

input
4 6 2

output
2

input
3 10 3

output
4

input
3 6 1

output
3

Note

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.

待……

代码：

#include<iostream>
#include<cstdio>
using namespace std;

int n, m, k;
int cnt = 1,ans = 1;
int main()
{
    scanf("%d%d%d",&n,&m,&k);

    m -= n;
    if(m == 0)
        return 0 * printf("1\n");
    while(m > 0)
    {
        if(k + ans <= n)
            ++cnt;
        if(k - ans >= 1)
            ++cnt;
        m -= cnt;
        ++ans;
    }
    printf("%d\n",ans);
    return 0;
}