- 1. Eingabe, Druck und Zahlen
- 2. Ganzzahl und Gleitzahl
- 3. Bedingungen: Wenn-dann-sonst
- 4. Für Schleife mit Bereich
- 5. Saiten
-
6. While-Schleife
-
- 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. Listen
- 8. Funktionen und Rekursion
- 9. Zweidimensionale Listen (Arrays)
- 10. Sätze
- 11. Wörterbücher
- 12. JavaScript
- 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().