HDU 2017 多校联赛 1001 Add More Zero
来源:互联网 发布:网络视频广告 编辑:程序博客网 时间:2024/06/11 00:35
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
题目大意:
求输入一个数n,求2的n次方的位数-1,十进制中位数及10的次方数-1,所以该题公式为,m=int(n*log10(2)),m即为位数-1。
c++
#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;}
- HDU 2017 多校联赛-1001 Add More Zero
- HDU 2017 多校联赛 1001 Add More Zero
- hdu 多校联赛 Add More Zero
- 2017杭电多校联赛 1001 Add More Zero(取对数)HDU 6033
- 17暑假多校联赛1.1 HDU 6033 Add More Zero
- HDU6033---Add More Zero(2017多校联赛A题)
- 2017杭电多校联赛-Add More Zero 数学找公式
- Add More Zero HDU
- HDU-Add More Zero
- Add More Zero HDU
- 2017第一次多校联合 1001Add More Zero
- HDU 6033 (2017 多校训练赛1 1001) Add More Zero
- HDU-6033 Add More Zero
- HDU 6033 Add More Zero
- HDU 6033 Add More Zero
- hdu 6033 Add More Zero
- HDU 6033 Add More Zero【】
- HDU 6033 Add More Zero
- 1075. PAT Judge (25)
- js基础知识
- Everything必知必会搜索教程
- 判断点击view是否是自己想要的view的三种方法
- TCP为什么要进行三次握手四次挥手
- HDU 2017 多校联赛 1001 Add More Zero
- 使用JQ来回切换样式的三种方法
- HTML5 canvas上画文字出现乱码
- 关于this的思考
- A
- HDU5019Revenge of GCD
- SPOJ 1812 Longest Common Substring II 后缀自动机求多字符串最长公共子串
- JavaScript数据类型、变量、运算符号
- sublime text 多行代码注释快捷键