HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Repetition (Loops) > problem:


095. 50651 - Largest power of two

Guest
• Discussion of problem (1)

Volume problems

• 030. 50584 - Total invoice amount
• 050. 50450 - Last Appereance of a ...
• 060. 50362 - Pythagorean Numbers
• 060. Problem 2
• 065. 50394 - Water Bills
• 070. 50465 - How many students h...
• 075. 50363 - Class GPA Average
• 085. 50333 - Series of Squares
• 095. 50651 - Largest power of two
• 130. 50440 - Call Center
• 135. 50392 - How much space
• 140. 50655 - Divisibility by 9
• 145. 50656 - Divisibility by 11
• 160. 50546 - Average Fuel Price
• 50338 - Convert Into Decimal
• 180. 50343 - The number of Ending...

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Prepared by Ibrahim Mesecan. Difficulty Beta

Write a program which has a function largest2spower. largest2spower function takes a number (n)
and finds the largest power of two whose result is less than or equal to the given number n
(1 <= n <= 4.000.000.000)

Sample Run 1:
Enter a number:1000
Sample Output 1:
9 // 29=512 and 210=1024


Sample Run 2:
Enter a number:100
Sample Output 2:
6 // 26=64 and 27=128
Для отправки решений необходимо выполнить вход.

www.contester.ru