(多校)hdu 6033 Add More Zero(数学)
来源:互联网 发布:日志服务器端口 编辑:程序博客网 时间:2024/06/10 17:03
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
164
Sample Output
Case #1: 0Case #2: 19
题目大意:
求出最大的k 使10^k>=2^m-1
解题思路:
直接取对数,用公式 k>=m*(log2/log10)
#include<iostream>#include<cstdio>using namespace std;int main(){ long long n,k,ans,tt=0; while(cin>>n>>k) { if(n>=k) ans=k; else { k-=n; int p=k/(n-1),q=k%(n-1); if(p%2) ans=q==0?n-1:q; else ans=q==0?n:q; } printf("Case #%lld: %lld\n",++tt,ans); } return 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) 简单数学题 Java
- 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
- HUD 6033 Add More Zero(数学)
- (hdu6033)Add More Zero(数学,取对数)
- Lintcode落单的数 删除排序数组中的重复数字 II
- 高德地图js api 轨迹回放 多人并且控制谁先播放
- Pots POJ
- PowerDesigner提示错误Could not Initialize JavaVM!
- 算法643. Maximum Average Subarray I
- (多校)hdu 6033 Add More Zero(数学)
- Lua基础(一)——赋值语句、表达式、流程控制、函数
- 朱鸿恣论文翻译:Exploiting Temporal Dependency for Opportunistic Forwarding in Urban Vehicular Networks
- Google App再度改版,利用机器学习推送个性化Feed服务
- 【docker虚拟化技术】docker学习笔记
- linux(deepin)在启动器上制作启动图标
- C#197课的主要内容
- windows下定时任务执行kettle Job
- z-index不起作用的大坑