HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Chapter 3. Repetition structures > problem:


The power of 2

Volume problems

• 08. Binary to decimal
• 09. Decimal to binary
• 10. Maximum
• 11. Perfect numbers
• 12. Wonder primes
• 13. Round numbers
• 14. Tower of Happiness
• 2. Molecules
• The power of 2

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.

Given a single integer N. Write a program that outputs YES if N is a power of 2, and NO otherwise.

standart input standart output
8
YES
22 NO

Для отправки решений необходимо выполнить вход.

www.contester.ru