SCUT Training 20170913 Problem O
来源:互联网 发布:iphone照片拷贝到mac 编辑:程序博客网 时间:2024/06/02 22:48
原题:http://acm.hdu.edu.cn/showproblem.php?pid=2178
思路:
这个题的题干描述很差,正确的意思是:你要猜到的最大的数字m,即在1到m间的每一个数,你都能在n次内把它猜出来。求m
所以说在最坏的情况下,在1到m间,你最多只要猜log2(m+1)次,所以m=2^n-1,即猜n次,你能猜到的最大的数为2^n-1。这道题就是这么简单
源代码:
#include <cstdio>#include <cmath>int t,n,ans=0;int main(){ scanf("%d",&t); for (int i=1;i<=t;i++) { ans=0; scanf("%d",&n); ans=pow(2,n)-1; printf("%d\n",ans); }}
阅读全文
0 0
- SCUT Training 20170913 Problem O
- SCUT Training 20170920 Problem O
- SCUT Training 20170913 Problem A
- SCUT Training 20170913 Problem B
- SCUT Training 20170913 Problem C
- SCUT Training 20170913 Problem D
- SCUT Training 20170913 Problem E
- SCUT Training 20170913 Problem F
- SCUT Training 20170913 Problem G
- SCUT Training 20170913 Problem H
- SCUT Training 20170913 Problem I
- SCUT Training 20170913 Problem J
- SCUT Training 20170913 Problem K
- SCUT Training 20170913 Problem L
- SCUT Training 20170913 Problem M
- SCUT Training 20170913 Problem N
- SCUT Training 20170913 Problem P
- SCUT Training 20170920 Problem A
- iOS WKWebView 加载网页 点击link不会跳转的解决方案
- leetcode 23. Merge k Sorted Lists 合并k个排序链表 优先级队列
- const 与 readonly的区别
- 仿京东首页沉浸式图片以及状态栏变色
- Python数据挖掘-文本挖掘
- SCUT Training 20170913 Problem O
- 结构体指针
- shrio学习第二章
- 数据库——连接查询(子查询)
- github项目学习
- 使用dbms_shared_pool.purge清除共享池中的SQL执行计划
- jQuery日期选择器
- HDFS原理
- vs2013编译ffmpeg