CodeForces 448D Multiplication Table
来源:互联网 发布:熊猫tv怎么刷猫币淘宝 编辑:程序博客网 时间:2024/05/17 02:42
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.
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
这题我搜题解了,没搜我根本不会知道这个表有个规律!!!
就是a[i][j] / i 是这一行中小于a[i][j]的数的个数。←这个这么重要不知道我还做什么啊……!!=A=
知道了之后二分就好了。如果数目大于k,移动r
#include<stdio.h>#include<string.h>__int64 n,m,k;__int64 OK(__int64 x){__int64 i;__int64 tmp,sum=0;for(i=1;i<=n;i++){tmp=x/i;if(tmp>m)tmp=m;sum+=tmp;}if(sum>=k)return 1;return 0;}int main(){while(~scanf("%I64d%I64d%I64d",&n,&m,&k)){__int64 l=1,r=n*m;__int64 mid,ans;while(l<=r){mid=(l+r)/2;if(OK(mid)){ans=mid;r=mid-1;}elsel=mid+1;}printf("%I64d\n",ans);}return 0;}
- Codeforces 448 D. Multiplication Table
- Codeforces 448D Multiplication Table
- Codeforces 448D Multiplication Table
- Codeforces 448 D. Multiplication Table
- 【CodeForces】[448D]Multiplication Table
- CodeForces 448D Multiplication Table
- codeforces D. Multiplication Table
- 【杂题】 codeforces 448D Multiplication Table
- 【CodeForces】448D - Multiplication Table(二分)
- Codeforces 448D Multiplication Table(二分)
- CodeForces 448D Multiplication Table (二分 )
- CodeForces 448D Multiplication Table (二分 )
- CodeForces 448D - Multiplication Table(二分)
- D. Multiplication Table 448D
- CodeForces - 448D—Multiplication Table--二分法(nlogn)
- Codeforces 448D: Multiplication Table(二分+数学)
- codeforces#256DIV2 D题Multiplication Table
- CodeForces 2014.7.17 D. Multiplication Table
- 2016/07/27 选择
- 实现上拉加载更多的SwipeRefreshLayout
- 【链表】单链表——单循环链表
- LintCode之爬楼梯
- 传统线程通信技术
- CodeForces 448D Multiplication Table
- 安卓aidl夸进程通信的小例子,
- 数据结构实验之链表五:单链表的拆分
- HDOJ 1010-Tempter of the Bone【dfs】
- python ldle是什么?
- Fragment的pause和resume
- nyoj722数独
- linux内核中的文件描述符(一)--基础知识简介
- SourceTree团队git项目工具入门(精简版)