Add More Zero
2017-07-31 09:45
211 查看
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 00 and (2m−1)(2m−1) (inclusive).
As a young man born with ten fingers, he loves the powers of 1010 so much, which results in his eccentricity that he always ranges integers he would like to use from 11 to 10k10k (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 mm, your task is to determine maximum possible integer kk 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 mm, satisfying 1≤m≤1051≤m≤105.
Output
For each test case, output " Case #xx: yy" in one line (without quotes), where xx indicates the case number starting from 11 and yy denotes the answer of corresponding case.
Sample Input
1
64
Sample Output
Case #1: 0
Case #2: 19
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
long long int t=0,m,x=0;
while(cin>>m)
{
x=(m*log10(2));
t++;
cout<<"Case #"<<t<<": "<<x<<endl;
}
}
Nowadays, he is preparing a thought-provoking problem on a specific type of supercomputer which has ability to support calculations of integers between 00 and (2m−1)(2m−1) (inclusive).
As a young man born with ten fingers, he loves the powers of 1010 so much, which results in his eccentricity that he always ranges integers he would like to use from 11 to 10k10k (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 mm, your task is to determine maximum possible integer kk 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 mm, satisfying 1≤m≤1051≤m≤105.
Output
For each test case, output " Case #xx: yy" in one line (without quotes), where xx indicates the case number starting from 11 and yy denotes the answer of corresponding case.
Sample Input
1
64
Sample Output
Case #1: 0
Case #2: 19
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
long long int t=0,m,x=0;
while(cin>>m)
{
x=(m*log10(2));
t++;
cout<<"Case #"<<t<<": "<<x<<endl;
}
}
相关文章推荐
- HDU 6033 (2017 多校训练赛1 1001) Add More Zero
- 1001.Add More Zero
- HDU6033-Add More Zero
- hdu 多校联赛 Add More Zero
- (数学)HDU 6033 Add More Zero
- 杭电第一次多校赛_1001_Add_More_Zero_2017_7_25
- 2017 Multi-University Training Contest - Team 1 Add More Zero
- Add More Zero
- HUD 6033 Add More Zero(暑期训练1001)
- 2017 Multi-University Training Contest - Team 1:Add More Zero (hdu 6033)
- HDU-Add More Zero
- 杭电 Add More Zero
- Add More Zero
- 2017 Multi-University Training Contest - Team 1 Add More Zero
- 2017 Multi-University Training Contest - Team 1&hdu6033 Add More Zero
- HDU 6033 Add More Zero【】
- HDU-6033 Add More Zero - 2017 Multi-University Training Contest - Team 1(水之崩心态题)
- HDU6033---Add More Zero(2017多校联赛A题)
- 杭电多校 1001 Add More Zero 题解报告
- 2017 Multi-University Training Contest - Team 1 HDU 6033 Add More Zero【对数】