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·10⁵;?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 #include <stdio.h> 2 int a, b; 3 long long c; 4 int main(){ 5 scanf("%d%d%lld", &a, &b, &c); 6 long long s = 1, e = (long long)a * b; 7 int i, j; 8 for(; !(s == e); ){ 9 long long m = (s + e) / 2; 10 long long cc = 0; 11 j = b; 12 for(i = 1; i <= a; i++){ 13 while((long long)i * j > m) j--; 14 cc += j; 15 } 16 if(cc < c) s = m + 1; 17 else e = m; 18 } 19 printf("%lld\n", s); 20 return 0; 21 } View Code

轉載于:https://www.cnblogs.com/qscqesze/p/3852507.html

總結

以上是生活随笔為你收集整理的Codeforces Round #256 (Div. 2) D Multiplication Table的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。