fix duplicate ids

Author: sujith-rek

_sources/quiz/Quiz10_en.rst

@@ -11,7 +11,7 @@ Quiz - 10
 
     .. tab:: Exercise 1
 
-        .. activecode:: q10_1
+        .. activecode:: q10_1_en
             :nocodelens:
 
             Develop the function ``cuantas_donas`` that takes ``n``, a positive integer, as a parameter, 
@@ -52,7 +52,7 @@ Quiz - 10
 
     .. tab:: Exercise 2
 
-        .. activecode:: q10_2
+        .. activecode:: q10_2_en
             :nocodelens:
 
             Develop the function ``cadena_de_extremos`` that, given a string ``s``, 
@@ -86,7 +86,7 @@ Quiz - 10
 
     .. tab:: Exercise 3
 
-        .. activecode:: q10_3
+        .. activecode:: q10_3_en
             :nocodelens:
 
             Develop the function ``remplazar_primer_caracter`` that, given a string ``s``, 
@@ -120,7 +120,7 @@ Quiz - 10
 
     .. tab:: Exercise 4
 
-        .. activecode:: q10_4
+        .. activecode:: q10_4_en
             :nocodelens:
 
             Develop the function ``combinar_dos_cadenas`` that takes two strings as 
@@ -163,7 +163,7 @@ Quiz - 10
     .. tab:: Exercise 5
 
 
-        .. activecode:: q10_5
+        .. activecode:: q10_5_en
             :nocodelens:
 
             Develop the function ``es_palindromo`` that takes a string ``s`` as 
@@ -197,7 +197,7 @@ Quiz - 10
 
     .. tab:: Exercise 6
 
-        .. activecode:: q10_6
+        .. activecode:: q10_6_en
             :nocodelens:
 
             Develop the function ``contar_ocurrencias`` that takes two parameters: 

_sources/quiz/Quiz11_en.rst

@@ -10,7 +10,7 @@ Quiz - 11
 
     .. tab:: Exercise 1
 
-        ..  activecode:: q11_1
+        ..  activecode:: q11_1_en
             :nocodelens:
 
             Develop the function ``verbo`` that receives a string ``s`` as a parameter. If the length of the string is at least 3, it should return the original string concatenated with ``"ing"`` at the end. If the string ``s`` already ends with ``"ing"``, concatenate the string ``"ly"``. If the length of the string is less than 3, it returns the original string. |br| |br|
@@ -45,7 +45,7 @@ Quiz - 11
 
     .. tab:: Exercise 2
 
-        ..  activecode:: q11_2
+        ..  activecode:: q11_2_en
             :nocodelens:
 
             Develop the function ``no_es_malo`` that receives a string ``s`` as a parameter. The function must search for the first occurrence of the string ``"no es"`` and the last occurrence of the string ``"malo"`` or the string ``"mala"``, if either appears after the first one, replace ``"no es" ... "malo"`` or ``"no es" ... "mala"`` with the strings ``"es bueno"`` or ``"es buena"`` respectively, then return the result. |br| |br|
@@ -105,7 +105,7 @@ Quiz - 11
 
     .. tab:: Exercise 3
 
-        .. activecode:: q11_3
+        .. activecode:: q11_3_en
             :nocodelens:
 
             Develop the function ``inicio_final`` that receives two strings ``a`` and ``b``. The strings have to be divided into two, if either of the strings has an odd number of characters, the first half will be the longest substring (for example ``dog`` will be divided into: ``do`` and ``g``). Given the two strings, return a new string formed as follows ``a_start + b_start + a_end + b_end``. |br| |br|
@@ -146,7 +146,7 @@ Quiz - 11
 
     .. tab:: Exercise 4
 
-        .. activecode:: q11_4
+        .. activecode:: q11_4_en
             :nocodelens:
 
             Develop the function ``cuantos_ceros`` that given a positive integer ``n``, returns the number of zeros at the end of the integer. |br| |br|
@@ -183,7 +183,7 @@ Quiz - 11
 
     .. tab:: Exercise 5
 
-        .. activecode:: q11_5
+        .. activecode:: q11_5_en
             :nocodelens:
 
             Develop the function ``contar_2`` that receives a positive integer ``n`` greater than 0. The function must return the number of times the digit 2 appears in the interval``[0, n-1]``. |br| |br|
@@ -216,7 +216,7 @@ Quiz - 11
 
     .. tab:: Exercise 6
 
-        .. activecode:: q11_6
+        .. activecode:: q11_6_en
             :nocodelens:
 
             Develop the function ``inicio_potencia`` that receives a positive integer ``n`` greater than 0. The function must return the first power of 2 that starts with ``n``. |br| |br|

_sources/quiz/Quiz12_en.rst

@@ -11,7 +11,7 @@ Quiz - 12
 
     .. tab:: Exercise 1
 
-        .. activecode:: q12_1
+        .. activecode:: q12_1_en
             :nocodelens:
 
             Develop the function ``ends_equal`` that, given a list of strings ``words``, returns the number of strings
@@ -40,7 +40,7 @@ Quiz - 12
 
     .. tab:: Exercise 2
 
-        .. activecode:: q12_2
+        .. activecode:: q12_2_en
             :nocodelens:
 
             Develop the function ``x_before`` that, given a list of strings ``words``, returns 
@@ -84,7 +84,7 @@ Quiz - 12
 
     .. tab:: Exercise 3
 
-        .. activecode:: q12_3
+        .. activecode:: q12_3_en
             :nocodelens:
 
             Develop the function ``sort_tuples`` that, given a non-empty list of tuples, returns another list 

_sources/quiz/Quiz13_en.rst

@@ -11,7 +11,7 @@ Quiz - 13
 
     .. tab:: Exercise 1
 
-        ..  activecode:: q13_1
+        ..  activecode:: q13_1_en
             :nocodelens:
 
             Develop the function ``remove_duplicates`` that receives a list ``numbers`` of integers. The function should return a list without repeated elements and sorted in ascending order. |br| |br|
@@ -46,7 +46,7 @@ Quiz - 13
 
     .. tab:: Exercise 2
 
-        ..  activecode:: q13_2
+        ..  activecode:: q13_2_en
             :nocodelens:
 
             Develop the function ``encrypt`` that receives a string ``phrase``. The function should return a new encrypted string, following these rules: |br|

_sources/quiz/Quiz8_en.rst

@@ -11,7 +11,7 @@ Quiz - 8
 
    .. tab:: Exercise 1
 
-      .. activecode:: q8_1
+      .. activecode:: q8_1_en
          :nocodelens:
 
          Define a function ``first_or_last_6`` that checks whether 6 is the first 
@@ -46,7 +46,7 @@ Quiz - 8
 
    .. tab:: Exercise 2
 
-      .. activecode:: q8_2
+      .. activecode:: q8_2_en
          :nocodelens:
 
          Define a function ``same_ends`` that takes a list ``numbers`` as a parameter, 
@@ -84,7 +84,7 @@ Quiz - 8
 
    .. tab:: Exercise 3
 
-      .. activecode:: q8_3
+      .. activecode:: q8_3_en
          :nocodelens:
 
          Define a function ``common_ends`` that takes two lists ``a`` and ``b`` 
@@ -135,7 +135,7 @@ Quiz - 8
 
    .. tab:: Exercise 4
 
-      .. activecode:: q8_4
+      .. activecode:: q8_4_en
          :nocodelens:
 
          Define a function called ``mayor_extremo`` that takes the list "numeros" as parameter, compares the ends of the list and returns a new list of the same size where all elements are the greatest magnitude extreme. |br| |br|
@@ -201,7 +201,7 @@ Quiz - 8
 
    .. tab:: Exercise 5
 
-      .. activecode:: q8_5
+      .. activecode:: q8_5_en
          :nocodelens:
 
          Define a function called ``sumar_primeros_dos`` that takes the integer list ``numeros`` of any length as parameter and returns the sum of the first two elements. If the list has less than two elements, add 0s. |br| |br|
@@ -241,7 +241,7 @@ Quiz - 8
 
    .. tab:: Exercise 6
 
-      .. activecode:: q8_6
+      .. activecode:: q8_6_en
          :nocodelens:
 
          Define a function called ``al_medio`` that takes two integer lists ``a`` and ``b`` as parameters, and returns a list of size 2 that contains the middle elements of ``a`` and ``b``. Assume that the lists have an odd length. |br| |br|
@@ -297,7 +297,7 @@ Quiz - 8
 
    .. tab:: Exercise 7
 
-      .. activecode:: q8_7
+      .. activecode:: q8_7_en
          :nocodelens:
 
          Define a function ``fancy_date``. The function will take two parameters, 
@@ -307,11 +307,12 @@ Quiz - 8
          Your clothes score will determine if you get a table at the restaurant or not, according to the following rules: |br|
 
          - If the score of one of the two clothing is less than or equal to 2, 
-         they will not be entitled to a table (``0``). |br|
+           they will not be entitled to a table (``0``). |br|
          - If the scores are higher, then if one of them is very 
-         elegant (score >= 8) they will be entitled to a table (``2``). |br|
+           elegant (score >= 8) they will be entitled to a table (``2``). |br|
          - Otherwise, the answer is maybe (``1``). |br|
 
+        
          So ``fancy_date`` returns a number between 0, 1, and 2, which mean No, Maybe, and Yes, respectively. |br| |br|
          Examples: |br|   
          ``fancy_date(5, 10)`` -> ``2`` |br|
@@ -347,7 +348,7 @@ Quiz - 8
 
    .. tab:: Exercise 8
 
-      .. activecode:: q8_8
+      .. activecode:: q8_8_en
          :nocodelens:
 
          The *squirrels* soccer team normally plays when the temperature is 
@@ -392,7 +393,7 @@ Quiz - 8
 
    .. tab:: Exercise 9
 
-      .. activecode:: q8_9
+      .. activecode:: q8_9_en
          :nocodelens:
 
          Let's simulate a speedometer that applies a fine if the maximum speed is exceeded:
@@ -450,7 +451,7 @@ Quiz - 8
 
    .. tab:: Exercise 10
 
-      .. activecode:: q8_10
+      .. activecode:: q8_10_en
         :nocodelens:
 
         Define a function ``set_alarm`` that takes two parameters: The first parameter 

_sources/quiz/QuizExtras2_en.rst

@@ -11,7 +11,7 @@ Quiz - Extras 2
 
     .. tab:: Exercise 1
 
-        ..  activecode:: qExtra2_1
+        ..  activecode:: qExtra2_1_en
             :nocodelens:
 
             A primary school is planning a field trip to the zoo for some of its students. For this, the school can only spend exactly ``budget`` units. It is known that the entry to the zoo costs 5 units for children under 12 years old and 7 units for those who are 12 years old or older. Develop the function ``maximo_estudiantes`` that receives ``budget``, a positive integer that indicates the budget that the school intends to spend. The function should return a tuple ``(p, g)`` with the maximum number of small and large students that the school can take to the zoo considering all values as integers. |br| |br|
@@ -42,7 +42,7 @@ Quiz - Extras 2
 
     .. tab:: Exercise 2
 
-        ..  activecode:: qExtra2_2
+        ..  activecode:: qExtra2_2_en
             :nocodelens:
 
             Develop the function ``a_romano``, which receives a positive integer ``n`` greater than zero. The function should return the conversion of the number from Arabic to Roman numerals. The function should return a string that represents the number in Roman numerals. |br| |br|
@@ -82,7 +82,7 @@ Quiz - Extras 2
 
     .. tab:: Exercise 3
 
-        ..  activecode:: qExtra2_3
+        ..  activecode:: qExtra2_3_en
             :nocodelens:
 
             Develop the function ``calcular_pi``, which receives a positive parameter ``n`` greater than 0. The function should calculate the approximate value of ``pi`` with ``n`` terms, according to the following formula. |br|

_sources/quiz/QuizExtras_en.rst

@@ -10,7 +10,7 @@ Quiz - Extras
 
     .. tab:: Exercise 1
 
-        .. activecode:: qExtra_1
+        .. activecode:: qExtra_1_en
             :nocodelens:
 
             **Josephus problem**. Imagine you have ``n`` people arranged in a circle. Suppose these people are numbered from 1 to ``n`` clockwise. Starting with person number **1**, 
@@ -36,7 +36,7 @@ Quiz - Extras
 
     .. tab:: Exercise 2
 
-        .. activecode:: qExtra_2
+        .. activecode:: qExtra_2_en
             :nocodelens:
 
             Implement the **Sieve of Eratosthenes** algorithm. |br|
@@ -69,7 +69,7 @@ Quiz - Extras
 
     .. tab:: Exercise 3
 
-        .. activecode:: qExtra_3
+        .. activecode:: qExtra_3_en
             :nocodelens:
 
             **Project Euler Problem 2**. `Problem <https://projecteuler.net/problem=2>`_ |br|
@@ -109,7 +109,7 @@ Quiz - Extras
 
     .. tab:: Exercise 4
 
-        .. activecode:: qExtra_4
+        .. activecode:: qExtra_4_en
             :nocodelens:
 
             In the book "The Man Who Counted," by *Malba Tahan*, a character wanted to win the grains of wheat that were distributed on a chessboard as follows: 
@@ -136,7 +136,7 @@ Quiz - Extras
 
     .. tab:: Exercise 5
 
-        .. activecode:: qExtra_5
+        .. activecode:: qExtra_5_en
             :nocodelens:
 
             You are given ``n`` tiles with dimensions of 10cm x 10cm. With them, you must assemble a set of squares using all the given tiles. To do this, you must follow the following rules: