UVA - 11384 Help is needed for Dexter ——递归
来源:互联网 发布:家居室内设计软件 编辑:程序博客网 时间:2024/04/30 11:37
原题链接:
http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=26096
Problem H
Help is needed for Dexter
Time Limit: 3 Second
Dexter is tired of Dee Dee. So he decided to keep Dee Dee busy in a game. The game he planned for her is quite easy to play but not easy to win at least not for Dee Dee. But Dexter does not have time to spend on this silly task, so he wants your help.
There will be a button, when it will be pushed a random number N will be chosen by computer. Then on screen there will be numbers from 1 to N. Dee Dee can choose any number of numbers from the numbers on the screen, and then she will command computer to subtract a positive number chosen by her (not necessarily on screen) from the selected numbers. Her objective will be to make all the numbers 0.
For example if N = 3, then on screen there will be 3 numbers on screen: 1, 2, 3. Say she now selects 1 and 2. Commands to subtract 1, then the numbers on the screen will be: 0, 1, 3. Then she selects 1 and 3 and commands to subtract 1. Now the numbers are 0, 0, 2. Now she subtracts 2 from 2 and all the numbers become 0.
Dexter is not so dumb to understand that this can be done very easily, so to make a twist he will give a limit L for each N and surely L will be as minimum as possible so that it is still possible to win within L moves. But Dexter does not have time to think how to determine L for each N, so he asks you to write a code which will take N as input and give L as output.
Input and Output:
Input consists of several lines each with N such that 1 ≤ N ≤ 1,000,000,000. Input will be terminated by end of file. For each N output L in separate lines.
SAMPLE INPUT
OUTPUT FOR SAMPLE INPUT
1
2
3
1
2
2
Problemsetter: Md. Mahbubul Hasan
代码:
#include "stdio.h"int f(int x){ if(x==1) return 1; else return f(x/2)+1;}int main(){ int n; while(scanf("%d",&n)!=EOF) { printf("%d\n",f(n)); }}
- UVA - 11384 Help is needed for Dexter ——递归
- UVA 11384 - Help is needed for Dexter(递归)
- UVA 11384 - Help is needed for Dexter(递归)
- UVA Help is needed for Dexter 11384 (递归)
- UVA 11384 - Help is needed for Dexter
- uva 11384 Help is needed for Dexter
- Uva-11384-Help is needed for Dexter
- UVA 11384 - Help is needed for Dexter
- UVA 11384 Help is needed for Dexter
- UVA 11384 - Help is needed for Dexter
- help is needed for dexter uva 11384
- UVa:11384 Help is needed for Dexter
- UVA - 11384 Help is needed for Dexter
- uva 11384 - Help is needed for Dexter
- Uva 11384 - Help is needed for Dexter
- Uva 11384 Help is needed for Dexter
- UVA 11384 Help is needed for Dexter
- uva-11384-Help is needed for Dexter
- [Python]学习笔记之文件和异常
- testing
- Qt 事件处理机制 (下篇)
- 第十五章 文件属性类的实现
- String类--字符串截取操作
- UVA - 11384 Help is needed for Dexter ——递归
- [转]Ubuntu下QT的安装详细教程
- [leetcode 26] Remove Duplicates from Sorted Array
- dataGridView禁用排序和一些样式
- CentOS6.3搭建LAMP环境
- 1到100中9的个数
- Python字符串常见操作
- 探秘Java虚拟机 gc的监控
- 登陆功能要考虑哪些点