CodeForces - 448D—Multiplication Table--二分法（nlogn）

最新推荐文章于 2022-08-12 12:19:39 发布

xiaohuihuicb

最新推荐文章于 2022-08-12 12:19:39 发布

阅读量1.2k

点赞数 2

分类专栏： cf 二分法时间复杂度文章标签： codeforces 二分法时间复杂度

本文链接：https://blog.csdn.net/sinat_30062549/article/details/47178707

版权

博客讲述了如何解决CodeForces上的448D问题，该问题要求找出n行m列乘法表中的第k个最大数。由于直接排序会超时，博主提出了利用二分查找的方法，通过计算mid在每一行的位置并累加，与k比较来确定正确答案。

摘要由CSDN通过智能技术生成

Description

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