hdu 6033 Add More Zero

最新推荐文章于 2021-03-19 09:27:50 发布

原创最新推荐文章于 2021-03-19 09:27:50 发布 · 216 阅读

0 ·

CC 4.0 BY-SA版权

多校专栏收录该内容

63 篇文章

订阅专栏

本文介绍了一种计算方法，用于确定特定类型超级计算机能够处理的最大整数范围。该计算机能处理0到2^m-1之间的整数。文章提供了一个算法示例，用以找出在1到10^k范围内，符合超级计算机处理能力的最大k值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 #

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
多校第一场水题，问你2^m-1次方有多少位

ac代码：
#include <iostream>
#include <cstdio>
#include <cstring>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <math.h>
using namespace std;

int main()
{
    int m;
    int cot=1;
    while(scanf("%d",&m)!=EOF)
    {
        printf("Case #%d: ",cot++);
        double n=m*log10(2);
        int len=(int)(n);
        printf("%d\n",len);
    }
    return 0;
}