Module: (Java) Loop statement with condition - while


Problem

14 /21


binary logarithm

Problem

Given a natural number N print the smallest integer k such that \(2^k >= N.\) Raising to a power cannot be used!

Input 
Enter a natural number N.

Imprint 
Print the answer to the problem.
 

 

Examples
# Input Output
1 7 3

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!