CodeForces 449-A. Jzzhu and Chocolate
2014-07-30 14:27
218 查看
A. 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.
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.
#include<stdio.h> #include<algorithm> using namespace std; typedef long long LL; int main() { LL n,m,k; while(scanf("%I64d%I64d%I64d",&n,&m,&k)!=EOF) { if(n+m-2<k) printf("-1\n"); else { LL temp1 = n>m?n:m; LL temp2 = n<m?n:m; if(k<=temp2-1) { LL temp3 = max(temp1/(k+1)*temp2,temp2/(k+1)*temp1); printf("%I64d\n",temp3); } else if(k<=temp1-1&&k>=temp2) { LL temp4 = max(temp1/(k+1)*temp2,temp1/(k-temp2+2)); printf("%I64d\n",temp4); } if(k>=temp1) { LL temp5 = max(temp2/(k-temp1+2),temp1/(k-temp2+2)); printf("%I64d\n",temp5); } } } return 0; }
相关文章推荐
- CodeForces 449 A.Jzzhu and Chocolate(枚举)
- Codeforces 449 A Jzzhu and Chocolate
- Codeforces 450 C. Jzzhu and Chocolate
- Codeforces 450 C. Jzzhu and Chocolate
- Codeforces 450 C. Jzzhu and Chocolate
- CodeForces 449 D.Jzzhu and Numbers(状压DP+容斥原理)
- CodeForces 449A - Jzzhu and Chocolate
- Codeforces 449 B. Jzzhu and Cities(图论dijk)
- Codeforces 449 B. Jzzhu and Cities
- CodeForces - 449B Jzzhu and Cities
- Codeforces 449D:Jzzhu and Numbers
- Codeforces 449 B. Jzzhu and Cities
- Codeforces Div. 2 #257-C. Jzzhu and Chocolate
- codeforces 449 D Jzzhu and Numbers(容斥+dp)
- CodeForces 449A - Jzzhu and Chocolate(贪心)
- CodeForces 449 C.Jzzhu and Apples(构造+数论)
- CodeForces 449 B. Jzzhu and Cities
- Codeforces 450 C. Jzzhu and Chocolate
- CodeForces 449A Jzzhu and Chocolate
- Jzzhu and Cities CodeForces - 449B (最短路 + 最短路的条数)