2017 Multi-University Training Contest - Team 1 1001 Add More Zero

最新推荐文章于 2017-10-04 18:44:00 发布

斌同学斌同學

最新推荐文章于 2017-10-04 18:44:00 发布

阅读量357

点赞数

分类专栏： HDU 2017多校文章标签： acm 多校训练

本文链接：https://blog.csdn.net/GreatJames/article/details/76095963

版权

HDU 同时被 2 个专栏收录

135 篇文章 0 订阅

订阅专栏

2017多校

27 篇文章 0 订阅

订阅专栏

Add More Zero

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

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

Sample Output

  
  
   
   Case #1: 0
Case #2: 19




   
   题意：问2^m-1有几位...
   
   思路：你会发现-1只有在 10的倍数时候位数才会发生变化 10-1 = 9， 100-1， 1000-1...2^m不可能出现，
   
   所以只考虑2^m有几位就好了...就是10的几次方， 取个log10， 答案就是m×log2

   
   #include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
    int n, ca = 1;
    while (~scanf("%d", &n))
    {
        int k = log10(2) * n;
        printf("Case #%d: %d\n", ca++, k);
    }
    return 0;
}