zoj 2722 Head-to-Head Match(数学思维)
题目链接:
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2722
题目描述:
Our school is planning to hold a new exciting computer programming contest. During each round of the contest, the competitors will be paired, and compete head-to-head. The loser will be eliminated, and the winner will advance to next round. It proceeds until there is only one competitor left, who is the champion. In a certain round, if the number of the remaining competitors is not even, one of them will be chosed randomly to advance to next round automatically, and then the others will be paired and fight as usual. The contest committee want to know how many rounds is needed to produce to champion, then they could prepare enough problems for the contest.
Input
The input consists of several test cases. Each case consists of a single line containing a integer N - the number of the competitors in total. 1 <= N <= 2,147,483,647. An input with 0(zero) signals the end of the input, which should not be processed.
Output
For each test case, output the number of rounds needed in the contest, on a single line.
Sample Input
8
16
15
0
Sample Output
3
4
4
/*问题 输入一个1到2147483647的整数,计算并输出两两配对的次数
解题思路 其实就是2的几次方的问题*/
#include<cstdio>
#include<cmath> int main()
{
int n,i;
while(scanf("%d",&n),n != ){
for(i=;i<;i++){
if(pow(,i) >= n){
printf("%d\n",i);
break;
}
}
}
return ;
}
最新文章
- 基于Chrome内核(WebKit.net)定制开发DoNet浏览器
- C#读取Excel文件:通过OleDb连接,把excel文件作为数据源来读取
- 一个python线程池的源码解析
- spring之依赖注入
- 如何知道某个网站的IP地址
- code vs1506传话(塔尖)+tarjan图文详解
- mfc中CString转化为string的方法
- php分享三十三:常量
- 微课程--Android--Android开发学习体系
- HTTP 错误 403.14 - Forbidden
- CH Round #58 - OrzCC杯noip模拟赛day2
- UITableView 隐藏多余的分割线
- Android网络编程之Http通信
- cocos2d-x-3.1 事件分发机制 (coco2d-x 学习笔记七)
- 初探swift语言的学习笔记五(线程)
- 未能加载文件或程序集 Newtonsoft.Json, Version=4.5.0.0 的报错,解决方法
- 【Unity3D】Unity3D开发《我的世界》之三、创建一个Chunk
- LDA主题模型
- 前端工程化(二)---webpack配置
- C++: typedef与template的配合使用;