UVA 11384 Help is needed for Dexter
来源:互联网 发布:iptv网络电视频道 编辑:程序博客网 时间:2024/05/22 06:35
UVA 11384 Help is needed for Dexter
Description:
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个连续的整数,需要你去通过把该数列的一个或者几个数同时减去一个正整数,使整个数列全部为零,求步骤最少的算法。
通过模拟可以发现:1,2,3,4,5,6 把4,5,6减去4后会变成0,1,2即相当于该数列前3项的数每个减去1,归纳可得 f(6)=f(3)+1,同理可知f(n)=f(n/2)+1,当n=1时,
f(1)=1——二分过程
代码如下:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int fun(int n)
{
return n == 1 ? 1 : fun(n/2)+1;
}
int main()
{
int n;
while (scanf("%d",&n) != EOF)
{
cout<<fun(n)<<endl;
}
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
- 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
- UVA 11384 Help is needed for Dexter
- 面向中文的自然语言编程
- Myeclipse中通过JDBC连接MySQL数据库的详细步骤
- Singleton Pattern(单例模式)
- Mac HomeBrew 安装
- 5.1比赛总结加解题报告
- UVA 11384 Help is needed for Dexter
- Special equations
- Delphi的线程类
- 黑马程序员-网络通信
- mac中安装python, pydev, beautifulsoup, lxml, scrapy
- iOS-UITableviewCell的重用机制
- UVALive 3357 Pinary
- STL容器默认的内存分配器(std::alloc)
- 【wamp+zendFramework】zendFramework基本配置环境详细步骤