杭电 Add More Zero
来源:互联网 发布:淘宝卫生巾试用报告 编辑:程序博客网 时间:2024/06/08 03:49
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
164
Sample Output
Case #1: 0Case #2: 19
题意:输入一个数m,求0到2^m-1范围内,使得10^k最大,求k
思路:10^k<=2^m-1 10^k<2^m 取对数 log10^k<log2^m k<m*log2/log10 k<m*log10(2)
AC代码如下:
#include <iostream>#include <cstdio>#include <cmath>#include <cstring>using namespace std;const double maxi=0.30102999566398;//log10(2)int main(){ int num=1; int m; while(scanf("%d",&m)!=EOF) { printf("Case #%d: ",num); num++; double ans=m*maxi; cout<<(int)ans<<endl; } return 0;}
阅读全文
0 0
- 杭电 Add More Zero
- 杭电暑期集训-Add More Zero
- 杭电problem6033- Add More Zero
- 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
- SpringMvc拦截器HandlerInterceptorAdapter
- EditText首选输入数字,可以切换输入中文英文
- Python学习08_图像的对比度和亮度
- mysql时间类型格式化
- java中static修饰词的作用
- 杭电 Add More Zero
- 【C++心路历程33】【USACO 2016 February Contest, Bronze Problem 3.】 Load Balancing(加难)
- python 修行之路(一)(购物车练习)
- HTML5基础(二) 个人笔记
- Linux学习(四)
- C# Directory.GetFiles()获取多个类型格式的文件
- 【Java笔记】异常处理:捕获和抛出基础
- “智能问诊”项目——数据处理(1)
- 回顾Java各大排序算法(持续更新)