- 1. Entrada, impresión y números
- 2. Números enteros y flotantes
- 3. Condiciones: if-then-else
- 4. Para bucle con rango
- 5. Instrumentos de cuerda
-
6. While loop
-
- 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. Liza
- 8. Funciones y recursión
- 9. Listas bidimensionales (matrices)
- 10. Conjuntos
- 11. Diccionarios
- 12. JavaScript
- 13. HTML5 and CSS
- 14. Responsive Design with Bootstrap
- 15. jQuery
Ad place
Fibonacci numbers
Statement
The Fibonacci sequence is defined as follows: $$ \phi_0 = 0, \ \phi_1 = 1, \ \phi_n = \phi_{n-1} + \phi_{n-2} . $$ Given a non-negative integer \( n \), print the \( n \)th Fibonacci number \( \phi_n \). This problem can also be solved with a for loop.
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
The Fibonacci sequence is defined as follows: $$ \phi_0 = 0, \ \phi_1 = 1, \ \phi_n = \phi_{n-1} + \phi_{n-2} . $$ Given a non-negative integer \( n \), print the \( n \)th Fibonacci number \( \phi_n \). This problem can also be solved with a for loop.
Advertising by Google, may be based on your interests
In all the problems input the data using input() and print the result using print().