codeforces D. Multiplication Table

D. Multiplication Table

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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

1 2 3
2 4 6

#include <iostream>
#include<cstdio>
using namespace std;
long long k,l=1,r,ans,t,n,m;


long long test(long long val)//多少个数比它小
{
    long long i;
    long long cnt=0;
    for(i=1;i<=val&&i<=n;i++)
    {
        if(val%i!=0)//还要比m小
        cnt+=val/i>m?m:val/i;
        else
        cnt+=val/i-1>m?m:val/i-1;
    }
    return cnt;
}


int main()
{
    scanf("%lld%lld%lld",&n,&m,&k);
    r=n*m;
    while(l<=r)
    {
        long long mid=(l+r)/2;
        t=test(mid);
        if(t<=k-1)//可能是这个数 也可能是更大的
        {
            ans=mid;
            l=mid+1;
        }
        else//更小的数
        r=mid-1;
    }
    printf("%lld",ans);
}
自从上次教了二分法，觉得还是挺神技的。题目易懂很好入手，这里数据量有点高，于是估计是nlogn，想了一下二分法可以做，就试着写了写，没想到还真AC了。

可惜一开始wa了几次，因为没有把所有变量都 long long 另外需要注意二分法一定分两段，分三段也wa了一次。

前面一题是动态规划。。。怎么感觉是上次选拔赛的节奏。

1 2 3
2 4 6