HDU 6033 Add More Zero(取对数求一个数长度)
来源:互联网 发布:淘宝点客服没反应 编辑:程序博客网 时间:2024/06/07 13:43
Add More Zero
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1687 Accepted Submission(s): 1072
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 between0 and (2m−1) (inclusive).
As a young man born with ten fingers, he loves the powers of10 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 integerm , your task is to determine maximum possible integer k that is suitable for the specific supercomputer.
Nowadays, he is preparing a thought-provoking problem on a specific type of supercomputer which has ability to support calculations of integers between
As a young man born with ten fingers, he loves the powers of
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
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
164
Sample Output
Case #1: 0Case #2: 19
题意:求2的m次方的长度
思路:利用log10可以知道一个数有几位的性质,再用对数的运算法则可以求任意数的长度
#include <iostream>#include <cstdio>#include <cstring>#include <stdio.h>#include <stdlib.h>#include <algorithm>#include <math.h>using namespace std;int main(){ int n,cas=1; while(scanf("%d",&n)!=EOF) { printf("Case #%d: ",cas++); int len=n*log10(2); printf("%d\n",len); } return 0;}
阅读全文
0 0
- HDU 6033 Add More Zero(取对数求一个数长度)
- 2017杭电多校联赛 1001 Add More Zero(取对数)HDU 6033
- HDU6033 Add More Zero(取对数)
- (hdu6033)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
- HDU 6033 Add More Zero
- hdu 6033 Add More Zero
- HDU-6033 Add More Zero
- hdu 6033 Add More Zero(数的位数)
- Add More Zero HDU
- HDU-Add More Zero
- Add More Zero HDU
- HDU 6033 Add More Zero (数学)
- DBCP建立数据连接池
- centos学习笔记(2)
- Tcp、Http网络协议
- [USACO5.1]Fencing the Cows
- 吉哥系列故事——完美队形II (manacher 的 变形应用)
- HDU 6033 Add More Zero(取对数求一个数长度)
- GridSearchCV用法
- java 通过jmx获取active mq队列消息
- 【Java多线程】多线程死锁
- linux下拷贝某一时间段的文件
- 剑指offer_数组---二维数组中的查找
- Shiro第六篇【验证码、记住我】
- MySQL 加锁处理分析
- 乱七八糟学习笔记之正则表达式