HDU 2017 多校联赛-1001 Add More Zero

最新推荐文章于 2018-03-23 14:51:15 发布

原创最新推荐文章于 2018-03-23 14:51:15 发布 · 399 阅读

0 ·

CC 4.0 BY-SA版权

ACM_简单题同时被 2 个专栏收录

32 篇文章

订阅专栏

ACM_数学

28 篇文章

订阅专栏

本文介绍了一个关于特定类型超级计算机处理能力的问题，该超算能处理0到(2^m-1)之间的整数。文章讨论了如何确定在这样的计算限制下，整数范围从1到10^k的最大可能k值，给出了一段C++代码实现，并通过样例输入输出展示了其正确性。

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

分析：

代码：

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
    long long int a,b,c,d;
    a=0;
    while(cin>>b)
    {
        a++;
        c=int(b*log10(2));
        cout<<"Case #"<<a<<": ";
        cout<<c<<endl;
    }
    return 0;
}