2017 Multi-University Training Contest - Team 1（hdu 6033 Add More Zero）

最新推荐文章于 2017-07-28 13:57:12 发布

「已注销」

最新推荐文章于 2017-07-28 13:57:12 发布

阅读量382

点赞数

CC 4.0 BY-SA版权

分类专栏：多校联系

本文链接：https://blog.youkuaiyun.com/Outp0st/article/details/76154060

多校联系专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一种简单的方法来确定特定超级计算机可以处理的最大整数范围。通过计算(2^m-1)的十进制位数，可以找出适合该计算机的最大k值，即1到10^k之间的整数。

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

Add More Zero

Time Limit: 2000/1000 MS(Java/Others) Memory Limit: 131072/131072 K(Java/Others)

Total Submission(s): 733 Accepted Submission(s): 508

Problem Description

There is ayoungster known for amateur propositions concerning several mathematical hardproblems.

Nowadays, he is preparing a thought-provoking problem on a specific type ofsupercomputer 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 containsmultiple test cases. Each test case in one line contains only one positiveinteger m, satisfying 1≤m≤105.

Output

For each testcase, 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

水题，题意是求(2m−1) 有十进制几位数，其实就是求log10(2m−1)，即m*log10（2），代码很简单：

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int m,t,k;
	t=1;
	while(cin>>m)
	{
		k=double(m)*log10(2.0);
		cout<<"Case #"<<t++<<": "<<k<<endl;
	}
	return 0;
}

2m−1