2017 Multi-University Training Contest
来源:互联网 发布:产品数据分析总结 编辑:程序博客网 时间:2024/06/05 16:35
题目链接:VJ: https://vjudge.net/problem/HDU-6033 HDU原链接:http://acm.hdu.edu.cn/contests/contest_showproblem.php?pid=1001&cid=759
题意: 给定一个m(1 <= m <= 1e5) 问2^m - 1和10^k长度相同的k是多少
思想:对于一个数x来说, log10(x) 就等于k, 就要考虑这个-1, 当只有在10, 100,...10的幂次的时候, 位数才会降低, 所以-1对于2^m并没有影响。
所以答案就是 m* log(2.0)
#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#include<algorithm>using namespace std;const int MaxN = 1e5;int n;int main(){int cas = 0;while(~scanf("%d", &n)){int k = n * log10(2.0);printf("Case #%d: %d\n", ++cas, k);}return 0;}
阅读全文
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
- Python 动态生成多维数组
- nginx和swoole高并发原理
- HDU
- STM32F103C8T6之通用异步收发器(发送接收中断)
- 【poj 2942 】 Knights of the Round Table 【tarjan求bcc+黑白染色判二分图】
- 2017 Multi-University Training Contest
- Structs2通过耦合的方式访问WEB资源
- 木兰词·拟古决绝词柬友
- ParseXML 和 parseJson
- HDU-3974 Assign the task题解报告【dfs序+线段树】
- gcc和makefile(二)
- MarkDown语法
- 关于货币战中P8的理解
- C语言中字符串如何转换为二进制、八进制、十进制、十六进制