- 1. 입력, 인쇄 및 숫자
- 2. 정수 및 부동 소수점 수
- 3. 조건 : if-then-else
- 4. 범위가있는 루프의 경우
- 5. 문자열
-
6. While 루프
-
- List of squares
- Least divisor
- The power of two
- Morning jog
- The length of the sequence
- The sum of the sequence
- The average of the sequence
- The maximum of the sequence
- The index of the maximum of a sequence
- The number of even elements of the sequence
- The number of elements that are greater than the previous one
- The second maximum
- The number of elements equal to the maximum
- Fibonacci numbers
- The index of a Fibonacci number
- The maximum number of consecutive equal elements
-
- 7. 기울기
- 8. 함수와 재귀
- 9. 2 차원 목록 (배열)
- 10. 세트
- 11. 사전
- 12. 자바 스크립트
- 13. HTML5 and CSS
- 14. Responsive Design with Bootstrap
- 15. jQuery
Ad place
The power of two
Statement
For a given integer N, find the greatest integer x where \( 2^x \) is less than or equal to N. Print the exponent value and the result of the expression \( 2^x \). Don't use the operation **
.
Advertising by Google, may be based on your interests
In all the problems input the data using input()
and print the result using print()
.
Statement
For a given integer N, find the greatest integer x where \( 2^x \) is less than or equal to N. Print the exponent value and the result of the expression \( 2^x \).Don't use the operation **
.
Advertising by Google, may be based on your interests
In all the problems input the data using input()
and print the result using print()
.