HDU-多校训练赛-Add More Zero
来源:互联网 发布:mysql建库 编辑:程序博客网 时间:2024/05/16 07:04
Add More Zero
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0
Problem Description
There is a youngster known for amateur propositions concerning several mathematical hard problems.
Nowadays, he is preparing a thought-provoking problem on a specific type of supercomputer which has ability to support calculations of integers between0 and (2m−1) (inclusive).
As a young man born with ten fingers, he loves the powers of10 so much, which results in his eccentricity that he always ranges integers he would like to use from 1 to
(inclusive).
For the sake of processing, all integers he would use possibly in this interesting problem ought to be as computable as this supercomputer could.
Given the positive integerm , your task is to determine maximum possible integer k that is suitable for the specific supercomputer.
Nowadays, he is preparing a thought-provoking problem on a specific type of supercomputer which has ability to support calculations of integers between
As a young man born with ten fingers, he loves the powers of
For the sake of processing, all integers he would use possibly in this interesting problem ought to be as computable as this supercomputer could.
Given the positive integer
Input
The input contains multiple test cases. Each test case in one line contains only one positive integer m , satisfying 1≤m≤105 .
Output
For each test case, output "Case #x : y " in one line (without quotes), where x indicates the case number starting from 1 and y denotes the answer of corresponding case.
Sample Input
164
Sample Output
Case #1: 0Case #2: 19
- 10k
2m−1
10k
一个无符号的n位二进制,其最大值为 2^n -1, 由于 2^3 =8 < 10, 2^4=16>10, 所以这个n位无符号二进制对应的十进制位数必然大于等于 (n/4) 且小于等于 (n/3)。其实这就是一个求”以2为底10的对数“的问题,程序如下
10k
#include<cstdio>#include<cmath>using namespace std;int main(){ int a; int t=0; while(~scanf("%d",&a)){ t++; int ans=(int)(a/log2(10)); printf("Case #%d: %d\n",t,ans); }}
2m−1
阅读全文
1 0
- HDU-多校训练赛-Add More Zero
- 【多校训练】 hdu 6033 Add More Zero
- HDU 6033 (2017 多校训练赛1 1001) Add More Zero
- 2017 多校训练第一场 Add More Zero
- Add More Zero HDU
- HDU-Add More Zero
- Add More Zero HDU
- hdu 多校联赛 Add More Zero
- HDU-6033 Add More Zero
- HDU 6033 Add More Zero
- HDU 6033 Add More Zero
- hdu 6033 Add More Zero
- HDU 6033 Add More Zero【】
- HDU 6033 Add More Zero
- HDU 6033 Add More Zero
- hdu 6033 Add More Zero
- HDU-6033 Add More Zero
- HDU 2017 多校联赛-1001 Add More Zero
- 平衡二叉搜索树之AVL树
- github入门到上传本地项目
- Android启动详解-----init.rc
- 测试环境为了方便DEBUG排查问题,配置YARN延迟删除本地文件
- git flow 工作流程
- HDU-多校训练赛-Add More Zero
- UNP第二十六章 线程
- 解压zip文件
- js通过后台配置动态生成html table表格
- 国家集训队论文分类整理
- 产品经理面对工作中的突发事件如何应对呢?
- 关于MVC框架的一点体悟
- 采集电信的电视信号的两种方法
- 关于android studio log日志打印信息不全的原因以及解决方法