HDU 6033 Add More Zero【】
来源:互联网 发布:金融数据分析就业方向 编辑:程序博客网 时间:2024/06/05 09:13
Add More Zero
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1082 Accepted Submission(s): 725
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
Source
2017 Multi-University Training Contest - Team 1
答案就是 ⌊log10(2m−1)⌋,注意到不存在 10k=2m ,所以⌊log10(2m−1)⌋=⌊log102m⌋=⌊mlog102⌋,这样做的时间复杂度是 O(1) 。
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<queue>#include<stack>#include<vector>#include<map>#include<set>#include<algorithm>using namespace std;#define ll long long#define ms(a,b) memset(a,b,sizeof(a))#define maxn 510const int M=1e6+10;const int inf=0x3f3f3f3f;const int mod=1e9+7;const double eps=1e-10;ll n,m;int main(){ int cas=1; while(~scanf("%d",&m)) { int ans=m*(log10(2.0)); printf("Case #%d: %d\n",cas++,ans); } return 0;}
阅读全文
0 0
- 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 (数学)
- 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 简单数学
- Css优化
- C#自定义控件实现窗体绘制表格
- 关于搜索Enter执行查询的方法
- SimpleDateFormat使用
- java list 交集 并集 差集 去重复并集
- HDU 6033 Add More Zero【】
- python学习(六)----Python魔术方法总结
- ORA-27301: OS failure message: No bufferspace available
- CSS Position定位属性介绍
- RTP视频传输播放延时(时间戳)
- android 全屏去掉ActionBar 和状态栏
- Logback手记
- 股票建仓、平仓、持仓是什么意思
- 双mysql之编译安装mysql-5-7-18