AYIT 여름방학 캠프 첫째 주 토요경기 F - 1로 횟수 감소

Description
전부 1 로 줄인 횟수
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
 
분석
제목: 가장 적은 수를 찾을 수 있도록 도와주는 것은 그 수에서 임의로 몇 개의 수를 선택하여 임의의 수를 빼고 모든 수가 0이 될 때까지 하는 것이다
또 하나의 규칙적인 문제입니다. 당신의 한 번 또 한 번의 유도가 필요합니다. 사실은 2점 찾기입니다. 훈련 안내서의 26페이지에서
주요 공식은 f(a)=f(a/2)+1이고 y는 n==1로 계속 귀속된다.

1
2
3
4
5
6
7
8
9
10
11
12

#include<stdio.h>
int main()
{
    int i,n;
    while(scanf("%d",&n)!=EOF)
    {
for(i=0;n!=0;i++)
    n/=2;
    printf("%d
",i);
    }
    return 0;
}