- 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
Morning jog
Statement
As a future athlete you just started your practice for an upcoming event. Given that on the first day you run x miles, and by the event you must be able to run y miles. Calculate the number of days required for you to finally reach the required distance for the event, if you increases your distance each day by 10% from the previous day.
Print one integer representing the number of days to reach the required distance.
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
As a future athlete you just started your practice for an upcoming event. Given that on the first day you run x miles, and by the event you must be able to run y miles.Calculate the number of days required for you to finally reach the required distance for the event, if you increases your distance each day by 10% from the previous day.
Print one integer representing the number of days to reach the required distance.
Advertising by Google, may be based on your interests
In all the problems input the data using input() and print the result using print().