【Educational Codeforces Round 35 B】Two Cakes
2017-12-29 10:22
399 查看
【链接】 我是链接,点我呀:)
【题意】
在这里输入题意
【题解】
从小到大枚举x.
看看a/x+b/x是不是大于等于n
是的话。
看看是不是两种蛋糕都能凑一堆。
也即x的最大枚举量是min(a,b)
不然可能有多余的a%x没地方放。(因为它都还没有一堆
【代码】
#include <bits/stdc++.h> using namespace std; int n,a,b; int main(){ #ifdef LOCAL_DEFINE freopen("rush_in.txt", "r", stdin); #endif ios::sync_with_stdio(0),cin.tie(0); cin >> n >> a >> b; int ans = 1; for (int i = 1;i <= min(a,b);i++){ int temp = a/i + b/i; if (temp>=n){ ans = i; } } cout << ans << endl; return 0; }
相关文章推荐
- 【Educational Codeforces Round 35 C】Two Cakes
- Educational Codeforces Round 35 (Rated for Div. 2) A——C
- Educational Codeforces Round 35
- Educational Codeforces Round 35 (Rated for Div. 2) A-D
- Educational Codeforces Round 35 A - Nearest Minimums
- Educational Codeforces Round 35 A B C D题解
- Educational Codeforces Round 35 (Rated for Div. 2) A
- Educational Codeforces Round 35 C - Three Garlands
- Educational Codeforces Round 35 (Rated for Div. 2) D. Inversion Counting
- Educational Codeforces Round 35 (Rated for Div. 2) E Stack Sorting
- Educational Codeforces Round 35 (Rated for Div.2)
- Educational Codeforces Round 35 (Rated for Div. 2)
- Educational Codeforces Round 35 (Rated for Div. 2)
- Educational Codeforces Round 35 (Rated for Div. 2)
- 【Educational Codeforces Round 35 A】 Nearest Minimums
- Educational Codeforces Round 35 (Rated for Div. 2)A,B,C
- Educational Codeforces Round 35 (Rated for Div. 2)
- Educational Codeforces Round 35 D - Inversion Counting
- Educational Codeforces Round 35 (Rated for Div. 2) - (A,B,C,D)
- Educational Codeforces Round 35 (Rated for Div. 2) F. Tree Destruction