euler-manager 0.0.5 → 0.0.6

data/data/problems/73.yml

@@ -2,15 +2,14 @@
 :id: 73
 :name: Counting fractions in a range
 :url: http://projecteuler.net/problem=73
-:content: "\r\n<p>Consider the fraction, <i>n/d</i>, where <i>n</i> and <i>d</i> are
-  positive integers. If <i>n</i><img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\"
-  alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><i>d</i> and HCF(<i>n,d</i>)=1,
-  it is called a reduced proper fraction.</p>\r\n<p>If we list the set of reduced
-  proper fractions for <i>d</i> <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 8 in ascending order of
-  size, we get:</p>\r\n<p style=\"text-align:center;font-size:8pt;\">1/8, 1/7, 1/6,
-  1/5, 1/4, 2/7, 1/3, <b>3/8, 2/5, 3/7</b>, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5,
-  5/6, 6/7, 7/8</p>\r\n<p>It can be seen that there are 3 fractions between 1/3 and
-  1/2.</p>\r\n<p>How many fractions lie between 1/3 and 1/2 in the sorted set of reduced
-  proper fractions for <i>d</i> <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 12,000?</p>\r\n\r\n\r\n"
+:content: |+
+  Consider the fraction, _n/d_, where _n_ and _d_ are positive integers. If _n_ ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)_d_ and HCF(_n,d_)=1, it is called a reduced proper fraction.
+
+  If we list the set of reduced proper fractions for _d_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 8 in ascending order of size, we get:
+
+  1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, **3/8, 2/5, 3/7** , 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8
+
+  It can be seen that there are 3 fractions between 1/3 and 1/2.
+
+  How many fractions lie between 1/3 and 1/2 in the sorted set of reduced proper fractions for _d_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 12,000?
+

data/data/problems/74.yml

@@ -2,40 +2,28 @@
 :id: 74
 :name: Digit factorial chains
 :url: http://projecteuler.net/problem=74
-:content: "\r\n\n<p>The number 145 is well known for the property that the sum of
-  the factorial of its digits is equal to 145:</p>\n<p style=\"margin-left:50px;\">1!
-  + 4! + 5! = 1 + 24 + 120 = 145</p>\n<p>Perhaps 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:</p>\n<p style=\"margin-left:50px;\">169 <img
-  src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 363601 <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 1454 <img
-  src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 169<br>\n871 <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\">
-  45361 <img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 871<br>\n872 <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\">
-  45362 <img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 872</p>\n<p>It is not difficult to prove that
-  EVERY starting number will eventually get stuck in a loop. For example,</p>\n<p
-  style=\"margin-left:50px;\">69 <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 363600 <img
-  src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 1454 <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 169 <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\">
-  363601 (<img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\"
-  border=\"0\" style=\"vertical-align:middle;\"> 1454)<br>\n78 <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\">
-  45360 <img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 871 <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 45361 (<img
-  src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 871)<br>\n540 <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\">
-  145 (<img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 145)</p>\n<p>Starting 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.</p>\n<p>How many chains, with a starting
-  number below one million, contain exactly sixty non-repeating terms?</p>\n\r\n"
+: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 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  363601 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  1454 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 169
+  \ \n871 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  45361 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 871
+  \ \n872 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  45362 ![→](/home/will/src/euler-manager/config/../data/images/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 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  363600 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  1454 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 169
+  ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 363601
+  ( ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 1454)
+  \ \n78 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  45360 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 871
+  ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 45361 (
+  ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 871)  \n540
+  ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 145 ( ![→](/home/will/src/euler-manager/config/../data/images/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"

data/data/problems/75.yml

@@ -2,15 +2,13 @@
 :id: 75
 :name: Singular integer right triangles
 :url: http://projecteuler.net/problem=75
-:content: "\r\n<p>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.</p>\r\n<p style=\"margin-left:50px;\"><b>12 cm</b>: (3,4,5)<br><b>24
-  cm</b>: (6,8,10)<br><b>30 cm</b>: (5,12,13)<br><b>36 cm</b>: (9,12,15)<br><b>40
-  cm</b>: (8,15,17)<br><b>48 cm</b>: (12,16,20)</p>\r\n<p>In contrast, some lengths
-  of wire, like 20 cm, cannot be bent to form an integer sided 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.</p>\r\n<p
-  style=\"margin-left:50px;\"><b>120 cm</b>: (30,40,50), (20,48,52), (24,45,51)</p>\r\n<p>Given
-  that L is the length of the wire, for how many values of L <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  1,500,000 can exactly one integer sided right angle triangle be formed?</p>\r\n\r\n"
+: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**
+  : (5,12,13)  \n**36 cm** : (9,12,15)  \n**40 cm** : (8,15,17)  \n**48 cm** : (12,16,20)\n\nIn
+  contrast, some lengths of wire, like 20 cm, cannot be bent to form an integer sided
+  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 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  1,500,000 can exactly one integer sided right angle triangle be formed?\n\n"

data/data/problems/76.yml

@@ -2,7 +2,7 @@
 :id: 76
 :name: Counting summations
 :url: http://projecteuler.net/problem=76
-:content: "\r\n\n<p>It is possible to write five as a sum in exactly six different
-  ways:</p>\n<p style=\"margin-left:50px;\">4 + 1<br>\n3 + 2<br>\n3 + 1 + 1<br>\n2
-  + 2 + 1<br>\n2 + 1 + 1 + 1<br>\n1 + 1 + 1 + 1 + 1</p>\n<p>How many different ways
-  can one hundred be written as a sum of at least two positive integers?</p>\n\r\n"
+: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
+  integers?\n\n"

data/data/problems/77.yml

@@ -2,7 +2,7 @@
 :id: 77
 :name: Prime summations
 :url: http://projecteuler.net/problem=77
-:content: "\r\n\n<p>It is possible to write ten as the sum of primes in exactly five
-  different ways:</p>\n<p style=\"margin-left:50px;\">7 + 3<br>\n5 + 5<br>\n5 + 3
-  + 2<br>\n3 + 3 + 2 + 2<br>\n2 + 2 + 2 + 2 + 2</p>\n<p>What is the first value which
-  can be written as the sum of primes in over five thousand different ways?</p>\n\r\n"
+: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
+  different ways?\n\n"

data/data/problems/78.yml

@@ -2,11 +2,16 @@
 :id: 78
 :name: Coin partitions
 :url: http://projecteuler.net/problem=78
-:content: "\r\n<p>Let p(<i>n</i>) represent the number of different ways in which
-  <i>n</i> coins can be separated into piles. For example, five coins can separated
-  into piles in exactly seven different ways, so p(5)=7.</p>\r\n<div style=\"text-align:center;\">\r\n<table
-  cellspacing=\"0\" cellpadding=\"10\">\n<tr>\n<td>OOOOO</td>\r\n</tr>\n<tr>\n<td>OOOO 
-   O</td>\r\n</tr>\n<tr>\n<td>OOO   OO</td>\r\n</tr>\n<tr>\n<td>OOO   O   O</td>\r\n</tr>\n<tr>\n<td>OO 
-   OO   O</td>\r\n</tr>\n<tr>\n<td>OO   O   O   O</td>\r\n</tr>\n<tr>\n<td>O   O 
-   O   O   O</td>\r\n</tr>\n</table>\n</div>\r\n<p>Find the least value of <i>n</i>
-  for which p(<i>n</i>) is divisible by one million.</p>\r\n\r\n"
+: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.
+
+  | OOOOO |
+  | 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

@@ -2,10 +2,10 @@
 :id: 79
 :name: Passcode derivation
 :url: http://projecteuler.net/problem=79
-:content: "\r\n<p>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.</p>\r\n<p>The text file, <a href=\"project/keylog.txt\">keylog.txt</a>, contains
-  fifty successful login attempts.</p>\r\n<p>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.</p>\r\n\r\n"
+: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.
+
+  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

@@ -2,12 +2,18 @@
 :id: 8
 :name: Largest product in a series
 :url: http://projecteuler.net/problem=8
-:content: "\r\n<p>The four adjacent digits in the 1000-digit number that have the
-  greatest product are 9 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 9 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  8 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 9 = 5832.</p>\r\n<p style=\"font-family:courier
-  new;text-align:center;\">\r\n73167176531330624919225119674426574742355349194934<br>\r\n96983520312774506326239578318016984801869478851843<br>\r\n85861560789112949495459501737958331952853208805511<br>\r\n12540698747158523863050715693290963295227443043557<br>\r\n66896648950445244523161731856403098711121722383113<br>\r\n62229893423380308135336276614282806444486645238749<br>\r\n30358907296290491560440772390713810515859307960866<br>\r\n70172427121883998797908792274921901699720888093776<br>\r\n65727333001053367881220235421809751254540594752243<br>\r\n52584907711670556013604839586446706324415722155397<br>\r\n53697817977846174064955149290862569321978468622482<br>\r\n83972241375657056057490261407972968652414535100474<br>\r\n82166370484403199890008895243450658541227588666881<br>\r\n16427171479924442928230863465674813919123162824586<br>\r\n17866458359124566529476545682848912883142607690042<br>\r\n24219022671055626321111109370544217506941658960408<br>\r\n07198403850962455444362981230987879927244284909188<br>\r\n84580156166097919133875499200524063689912560717606<br>\r\n05886116467109405077541002256983155200055935729725<br>\r\n71636269561882670428252483600823257530420752963450<br></p>\r\n<p>Find
+:content: "The four adjacent digits in the 1000-digit number that have the greatest
+  product are 9 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  9 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 8 ![×](/home/will/src/euler-manager/config/../data/images/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 digits in the 1000-digit number that have the greatest product.
-  What is the value of this product?</p>\r\n"
+  What is the value of this product?\n\n"

data/data/problems/80.yml

@@ -2,10 +2,10 @@
 :id: 80
 :name: Square root digital expansion
 :url: http://projecteuler.net/problem=80
-:content: "\r\n\n<p>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.</p>\n<p>The square root of two
-  is 1.41421356237309504880..., and the digital sum of the first one hundred decimal
-  digits is 475.</p>\n<p>For the first one hundred natural numbers, find the total
-  of the digital sums of the first one hundred decimal digits for all the irrational
-  square roots.</p>\n\r\n"
+: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.
+
+  The square root of two is 1.41421356237309504880..., and the digital sum of the first one hundred decimal digits is 475.
+
+  For the first one hundred natural numbers, find the total of the digital sums of the first one hundred decimal digits for all the irrational square roots.
+

data/data/problems/81.yml

@@ -2,18 +2,12 @@
 :id: 81
 :name: 'Path sum: two ways'
 :url: http://projecteuler.net/problem=81
-:content: "\r\n<p>In the 5 by 5 matrix below, the minimal path sum from the top left
-  to the bottom right, by <b>only moving to the right and down</b>, is indicated in
-  bold red and is equal to 2427.</p>\r\n<div style=\"text-align:center;\">\r\n<table
-  cellpadding=\"0\" cellspacing=\"0\" border=\"0\" align=\"center\"><tr>\n<td>\n<img
-  src=\"images/bracket_left.gif\" width=\"8\" height=\"120\" alt=\"\" align=\"middle\"><br>\n</td>\r\n<td>\r\n<table
-  cellpadding=\"3\" cellspacing=\"0\" border=\"0\">\n<tr>\n<td><span style=\"color:#dd0000;\"><b>131</b></span></td>\n<td>673</td>\n<td>234</td>\n<td>103</td>\n<td>18</td>\r\n</tr>\n<tr>\n<td><span
-  style=\"color:#dd0000;\"><b>201</b></span></td>\n<td><span style=\"color:#dd0000;\"><b>96</b></span></td>\n<td><span
-  style=\"color:#dd0000;\"><b>342</b></span></td>\n<td>965</td>\n<td>150</td>\r\n</tr>\n<tr>\n<td>630</td>\n<td>803</td>\n<td><span
-  style=\"color:#dd0000;\"><b>746</b></span></td>\n<td><span style=\"color:#dd0000;\"><b>422</b></span></td>\n<td>111</td>\r\n</tr>\n<tr>\n<td>537</td>\n<td>699</td>\n<td>497</td>\n<td><span
-  style=\"color:#dd0000;\"><b>121</b></span></td>\n<td>956</td>\r\n</tr>\n<tr>\n<td>805</td>\n<td>732</td>\n<td>524</td>\n<td><span
-  style=\"color:#dd0000;\"><b>37</b></span></td>\n<td><span style=\"color:#dd0000;\"><b>331</b></span></td>\r\n</tr>\n</table>\n</td>\r\n<td>\n<img
-  src=\"images/bracket_right.gif\" width=\"8\" height=\"120\" alt=\"\" align=\"middle\"><br>\n</td>\r\n</tr></table>\n</div>\r\n<p>Find
-  the minimal path sum, in <a href=\"project/matrix.txt\">matrix.txt</a> (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.</p>\r\n\r\n"
+: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| ![](/home/will/src/euler-manager/config/../data/images/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 | ![](/home/will/src/euler-manager/config/../data/images/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"

data/data/problems/82.yml

@@ -2,18 +2,13 @@
 :id: 82
 :name: 'Path sum: three ways'
 :url: http://projecteuler.net/problem=82
-:content: "\r\n<p class=\"note\">NOTE: This problem is a more challenging version
-  of <a href=\"problem=81\">Problem 81</a>.</p>\r\n<p>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.</p>\r\n<div style=\"text-align:center;\">\r\n<table
-  cellpadding=\"0\" cellspacing=\"0\" border=\"0\" align=\"center\"><tr>\n<td>\n<img
-  src=\"images/bracket_left.gif\" width=\"8\" height=\"120\" alt=\"\" align=\"middle\"><br>\n</td>\r\n<td>\r\n<table
-  cellpadding=\"3\" cellspacing=\"0\" border=\"0\">\n<tr>\n<td>131</td>\n<td>673</td>\n<td><span
-  style=\"color:#dd0000;\"><b>234</b></span></td>\n<td><span style=\"color:#dd0000;\"><b>103</b></span></td>\n<td><span
-  style=\"color:#dd0000;\"><b>18</b></span></td>\r\n</tr>\n<tr>\n<td><span style=\"color:#dd0000;\"><b>201</b></span></td>\n<td><span
-  style=\"color:#dd0000;\"><b>96</b></span></td>\n<td><span style=\"color:#dd0000;\"><b>342</b></span></td>\n<td>965</td>\n<td>150</td>\r\n</tr>\n<tr>\n<td>630</td>\n<td>803</td>\n<td>746</td>\n<td>422</td>\n<td>111</td>\r\n</tr>\n<tr>\n<td>537</td>\n<td>699</td>\n<td>497</td>\n<td>121</td>\n<td>956</td>\r\n</tr>\n<tr>\n<td>805</td>\n<td>732</td>\n<td>524</td>\n<td>37</td>\n<td>331</td>\r\n</tr>\n</table>\n</td>\r\n<td>\n<img
-  src=\"images/bracket_right.gif\" width=\"8\" height=\"120\" alt=\"\" align=\"middle\"><br>\n</td>\r\n</tr></table>\n</div>\r\n<p>Find
-  the minimal path sum, in <a href=\"project/matrix.txt\">matrix.txt</a> (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.</p>\r\n\r\n"
+: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| ![](/home/will/src/euler-manager/config/../data/images/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 | ![](/home/will/src/euler-manager/config/../data/images/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"

data/data/problems/83.yml

@@ -2,22 +2,13 @@
 :id: 83
 :name: 'Path sum: four ways'
 :url: http://projecteuler.net/problem=83
-:content: "\r\n<p class=\"note\">NOTE: This problem is a significantly more challenging
-  version of <a href=\"problem=81\">Problem 81</a>.</p>\r\n<p>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.</p>\r\n<div
-  style=\"text-align:center;\">\r\n<table cellpadding=\"0\" cellspacing=\"0\" border=\"0\"
-  align=\"center\"><tr>\n<td>\n<img src=\"images/bracket_left.gif\" width=\"8\" height=\"120\"
-  alt=\"\" align=\"middle\"><br>\n</td>\r\n<td>\r\n<table cellpadding=\"3\" cellspacing=\"0\"
-  border=\"0\">\n<tr>\n<td><span style=\"color:#dd0000;\"><b>131</b></span></td>\n<td>673</td>\n<td><span
-  style=\"color:#dd0000;\"><b>234</b></span></td>\n<td><span style=\"color:#dd0000;\"><b>103</b></span></td>\n<td><span
-  style=\"color:#dd0000;\"><b>18</b></span></td>\r\n</tr>\n<tr>\n<td><span style=\"color:#dd0000;\"><b>201</b></span></td>\n<td><span
-  style=\"color:#dd0000;\"><b>96</b></span></td>\n<td><span style=\"color:#dd0000;\"><b>342</b></span></td>\n<td>965</td>\n<td><span
-  style=\"color:#dd0000;\"><b>150</b></span></td>\r\n</tr>\n<tr>\n<td>630</td>\n<td>803</td>\n<td>746</td>\n<td><span
-  style=\"color:#dd0000;\"><b>422</b></span></td>\n<td><span style=\"color:#dd0000;\"><b>111</b></span></td>\r\n</tr>\n<tr>\n<td>537</td>\n<td>699</td>\n<td>497</td>\n<td><span
-  style=\"color:#dd0000;\"><b>121</b></span></td>\n<td>956</td>\r\n</tr>\n<tr>\n<td>805</td>\n<td>732</td>\n<td>524</td>\n<td><span
-  style=\"color:#dd0000;\"><b>37</b></span></td>\n<td><span style=\"color:#dd0000;\"><b>331</b></span></td>\r\n</tr>\n</table>\n</td>\r\n<td>\n<img
-  src=\"images/bracket_right.gif\" width=\"8\" height=\"120\" alt=\"\" align=\"middle\"><br>\n</td>\r\n</tr></table>\n</div>\r\n<p>Find
-  the minimal path sum, in <a href=\"project/matrix.txt\">matrix.txt</a> (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.</p>\r\n\r\n"
+: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| ![](/home/will/src/euler-manager/config/../data/images/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 | ![](/home/will/src/euler-manager/config/../data/images/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"

data/data/problems/84.yml

@@ -2,62 +2,39 @@
 :id: 84
 :name: Monopoly odds
 :url: http://projecteuler.net/problem=84
-:content: "\r\n<p>In the game, <i>Monopoly</i>, the standard board is set up in the
-  following way:</p>\r\n<div style=\"text-align:center;\">\r\n<table cellspacing=\"1\"
-  cellpadding=\"5\" border=\"0\" style=\"background-color:#333333;\" align=\"center\">\n<tr>\n<td
-  style=\"background-color:#ffffff;\">GO</td>\r\n<td style=\"background-color:#ffffff;\">A1</td>\r\n<td
-  style=\"background-color:#ffffff;\">CC1</td>\r\n<td style=\"background-color:#ffffff;\">A2</td>\r\n<td
-  style=\"background-color:#ffffff;\">T1</td>\r\n<td style=\"background-color:#ffffff;\">R1</td>\r\n<td
-  style=\"background-color:#ffffff;\">B1</td>\r\n<td style=\"background-color:#ffffff;\">CH1</td>\r\n<td
-  style=\"background-color:#ffffff;\">B2</td>\r\n<td style=\"background-color:#ffffff;\">B3</td>\r\n<td
-  style=\"background-color:#ffffff;\">JAIL</td>\r\n</tr>\n<tr>\n<td style=\"background-color:#ffffff;\">H2</td>\r\n<td
-  colspan=\"9\"> </td>\r\n<td style=\"background-color:#ffffff;\">C1</td>\r\n</tr>\n<tr>\n<td
-  style=\"background-color:#ffffff;\">T2</td>\r\n<td colspan=\"9\"> </td>\r\n<td style=\"background-color:#ffffff;\">U1</td>\r\n</tr>\n<tr>\n<td
-  style=\"background-color:#ffffff;\">H1</td>\r\n<td colspan=\"9\"> </td>\r\n<td style=\"background-color:#ffffff;\">C2</td>\r\n</tr>\n<tr>\n<td
-  style=\"background-color:#ffffff;\">CH3</td>\r\n<td colspan=\"9\"> </td>\r\n<td
-  style=\"background-color:#ffffff;\">C3</td>\r\n</tr>\n<tr>\n<td style=\"background-color:#ffffff;\">R4</td>\r\n<td
-  colspan=\"9\"> </td>\r\n<td style=\"background-color:#ffffff;\">R2</td>\r\n</tr>\n<tr>\n<td
-  style=\"background-color:#ffffff;\">G3</td>\r\n<td colspan=\"9\"> </td>\r\n<td style=\"background-color:#ffffff;\">D1</td>\r\n</tr>\n<tr>\n<td
-  style=\"background-color:#ffffff;\">CC3</td>\r\n<td colspan=\"9\"> </td>\r\n<td
-  style=\"background-color:#ffffff;\">CC2</td>\r\n</tr>\n<tr>\n<td style=\"background-color:#ffffff;\">G2</td>\r\n<td
-  colspan=\"9\"> </td>\r\n<td style=\"background-color:#ffffff;\">D2</td>\r\n</tr>\n<tr>\n<td
-  style=\"background-color:#ffffff;\">G1</td>\r\n<td colspan=\"9\"> </td>\r\n<td style=\"background-color:#ffffff;\">D3</td>\r\n</tr>\n<tr>\n<td
-  style=\"background-color:#ffffff;\">G2J</td>\r\n<td style=\"background-color:#ffffff;\">F3</td>\r\n<td
-  style=\"background-color:#ffffff;\">U2</td>\r\n<td style=\"background-color:#ffffff;\">F2</td>\r\n<td
-  style=\"background-color:#ffffff;\">F1</td>\r\n<td style=\"background-color:#ffffff;\">R3</td>\r\n<td
-  style=\"background-color:#ffffff;\">E3</td>\r\n<td style=\"background-color:#ffffff;\">E2</td>\r\n<td
-  style=\"background-color:#ffffff;\">CH2</td>\r\n<td style=\"background-color:#ffffff;\">E1</td>\r\n<td
-  style=\"background-color:#ffffff;\">FP</td>\r\n</tr>\n</table>\n</div>\r\n<p>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.</p>\r\n<p>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.</p>\r\n<p>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.</p>\r\n<ul>\n<li>Community Chest
-  (2/16 cards):\r\n<ol>\n<li>Advance to GO</li>\r\n<li>Go to JAIL</li>\r\n</ol>\n</li>\r\n<li>Chance
-  (10/16 cards):\r\n<ol>\n<li>Advance to GO</li>\r\n<li>Go to JAIL</li>\r\n<li>Go
-  to C1</li>\r\n<li>Go to E3</li>\r\n<li>Go to H2</li>\r\n<li>Go to R1</li>\r\n<li>Go
-  to next R (railway company)</li>\r\n<li>Go to next R</li>\r\n<li>Go to next U (utility
-  company)</li>\r\n<li>Go back 3 squares.</li>\r\n</ol>\n</li>\r\n</ul>\n<p>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.</p>\r\n<p>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.</p>\r\n<p>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.</p>\r\n<p>If, instead of using two
-  6-sided dice, two 4-sided dice are used, find the six-digit modal string.</p>\r\n\r\n"
+: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"

data/data/problems/85.yml

@@ -2,8 +2,10 @@
 :id: 85
 :name: Counting rectangles
 :url: http://projecteuler.net/problem=85
-:content: "\r\n<p>By counting carefully it can be seen that a rectangular grid measuring
-  3 by 2 contains eighteen rectangles:</p>\r\n<div style=\"text-align:center;\">\r\n<img
-  src=\"project/images/p_085.gif\" alt=\"\">\n</div>\r\n<p>Although there exists no
-  rectangular grid that contains exactly two million rectangles, find the area of
-  the grid with the nearest solution.</p>\r\n\r\n"
+:content: |+
+  By counting carefully it can be seen that a rectangular grid measuring 3 by 2 contains eighteen rectangles:
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_085.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

@@ -2,14 +2,14 @@
 :id: 86
 :name: Cuboid route
 :url: http://projecteuler.net/problem=86
-:content: "\r\n<p>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.</p>\r\n<div style=\"text-align:center;\">\r\n<img src=\"project/images/p_086.gif\"
-  alt=\"\"><br>\n</div>\r\n<p>However, there are up to three \"shortest\" path candidates
-  for any given cuboid and the shortest route doesn't always have integer length.</p>\r\n<p>By
-  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.</p>\r\n<p>Find
-  the least value of M such that the number of solutions first exceeds one million.</p>\r\n\r\n"
+: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 ![](/home/will/src/euler-manager/config/../data/images/p_086.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"

data/data/problems/87.yml

@@ -2,11 +2,10 @@
 :id: 87
 :name: Prime power triples
 :url: http://projecteuler.net/problem=87
-:content: "\r\n\n<p>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:</p>\n<p style=\"margin-left:50px;\">28
-  = 2<sup>2</sup> + 2<sup>3</sup> + 2<sup>4</sup><br>\n33 = 3<sup>2</sup> + 2<sup>3</sup>
-  + 2<sup>4</sup><br>\n49 = 5<sup>2</sup> + 2<sup>3</sup> + 2<sup>4</sup><br>\n47
-  = 2<sup>2</sup> + 3<sup>3</sup> + 2<sup>4</sup></p>\n<p>How many numbers below fifty
-  million can be expressed as the sum of a prime square, prime cube, and prime fourth
-  power?</p>\n\r\n"
+: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>
+  \ \n33 = 3<sup>2</sup> + 2<sup>3</sup> + 2<sup>4</sup>  \n49 = 5<sup>2</sup> + 2<sup>3</sup>
+  + 2<sup>4</sup>  \n47 = 2<sup>2</sup> + 3<sup>3</sup> + 2<sup>4</sup>\n\nHow many
+  numbers below fifty million can be expressed as the sum of a prime square, prime
+  cube, and prime fourth power?\n\n"