CodeForces 449A Jzzhu and Chocolate

A. Jzzhu and Chocolate

time limit per test

1 second

memory limit per test

256 megabytes

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 exactly k 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 ≤ 10⁹; 1 ≤ k ≤ 2·10⁹).

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.

题目链接  :http://codeforces.com/problemset/problem/449/A

题目大意  :给一个n*m的方格，求各种情况切k刀后最小的那一块的最大值(若切的次数不可能达到输出－1)，切的时候需要满足三点  1.每次切必须直切(水平或竖直)   2.每次切必须沿着单元格的边  3.每次切必须切断整块，不能切一半.

题目分析  :最小值中求最大值，通常采用贪心思想的均分策略，首先如果k > m + n - 2,则次数不可能达到，输出-1, 因为要最少，我们可以发现，假设横着切了kx刀，竖着切了ky刀，最后的答案为 (int)( n / (kx + 1) )  *  (int)( m / (ky + 1) )，这里kx和ky是必然小于等于n－1和m－1的，原式可以变为 (m*n) / (kx*ky + kx + ky + 1)，由于m*n和kx + ky + 1均为定值，因此最后答案取决于kx*ky的值又因为kx和ky是大于等于0的且满足ky + kx = k，所以我们可以发现，要使kx*ky值越小，可以先只切某一行或者某一列，(这取决于行列的长度，先切长的，因为这样可以保证kx*ky为0的值更多)，根据此策略得到公式: 当n > k时，ans = m*(n / (k + 1)) 注意这里不能写成(m*n)因为涉及到小数取整的问题，当m > k时，ans = n*(m / (k+1))，当k >= n时，ans = m / (k - n + 2)，当k >= m时，ans = n / (k - m + 2)，分别取四种情况的最大值即为最终答案

#include <cstdio>
#include <algorithm>
using namespace std;
#define ll long long
int main()
{
    ll n, m, k;
    while(scanf("%lld %lld %lld", &n, &m, &k) != EOF)
    {
        if(n + m - 2 < k)
        {
            printf("-1\n");
            continue;
        }
        ll ans = 0;
        if(n > k)
            ans = max(ans, m * (n / (k + 1)));
        if(n <= k)
            ans = max(ans, m / (k - n + 2));
        if(m > k)
            ans = max(ans, n * (m / (k + 1)));
        if(m <= k)
            ans = max(ans, n / (k - m + 2));
        printf("%lld\n", ans);
    }
}