euler-manager 0.1.1 → 0.2.0

data/data/problems/104.yml

@@ -1,11 +1,11 @@
 ---
 :id: 104
 :name: Pandigital Fibonacci ends
-:url: http://projecteuler.net/problem=104
+:url: https://projecteuler.net/problem=104
 :content: |+
   The Fibonacci sequence is defined by the recurrence relation:
 
-  > F<sub><i>n</i></sub> = F<sub><i>n</i><img src="%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif" width="9" height="3" alt="−" border="0" style="vertical-align:middle;">1</sub> + F<sub><i>n</i><img src="%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif" width="9" height="3" alt="−" border="0" style="vertical-align:middle;">2</sub>, where F<sub>1</sub> = 1 and F<sub>2</sub> = 1.
+  > F<sub><i>n</i></sub> = F<sub><i>n</i>−1</sub> + F<sub><i>n</i>−2</sub>, where F<sub>1</sub> = 1 and F<sub>2</sub> = 1.
 
   It turns out that F<sub>541</sub>, which contains 113 digits, is the first Fibonacci number for which the last nine digits are 1-9 pandigital (contain all the digits 1 to 9, but not necessarily in order). And F<sub>2749</sub>, which contains 575 digits, is the first Fibonacci number for which the first nine digits are 1-9 pandigital.
 

data/data/problems/105.yml

@@ -1,16 +1,16 @@
 ---
 :id: 105
 :name: 'Special subset sums: testing'
-:url: http://projecteuler.net/problem=105
+:url: https://projecteuler.net/problem=105
 :content: |+
   Let S(A) represent the sum of elements in set A of size _n_. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the following properties are true:
 
-  1. S(B) ![≠]({{ images_dir }}/symbol_ne.gif) S(C); that is, sums of subsets cannot be equal.
-  2. If B contains more elements than C then S(B) ![>]({{ images_dir }}/symbol_gt.gif) S(C).
+  1. S(B) ≠ S(C); that is, sums of subsets cannot be equal.
+  2. If B contains more elements than C then S(B) \> S(C).
 
   For example, {81, 88, 75, 42, 87, 84, 86, 65} is not a special sum set because 65 + 87 + 88 = 75 + 81 + 84, whereas {157, 150, 164, 119, 79, 159, 161, 139, 158} satisfies both rules for all possible subset pair combinations and S(A) = 1286.
 
-  Using [sets.txt](project/sets.txt) (right click and "Save Link/Target As..."), a 4K text file with one-hundred sets containing seven to twelve elements (the two examples given above are the first two sets in the file), identify all the special sum sets, A<sub>1</sub>, A<sub>2</sub>, ..., A<sub><i>k</i></sub>, and find the value of S(A<sub>1</sub>) + S(A<sub>2</sub>) + ... + S(A<sub><i>k</i></sub>).
+  Using [sets.txt](project/resources/p105_sets.txt) (right click and "Save Link/Target As..."), a 4K text file with one-hundred sets containing seven to twelve elements (the two examples given above are the first two sets in the file), identify all the special sum sets, A<sub>1</sub>, A<sub>2</sub>, ..., A<sub><i>k</i></sub>, and find the value of S(A<sub>1</sub>) + S(A<sub>2</sub>) + ... + S(A<sub><i>k</i></sub>).
 
   NOTE: This problem is related to [Problem 103](problem=103) and [Problem 106](problem=106).
 

data/data/problems/106.yml

@@ -1,12 +1,12 @@
 ---
 :id: 106
 :name: 'Special subset sums: meta-testing'
-:url: http://projecteuler.net/problem=106
+:url: https://projecteuler.net/problem=106
 :content: |+
   Let S(A) represent the sum of elements in set A of size _n_. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the following properties are true:
 
-  1. S(B) ![≠]({{ images_dir }}/symbol_ne.gif) S(C); that is, sums of subsets cannot be equal.
-  2. If B contains more elements than C then S(B) ![>]({{ images_dir }}/symbol_gt.gif) S(C).
+  1. S(B) ≠ S(C); that is, sums of subsets cannot be equal.
+  2. If B contains more elements than C then S(B) \> S(C).
 
   For this problem we shall assume that a given set contains _n_ strictly increasing elements and it already satisfies the second rule.
 

data/data/problems/107.yml

@@ -1,19 +1,19 @@
 ---
 :id: 107
 :name: Minimal network
-:url: http://projecteuler.net/problem=107
+:url: https://projecteuler.net/problem=107
 :content: "The following undirected network consists of seven vertices and twelve
-  edges with a total weight of 243.\n\n ![]({{ images_dir }}/p_107_1.gif)  \n\nThe
-  same network can be represented by the matrix below.\n\n|      | **A** | **B** |
-  **C** | **D** | **E** | **F** | **G** |\n| **A** | - | 16 | 12 | 21 | - | - | -
-  |\n| **B** | 16 | - | - | 17 | 20 | - | - |\n| **C** | 12 | - | - | 28 | - | 31
-  | - |\n| **D** | 21 | 17 | 28 | - | 18 | 19 | 23 |\n| **E** | - | 20 | - | 18 |
-  - | - | 11 |\n| **F** | - | - | 31 | 19 | - | - | 27 |\n| **G** | - | - | - | 23
-  | 11 | 27 | - |\n\nHowever, it is possible to optimise the network by removing some
-  edges and still ensure that all points on the network remain connected. The network
-  which achieves the maximum saving is shown below. It has a weight of 93, representing
-  a saving of 243 ![−]({{ images_dir }}/symbol_minus.gif) 93 = 150 from the original
-  network.\n\n ![]({{ images_dir }}/p_107_2.gif)  \n\nUsing [network.txt](project/network.txt)
+  edges with a total weight of 243.\n\n ![]({{ images_dir }}/p107_1.gif)  \n\nThe
+  same network can be represented by the matrix below.\n\n|     
+  | **A** | **B** | **C** | **D** | **E** | **F** | **G** |\n| **A** | - | 16 | 12
+  | 21 | - | - | - |\n| **B** | 16 | - | - | 17 | 20 | - | - |\n| **C** | 12 | - |
+  - | 28 | - | 31 | - |\n| **D** | 21 | 17 | 28 | - | 18 | 19 | 23 |\n| **E** | -
+  | 20 | - | 18 | - | - | 11 |\n| **F** | - | - | 31 | 19 | - | - | 27 |\n| **G**
+  | - | - | - | 23 | 11 | 27 | - |\n\nHowever, it is possible to optimise the network
+  by removing some edges and still ensure that all points on the network remain connected.
+  The network which achieves the maximum saving is shown below. It has a weight of
+  93, representing a saving of 243 − 93 = 150 from the original network.\n\n ![]({{
+  images_dir }}/p107_2.gif)  \n\nUsing [network.txt](project/resources/p107_network.txt)
   (right click and 'Save Link/Target As...'), a 6K text file containing a network
   with forty vertices, and given in matrix form, find the maximum saving which can
   be achieved by removing redundant edges whilst ensuring that the network remains

data/data/problems/108.yml

@@ -1,18 +1,12 @@
 ---
 :id: 108
 :name: Diophantine reciprocals I
-:url: http://projecteuler.net/problem=108
+:url: https://projecteuler.net/problem=108
 :content: "In the following equation <var>x</var>, <var>y</var>, and <var>n</var>
-  are positive integers.\n\n| \n1  \n ![]({{ images_dir }}/blackdot.gif)  \n <var>x</var>\n
-  | + | \n1  \n ![]({{ images_dir }}/blackdot.gif)  \n <var>y</var>\n | = | \n1  \n
-  ![]({{ images_dir }}/blackdot.gif)  \n <var>n</var>\n |\n\nFor <var>n</var> = 4
-  there are exactly three distinct solutions:\n\n| \n1  \n ![]({{ images_dir }}/blackdot.gif)
-  \ \n 5\n | + | \n1  \n ![]({{ images_dir }}/blackdot.gif)  \n 20\n | = | \n1  \n
-  ![]({{ images_dir }}/blackdot.gif)  \n 4\n |\n| \n1  \n ![]({{ images_dir }}/blackdot.gif)
-  \ \n 6\n | + | \n1  \n ![]({{ images_dir }}/blackdot.gif)  \n 12\n | = | \n1  \n
-  ![]({{ images_dir }}/blackdot.gif)  \n 4\n |\n| \n1  \n ![]({{ images_dir }}/blackdot.gif)
-  \ \n 8\n | + | \n1  \n ![]({{ images_dir }}/blackdot.gif)  \n 8\n | = | \n1  \n
-  ![]({{ images_dir }}/blackdot.gif)  \n 4\n |\n\nWhat is the least value of <var>n</var>
-  for which the number of distinct solutions exceeds one-thousand?\n\nNOTE: This problem
-  is an easier version of [Problem 110](problem=110); it is strongly advised that
-  you solve this one first.\n\n"
+  are positive integers.\n\n| \n1  \n<var>x</var>\n | + | \n1  \n<var>y</var>\n |
+  = | \n1  \n<var>n</var>\n |\n\nFor <var>n</var> = 4 there are exactly three distinct
+  solutions:\n\n| \n1  \n5\n | + | \n1  \n20\n | = | \n1  \n4\n |\n| \n1  \n6\n |
+  + | \n1  \n12\n | = | \n1  \n4\n |\n| \n1  \n8\n | + | \n1  \n8\n | = | \n1  \n4\n
+  |\n\nWhat is the least value of <var>n</var> for which the number of distinct solutions
+  exceeds one-thousand?\n\nNOTE: This problem is an easier version of [Problem 110](problem=110);
+  it is strongly advised that you solve this one first.\n\n"

data/data/problems/109.yml

@@ -1,10 +1,10 @@
 ---
 :id: 109
 :name: Darts
-:url: http://projecteuler.net/problem=109
+:url: https://projecteuler.net/problem=109
 :content: "In the game of darts a player throws three darts at a target board which
   is split into twenty equal sized sections numbered one to twenty.\n\n ![]({{ images_dir
-  }}/p_109.gif)  \n\nThe score of a dart is determined by the number of the region
+  }}/p109.gif)  \n\nThe score of a dart is determined by the number of the region
   that the dart lands in. A dart landing outside the red/green outer ring scores zero.
   The black and cream regions inside this ring represent single scores. However, the
   red/green outer ring and middle ring score double and treble scores respectively.\n\nAt
@@ -19,12 +19,13 @@
   a player is able to finish on their current score it is called a \"checkout\" and
   the highest checkout is 170: T20 T20 D25 (two treble 20s and double bull).\n\nThere
   are exactly eleven distinct ways to checkout on a score of 6:\n\n| ![]({{ images_dir
-  }}/spacer.gif)  \nD3 | ![]({{ images_dir }}/spacer.gif)  \n  | ![]({{ images_dir
-  }}/spacer.gif)  \n  |\n| D1 | D2 |   |\n| S2 | D2 |   |\n| D2 | D1 |   |\n| S4 |
-  D1 |   |\n| S1 | S1 | D2 |\n| S1 | T1 | D1 |\n| S1 | S3 | D1 |\n| D1 | D1 | D1 |\n|
-  D1 | S2 | D1 |\n| S2 | S2 | D1 |\n\nNote that D1 D2 is considered **different**
-  to D2 D1 as they finish on different doubles. However, the combination S1 T1 D1
-  is considered the **same** as T1 S1 D1.\n\nIn addition we shall not include misses
-  in considering combinations; for example, D3 is the **same** as 0 D3 and 0 0 D3.\n\nIncredibly
-  there are 42336 distinct ways of checking out in total.\n\nHow many distinct ways
-  can a player checkout with a score less than 100?\n\n"
+  }}/spacer.gif)  \nD3 | ![]({{ images_dir }}/spacer.gif)  \n  | ![]({{ images_dir
+  }}/spacer.gif)  \n  |\n| D1 | D2 |   |\n| S2 | D2 |   |\n| D2 | D1
+  |   |\n| S4 | D1 |   |\n| S1 | S1 | D2 |\n| S1 | T1 | D1 |\n| S1 | S3
+  | D1 |\n| D1 | D1 | D1 |\n| D1 | S2 | D1 |\n| S2 | S2 | D1 |\n\nNote that D1 D2
+  is considered **different** to D2 D1 as they finish on different doubles. However,
+  the combination S1 T1 D1 is considered the **same** as T1 S1 D1.\n\nIn addition
+  we shall not include misses in considering combinations; for example, D3 is the
+  **same** as 0 D3 and 0 0 D3.\n\nIncredibly there are 42336 distinct ways of checking
+  out in total.\n\nHow many distinct ways can a player checkout with a score less
+  than 100?\n\n"

data/data/problems/11.yml

@@ -1,27 +1,24 @@
 ---
 :id: 11
 :name: Largest product in a grid
-:url: http://projecteuler.net/problem=11
-:content: "In the 20 ![×]({{ images_dir }}/symbol_times.gif)20 grid below, four numbers
-  along a diagonal line have been marked in red.\n\n08 02 22 97 38 15 00 40 00 75
-  04 05 07 78 52 12 50 77 91 08  \n\r49 49 99 40 17 81 18 57 60 87 17 40 98 43 69
-  48 04 56 62 00  \n\r81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
-  \ \n\r52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91  \n\r22 31 16
-  71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80  \n\r24 47 32 60 99 03 45 02
-  44 75 33 53 78 36 84 20 35 17 12 50  \n\r32 98 81 28 64 23 67 10 **26** 38 40 67
-  59 54 70 66 18 38 64 70  \n\r67 26 20 68 02 62 12 20 95 **63** 94 39 63 08 40 91
-  66 49 94 21  \n\r24 55 58 05 66 73 99 26 97 17 **78** 78 96 83 14 88 34 89 63 72
-  \ \n\r21 36 23 09 75 00 76 44 20 45 35 **14** 00 61 33 97 34 31 33 95  \n\r78 17
-  53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92  \n\r16 39 05 42 96 35 31
-  47 55 58 88 24 00 17 54 24 36 29 85 57  \n\r86 56 00 48 35 71 89 07 05 44 44 37
-  44 60 21 58 51 54 17 58  \n\r19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04
-  89 55 40  \n\r04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66  \n\r88
-  36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69  \n\r04 42 16 73 38 25
-  39 11 24 94 72 18 08 46 29 32 40 62 76 36  \n\r20 69 36 41 72 30 23 88 34 62 99
-  69 82 67 59 85 74 04 36 16  \n\r20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16
-  23 57 05 54  \n\r01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48\n\nThe
-  product of these numbers is 26 ![×]({{ images_dir }}/symbol_times.gif) 63 ![×]({{
-  images_dir }}/symbol_times.gif) 78 ![×]({{ images_dir }}/symbol_times.gif) 14 =
-  1788696.\n\nWhat is the greatest product of four adjacent numbers in the same direction
-  (up, down, left, right, or diagonally) in the 20 ![×]({{ images_dir }}/symbol_times.gif)20
-  grid?\n\n"
+:url: https://projecteuler.net/problem=11
+:content: "In the 20×20 grid below, four numbers along a diagonal line have been marked
+  in red.\n\n08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08  \n49 49
+  99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00  \n81 49 31 73 55 79 14 29
+  93 71 40 67 53 88 30 03 49 13 36 65  \n52 70 95 23 04 60 11 42 69 24 68 56 01 32
+  56 71 37 02 36 91  \n22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
+  \ \n24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50  \n32 98 81 28 64
+  23 67 10 **26** 38 40 67 59 54 70 66 18 38 64 70  \n67 26 20 68 02 62 12 20 95 **63**
+  94 39 63 08 40 91 66 49 94 21  \n24 55 58 05 66 73 99 26 97 17 **78** 78 96 83 14
+  88 34 89 63 72  \n21 36 23 09 75 00 76 44 20 45 35 **14** 00 61 33 97 34 31 33 95
+  \ \n78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92  \n16 39 05 42 96
+  35 31 47 55 58 88 24 00 17 54 24 36 29 85 57  \n86 56 00 48 35 71 89 07 05 44 44
+  37 44 60 21 58 51 54 17 58  \n19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04
+  89 55 40  \n04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66  \n88 36
+  68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69  \n04 42 16 73 38 25 39 11
+  24 94 72 18 08 46 29 32 40 62 76 36  \n20 69 36 41 72 30 23 88 34 62 99 69 82 67
+  59 85 74 04 36 16  \n20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
+  \ \n01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48\n\nThe product of
+  these numbers is 26 × 63 × 78 × 14 = 1788696.\n\nWhat is the greatest product of
+  four adjacent numbers in the same direction (up, down, left, right, or diagonally)
+  in the 20×20 grid?\n\n"

data/data/problems/110.yml

@@ -1,14 +1,13 @@
 ---
 :id: 110
 :name: Diophantine reciprocals II
-:url: http://projecteuler.net/problem=110
+:url: https://projecteuler.net/problem=110
 :content: "In the following equation <var>x</var>, <var>y</var>, and <var>n</var>
-  are positive integers.\n\n| \n1  \n ![]({{ images_dir }}/blackdot.gif)  \n <var>x</var>\n
-  | + | \n1  \n ![]({{ images_dir }}/blackdot.gif)  \n <var>y</var>\n | = | \n1  \n
-  ![]({{ images_dir }}/blackdot.gif)  \n <var>n</var>\n |\n\nIt can be verified that
-  when <var>n</var> = 1260 there are 113 distinct solutions and this is the least
-  value of <var>n</var> for which the total number of distinct solutions exceeds one
-  hundred.\n\nWhat is the least value of <var>n</var> for which the number of distinct
-  solutions exceeds four million?\n\nNOTE: This problem is a much more difficult version
-  of [Problem 108](problem=108) and as it is well beyond the limitations of a brute
-  force approach it requires a clever implementation.\n\n"
+  are positive integers.\n\n| \n1  \n<var>x</var>\n | + | \n1  \n<var>y</var>\n |
+  = | \n1  \n<var>n</var>\n |\n\nIt can be verified that when <var>n</var> = 1260
+  there are 113 distinct solutions and this is the least value of <var>n</var> for
+  which the total number of distinct solutions exceeds one hundred.\n\nWhat is the
+  least value of <var>n</var> for which the number of distinct solutions exceeds four
+  million?\n\nNOTE: This problem is a much more difficult version of [Problem 108](problem=108)
+  and as it is well beyond the limitations of a brute force approach it requires a
+  clever implementation.\n\n"

data/data/problems/111.yml

@@ -1,7 +1,7 @@
 ---
 :id: 111
 :name: Primes with runs
-:url: http://projecteuler.net/problem=111
+:url: https://projecteuler.net/problem=111
 :content: |+
   Considering 4-digit primes containing repeated digits it is clear that they cannot all be the same: 1111 is divisible by 11, 2222 is divisible by 22, and so on. But there are nine 4-digit primes containing three ones:
 

data/data/problems/112.yml

@@ -1,7 +1,7 @@
 ---
 :id: 112
 :name: Bouncy numbers
-:url: http://projecteuler.net/problem=112
+:url: https://projecteuler.net/problem=112
 :content: |+
   Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number; for example, 134468.
 

data/data/problems/113.yml

@@ -1,7 +1,7 @@
 ---
 :id: 113
 :name: Non-bouncy numbers
-:url: http://projecteuler.net/problem=113
+:url: https://projecteuler.net/problem=113
 :content: |+
   Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number; for example, 134468.
 

data/data/problems/114.yml

@@ -1,7 +1,7 @@
 ---
 :id: 114
 :name: Counting block combinations I
-:url: http://projecteuler.net/problem=114
+:url: https://projecteuler.net/problem=114
 :content: "A row measuring seven units in length has red blocks with a minimum length
   of three units placed on it, such that any two red blocks (which are allowed to
   be different lengths) are separated by at least one black square. There are exactly
@@ -35,7 +35,7 @@
   | ![]({{ images_dir }}/spacer.gif) |\n\n | \n\n| ![]({{ images_dir }}/spacer.gif)
   | ![]({{ images_dir }}/spacer.gif) |\n\n |\n| \n\n| ![]({{ images_dir }}/spacer.gif)
   | ![]({{ images_dir }}/spacer.gif) |\n\n | \n\n| ![]({{ images_dir }}/spacer.gif)
-  |\n\n |   |\n\nHow many ways can a row measuring fifty units in length be filled?\n\nNOTE:
+  |\n\n |   |\n\nHow many ways can a row measuring fifty units in length be filled?\n\nNOTE:
   Although the example above does not lend itself to the possibility, in general it
   is permitted to mix block sizes. For example, on a row measuring eight units in
   length you could use red (3), black (1), and red (4).\n\n"

data/data/problems/115.yml

@@ -1,7 +1,7 @@
 ---
 :id: 115
 :name: Counting block combinations II
-:url: http://projecteuler.net/problem=115
+:url: https://projecteuler.net/problem=115
 :content: |+
   NOTE: This is a more difficult version of [Problem 114](problem=114).
 

data/data/problems/116.yml

@@ -1,7 +1,7 @@
 ---
 :id: 116
 :name: Red, green or blue tiles
-:url: http://projecteuler.net/problem=116
+:url: https://projecteuler.net/problem=116
 :content: "A row of five black square tiles is to have a number of its tiles replaced
   with coloured oblong tiles chosen from red (length two), green (length three), or
   blue (length four).\n\nIf red tiles are chosen there are exactly seven ways this
@@ -16,16 +16,16 @@
   }}/spacer.gif) | ![]({{ images_dir }}/spacer.gif) |\n\n | \n\n| ![]({{ images_dir
   }}/spacer.gif) | ![]({{ images_dir }}/spacer.gif) | ![]({{ images_dir }}/spacer.gif)
   |\n\n | \n\n| ![]({{ images_dir }}/spacer.gif) | ![]({{ images_dir }}/spacer.gif)
-  | ![]({{ images_dir }}/spacer.gif) |\n\n |   |\n\nIf green tiles are chosen there
-  are three ways.\n\n| \n\n| ![]({{ images_dir }}/spacer.gif) | ![]({{ images_dir
+  | ![]({{ images_dir }}/spacer.gif) |\n\n |   |\n\nIf green tiles are chosen
+  there are three ways.\n\n| \n\n| ![]({{ images_dir }}/spacer.gif) | ![]({{ images_dir
   }}/spacer.gif) | ![]({{ images_dir }}/spacer.gif) |\n\n | \n\n| ![]({{ images_dir
   }}/spacer.gif) | ![]({{ images_dir }}/spacer.gif) | ![]({{ images_dir }}/spacer.gif)
   |\n\n | \n\n| ![]({{ images_dir }}/spacer.gif) | ![]({{ images_dir }}/spacer.gif)
-  | ![]({{ images_dir }}/spacer.gif) |\n\n |   |\n\nAnd if blue tiles are chosen there
-  are two ways.\n\n| \n\n| ![]({{ images_dir }}/spacer.gif) | ![]({{ images_dir }}/spacer.gif)
-  |\n\n | \n\n| ![]({{ images_dir }}/spacer.gif) | ![]({{ images_dir }}/spacer.gif)
-  |\n\n |\n\nAssuming that colours cannot be mixed there are 7 + 3 + 2 = 12 ways of
-  replacing the black tiles in a row measuring five units in length.\n\nHow many different
-  ways can the black tiles in a row measuring fifty units in length be replaced if
-  colours cannot be mixed and at least one coloured tile must be used?\n\nNOTE: This
-  is related to [Problem 117](problem=117).\n\n"
+  | ![]({{ images_dir }}/spacer.gif) |\n\n |   |\n\nAnd if blue tiles are chosen
+  there are two ways.\n\n| \n\n| ![]({{ images_dir }}/spacer.gif) | ![]({{ images_dir
+  }}/spacer.gif) |\n\n | \n\n| ![]({{ images_dir }}/spacer.gif) | ![]({{ images_dir
+  }}/spacer.gif) |\n\n |\n\nAssuming that colours cannot be mixed there are 7 + 3
+  + 2 = 12 ways of replacing the black tiles in a row measuring five units in length.\n\nHow
+  many different ways can the black tiles in a row measuring fifty units in length
+  be replaced if colours cannot be mixed and at least one coloured tile must be used?\n\nNOTE:
+  This is related to [Problem 117](problem=117).\n\n"

data/data/problems/117.yml

@@ -1,7 +1,7 @@
 ---
 :id: 117
 :name: Red, green, and blue tiles
-:url: http://projecteuler.net/problem=117
+:url: https://projecteuler.net/problem=117
 :content: "Using a combination of black square tiles and oblong tiles chosen from:
   red tiles measuring two units, green tiles measuring three units, and blue tiles
   measuring four units, it is possible to tile a row measuring five units in length
@@ -27,5 +27,5 @@
   }}/spacer.gif) |\n\n |\n| \n\n| ![]({{ images_dir }}/spacer.gif) | ![]({{ images_dir
   }}/spacer.gif) |\n\n | \n\n| ![]({{ images_dir }}/spacer.gif) | ![]({{ images_dir
   }}/spacer.gif) |\n\n | \n\n| ![]({{ images_dir }}/spacer.gif) | ![]({{ images_dir
-  }}/spacer.gif) |\n\n |   |\n\nHow many ways can a row measuring fifty units in length
-  be tiled?\n\nNOTE: This is related to [Problem 116](problem=116).\n\n"
+  }}/spacer.gif) |\n\n |   |\n\nHow many ways can a row measuring fifty units
+  in length be tiled?\n\nNOTE: This is related to [Problem 116](problem=116).\n\n"

data/data/problems/118.yml

@@ -1,7 +1,7 @@
 ---
 :id: 118
 :name: Pandigital prime sets
-:url: http://projecteuler.net/problem=118
+:url: https://projecteuler.net/problem=118
 :content: |+
   Using all of the digits 1 through 9 and concatenating them freely to form decimal integers, different sets can be formed. Interestingly with the set {2,5,47,89,631}, all of the elements belonging to it are prime.
 

data/data/problems/119.yml

@@ -1,7 +1,7 @@
 ---
 :id: 119
 :name: Digit power sum
-:url: http://projecteuler.net/problem=119
+:url: https://projecteuler.net/problem=119
 :content: |+
   The number 512 is interesting because it is equal to the sum of its digits raised to some power: 5 + 1 + 2 = 8, and 8<sup>3</sup> = 512. Another example of a number with this property is 614656 = 28<sup>4</sup>.
 

data/data/problems/12.yml

@@ -1,12 +1,12 @@
 ---
 :id: 12
 :name: Highly divisible triangular number
-:url: http://projecteuler.net/problem=12
+:url: https://projecteuler.net/problem=12
 :content: "The sequence of triangle numbers is generated by adding the natural numbers.
   So the 7<sup>th</sup> triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The
   first ten terms would be:\n\n1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...\n\nLet us
-  list the factors of the first seven triangle numbers:\n\n> ** 1** : 1  \n> ** 3**
-  : 1,3  \n> ** 6** : 1,2,3,6  \n> **10** : 1,2,5,10  \n> **15** : 1,3,5,15  \n> **21**
-  : 1,3,7,21  \n> **28** : 1,2,4,7,14,28\n\nWe can see that 28 is the first triangle
-  number to have over five divisors.\n\nWhat is the value of the first triangle number
-  to have over five hundred divisors?\n\n"
+  list the factors of the first seven triangle numbers:\n\n> **&nbsp;1** : 1  \n>
+  **&nbsp;3** : 1,3  \n> **&nbsp;6** : 1,2,3,6  \n> **10** : 1,2,5,10  \n> **15**
+  : 1,3,5,15  \n> **21** : 1,3,7,21  \n> **28** : 1,2,4,7,14,28\n\nWe can see that
+  28 is the first triangle number to have over five divisors.\n\nWhat is the value
+  of the first triangle number to have over five hundred divisors?\n\n"

data/data/problems/120.yml

@@ -1,11 +1,11 @@
 ---
 :id: 120
 :name: Square remainders
-:url: http://projecteuler.net/problem=120
+:url: https://projecteuler.net/problem=120
 :content: |+
-  Let _r_ be the remainder when (_a_ ![−]({{ images_dir }}/symbol_minus.gif)1)<sup><i>n</i></sup> + (_a_+1)<sup><i>n</i></sup> is divided by _a_<sup>2</sup>.
+  Let _r_ be the remainder when (_a_−1)<sup><i>n</i></sup> + (_a_+1)<sup><i>n</i></sup> is divided by _a_<sup>2</sup>.
 
-  For example, if _a_ = 7 and _n_ = 3, then _r_ = 42: 6<sup>3</sup> + 8<sup>3</sup> = 728 ![≡]({{ images_dir }}/symbol_cong.gif) 42 mod 49. And as _n_ varies, so too will _r_, but for _a_ = 7 it turns out that _r_<sub>max</sub> = 42.
+  For example, if _a_ = 7 and _n_ = 3, then _r_ = 42: 6<sup>3</sup> + 8<sup>3</sup> = 728 ≡ 42 mod 49. And as _n_ varies, so too will _r_, but for _a_ = 7 it turns out that _r_<sub>max</sub> = 42.
 
-  For 3 ![≤]({{ images_dir }}/symbol_le.gif) _a_ ![≤]({{ images_dir }}/symbol_le.gif) 1000, find ![∑]({{ images_dir }}/symbol_sum.gif) _r_<sub>max</sub>.
+  For 3 ≤ _a_ ≤ 1000, find ∑ _r_<sub>max</sub>.
 

data/data/problems/121.yml

@@ -1,7 +1,7 @@
 ---
 :id: 121
 :name: Disc game prize fund
-:url: http://projecteuler.net/problem=121
+:url: https://projecteuler.net/problem=121
 :content: |+
   A bag contains one red disc and one blue disc. In a game of chance a player takes a disc at random and its colour is noted. After each turn the disc is returned to the bag, an extra red disc is added, and another disc is taken at random.
 

data/data/problems/122.yml

@@ -1,23 +1,15 @@
 ---
 :id: 122
 :name: Efficient exponentiation
-:url: http://projecteuler.net/problem=122
+:url: https://projecteuler.net/problem=122
 :content: "The most naive way of computing _n_<sup>15</sup> requires fourteen multiplications:\n\n_n_
-  ![×]({{ images_dir }}/symbol_times.gif) _n_ ![×]({{ images_dir }}/symbol_times.gif)
-  ... ![×]({{ images_dir }}/symbol_times.gif) _n_ = _n_<sup>15</sup>\n\nBut using
-  a \"binary\" method you can compute it in six multiplications:\n\n_n_ ![×]({{ images_dir
-  }}/symbol_times.gif) _n_ = _n_<sup>2</sup>  \n_n_<sup>2</sup> ![×]({{ images_dir
-  }}/symbol_times.gif) _n_<sup>2</sup> = _n_<sup>4</sup>  \n_n_<sup>4</sup> ![×]({{
-  images_dir }}/symbol_times.gif) _n_<sup>4</sup> = _n_<sup>8</sup>  \n_n_<sup>8</sup>
-  ![×]({{ images_dir }}/symbol_times.gif) _n_<sup>4</sup> = _n_<sup>12</sup>  \n_n_<sup>12</sup>
-  ![×]({{ images_dir }}/symbol_times.gif) _n_<sup>2</sup> = _n_<sup>14</sup>  \n_n_<sup>14</sup>
-  ![×]({{ images_dir }}/symbol_times.gif) _n_ = _n_<sup>15</sup>\n\nHowever it is
-  yet possible to compute it in only five multiplications:\n\n_n_ ![×]({{ images_dir
-  }}/symbol_times.gif) _n_ = _n_<sup>2</sup>  \n_n_<sup>2</sup> ![×]({{ images_dir
-  }}/symbol_times.gif) _n_ = _n_<sup>3</sup>  \n_n_<sup>3</sup> ![×]({{ images_dir
-  }}/symbol_times.gif) _n_<sup>3</sup> = _n_<sup>6</sup>  \n_n_<sup>6</sup> ![×]({{
-  images_dir }}/symbol_times.gif) _n_<sup>6</sup> = _n_<sup>12</sup>  \n_n_<sup>12</sup>
-  ![×]({{ images_dir }}/symbol_times.gif) _n_<sup>3</sup> = _n_<sup>15</sup>\n\nWe
+  × _n_ × ... × _n_ = _n_<sup>15</sup>\n\nBut using a \"binary\" method you can compute
+  it in six multiplications:\n\n_n_ × _n_ = _n_<sup>2</sup>  \n_n_<sup>2</sup> × _n_<sup>2</sup>
+  = _n_<sup>4</sup>  \n_n_<sup>4</sup> × _n_<sup>4</sup> = _n_<sup>8</sup>  \n_n_<sup>8</sup>
+  × _n_<sup>4</sup> = _n_<sup>12</sup>  \n_n_<sup>12</sup> × _n_<sup>2</sup> = _n_<sup>14</sup>
+  \ \n_n_<sup>14</sup> × _n_ = _n_<sup>15</sup>\n\nHowever it is yet possible to compute
+  it in only five multiplications:\n\n_n_ × _n_ = _n_<sup>2</sup>  \n_n_<sup>2</sup>
+  × _n_ = _n_<sup>3</sup>  \n_n_<sup>3</sup> × _n_<sup>3</sup> = _n_<sup>6</sup>  \n_n_<sup>6</sup>
+  × _n_<sup>6</sup> = _n_<sup>12</sup>  \n_n_<sup>12</sup> × _n_<sup>3</sup> = _n_<sup>15</sup>\n\nWe
   shall define m(_k_) to be the minimum number of multiplications to compute _n_<sup><i>k</i></sup>;
-  for example m(15) = 5.\n\nFor 1 ![≤]({{ images_dir }}/symbol_le.gif) _k_ ![≤]({{
-  images_dir }}/symbol_le.gif) 200, find ![∑]({{ images_dir }}/symbol_sum.gif) m(_k_).\n\n"
+  for example m(15) = 5.\n\nFor 1 ≤ _k_ ≤ 200, find ∑ m(_k_).\n\n"

data/data/problems/123.yml

@@ -1,11 +1,11 @@
 ---
 :id: 123
 :name: Prime square remainders
-:url: http://projecteuler.net/problem=123
+:url: https://projecteuler.net/problem=123
 :content: |+
-  Let _p_<sub>n</sub> be the _n_th prime: 2, 3, 5, 7, 11, ..., and let _r_ be the remainder when (_p_<sub>n</sub> ![−]({{ images_dir }}/symbol_minus.gif)1)<sup><i>n</i></sup> + (_p_<sub>n</sub>+1)<sup><i>n</i></sup> is divided by _p_<sub>n</sub><sup>2</sup>.
+  Let _p_<sub>n</sub> be the _n_th prime: 2, 3, 5, 7, 11, ..., and let _r_ be the remainder when (_p_<sub>n</sub>−1)<sup><i>n</i></sup> + (_p_<sub>n</sub>+1)<sup><i>n</i></sup> is divided by _p_<sub>n</sub><sup>2</sup>.
 
-  For example, when _n_ = 3, _p_<sub>3</sub> = 5, and 4<sup>3</sup> + 6<sup>3</sup> = 280 ![≡]({{ images_dir }}/symbol_cong.gif) 5 mod 25.
+  For example, when _n_ = 3, _p_<sub>3</sub> = 5, and 4<sup>3</sup> + 6<sup>3</sup> = 280 ≡ 5 mod 25.
 
   The least value of _n_ for which the remainder first exceeds 10<sup>9</sup> is 7037.