Add More Zero

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  kkthat is suitable for the specific supercomputer.

InputThe input contains multiple test cases. Each test case in one line contains only one positive integer  mm, satisfying  1≤m≤1051≤m≤105. OutputFor each test case, output "  Case #xx: yy" in one line (without quotes), where  xxindicates 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

题意：
   (1)0 and (2m−1)(inclusive).  

  (2)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). 

  简单的说就是，在0到（2^m-1）之间，求最大的10^k,求k的值。（英语好重要啊，想哭，真的!）

思路如下：

   10^k<=2^m-1 ==> 10^k<2^m ==> k<m*log10(2)

代码如下：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <map>
#include <math.h>

using namespace std;


int main()
{
    double mi = log10(2);
    int n,num=1;
    while(scanf("%d",&n)!=EOF)
    {
        double ans = n*mi;
        printf("Case #%d: %lld\n",num++,(long long)ans);
    }
    return 0;
}

转载于:https://www.cnblogs.com/new-zjw/p/8540937.html