2017杭电多校联赛-Add More Zero 数学找公式
来源:互联网 发布:天正建筑软件最新版 编辑:程序博客网 时间:2024/05/29 10:09
Add More Zero
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2245 Accepted Submission(s): 1053
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 from1 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题目大意:给你m,m满足有2^m-1>=10^k,询问最大k值为多少。
解题思路:有题,我们只需要求得最大k值,则可以列出下列公式:
因此代码就非常好写了。
#include <cstdio>#include <iostream>#include <cmath>using namespace std;int main(){int m, k;int cas = 0;while(~scanf("%d", &m)){ k = log10(2)*m;printf("Case #%d: %d\n", ++cas, k);}return 0;}
题目链接:点击打开链接http://acm.hdu.edu.cn/contests/contest_showproblem.php?pid=1001&cid=759
阅读全文
0 0
- 2017杭电多校联赛-Add More Zero 数学找公式
- HDU 2017 多校联赛-1001 Add More Zero
- HDU 2017 多校联赛 1001 Add More Zero
- 2017杭电多校联赛 1001 Add More Zero(取对数)HDU 6033
- hdu 多校联赛 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 简单数学
- HUD 6033 Add More Zero(数学)
- HDU6033---Add More Zero(2017多校联赛A题)
- (多校)hdu 6033 Add More Zero(数学)
- (hdu6033)Add More Zero(数学,取对数)
- 杭电多校 1001 Add More Zero 题解报告
- Add More Zero
- Add More Zero
- 1001.Add More Zero
- 欢迎使用CSDN-markdown编辑器
- 【Wifi密码破解】安卓手机、电脑如何破解Wifi密码
- 8.Java内存模型和线程
- 《安全测试重点》
- jq和js用mousemove获取鼠标当前位置
- 2017杭电多校联赛-Add More Zero 数学找公式
- 虚函数和纯虚函数的区别
- webstorm 使用时 链接上级目录下的样式 不起作用
- dubbo原理特点
- Burnside引理
- Redux:百行代码千行文档
- hessian简单示例
- 会声会影X9中文版 v19.1.0.14
- Dubbo-02:使用zookeeper的简单demo