Codeforces Round #256 (Div. 2) D. Multiplication Table
来源:互联网 发布:b2b 快速 建站 编辑:程序博客网 时间:2024/05/22 06:52
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.
The single line contains integers n, m and k (1 ≤ n, m ≤ 5·105; 1 ≤ k ≤ n·m).
Print the k-th largest number in a n × m multiplication table.
2 2 2
2
2 3 4
3
1 10 5
5
A 2 × 3 multiplication table looks like this:
1 2 32 4 6
题意:一个n*m的矩阵。行乘上列等于这个点的值。问第k个大的数是多少。
题解:从l=1到r=n*m开始二分搜索mid=(l+r)/2;然后枚举,每一行有多少个小于mid的数,如果总数小于k则l=mid+1,否则r=mid;直到l>r终止。
#include <bits/stdc++.h> using namespace std;#define ll __int64ll n,m,k;ll cnt(ll s){ll t=0;for (int i=1;i<=n;i++){ll h=s/i;if (h>m)h=m;t+=h;}return t;}int main(){scanf("%I64d%I64d%I64d",&n,&m,&k);ll l=1;ll r=n*m+1;while (l<r){ll mid=(l+r)/2;if (cnt(mid)<k)l=mid+1;else r=mid;}cout<<r<<endl;}
- Codeforces Round #256 (Div. 2) D. Multiplication Table
- Codeforces Round #256 (Div. 2) D. Multiplication Table
- Codeforces Round #256 (Div. 2) D. Multiplication Table 二分
- Codeforces Round #256 (Div. 2) D. Multiplication Table
- Codeforces Round #256 (Div. 2) D. Multiplication Table
- Codeforces Round #256 (Div. 2) D. Multiplication Table
- Codeforces Round #256 (Div. 2) D Multiplication Table (二分)
- Codeforces Round #256 (Div. 2) D. Multiplication Table 【二分】
- codeforces Round 256(Div.2)D.Multiplication Table(二分)
- CF Codeforces Round #256 (Div. 2) D (448D) Multiplication Table
- Codeforces Round #256 (Div. 2) D. Multiplication Table(二分查找)
- Codeforces Round #256 (Div. 2) D Multiplication Table(很巧妙二分)
- Codeforces Round #256 (Div. 2)——Multiplication Table
- Codeforces Round #319 (Div. 2) 577A Multiplication Table(脑洞)
- Codeforces Round #319 (Div. 2)A Multiplication Table
- Multiplication Table - #256 (Div. 2) D (448D) 二分
- codeforces D. Multiplication Table
- Codeforces #319(Div.2) A. Multiplication Table
- J Dp
- 图像处理——灰度化、二值化、膨胀算法、腐蚀算法以及开运算和闭运算
- 一线城市与三线城市的IT生活——从《机器灵 砍菜刀》说开去
- JDBC
- VS2010编译报错(LINK : fatal error LNK1123: 转换到 COFF 期间失败: 文件无效或损坏)
- Codeforces Round #256 (Div. 2) D. Multiplication Table
- mfc 新插入的menu如果没有消息映射,则会是灰色的
- Linux下源码安装svn客户端
- Linux Realtek RTL8723BE驱动掉线重连不上问题解决
- 为什么单例对象的并发调用需要同步?
- TCP套接字通信中字符串的处理
- Java抽象类与接口的区别
- log4J.property
- Java单例对象同步问题探讨