lin all term oss imu define cor hdu range

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 1to 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 有一臺計算機，它可以計算從0~2^m-1的所有數，一個年輕人喜歡10^k，所以他希望你能告訴他在給定的m下，能使10^k滿足條件的K的最大值。 差不多這個意思吧... 那麽把10^k中k可以看成是2^m-1的位數-1。即求解2^m-1的位數即可。

#include<iostream>
#include<math.h>
#define LG 0.30102999566
using namespace std;
int main()
{
    int a;
    double m;
    a=1;
    while(cin>>m)
    {
        cout<<"Case #"<<a++<<": "; 
        cout<<(int)(m*LG)<<endl;
    }
}

HDU-6033 Add More Zero