ACM - Multiplication Table

Multiplication Table

Bizon the Champion isn’t just charming, he also is very smart.

While some of us were learning the multiplication table, Bizon the Champion had fun in his own manner. Bizon the Champion painted an n × m multiplication table, where the element on the intersection of the i-th row and j-th column equals i·j (the rows and columns of the table are numbered starting from 1). Then he was asked: what number in the table is the k-th largest number? Bizon the Champion always answered correctly and immediately. Can you repeat his success?

Consider the given multiplication table. If you write out all n·m numbers from the table in the non-decreasing order, then the k-th number you write out is called the k-th largest number.

Input
The single line contains integers n, m and k (1 ≤ n, m ≤ 5·105; 1 ≤ k ≤ n·m).

Output
Print the k-th largest number in a n × m multiplication table.

Examples
Input
2 2 2
Output
2
Input
2 3 4
Output
3
Input
1 10 5
Output
5

Note
A 2 × 3 multiplication table looks like this:
1 2 3
2 4 6

此题暴力不可解。
优化方法：二分
将答案二分，答案区间在[ 1, n*m ]，二分值mid对乘法表一行一行依次遍历。根据乘法表的特性，mid / i（i 是行数）是在 i 行比mid小的数的数量。

代码（二分法的模板要熟记）：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
int main()
{
	ll n, m, k;
	cin >> n >> m >> k;
	ll l = 1, r = m * n, mid;
	// 二分
	while (l != r) {
		mid = (l + r) / 2;
		ll sum = 0;
		for (int i = 1; i <= n; i++) {
			ll x = mid / i;
			if (x <= m)sum += x;
			else sum += m;
		}
		if (sum < k)l = mid + 1;
		else r = mid;
	}
	printf("%lld\n", l);
	return 0;
}