标签:448D cnt number CodeForces mid 2020 th multiplication table
Problem 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, 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
Input2 2 2Output
2Input
2 3 4Output
3Input
1 10 5Output
5
Note
A 2 × 3 multiplication table looks like this:
1 2 3
2 4 6
使用二分在1~n*m这个区间上寻找第k大的数。
即计算有多少数小于等于这个数并记录为cnt。找到最小的比第k大的cnt,该cnt所最对应的数即为答案。
计算cnt的方法为逐行cnt+=min(m,mid/i);(m为列数,mid为值,i为行数)
AC代码如下:
#include<cstdio> #include<algorithm> using namespace std; long long n,m,l,r,mid,k,cnt,templ,tempr,tempm; int main(){ scanf("%lld%lld%lld",&n,&m,&k); l=1,r=n*m; while(r>=l){ mid=(l+r)/2; cnt=0; for(long long i=1;i<=n;i++){ cnt+=min(m,mid/i); } if(cnt>=k) r=mid-1; else l=mid+1; } printf("%lld",l); }
标签:448D,cnt,number,CodeForces,mid,2020,th,multiplication,table 来源: https://www.cnblogs.com/mikku39/p/14401058.html
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。