Module: (C++) Penyataan gelung dengan syarat - manakala


Problem

14 /21


logaritma binari

Problem

Diberi nombor asli N cetak integer terkecil k supaya \(2^k > ;= N.\) Meningkatkan kuasa tidak boleh digunakan!

Input 
Masukkan nombor asli N.

Cetakan 
Cetak jawapan kepada masalah.
 

 

Contoh

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!

# Input Output
1 7 3