2017 Multi-University Training Contest - Team 1 1001 hdu 6033
2017-07-25 19:07
489 查看
Add More Zero
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 99 Accepted Submission(s): 72
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
Source
2017 Multi-University Training Contest - Team 1
比赛的时候以为是找规律,结果。。。
真的伤心。
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 99 Accepted Submission(s): 72
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
Source
2017 Multi-University Training Contest - Team 1
比赛的时候以为是找规律,结果。。。
真的伤心。
#include<cstdio> #include<cmath> using namespace std; int main() { int a; int i=0; while(scanf("%d",&a)!=EOF) { i++; double c=log10(2.0); double o=c*a; int u=(int)o; printf("Case #%d: %d\n",i,u); } }
相关文章推荐
- 2017 Multi-University Training Contest - Team 1 1001&&HDU 6033 Add More Zero【签到题,数学,水】
- HDU-6033 Add More Zero - 2017 Multi-University Training Contest - Team 1(水之崩心态题)
- 2017 Multi-University Training Contest - Team 1(hdu 6033 Add More Zero)
- 2017 Multi-University Training Contest - Team 9 1001&&HDU 6161 Big binary tree【树形dp+hash】
- 2017 Multi-University Training Contest - Team 1:Add More Zero (hdu 6033)
- HDU 6096 String(2017 Multi-University Training Contest - Team 6 1001)后缀自动机
- 2017 Multi-University Training Contest - Team 1 HDU 6033 Add More Zero【对数】
- hdu 6058 Kanade's sum(链表)(2017 Multi-University Training Contest - Team 3 )
- 转载hdu 6059 字典树(好题要慢慢消化)2017 Multi-University Training Contest - Team 3
- HDU-6129 Just do it - 2017 Multi-University Training Contest - Team 7(规律、杨辉三角、组合数奇偶性)
- hdu 6069 Counting Divisors(约数个数)(2017 Multi-University Training Contest - Team 4 )
- hdu 6070 Dirt Ratio(二分+线段树)(2017 Multi-University Training Contest - Team 4 )
- hdu 6071 Lazy Running(优先队列+dijkstra)(2017 Multi-University Training Contest - Team 4)
- hdu 6073 Matching In Multiplication(2017 Multi-University Training Contest - Team 4 )
- 2017 Multi-University Training Contest - Team 1 1001 Add More Zero
- hdu 6034 Balala Power!(贪心)( 2017 Multi-University Training Contest - Team 1 )(无耻之sort)
- 2017 Multi-University Training Contest - Team 9 HDU -6167:Missile Interception
- 2017 Multi-University Training Contest - Team 2 1001 Is Derek lying?
- HDU - 6106 Classes (2017 Multi-University Training Contest - Team 6)
- hdu 6047 Maximum Sequence(2017 Multi-University Training Contest - Team 2)