uva 11384 Help is needed for Dexter(模拟)
来源:互联网 发布:怎么健身 知乎 编辑:程序博客网 时间:2024/05/01 09:14
uva 11384 Help is needed for Dexter
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
题目大意:给出n个连续的整数,可从中选中一个或多个整数,同时减去一个相同的正整数,最终要将所有的数都变为0,求最少的操作数。
解题思路:模拟几遍。
#include<stdio.h>int f(int n) {if (n == 1) return 1;else return f(n / 2) + 1;}int main() {int n;while (scanf("%d", &n) == 1) {printf("%d\n", f(n));}return 0;}
- 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
- 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
- UVA - 11384 Help is needed for Dexter
- uva 11384 - Help is needed for Dexter
- UVA 11384 Help is needed for Dexter
- Objective - C基础: 第五天 - 4.@property - 内存管理
- HTML页面过渡效果大全
- getopt和getopt_long函数
- Android动态加载XML文件及控件来简单实现QQ好友印象的功能
- 新建Maven+Spring项目错误集锦
- uva 11384 Help is needed for Dexter(模拟)
- [Java]Eclipse配置JDK的图解步骤
- USACO1.2.4 Palindromic Squares (palsquare)
- Codeforces Round #276 (Div. 2) Factory
- Populating Next Right Pointers in Each Node II
- Java 对象数组初始化 和 基本类型数组初始化的区别
- Activity的启动模式
- 下位机单片机c语言发送数据到串口,上位机pc机java语言获取端口数据
- Serial Port 波形分析