HDU6033-Add More Zero

Add More Zero

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 849 Accepted Submission(s): 585

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

题目大意：给定m，求满足10y≤2m−1的y的最大值。
解题思路：y=⌊mlog102⌋

#include<iostream>#include<cstdio>#include<cmath>#include<algorithm>#include<cstring>#include<queue>using namespace std;typedef long long LL;const int MAXN=1e5+5;int main(){    //freopen("in.txt","r",stdin);    //freopen("out.txt","w",stdout);    ios::sync_with_stdio(false);    int cas=0;    int m;    while(cin>>m)    {        cout<<"Case #"<<++cas<<": "<<(int)floor(m*log10(2))<<endl;    }    return 0;}