Add More Zero
来源:互联网 发布:以色列 巴基斯坦 知乎 编辑:程序博客网 时间:2024/06/01 20:09
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 from1 to 10k (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 integerm , 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
1
64
Sample Output
Case #1: 0
Case #2: 19
1
64
Sample Output
Case #1: 0
Case #2: 19
题意:给出一个n,找到2^n以内最大的10^k,求k的最大值。
思路:本题是到数学题,公式为log10(2^n).
#include<iostream>#include<cmath>using namespace std;int main(){ long long int m,n,x; m=0; while(cin>>n) { m++; x=int(n*log10(2)); cout<<"Case #"<<m<<": "; cout<<x<<endl; } return 0;}
阅读全文
0 0
- Add More Zero
- Add More Zero
- 1001.Add More Zero
- hdu6033--Add More Zero
- HDU6033-Add More Zero
- HDU6033-Add More Zero
- hdu6033 Add More Zero
- Add More Zero HDU
- Add More Zero
- HDU-Add More Zero
- Add More Zero
- Add More Zero
- 6033 Add More Zero
- Add More Zero
- Add More Zero HDU
- 杭电 Add More Zero
- HDU-6033 Add More Zero
- HDU 6033 Add More Zero
- 数理逻辑2 -- 量化理论3
- 为什么大多数人不能够成为架构师
- Java中的异常处理机制的简单原理和应用
- 理解Lua语言中的__index,__newindex,rawget和rawset 标签: luametatable__index__newindexrawget 2013-09-27 20:02
- window10+caffe(新版)+自己工程
- Add More Zero
- python求解简单加密问题,实现对输入的密文加密
- Manifest merger failed with multiple errors清单合并失败解决办法
- 浏览器如何工作
- JAVA运算符
- 解决MPAndroidChart-LineChart清除数据刷新后X轴取值不准确的问题
- 编写Java程序,计算数字可以被哪些数字整除。
- 构建配置文件
- adb shell 终止应用程序