euler-manager 0.1.1 → 0.2.0

data/data/problems/74.yml

@@ -1,22 +1,15 @@
 ---
 :id: 74
 :name: Digit factorial chains
-:url: http://projecteuler.net/problem=74
+:url: https://projecteuler.net/problem=74
 :content: "The number 145 is well known for the property that the sum of the factorial
   of its digits is equal to 145:\n\n1! + 4! + 5! = 1 + 24 + 120 = 145\n\nPerhaps less
   well known is 169, in that it produces the longest chain of numbers that link back
-  to 169; it turns out that there are only three such loops that exist:\n\n169 ![→]({{
-  images_dir }}/symbol_maps.gif) 363601 ![→]({{ images_dir }}/symbol_maps.gif) 1454
-  ![→]({{ images_dir }}/symbol_maps.gif) 169  \n871 ![→]({{ images_dir }}/symbol_maps.gif)
-  45361 ![→]({{ images_dir }}/symbol_maps.gif) 871  \n872 ![→]({{ images_dir }}/symbol_maps.gif)
-  45362 ![→]({{ images_dir }}/symbol_maps.gif) 872\n\nIt is not difficult to prove
-  that EVERY starting number will eventually get stuck in a loop. For example,\n\n69
-  ![→]({{ images_dir }}/symbol_maps.gif) 363600 ![→]({{ images_dir }}/symbol_maps.gif)
-  1454 ![→]({{ images_dir }}/symbol_maps.gif) 169 ![→]({{ images_dir }}/symbol_maps.gif)
-  363601 ( ![→]({{ images_dir }}/symbol_maps.gif) 1454)  \n78 ![→]({{ images_dir }}/symbol_maps.gif)
-  45360 ![→]({{ images_dir }}/symbol_maps.gif) 871 ![→]({{ images_dir }}/symbol_maps.gif)
-  45361 ( ![→]({{ images_dir }}/symbol_maps.gif) 871)  \n540 ![→]({{ images_dir }}/symbol_maps.gif)
-  145 ( ![→]({{ images_dir }}/symbol_maps.gif) 145)\n\nStarting with 69 produces a
-  chain of five non-repeating terms, but the longest non-repeating chain with a starting
-  number below one million is sixty terms.\n\nHow many chains, with a starting number
-  below one million, contain exactly sixty non-repeating terms?\n\n"
+  to 169; it turns out that there are only three such loops that exist:\n\n169 → 363601
+  → 1454 → 169  \n871 → 45361 → 871  \n872 → 45362 → 872\n\nIt is not difficult to
+  prove that EVERY starting number will eventually get stuck in a loop. For example,\n\n69
+  → 363600 → 1454 → 169 → 363601 (→ 1454)  \n78 → 45360 → 871 → 45361 (→ 871)  \n540
+  → 145 (→ 145)\n\nStarting with 69 produces a chain of five non-repeating terms,
+  but the longest non-repeating chain with a starting number below one million is
+  sixty terms.\n\nHow many chains, with a starting number below one million, contain
+  exactly sixty non-repeating terms?\n\n"

data/data/problems/75.yml

@@ -1,7 +1,7 @@
 ---
 :id: 75
 :name: Singular integer right triangles
-:url: http://projecteuler.net/problem=75
+:url: https://projecteuler.net/problem=75
 :content: "It turns out that 12 cm is the smallest length of wire that can be bent
   to form an integer sided right angle triangle in exactly one way, but there are
   many more examples.\n\n**12 cm** : (3,4,5)  \n**24 cm** : (6,8,10)  \n**30 cm**
@@ -10,5 +10,5 @@
   right angle triangle, and other lengths allow more than one solution to be found;
   for example, using 120 cm it is possible to form exactly three different integer
   sided right angle triangles.\n\n**120 cm** : (30,40,50), (20,48,52), (24,45,51)\n\nGiven
-  that L is the length of the wire, for how many values of L ![≤]({{ images_dir }}/symbol_le.gif)
-  1,500,000 can exactly one integer sided right angle triangle be formed?\n\n"
+  that L is the length of the wire, for how many values of L ≤ 1,500,000 can exactly
+  one integer sided right angle triangle be formed?\n\n"

data/data/problems/76.yml

@@ -1,7 +1,7 @@
 ---
 :id: 76
 :name: Counting summations
-:url: http://projecteuler.net/problem=76
+:url: https://projecteuler.net/problem=76
 :content: "It is possible to write five as a sum in exactly six different ways:\n\n4
   + 1  \n3 + 2  \n3 + 1 + 1  \n2 + 2 + 1  \n2 + 1 + 1 + 1  \n1 + 1 + 1 + 1 + 1\n\nHow
   many different ways can one hundred be written as a sum of at least two positive

data/data/problems/77.yml

@@ -1,7 +1,7 @@
 ---
 :id: 77
 :name: Prime summations
-:url: http://projecteuler.net/problem=77
+:url: https://projecteuler.net/problem=77
 :content: "It is possible to write ten as the sum of primes in exactly five different
   ways:\n\n7 + 3  \n5 + 5  \n5 + 3 + 2  \n3 + 3 + 2 + 2  \n2 + 2 + 2 + 2 + 2\n\nWhat
   is the first value which can be written as the sum of primes in over five thousand

data/data/problems/78.yml

@@ -1,17 +1,17 @@
 ---
 :id: 78
 :name: Coin partitions
-:url: http://projecteuler.net/problem=78
+:url: https://projecteuler.net/problem=78
 :content: |+
-  Let p(_n_) represent the number of different ways in which _n_ coins can be separated into piles. For example, five coins can separated into piles in exactly seven different ways, so p(5)=7.
+  Let p(_n_) represent the number of different ways in which _n_ coins can be separated into piles. For example, five coins can be separated into piles in exactly seven different ways, so p(5)=7.
 
   | OOOOO |
-  | OOOO   O |
-  | OOO   OO |
-  | OOO   O   O |
-  | OO   OO   O |
-  | OO   O   O   O |
-  | O   O   O   O   O |
+  | OOOO   O |
+  | OOO   OO |
+  | OOO   O   O |
+  | OO   OO   O |
+  | OO   O   O   O |
+  | O   O   O   O   O |
 
   Find the least value of _n_ for which p(_n_) is divisible by one million.
 

data/data/problems/79.yml

@@ -1,11 +1,11 @@
 ---
 :id: 79
 :name: Passcode derivation
-:url: http://projecteuler.net/problem=79
+:url: https://projecteuler.net/problem=79
 :content: |+
   A common security method used for online banking is to ask the user for three random characters from a passcode. For example, if the passcode was 531278, they may ask for the 2nd, 3rd, and 5th characters; the expected reply would be: 317.
 
-  The text file, [keylog.txt](project/keylog.txt), contains fifty successful login attempts.
+  The text file, [keylog.txt](project/resources/p079_keylog.txt), contains fifty successful login attempts.
 
   Given that the three characters are always asked for in order, analyse the file so as to determine the shortest possible secret passcode of unknown length.
 

data/data/problems/8.yml

@@ -1,19 +1,18 @@
 ---
 :id: 8
 :name: Largest product in a series
-:url: http://projecteuler.net/problem=8
+:url: https://projecteuler.net/problem=8
 :content: "The four adjacent digits in the 1000-digit number that have the greatest
-  product are 9 ![×]({{ images_dir }}/symbol_times.gif) 9 ![×]({{ images_dir }}/symbol_times.gif)
-  8 ![×]({{ images_dir }}/symbol_times.gif) 9 = 5832.\n\n73167176531330624919225119674426574742355349194934
-  \ \n\r96983520312774506326239578318016984801869478851843  \n\r85861560789112949495459501737958331952853208805511
-  \ \n\r12540698747158523863050715693290963295227443043557  \n\r66896648950445244523161731856403098711121722383113
-  \ \n\r62229893423380308135336276614282806444486645238749  \n\r30358907296290491560440772390713810515859307960866
-  \ \n\r70172427121883998797908792274921901699720888093776  \n\r65727333001053367881220235421809751254540594752243
-  \ \n\r52584907711670556013604839586446706324415722155397  \n\r53697817977846174064955149290862569321978468622482
-  \ \n\r83972241375657056057490261407972968652414535100474  \n\r82166370484403199890008895243450658541227588666881
-  \ \n\r16427171479924442928230863465674813919123162824586  \n\r17866458359124566529476545682848912883142607690042
-  \ \n\r24219022671055626321111109370544217506941658960408  \n\r07198403850962455444362981230987879927244284909188
-  \ \n\r84580156166097919133875499200524063689912560717606  \n\r05886116467109405077541002256983155200055935729725
-  \ \n\r71636269561882670428252483600823257530420752963450\n\nFind the thirteen adjacent
+  product are 9 × 9 × 8 × 9 = 5832.\n\n73167176531330624919225119674426574742355349194934
+  \ \n96983520312774506326239578318016984801869478851843  \n85861560789112949495459501737958331952853208805511
+  \ \n12540698747158523863050715693290963295227443043557  \n66896648950445244523161731856403098711121722383113
+  \ \n62229893423380308135336276614282806444486645238749  \n30358907296290491560440772390713810515859307960866
+  \ \n70172427121883998797908792274921901699720888093776  \n65727333001053367881220235421809751254540594752243
+  \ \n52584907711670556013604839586446706324415722155397  \n53697817977846174064955149290862569321978468622482
+  \ \n83972241375657056057490261407972968652414535100474  \n82166370484403199890008895243450658541227588666881
+  \ \n16427171479924442928230863465674813919123162824586  \n17866458359124566529476545682848912883142607690042
+  \ \n24219022671055626321111109370544217506941658960408  \n07198403850962455444362981230987879927244284909188
+  \ \n84580156166097919133875499200524063689912560717606  \n05886116467109405077541002256983155200055935729725
+  \ \n71636269561882670428252483600823257530420752963450\n\nFind the thirteen adjacent
   digits in the 1000-digit number that have the greatest product. What is the value
   of this product?\n\n"

data/data/problems/80.yml

@@ -1,7 +1,7 @@
 ---
 :id: 80
 :name: Square root digital expansion
-:url: http://projecteuler.net/problem=80
+:url: https://projecteuler.net/problem=80
 :content: |+
   It is well known that if the square root of a natural number is not an integer, then it is irrational. The decimal expansion of such square roots is infinite without any repeating pattern at all.
 

data/data/problems/81.yml

@@ -1,13 +1,11 @@
 ---
 :id: 81
 :name: 'Path sum: two ways'
-:url: http://projecteuler.net/problem=81
-:content: "In the 5 by 5 matrix below, the minimal path sum from the top left to the
-  bottom right, by **only moving to the right and down** , is indicated in bold red
-  and is equal to 2427.\n\n| ![]({{ images_dir }}/bracket_left.gif)  \n | \n\n| **131**
-  | 673 | 234 | 103 | 18 |\n| **201** | **96** | **342** | 965 | 150 |\n| 630 | 803
-  | **746** | **422** | 111 |\n| 537 | 699 | 497 | **121** | 956 |\n| 805 | 732 |
-  524 | **37** | **331** |\n\n | ![]({{ images_dir }}/bracket_right.gif)  \n |\n\nFind
-  the minimal path sum, in [matrix.txt](project/matrix.txt) (right click and 'Save
-  Link/Target As...'), a 31K text file containing a 80 by 80 matrix, from the top
-  left to the bottom right by only moving right and down.\n\n"
+:url: https://projecteuler.net/problem=81
+:content: |+
+  In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by **only moving to the right and down** , is indicated in bold red and is equal to 2427.
+
+  $$ \begin{pmatrix} \color{red}{131} & 673 & 234 & 103 & 18\\ \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\ 630 & 803 & \color{red}{746} & \color{red}{422} & 111\\ 537 & 699 & 497 & \color{red}{121} & 956\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix} $$
+
+  Find the minimal path sum, in [matrix.txt](project/resources/p081_matrix.txt) (right click and "Save Link/Target As..."), a 31K text file containing a 80 by 80 matrix, from the top left to the bottom right by only moving right and down.
+

data/data/problems/82.yml

@@ -1,14 +1,13 @@
 ---
 :id: 82
 :name: 'Path sum: three ways'
-:url: http://projecteuler.net/problem=82
-:content: "NOTE: This problem is a more challenging version of [Problem 81](problem=81).\n\nThe
-  minimal path sum in the 5 by 5 matrix below, by starting in any cell in the left
-  column and finishing in any cell in the right column, and only moving up, down,
-  and right, is indicated in red and bold; the sum is equal to 994.\n\n| ![]({{ images_dir
-  }}/bracket_left.gif)  \n | \n\n| 131 | 673 | **234** | **103** | **18** |\n| **201**
-  | **96** | **342** | 965 | 150 |\n| 630 | 803 | 746 | 422 | 111 |\n| 537 | 699 |
-  497 | 121 | 956 |\n| 805 | 732 | 524 | 37 | 331 |\n\n | ![]({{ images_dir }}/bracket_right.gif)
-  \ \n |\n\nFind the minimal path sum, in [matrix.txt](project/matrix.txt) (right
-  click and 'Save Link/Target As...'), a 31K text file containing a 80 by 80 matrix,
-  from the left column to the right column.\n\n"
+:url: https://projecteuler.net/problem=82
+:content: |+
+  NOTE: This problem is a more challenging version of [Problem 81](problem=81).
+
+  The minimal path sum in the 5 by 5 matrix below, by starting in any cell in the left column and finishing in any cell in the right column, and only moving up, down, and right, is indicated in red and bold; the sum is equal to 994.
+
+  $$ \begin{pmatrix} 131 & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\ \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & 150\\ 630 & 803 & 746 & 422 & 111\\ 537 & 699 & 497 & 121 & 956\\ 805 & 732 & 524 & 37 & 331 \end{pmatrix} $$
+
+  Find the minimal path sum, in [matrix.txt](project/resources/p082_matrix.txt) (right click and "Save Link/Target As..."), a 31K text file containing a 80 by 80 matrix, from the left column to the right column.
+

data/data/problems/83.yml

@@ -1,14 +1,13 @@
 ---
 :id: 83
 :name: 'Path sum: four ways'
-:url: http://projecteuler.net/problem=83
-:content: "NOTE: This problem is a significantly more challenging version of [Problem
-  81](problem=81).\n\nIn the 5 by 5 matrix below, the minimal path sum from the top
-  left to the bottom right, by moving left, right, up, and down, is indicated in bold
-  red and is equal to 2297.\n\n| ![]({{ images_dir }}/bracket_left.gif)  \n | \n\n|
-  **131** | 673 | **234** | **103** | **18** |\n| **201** | **96** | **342** | 965
-  | **150** |\n| 630 | 803 | 746 | **422** | **111** |\n| 537 | 699 | 497 | **121**
-  | 956 |\n| 805 | 732 | 524 | **37** | **331** |\n\n | ![]({{ images_dir }}/bracket_right.gif)
-  \ \n |\n\nFind the minimal path sum, in [matrix.txt](project/matrix.txt) (right
-  click and 'Save Link/Target As...'), a 31K text file containing a 80 by 80 matrix,
-  from the top left to the bottom right by moving left, right, up, and down.\n\n"
+:url: https://projecteuler.net/problem=83
+:content: |+
+  NOTE: This problem is a significantly more challenging version of [Problem 81](problem=81).
+
+  In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by moving left, right, up, and down, is indicated in bold red and is equal to 2297.
+
+  $$ \begin{pmatrix} \color{red}{131} & 673 & \color{red}{234} & \color{red}{103} & \color{red}{18}\\ \color{red}{201} & \color{red}{96} & \color{red}{342} & 965 & \color{red}{150}\\ 630 & 803 & 746 & \color{red}{422} & \color{red}{111}\\ 537 & 699 & 497 & \color{red}{121} & 956\\ 805 & 732 & 524 & \color{red}{37} & \color{red}{331} \end{pmatrix} $$
+
+  Find the minimal path sum, in [matrix.txt](project/resources/p083_matrix.txt) (right click and "Save Link/Target As..."), a 31K text file containing a 80 by 80 matrix, from the top left to the bottom right by moving left, right, up, and down.
+

data/data/problems/84.yml

@@ -1,40 +1,48 @@
 ---
 :id: 84
 :name: Monopoly odds
-:url: http://projecteuler.net/problem=84
-:content: "In the game, _Monopoly_, the standard board is set up in the following
-  way:\n\n| GO | A1 | CC1 | A2 | T1 | R1 | B1 | CH1 | B2 | B3 | JAIL |\n| H2 |   |
-  C1 |\n| T2 |   | U1 |\n| H1 |   | C2 |\n| CH3 |   | C3 |\n| R4 |   | R2 |\n| G3
-  |   | D1 |\n| CC3 |   | CC2 |\n| G2 |   | D2 |\n| G1 |   | D3 |\n| G2J | F3 | U2
-  | F2 | F1 | R3 | E3 | E2 | CH2 | E1 | FP |\n\nA player starts on the GO square and
-  adds the scores on two 6-sided dice to determine the number of squares they advance
-  in a clockwise direction. Without any further rules we would expect to visit each
-  square with equal probability: 2.5%. However, landing on G2J (Go To Jail), CC (community
-  chest), and CH (chance) changes this distribution.\n\nIn addition to G2J, and one
-  card from each of CC and CH, that orders the player to go directly to jail, if a
-  player rolls three consecutive doubles, they do not advance the result of their
-  3rd roll. Instead they proceed directly to jail.\n\nAt the beginning of the game,
-  the CC and CH cards are shuffled. When a player lands on CC or CH they take a card
-  from the top of the respective pile and, after following the instructions, it is
-  returned to the bottom of the pile. There are sixteen cards in each pile, but for
-  the purpose of this problem we are only concerned with cards that order a movement;
-  any instruction not concerned with movement will be ignored and the player will
-  remain on the CC/CH square.\n\n- Community Chest (2/16 cards):\r\n  1. Advance to
-  GO\n  2. Go to JAIL\n\n- Chance (10/16 cards):\r\n  1. Advance to GO\n  2. Go to
-  JAIL\n  3. Go to C1\n  4. Go to E3\n  5. Go to H2\n  6. Go to R1\n  7. Go to next
-  R (railway company)\n  8. Go to next R\n  9. Go to next U (utility company)\n  10.
-  Go back 3 squares.\n\nThe heart of this problem concerns the likelihood of visiting
-  a particular square. That is, the probability of finishing at that square after
-  a roll. For this reason it should be clear that, with the exception of G2J for which
-  the probability of finishing on it is zero, the CH squares will have the lowest
-  probabilities, as 5/8 request a movement to another square, and it is the final
-  square that the player finishes at on each roll that we are interested in. We shall
-  make no distinction between \"Just Visiting\" and being sent to JAIL, and we shall
-  also ignore the rule about requiring a double to \"get out of jail\", assuming that
-  they pay to get out on their next turn.\n\nBy starting at GO and numbering the squares
-  sequentially from 00 to 39 we can concatenate these two-digit numbers to produce
-  strings that correspond with sets of squares.\n\nStatistically it can be shown that
-  the three most popular squares, in order, are JAIL (6.24%) = Square 10, E3 (3.18%)
-  = Square 24, and GO (3.09%) = Square 00. So these three most popular squares can
-  be listed with the six-digit modal string: 102400.\n\nIf, instead of using two 6-sided
-  dice, two 4-sided dice are used, find the six-digit modal string.\n\n"
+:url: https://projecteuler.net/problem=84
+:content: |+
+  In the game, _Monopoly_, the standard board is set up in the following way:
+
+  | GO | A1 | CC1 | A2 | T1 | R1 | B1 | CH1 | B2 | B3 | JAIL |
+  | H2 |   | C1 |
+  | T2 |   | U1 |
+  | H1 |   | C2 |
+  | CH3 |   | C3 |
+  | R4 |   | R2 |
+  | G3 |   | D1 |
+  | CC3 |   | CC2 |
+  | G2 |   | D2 |
+  | G1 |   | D3 |
+  | G2J | F3 | U2 | F2 | F1 | R3 | E3 | E2 | CH2 | E1 | FP |
+
+  A player starts on the GO square and adds the scores on two 6-sided dice to determine the number of squares they advance in a clockwise direction. Without any further rules we would expect to visit each square with equal probability: 2.5%. However, landing on G2J (Go To Jail), CC (community chest), and CH (chance) changes this distribution.
+
+  In addition to G2J, and one card from each of CC and CH, that orders the player to go directly to jail, if a player rolls three consecutive doubles, they do not advance the result of their 3rd roll. Instead they proceed directly to jail.
+
+  At the beginning of the game, the CC and CH cards are shuffled. When a player lands on CC or CH they take a card from the top of the respective pile and, after following the instructions, it is returned to the bottom of the pile. There are sixteen cards in each pile, but for the purpose of this problem we are only concerned with cards that order a movement; any instruction not concerned with movement will be ignored and the player will remain on the CC/CH square.
+
+  - Community Chest (2/16 cards):
+    1. Advance to GO
+    2. Go to JAIL
+  - Chance (10/16 cards):
+    1. Advance to GO
+    2. Go to JAIL
+    3. Go to C1
+    4. Go to E3
+    5. Go to H2
+    6. Go to R1
+    7. Go to next R (railway company)
+    8. Go to next R
+    9. Go to next U (utility company)
+    10. Go back 3 squares.
+
+  The heart of this problem concerns the likelihood of visiting a particular square. That is, the probability of finishing at that square after a roll. For this reason it should be clear that, with the exception of G2J for which the probability of finishing on it is zero, the CH squares will have the lowest probabilities, as 5/8 request a movement to another square, and it is the final square that the player finishes at on each roll that we are interested in. We shall make no distinction between "Just Visiting" and being sent to JAIL, and we shall also ignore the rule about requiring a double to "get out of jail", assuming that they pay to get out on their next turn.
+
+  By starting at GO and numbering the squares sequentially from 00 to 39 we can concatenate these two-digit numbers to produce strings that correspond with sets of squares.
+
+  Statistically it can be shown that the three most popular squares, in order, are JAIL (6.24%) = Square 10, E3 (3.18%) = Square 24, and GO (3.09%) = Square 00. So these three most popular squares can be listed with the six-digit modal string: 102400.
+
+  If, instead of using two 6-sided dice, two 4-sided dice are used, find the six-digit modal string.
+

data/data/problems/85.yml

@@ -1,11 +1,11 @@
 ---
 :id: 85
 :name: Counting rectangles
-:url: http://projecteuler.net/problem=85
+:url: https://projecteuler.net/problem=85
 :content: |+
   By counting carefully it can be seen that a rectangular grid measuring 3 by 2 contains eighteen rectangles:
 
-   ![]({{ images_dir }}/p_085.gif)
+   ![]({{ images_dir }}/p085.gif)
 
   Although there exists no rectangular grid that contains exactly two million rectangles, find the area of the grid with the nearest solution.
 

data/data/problems/86.yml

@@ -1,15 +1,15 @@
 ---
 :id: 86
 :name: Cuboid route
-:url: http://projecteuler.net/problem=86
+:url: https://projecteuler.net/problem=86
 :content: "A spider, S, sits in one corner of a cuboid room, measuring 6 by 5 by 3,
   and a fly, F, sits in the opposite corner. By travelling on the surfaces of the
   room the shortest \"straight line\" distance from S to F is 10 and the path is shown
-  on the diagram.\n\n ![]({{ images_dir }}/p_086.gif)  \n\nHowever, there are up to
+  on the diagram.\n\n ![]({{ images_dir }}/p086.gif)  \n\nHowever, there are up to
   three \"shortest\" path candidates for any given cuboid and the shortest route doesn't
-  always have integer length.\n\nBy considering all cuboid rooms with integer dimensions,
-  up to a maximum size of M by M by M, there are exactly 2060 cuboids for which the
-  shortest route has integer length when M=100, and this is the least value of M for
-  which the number of solutions first exceeds two thousand; the number of solutions
-  is 1975 when M=99.\n\nFind the least value of M such that the number of solutions
-  first exceeds one million.\n\n"
+  always have integer length.\n\nIt can be shown that there are exactly 2060 distinct
+  cuboids, ignoring rotations, with integer dimensions, up to a maximum size of M
+  by M by M, for which the shortest route has integer length when M = 100. This is
+  the least value of M for which the number of solutions first exceeds two thousand;
+  the number of solutions when M = 99 is 1975.\n\nFind the least value of M such that
+  the number of solutions first exceeds one million.\n\n"

data/data/problems/87.yml

@@ -1,7 +1,7 @@
 ---
 :id: 87
 :name: Prime power triples
-:url: http://projecteuler.net/problem=87
+:url: https://projecteuler.net/problem=87
 :content: "The smallest number expressible as the sum of a prime square, prime cube,
   and prime fourth power is 28. In fact, there are exactly four numbers below fifty
   that can be expressed in such a way:\n\n28 = 2<sup>2</sup> + 2<sup>3</sup> + 2<sup>4</sup>

data/data/problems/88.yml

@@ -1,29 +1,18 @@
 ---
 :id: 88
 :name: Product-sum numbers
-:url: http://projecteuler.net/problem=88
+:url: https://projecteuler.net/problem=88
 :content: "A natural number, N, that can be written as the sum and product of a given
   set of at least two natural numbers, {_a_<sub>1</sub>, _a_<sub>2</sub>, ... , _a_<sub><i>k</i></sub>}
   is called a product-sum number: N = _a_<sub>1</sub> + _a_<sub>2</sub> + ... + _a_<sub><i>k</i></sub>
-  = _a_<sub>1</sub> ![×]({{ images_dir }}/symbol_times.gif) _a_<sub>2</sub> ![×]({{
-  images_dir }}/symbol_times.gif) ... ![×]({{ images_dir }}/symbol_times.gif) _a_<sub><i>k</i></sub>.\n\nFor
-  example, 6 = 1 + 2 + 3 = 1 ![×]({{ images_dir }}/symbol_times.gif) 2 ![×]({{ images_dir
-  }}/symbol_times.gif) 3.\n\nFor a given set of size, _k_, we shall call the smallest
+  = _a_<sub>1</sub> × _a_<sub>2</sub> × ... × _a_<sub><i>k</i></sub>.\n\nFor example,
+  6 = 1 + 2 + 3 = 1 × 2 × 3.\n\nFor a given set of size, _k_, we shall call the smallest
   N with this property a minimal product-sum number. The minimal product-sum numbers
-  for sets of size, _k_ = 2, 3, 4, 5, and 6 are as follows.\n\n_k_=2: 4 = 2 ![×]({{
-  images_dir }}/symbol_times.gif) 2 = 2 + 2  \n_k_=3: 6 = 1 ![×]({{ images_dir }}/symbol_times.gif)
-  2 ![×]({{ images_dir }}/symbol_times.gif) 3 = 1 + 2 + 3  \n_k_=4: 8 = 1 ![×]({{
-  images_dir }}/symbol_times.gif) 1 ![×]({{ images_dir }}/symbol_times.gif) 2 ![×]({{
-  images_dir }}/symbol_times.gif) 4 = 1 + 1 + 2 + 4  \n_k_=5: 8 = 1 ![×]({{ images_dir
-  }}/symbol_times.gif) 1 ![×]({{ images_dir }}/symbol_times.gif) 2 ![×]({{ images_dir
-  }}/symbol_times.gif) 2 ![×]({{ images_dir }}/symbol_times.gif) 2 = 1 + 1 + 2 + 2
-  + 2  \n_k_=6: 12 = 1 ![×]({{ images_dir }}/symbol_times.gif) 1 ![×]({{ images_dir
-  }}/symbol_times.gif) 1 ![×]({{ images_dir }}/symbol_times.gif) 1 ![×]({{ images_dir
-  }}/symbol_times.gif) 2 ![×]({{ images_dir }}/symbol_times.gif) 6 = 1 + 1 + 1 + 1
-  + 2 + 6\n\nHence for 2 ![≤]({{ images_dir }}/symbol_le.gif)_k_ ![≤]({{ images_dir
-  }}/symbol_le.gif)6, the sum of all the minimal product-sum numbers is 4+6+8+12 =
-  30; note that 8 is only counted once in the sum.\n\nIn fact, as the complete set
-  of minimal product-sum numbers for 2 ![≤]({{ images_dir }}/symbol_le.gif)_k_ ![≤]({{
-  images_dir }}/symbol_le.gif)12 is {4, 6, 8, 12, 15, 16}, the sum is 61.\n\nWhat
-  is the sum of all the minimal product-sum numbers for 2 ![≤]({{ images_dir }}/symbol_le.gif)_k_
-  ![≤]({{ images_dir }}/symbol_le.gif)12000?\n\n"
+  for sets of size, _k_ = 2, 3, 4, 5, and 6 are as follows.\n\n_k_=2: 4 = 2 × 2 =
+  2 + 2  \n_k_=3: 6 = 1 × 2 × 3 = 1 + 2 + 3  \n_k_=4: 8 = 1 × 1 × 2 × 4 = 1 + 1 +
+  2 + 4  \n_k_=5: 8 = 1 × 1 × 2 × 2 × 2 = 1 + 1 + 2 + 2 + 2  \n_k_=6: 12 = 1 × 1 ×
+  1 × 1 × 2 × 6 = 1 + 1 + 1 + 1 + 2 + 6\n\nHence for 2≤_k_≤6, the sum of all the minimal
+  product-sum numbers is 4+6+8+12 = 30; note that 8 is only counted once in the sum.\n\nIn
+  fact, as the complete set of minimal product-sum numbers for 2≤_k_≤12 is {4, 6,
+  8, 12, 15, 16}, the sum is 61.\n\nWhat is the sum of all the minimal product-sum
+  numbers for 2≤_k_≤12000?\n\n"

data/data/problems/89.yml

@@ -1,17 +1,17 @@
 ---
 :id: 89
 :name: Roman numerals
-:url: http://projecteuler.net/problem=89
-:content: "The rules for writing Roman numerals allow for many ways of writing each
-  number (see [About Roman Numerals...](about=roman_numerals)). However, there is
-  always a \"best\" way of writing a particular number.\n\nFor example, the following
-  represent all of the legitimate ways of writing the number sixteen:\n\nIIIIIIIIIIIIIIII
-  \ \n\rVIIIIIIIIIII  \n\rVVIIIIII  \n\rXIIIIII  \n\rVVVI  \n\rXVI\n\nThe last example
-  being considered the most efficient, as it uses the least number of numerals.\n\nThe
-  11K text file, [roman.txt](project/roman.txt) (right click and 'Save Link/Target
-  As...'), contains one thousand numbers written in valid, but not necessarily minimal,
-  Roman numerals; that is, they are arranged in descending units and obey the subtractive
-  pair rule (see [About Roman Numerals...](about=roman_numerals) for the definitive
-  rules for this problem).\n\nFind the number of characters saved by writing each
-  of these in their minimal form.\n\nNote: You can assume that all the Roman numerals
-  in the file contain no more than four consecutive identical units.\n\n"
+:url: https://projecteuler.net/problem=89
+:content: "For a number written in Roman numerals to be considered valid there are
+  basic rules which must be followed. Even though the rules allow some numbers to
+  be expressed in more than one way there is always a \"best\" way of writing a particular
+  number.\n\nFor example, it would appear that there are at least six ways of writing
+  the number sixteen:\n\nIIIIIIIIIIIIIIII  \nVIIIIIIIIIII  \nVVIIIIII  \nXIIIIII  \nVVVI
+  \ \nXVI\n\nHowever, according to the rules only XIIIIII and XVI are valid, and the
+  last example is considered to be the most efficient, as it uses the least number
+  of numerals.\n\nThe 11K text file, [roman.txt](project/resources/p089_roman.txt)
+  (right click and 'Save Link/Target As...'), contains one thousand numbers written
+  in valid, but not necessarily minimal, Roman numerals; see [About... Roman Numerals](about=roman_numerals)
+  for the definitive rules for this problem.\n\nFind the number of characters saved
+  by writing each of these in their minimal form.\n\nNote: You can assume that all
+  the Roman numerals in the file contain no more than four consecutive identical units.\n\n"

data/data/problems/9.yml

@@ -1,10 +1,9 @@
 ---
 :id: 9
 :name: Special Pythagorean triplet
-:url: http://projecteuler.net/problem=9
-:content: "A Pythagorean triplet is a set of three natural numbers, <var>a</var> ![<]({{
-  images_dir }}/symbol_lt.gif) <var>b</var> ![<]({{ images_dir }}/symbol_lt.gif) <var>c</var>,
-  for which,\n\n <var>a</var><sup>2</sup> + <var>b</var><sup>2</sup> = <var>c</var><sup>2</sup>\n\nFor
-  example, 3<sup>2</sup> + 4<sup>2</sup> = 9 + 16 = 25 = 5<sup>2</sup>.\n\nThere exists
-  exactly one Pythagorean triplet for which <var>a</var> + <var>b</var> + <var>c</var>
-  = 1000.  \nFind the product <var>abc</var>.\n\n"
+:url: https://projecteuler.net/problem=9
+:content: "A Pythagorean triplet is a set of three natural numbers, <var>a</var> \\<
+  <var>b</var> \\< <var>c</var>, for which,\n\n <var>a</var><sup>2</sup> + <var>b</var><sup>2</sup>
+  = <var>c</var><sup>2</sup>\n\nFor example, 3<sup>2</sup> + 4<sup>2</sup> = 9 + 16
+  = 25 = 5<sup>2</sup>.\n\nThere exists exactly one Pythagorean triplet for which
+  <var>a</var> + <var>b</var> + <var>c</var> = 1000.  \nFind the product <var>abc</var>.\n\n"