Jzzhu and Chocolate - CF 449C 贪心
2014-07-20 11:58
495 查看
Jzzhu and Chocolate
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Jzzhu has a big rectangular chocolate bar that consists of n × m unit squares. He wants to cut this bar exactly k times.
Each cut must meet the following requirements:
each cut should be straight (horizontal or vertical);
each cut should go along edges of unit squares (it is prohibited to divide any unit chocolate square with cut);
each cut should go inside the whole chocolate bar, and all cuts must be distinct.
The picture below shows a possible way to cut a 5 × 6 chocolate for 5 times.
Imagine Jzzhu have made k cuts and the big chocolate is splitted into several pieces. Consider the smallest (by area) piece of the chocolate, Jzzhu wants
this piece to be as large as possible. What is the maximum possible area of smallest piece he can get with exactlyk cuts? The area of a chocolate piece
is the number of unit squares in it.
Input
A single line contains three integers n, m, k (1 ≤ n, m ≤ 109; 1 ≤ k ≤ 2·109).
Output
Output a single integer representing the answer. If it is impossible to cut the big chocolate k times, print -1.
Sample test(s)
input
output
input
output
input
output
Note
In the first sample, Jzzhu can cut the chocolate following the picture below:
In the second sample the optimal division looks like this:
In the third sample, it's impossible to cut a 2 × 3 chocolate 4 times.
题意:切k刀后最大的最小块数。
思路:贪心,尽可能多地横着切,或尽可能多地竖着切。
AC代码如下:
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Jzzhu has a big rectangular chocolate bar that consists of n × m unit squares. He wants to cut this bar exactly k times.
Each cut must meet the following requirements:
each cut should be straight (horizontal or vertical);
each cut should go along edges of unit squares (it is prohibited to divide any unit chocolate square with cut);
each cut should go inside the whole chocolate bar, and all cuts must be distinct.
The picture below shows a possible way to cut a 5 × 6 chocolate for 5 times.
Imagine Jzzhu have made k cuts and the big chocolate is splitted into several pieces. Consider the smallest (by area) piece of the chocolate, Jzzhu wants
this piece to be as large as possible. What is the maximum possible area of smallest piece he can get with exactlyk cuts? The area of a chocolate piece
is the number of unit squares in it.
Input
A single line contains three integers n, m, k (1 ≤ n, m ≤ 109; 1 ≤ k ≤ 2·109).
Output
Output a single integer representing the answer. If it is impossible to cut the big chocolate k times, print -1.
Sample test(s)
input
3 4 1
output
6
input
6 4 2
output
8
input
2 3 4
output
-1
Note
In the first sample, Jzzhu can cut the chocolate following the picture below:
In the second sample the optimal division looks like this:
In the third sample, it's impossible to cut a 2 × 3 chocolate 4 times.
题意:切k刀后最大的最小块数。
思路:贪心,尽可能多地横着切,或尽可能多地竖着切。
AC代码如下:
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; int main() { long long l,w,k,num1,num2,ans; scanf("%I64d%I64d%I64d",&l,&w,&k); if(l+w-2<k) printf("-1\n"); else { num1=min(l-1,k); num2=k-num1; ans=(l/(num1+1))*(w/(num2+1)); num2=min(w-1,k); num1=k-num2; ans=max(ans,(l/(num1+1))*(w/(num2+1))); printf("%I64d\n",ans); } }
相关文章推荐
- Codeforces Round #257 (Div. 1)449A - Jzzhu and Chocolate(贪心、数学)
- 449A - Jzzhu and Chocolate 贪心
- cf 450c Jzzhu and Chocolate
- CF Codeforces Round #257 (Div. 1) A (449A) Jzzhu and Chocolate
- CodeForces 449A - Jzzhu and Chocolate(贪心)
- 449A - Jzzhu and Chocolate 贪心
- CF 525C(Ilya and Sticks-贪心)
- 450C - Jzzhu and Chocolate
- CodeForces 449A - Jzzhu and Chocolate
- CF_6C_Alice,BobAndChocolate
- CF 628C --- Bear and String Distance --- 简单贪心
- 【贪心+简单题】-CF-388A-A fox and box accumulation
- CF Soldier and Badges (贪心)
- CF 449B - Jzzhu and Cities(最短路)
- codeforces C. Jzzhu and Chocolate
- CF 262 C. Maxim and Discounts 贪心(水)
- cf#AIM Tech Round -C. Graph and String-贪心/ 二分图染色
- CF Amr and Music (贪心)
- Codeforces Round #257 (Div. 2) C. Jzzhu and Chocolate
- Codeforces 450 C. Jzzhu and Chocolate