-
Notifications
You must be signed in to change notification settings - Fork 175
Translated until exercise 20 only because the rest haven't been formatted #6
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
Merged
Changes from all commits
Commits
Show all changes
2 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -6,6 +6,7 @@ | |
!.gitpod.Dockerfile | ||
!bc.json | ||
!README.md | ||
!README.*.md | ||
|
||
!/exercises | ||
!/exercises/* | ||
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
4 changes: 4 additions & 0 deletions
exercises/01-welcome/README.es.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,4 @@ | ||
# Bienvenid@ a Python! | ||
|
||
¡¡Nos estusiasma mucho tenerte aquí!! 🎉 😂 | ||
Presiona `Next` `Next →` de arriba a la derecha cuando quieras empezar. |
5 changes: 4 additions & 1 deletion
exercises/01-welcome/README.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1,4 @@ | ||
# Welcome to Python! | ||
# Welcome to Python! | ||
|
||
We are very excited to have you here !! 🎉 😂 | ||
Click `next` on the top right of this instructions when you are ready to start. |
19 changes: 19 additions & 0 deletions
exercises/02-hello-world/README.es.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,19 @@ | ||
# `02` Hola, Mundo | ||
|
||
En Python, usamos `print` para hacer que el computador escriba cualquier cosa que queramos (el contenido de una variable, un texto dado, etc.) in algo llamado `la consola`. | ||
|
||
Cada idioma tiene funciones para integrarse con la consola, ya que al principio era la única forma de interactuar con los usuarios (antes de que llegara Windows o MacOS o Linux). Hoy en día, la impresión en la consola se utiliza sobre todo como herramienta de monitorización, ideal para dejar un rastro del contenido de las variables durante la ejecución del programa. | ||
|
||
Este es un ejemplo de cómo usarlo: | ||
```py | ||
print("How are you?") | ||
``` | ||
|
||
## 📝 Instrucciones: | ||
|
||
Usa la función `print()` para escribir "Hello World!" en la consola. Siéntete libre de intentar otras cosas también. | ||
|
||
## 💡 Información adicional: | ||
|
||
Video de 5 minutos sobre la consola: | ||
https://www.youtube.com/watch?v=vROGBvX_MHQ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
15 changes: 15 additions & 0 deletions
exercises/03-sum_of_three_numbers/README.es.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,15 @@ | ||
# `03` Sum of three numbers | ||
|
||
## 📝 Instrucciones: | ||
|
||
**Planteamiento** | ||
Obteniendo tres números de la entrada, imprime su suma. Cada número es dado en una línea aparte. | ||
|
||
**Ejemplo de entrada** | ||
- 2 | ||
- 3 | ||
- 6 | ||
|
||
**Ejemplo de salida** | ||
- 11 | ||
|
2 changes: 1 addition & 1 deletion
exercises/03-sum_of_three_numbers/README.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
22 changes: 22 additions & 0 deletions
exercises/04-area_of_right_triangle/README.es.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,22 @@ | ||
# `04` Área de un triángulo rectángulo | ||
|
||
## 📝 Instrucciones: | ||
|
||
Escribe un programa que lea la longitud de la base y la altura de un triángulo rectángulo e imprima su área. Cada número es dado en una línea por separado. | ||
|
||
 | ||
|
||
**Ejemplo de entrada** | ||
* 3 | ||
* 5 | ||
|
||
**Ejemplo de salida** | ||
* 7.5 | ||
|
||
**Teoría** | ||
|
||
Si no sabes cómo empezar la solución a este problema, por favor, revisa la teoría en esta lección: | ||
https://snakify.org/lessons/print_input_numbers/ | ||
|
||
También puedes intentar paso a paso con trozos de la teoría: | ||
https://snakify.org/lessons/print_input_numbers/steps/1/ |
2 changes: 1 addition & 1 deletion
exercises/04-area_of_right_triangle/README.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
20 changes: 20 additions & 0 deletions
exercises/05-hello_harry/README.es.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,20 @@ | ||
# `05` Hola Harry | ||
|
||
## 📝 Instrucciones: | ||
|
||
Escribe un programa que salude al usuario imprimiendo la palabra "Hola", una coma, el nombre del usuario y un signo de exclamación después de él. Ve los ejemplos a continuación. | ||
|
||
**Advertencia.** La salida de tu programa debe coincidir estrictamente con la deseada, caracter por caracter. No debe haber ningún espacio entre el nombre y el signo de exclamación. Puedes usar el operador + para concatenar dos cadenas de texto. Ve la lección para más detalles. | ||
|
||
**Ejemplo de entrada** | ||
* Harry | ||
|
||
**Ejemplo de salida** | ||
* Hello, Harry! | ||
|
||
**Teoría** | ||
Si no sabes cómo empezar la solución a esta asignación, por favor, revisa la teoría en esta lección: | ||
https://snakify.org/lessons/print_input_numbers/ | ||
|
||
También puedes intentar paso a paso con trozos de la teoría: | ||
https://snakify.org/lessons/print_input_numbers/steps/1/ |
2 changes: 1 addition & 1 deletion
exercises/05-hello_harry/README.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
20 changes: 20 additions & 0 deletions
exercises/06-previous_and_next/README.es.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,20 @@ | ||
# `06` Anterior y siguiente | ||
|
||
## 📝 Instrucciones: | ||
|
||
Escribe un programa que lea un número entero y devuelva sus números anteriores y siguientes. Ve el ejemplo a continuación. | ||
|
||
**Ejemplo de entrada** | ||
* 179 | ||
|
||
**Ejemplo de salida** | ||
* (178, 180) | ||
|
||
Ayuda: Puedes devolver múltiples parámetros: `return a, b` | ||
|
||
**Teoría** | ||
Si no sabes cómo empezar la solución a esta asignación, por favor, revisa la teoría en esta lección: | ||
https://snakify.org/lessons/print_input_numbers/ | ||
|
||
También puedes intentar paso a paso con trozos de la teoría: | ||
https://snakify.org/lessons/print_input_numbers/steps/1/ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
21 changes: 21 additions & 0 deletions
exercises/07-Apple_sharing/README.es.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,21 @@ | ||
# `07` Compartiendo una manzana | ||
|
||
## 📝 Instrucciones: | ||
|
||
N estudiantes cogen K manzanas y las distribuyen entre ell@s de manera uniforme. La parte restante (la indivisible) permanece en la cesta. ¿Cuántas manzanas recibirá cada estudiante? ¿Cuántas manzanas quedarán en la cesta? | ||
El programa lee los números N y K. Debería devolver las dos respuestas a las preguntas anteriores. | ||
|
||
**Ejemplo de entrada** | ||
* (6, 50) | ||
|
||
**Ejemplo de salida** | ||
* (8, 2) | ||
|
||
Ayuda: Puedes devolver múltiples parámetros: `return a, b` | ||
|
||
**Teoría** | ||
Si no sabes cómo empezar la solución a esta asignación, por favor, revisa la teoría en esta lección: | ||
https://snakify.org/lessons/print_input_numbers/ | ||
|
||
También puedes intentar paso a paso con trozos de la teoría: | ||
https://snakify.org/lessons/print_input_numbers/steps/1/ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
8 changes: 8 additions & 0 deletions
exercises/07.1-square-value/README.es.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,8 @@ | ||
# 07.1 El cuadrado de un número | ||
|
||
# 📝 Instrucciones | ||
|
||
Escribe un método llamado `square` que calculará el valor cuadrado de un número | ||
|
||
## 💡 Ayuda: | ||
Usa el operador `**` |
23 changes: 23 additions & 0 deletions
exercises/08-hours_and_minutes/README.es.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,23 @@ | ||
# `08` Horas y minutos | ||
|
||
## 📝 Instrucciones: | ||
|
||
Dado el número entero N - el número de segundos que pasan desde la medianoche - ¿cuántas horas y minutos completos pasan desde la medianoche? | ||
|
||
El programa debe imprimir dos números: el número de horas (entre 0 y 23) y el número de minutos (entre 0 y 1339). | ||
|
||
Por ejemplo, si N = 3900, entonces han pasado 3900 segundos desde la medianoche - es decir, ahora es la 1:05am. Así que el programa debe imprimir 1 65 - 1 hora completa ha pasado desde la medianoche, 65 minutos completos han pasado desde la medianoche. | ||
|
||
|
||
**Ejemplo de entrada** | ||
* 3900 | ||
|
||
**Ejemplo de salida** | ||
* (1, 65) | ||
|
||
**Teoría** | ||
Si no sabes cómo empezar la solución a esta asignación, por favor, revisa la teoría en esta lección: | ||
https://snakify.org/lessons/print_input_numbers/ | ||
|
||
También puedes intentar paso a paso con trozos de la teoría: | ||
https://snakify.org/lessons/print_input_numbers/steps/1/ |
2 changes: 1 addition & 1 deletion
exercises/08-hours_and_minutes/README.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
35 changes: 35 additions & 0 deletions
exercises/09-Two_timestamps/README.es.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,35 @@ | ||
# `09` Dos marcas de tiempo | ||
|
||
## 📝 Instrucciones: | ||
|
||
Dadas dos marcas de tiempo del mismo día: un número de horas, minutos y segundos para ambas marcas de tiempo. El momento de la primera marca de tiempo ocurrió antes del momento de la segunda. Calcula cuántos segundos pasaron entre ellos. | ||
|
||
|
||
**Ejemplo de entrada #1** | ||
* 1 | ||
* 1 | ||
* 1 | ||
* 2 | ||
* 2 | ||
* 2 | ||
|
||
**Ejemplo de salida #1** | ||
* 3661 | ||
|
||
**Ejemplo de entrada #2** | ||
* 1 | ||
* 2 | ||
* 30 | ||
* 1 | ||
* 3 | ||
* 20 | ||
|
||
**Ejemplo de salida #2** | ||
* 50 | ||
|
||
**Teoría** | ||
Si no sabes cómo empezar la solución a esta asignación, por favor, revisa la teoría en esta lección: | ||
https://snakify.org/lessons/print_input_numbers/ | ||
|
||
También puedes intentar paso a paso con trozos de la teoría: | ||
https://snakify.org/lessons/print_input_numbers/steps/1/ |
2 changes: 1 addition & 1 deletion
exercises/09-Two_timestamps/README.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
18 changes: 18 additions & 0 deletions
exercises/10-Two_digits/README.es.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,18 @@ | ||
# `10` Dos dígitos | ||
|
||
## 📝 Instrucciones: | ||
|
||
Dado un entero de dos dígitos, devuelve su dígito izquierdo (las decenas) y luego su dígito derecho (las unidades). Utiliza el operador de división de enteros para obtener el dígito de las decenas y el operador de residuo/resto para obtener el dígito de las unidades. | ||
|
||
**Ejemplo de entrada** | ||
* 79 | ||
|
||
**Ejemplo de salida** | ||
* (7, 9) | ||
|
||
**Teoría** | ||
Si no sabes cómo empezar la solución a esta asignación, por favor, revisa la teoría en esta lección: | ||
https://snakify.org/lessons/integer_float_numbers/ | ||
|
||
También puedes intentar paso a paso con trozos de la teoría: | ||
https://snakify.org/lessons/integer_float_numbers/steps/1/ |
2 changes: 1 addition & 1 deletion
exercises/10-Two_digits/README.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
18 changes: 18 additions & 0 deletions
exercises/11-Swap_digits/README.es.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,18 @@ | ||
# `11` Intercambiar dígitos | ||
|
||
## 📝 Instrucciones: | ||
|
||
Dado un entero de dos dígitos, intercambia sus dígitos de posición e imprime el resultado. | ||
|
||
**Ejemplo de entrada** | ||
* 79 | ||
|
||
**Ejemplo de salida** | ||
* 97 | ||
|
||
**Teoría** | ||
Si no sabes cómo empezar la solución a esta asignación, por favor, revisa la teoría en esta lección: | ||
https://snakify.org/lessons/integer_float_numbers/ | ||
|
||
También puedes intentar paso a paso con trozos de la teoría: | ||
https://snakify.org/lessons/integer_float_numbers/steps/1/ |
2 changes: 1 addition & 1 deletion
exercises/11-Swap_digits/README.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
18 changes: 18 additions & 0 deletions
exercises/12-Last_two_digits/README.es.md
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,18 @@ | ||
# `12` Últimos dos dígitos | ||
|
||
## 📝 Instrucciones: | ||
|
||
Dado un número entero mayor que 9, imprime sus últimos dos dígitos. | ||
|
||
**Ejemplo de entrada** | ||
1234 | ||
|
||
**Ejemplo de salida** | ||
34 | ||
|
||
**Teoría** | ||
Si no sabes cómo empezar la solución a esta asignación, por favor, revisa la teoría en esta lección: | ||
https://snakify.org/lessons/integer_float_numbers/ | ||
|
||
También puedes intentar paso a paso con trozos de la teoría: | ||
https://snakify.org/lessons/integer_float_numbers/steps/1/ |
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.