Codeforces 449A 模拟

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

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.

题意：

Jzzhu有一块由n*m个单位正方形组成的巧克力，他想把这块巧克力切k次，每次切割按照以下规则。
.每次只能横着或者竖着切
.每次切割应该沿着单位正方形的边缘（不能分割单位巧克力)
.每次切割只能在巧克力内部进行，且所有切法都不同
问当切完k次后，最小的巧克力面积最大是多少。
如果不存在切割方案，输出-1。

题解：

假设横着切x-1刀，竖着切y-1刀。

那么横着被分成x份，竖着被分成y份，最小值是n/x+m/y。

所以n/i枚举一遍，再把m/i枚举一遍即可。

每次枚举只需要枚举到sqrt(n)就可以了。参照判断素数。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
int main(){
	ll n,m,k;
	cin>>n>>m>>k;
	if(n+m-2<k){
		printf("-1\n");
		return 0;
	}
	ll ans=0,que,eid,j;
	for(ll i=1;i*i<=n;i++){
		if(k<i-1)continue;
		que=n/i;
		eid=m/(k-i+2);
		ans=max(que*eid,ans);
		j=n/i;
		if(k<j-1)continue;
		que=n/j;
		eid=m/(k-j+2);
		ans=max(que*eid,ans);
	}
	swap(n,m);
	for(ll i=1;i*i<=n;i++){
		if(k<i-1)continue;
		que=n/i;
		eid=m/(k-i+2);
		ans=max(que*eid,ans);
		j=n/i;
		if(k<j-1)continue;
		que=n/j;
		eid=m/(k-j+2);
		ans=max(que*eid,ans);
	}
	cout<<ans<<endl;
	return 0;
}