[Codeforces-911B] - Two Cakes

最新推荐文章于 2020-04-08 21:09:33 发布

小小小丸子儿

最新推荐文章于 2020-04-08 21:09:33 发布

阅读量400

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/Dream_your/article/details/89348062

本文详细解析了Codeforces平台上的编程题TwoCakes，阐述了如何在满足特定条件下，将两块蛋糕切成的a和b片均匀分配到n个盘子中，使得每个盘子至少包含x片蛋糕，且x尽可能大。通过算法设计，实现了最优解的计算。

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

[Codeforces-911B] - Two Cakes

B. Two Cakes
time limit per test 1 second
memory limit per test 256 megabytes
input standard input
output standard output
It's New Year's Eve soon, so Ivan decided it's high time he started setting the table. Ivan has bought two cakes and cut them into pieces: the first cake has been cut into a pieces, and the second one — into b pieces.

Ivan knows that there will be n people at the celebration (including himself), so Ivan has set nplates for the cakes. Now he is thinking about how to distribute the cakes between the plates. Ivan wants to do it in such a way that all following conditions are met:

Each piece of each cake is put on some plate;
Each plate contains at least one piece of cake;
No plate contains pieces of both cakes.
To make his guests happy, Ivan wants to distribute the cakes in such a way that the minimum number of pieces on the plate is maximized. Formally, Ivan wants to know the maximum possible number x such that he can distribute the cakes according to the aforementioned conditions, and each plate will contain at least x pieces of cake.

Help Ivan to calculate this number x!

Input
The first line contains three integers n, a and b (1 ≤ a, b ≤ 100, 2 ≤ n ≤ a + b) — the number of plates, the number of pieces of the first cake, and the number of pieces of the second cake, respectively.

Output
Print the maximum possible number x such that Ivan can distribute the cake in such a way that each plate will contain at least x pieces of cake.

Examples
input
5 2 3
output
1
input
4 7 10
output
3
Note
In the first example there is only one way to distribute cakes to plates, all of them will have 1cake on it.

In the second example you can have two plates with 3 and 4 pieces of the first cake and two plates both with 5 pieces of the second cake. Minimal number of pieces is 3.

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n, a, b,ans;
    while(cin>>n>>a>>b)
    {
        ans  = 0;
        for(int i=1;i<n;i++)
            ans = max(min(a/i,b/(n-i)),ans);
        cout<<ans<<endl;
    }
    return 0;
}