uva-----(11384)Help is needed for Dexter

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

代码:

 1 #include<stdio.h>
 2 int work(int n)
 3 {
 4   int ans=0;
 5   while(n>0){
 6    ans++;
 7    n>>=1;
 8  }
 9   return ans;
10 }
11 int main()
12 {
13     int n;
14     while(scanf("%d",&n)!=EOF)
15       printf("%d\n",work(n));
16     return 0;
17 }

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏码匠的流水账

聊聊HystrixMetricsPublisher

hystrix-core-1.5.12-sources.jar!/com/netflix/hystrix/strategy/metrics/HystrixMet...

13210
来自专栏算法修养

FZU 2099 魔法阵(计算几何)

 Problem 2099 魔法阵 Accept: 120    Submit: 289 Time Limit: 1000 mSec    Memory L...

29530
来自专栏ml

uva------Help is needed for Dexter(11384)

Problem H Help is needed for Dexter Time Limit: 3 Second Dexter is tired of Dee ...

22550
来自专栏HansBug's Lab

1751: [Usaco2005 qua]Lake Counting

1751: [Usaco2005 qua]Lake Counting Time Limit: 5 Sec  Memory Limit: 64 MB Submit...

33560
来自专栏C语言及其他语言

[程序源码]C语言实现俄罗斯方块(TC2.0)

看大家这么喜欢源码,那么好吧,小编和黄老师要了许多源码,这就给大家一一分享出去! C语言实现俄罗斯方块游戏 TC2.0环境,主要用到TC提供的graphics来...

780120
来自专栏函数式编程语言及工具

FunDA(11)- 数据库操作的并行运算:Parallel data processing

   FunDA最重要的设计目标之一就是能够实现数据库操作的并行运算。我们先重温一下fs2是如何实现并行运算的。我们用interleave、merge、eith...

20780
来自专栏计算机视觉与深度学习基础

Leetcode 150 Evaluate Reverse Polish Notation

Evaluate the value of an arithmetic expression in Reverse Polish Notation. Val...

214100
来自专栏mukekeheart的iOS之旅

No.003 Longest Substring Without Repeating Characters

Longest Substring Without Repeating Characters Total Accepted: 167158 Total Subm...

24750
来自专栏码匠的流水账

聊聊spring cloud netflix的HystrixCommands

本文主要研究一下spring cloud netflix的HystrixCommands。

18720
来自专栏技术随笔

医学影像中Dicom的常用Tag分类与说明

51870

扫码关注云+社区

领取腾讯云代金券