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.

Input:

2 2 2

Out:

2

---

 Input:

2 3 4

Out:

3

---

  Input:

1 10 5

Out:

5

---

题意：列出n*m的乘法表，找到第k小的数。

思路：答案一定在1 ~ n*m中。且随着值增大，它大于的数就会越多，根据这个特性，则我们通过二分试图找到大于数的数量刚好等于k。mid就是答案。

关键在check，他是先逐一搜索乘法表中每一行中比mid小的数：

bool check(int mid){
	int sum=0;
	for(int i=1;i<=n;i++){
 		sum+=min(m,mid/i);
	}
	return sum>=k;
}

因为每一行行号就是结果的因子，因此要知道比mid小的数有多少，只要找到有多少个因子乘以行号小于等于k，即mid/i就是那个因子数。当然可能给的m很小，我们就要取min(m,mid/i)的较小者。

---

完整代码：

#include<bits/stdc++.h>
#define int long long 
#define rep(i, a, b) for(int i = a; i <= b; ++ i)
#define per(i, a, b) for(int i = a; i >= b; -- i)
using namespace std;

int n;

bool is_su(int n){
	if(n == 1) return false;
	for(int i = 2;i <= n/i;i++){
		if(n%i==0) return false;
	}
	return true;
}

signed main(){
	scanf("%lld",&n); 
    
	if(n==2){
		cout << 1 << endl;
		return 0;
	}else if(n & 1){
		if(is_su(n)){
			cout << 1 << endl;
		}else{
			if(is_su(n-2)){
				cout << 2 << endl;
			}else cout << 3<< endl;
		}
	}else{
		cout << 2 << endl;
	}
    return 0;
}