【组队赛三】-E Binary Search cf448D
来源:互联网 发布:java代码实现阶乘 编辑:程序博客网 时间:2024/06/04 23:37
Multiplication Table
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit
Status
Practice
CodeForces 448D
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.
Sample Input
Input
2 2 2
Output
2
Input
2 3 4
Output
3
Input
1 10 5
Output
5
Hint
A 2 × 3 multiplication table looks like this:
1 2 3
2 4 6
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit
Status
Practice
CodeForces 448D
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.
Sample Input
Input
2 2 2
Output
2
Input
2 3 4
Output
3
Input
1 10 5
Output
5
Hint
A 2 × 3 multiplication table looks like this:
1 2 3
2 4 6
<span style="color:#3333ff;"><span style="color:#3333ff;background-color: rgb(255, 255, 255);">/*_______________________________________________________________________________________ author : Grant yuan time : 2014.7.21 algorithm : Binary Search explain : 如果i*m<=aa,则会有m个数满足结果,否则会有aa/i个数满足结果 ________________________________________________________________________________________*/#include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>#include<queue>#include<functional>#define INF 999999999using namespace std;//long long a[100003][100003];long long k;long long l,r,mid;long long n,m;long long M;inline bool can(long long aa){ long long sum=0; for(int i=1;i<=n;i++) { if(i*m<=aa) sum+=m; else sum+=aa/i; } if(sum>=k) return true; return false;}int main(){ M=0; cin>>n>>m>>k; long long ans=1; l=1;r=n*m; while(l<=r){ mid=(long long)((l+r)*0.5); if(can(mid)) { ans=mid; r=mid-1; } else l=mid+1; } cout<<ans<<endl;}</span></span>
0 0
- 【组队赛三】-E Binary Search cf448D
- nyist---组队赛(三)
- 【组队赛三】-C cf448B
- 组队赛三 dfs搜索
- [US Giants] 三. Binary Search
- codeforces 173E 组队
- 【组队赛三】-D 优先队列 cf446B
- (组队赛E/F Number of Connected Components )UVALive
- 235-e-Lowest Common Ancestor of a Binary Search Tree
- CF#200 div2 E Read Time(binary search)
- Binary search
- Binary Search
- Binary Search
- binary search
- binary search
- Binary Search
- binary search
- binary search
- “硬解码”与“软解码”的区别
- LED音乐频谱之输入数据处理
- Java集合源码学习(13)_Queue接口以及基础实现AbstractQueue
- 为类编写完美的Equals()
- HDU 2035人见人爱A^B(数字快速幂法)
- 【组队赛三】-E Binary Search cf448D
- 最小生成树问题
- HDUOJ 2089 数位DP
- PyQt 的一些小总结 (信号槽,弹框)
- android tv开发碰到的坑儿----第一篇
- ios 正则表达式
- 线程和进程区别和联系。什么是“线程安全”?
- java学习的第一个App
- UIView-入门