CodeForces 448D - Multiplication Table(二分)

最新推荐文章于 2021-07-16 21:15:58 发布

原创最新推荐文章于 2021-07-16 21:15:58 发布 · 518 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

Codeforces 同时被 2 个专栏收录

16 篇文章

订阅专栏

二分

6 篇文章

订阅专栏

探讨如何通过二分查找法高效求解n×m乘法表中的第k小数，提供了一种实用的算法解决方案。

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 ann × 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

/*
题目链接：http://codeforces.com/problemset/problem/448/D

题意：输入n,m,k, 求从一个n*m的乘法表中选出第k小数（相同的数字会计算多次）。
	乘法表就是 一个n*m的表 a[i][j] = i * j; 
比如样例 2 3 4
乘法表为
	1 2 3
	2 3 4
非减序列是：1, 2, 2, 3, 3, 4。第4个数字是3，所以输出3。

思路：二分找值。对于每一行找比 mid/n小的数的个数 全部加起来如果等于k就找到啦。

	需要注意的是 个数可能是达不到k的(或多于或少于) 因为该值可能有多个
	但是不影响二分找这个值  
	只要个数小于k 令l = mid + 1 否则 r = mid + 1 就行啦
	最后ans = l 
	还有就是要 long long 
*/ 
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <cmath>
#include <stack>
#include <string>
#include <sstream>
#include <map>
#include <set>
#define pi acos(-1.0)
#define LL long long
#define ULL unsigned long long
#define inf 0x3f3f3f3f
#define INF 1e18
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define debug(a) printf("---%d---\n", a)
#define mem0(a) memset(a, 0, sizeof(a))
#define memi(a) memset(a, inf, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))
#define input1(a) scanf("%d", &a)
#define input2(a,b) scanf("%d %d", &a, &b)
#define input3(a,b,c) scanf("%d %d %d", &a, &b, &c)
using namespace std;
typedef pair<int, int> P;
const double eps = 1e-10;
const int maxn = 1e6 + 5;
const int N = 1e4 + 5;
const int mod = 1e8;

int main(void)
{
//	freopen("in.txt","r", stdin);
	LL n, m, k;
	cin >> n >> m >> k;
	LL l = 1, r = n*m, mid;
	while (l <= r) // 二分查找值 
	{
		mid = (l + r) >> 1;
		LL cnt = 0;
		for (LL i = 1; i <= n; i++)  
			cnt += min(m, mid/i); // 将个数加起来 
		if (cnt < k) 	
			l = mid + 1; 
		else r = mid - 1;  
	} 
	cout << l << endl;

	return 0;
}