Codeforces Round #257 (Div. 2) C. Jzzhu and Chocolate

C. 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 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 ≤ 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.

Examples

input

Copy

3 4 1

output

Copy

6

input

Copy

6 4 2

output

Copy

8

input

Copy

2 3 4

output

Copy

-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 <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
long long n,m,k;
long long mk,nk;
int main()
{
cin>>n>>m>>k;
if(k>n-1+m-1)
cout<<-1<<endl;
else
{
int s = k;
if(k<=m-1)
{
mk = m/(k+1)*n;
} 
else
{
k = k-m+1;
mk = n/(k+1);
}
long long t = m;
m = n;
n = t;
k =s;
if(k<=m-1)
{
nk = m/(k+1)*n;
} 
else
{
k = k-m+1;
nk = n/(k+1);
}
if(mk>nk)
cout<<mk<<endl;
else
cout<<nk<<endl;
}
}