2017 Multi-University Training Contest
来源:互联网 发布:单机服装销售软件 编辑:程序博客网 时间:2024/05/30 23:03
http://acm.hdu.edu.cn/showproblem.php?pid=6033
题意:
跟你一个m,求一个k的最小值,使得10
思路:
其实就是求n * log
log
代码:
#include<bits/stdc++.h>using namespace std;int main(){ int n; int cas = 1; while(~scanf("%d",&n)){ double ans = n * (log(2)) / (log(10)); printf("Case #%d: %d\n",cas++,(int)ans); }}
阅读全文
0 0
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 笔记3:栈
- C++const成员和this指针
- Java程序调试
- PHP页面ob静态化
- java for 循环
- 2017 Multi-University Training Contest
- 将RecyclerView变为可以左右上下滑动的Excel时间表格
- break、continue、return
- Python暴力破解rar压缩包
- HDU6045(数学公式)
- tensorflow lite用于移动电话的神经网络库
- 使用数组模拟邻接表
- oracle数据库操作整理
- Linux 软件安装