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
题目大意:给定一个n*m乘法表,求第k大的数是几,本题可采用二分法,对于每一个中间值m,判断条件为它所对应数字前面有几位,记为sum,如果sum小于k,则说明m太小,左端点作m,反之亦然。
由于数据比较大,注意开long long
AC代码:
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<queue>
#include<stack>
#include<string>
#include<algorithm>
#include<map>
#include<sstream>
#include<set>
#define debug(x) cout << "[" << #x <<": " << (x) <<"]"<< endl
#define CLE(a,b) memset(a,b,sizeof(a))
#define MEC(a,b) memcpy(a,b,sizeof(a))
#define ll long long
#define inff 0x7fffffff
ll n, m, k;
using namespace std;
int main()
{
cin >> n >> m >> k;
ll lef = 0;ll ri = n * m;
ll mid;
ll ans;
while (lef <= ri)
{
mid = (ri + lef) >> 1;
ll sum = 0;
for (ll i = 1;i <= n;i++)
sum += min((mid - 1) / i, m);
if (sum < k)
{
lef = mid+1;
ans = mid;
}
else
{
ri = mid-1;
}
}
cout << ans << endl;
return 0;
}