Codeforces 448 D. Multiplication Table-CSDN博客

本文链接：https://blog.csdn.net/Novak_Djokovic/article/details/45393179

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.

   Sample test(s) 
 
     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



忙的好久没做题了，水出来一道就热泪盈眶啊有木有~~

找出从小到大的第K个数输出

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
long long m,n,k;
long long sum(long long m,long long n,long long k)
{
    long long sum=0;
    for(int i=1;i<=n;i++)
    {
        sum+=min(k,(m-1)/i);
    }
    return sum;
}
int main()
{
    while(cin>>m>>n>>k)
    {
        long long left=1,right=m*n+1;
        while(left<right)
        {
            long long mid=(left+right)/2;
            if(sum(mid,n,m)<k)
                left=mid+1;
            else
                right=mid;
        }
        cout<<left-1<<endl;
    }
    return 0;
}