1001.Add More Zero
2017-07-25 22:45
323 查看
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 between 0 and (2m−1) (inclusive).
As a young man born with ten fingers, he loves the powers of 10 so much, which results in his eccentricity that he always ranges integers he would like to use from 1 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 integer m, your task is to determine maximum possible integer k that is suitable for the specific supercomputer.
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
1
64
Sample Output
Case #1: 0
Case #2: 19
题解如下,水题没啥说的
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 between 0 and (2m−1) (inclusive).
As a young man born with ten fingers, he loves the powers of 10 so much, which results in his eccentricity that he always ranges integers he would like to use from 1 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 integer m, your task is to determine maximum possible integer k that is suitable for the specific supercomputer.
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
1
64
Sample Output
Case #1: 0
Case #2: 19
题解如下,水题没啥说的
//202MS 1508K #include <cstdio> #include <cstring> #include <algorithm> #include <cmath> using namespace std; int main() { int cas=1; int n; while(scanf("%d",&n)!=EOF){ printf("Case #%d: ",cas); cas++; int w=n*log(2)/log(10); printf("%d\n",w); } return 0; }
相关文章推荐
- HDU 6033 (2017 多校训练赛1 1001) Add More Zero
- 2017年多校赛第一场 1001 Add More Zero(逻辑思维)
- 杭电第一次多校赛_1001_Add_More_Zero_2017_7_25
- HUD 6033 Add More Zero(暑期训练1001)
- 2017 Multi-University Training Contest - Team 1 1001&&HDU 6033 Add More Zero【签到题,数学,水】
- 2017 Multi-University Training Contest - Team 1 1001 Add More Zero
- 杭电多校 1001 Add More Zero 题解报告
- 2017 Multi-University Training Contest - Team 1 1001 Add More Zero
- 【2017 Multi-University Training Contest - Team 1 1001】Add More Zero
- 17 多校 - 1 - 1001 - Add More Zero (HDU 6033)
- 2017杭电多校联赛 1001 Add More Zero(取对数)HDU 6033
- HDU 2017 多校联赛-1001 Add More Zero
- 多校1 A Add More Zero
- hdu 6033 Add More Zero(数的位数)
- 2017 Multi-University Training Contest - Team 1 Add More Zero
- HDU6033 Add More Zero
- HDU 6033 Add More Zero
- 2017 Multi-University Training Contest - Team 1 之Add More Zero
- HDU 6033 Add More Zero 【数学】【基础】
- hdu6033 Add More Zero