euler-manager 0.0.5 → 0.0.6

data/data/problems/88.yml

@@ -2,52 +2,33 @@
 :id: 88
 :name: Product-sum numbers
 :url: http://projecteuler.net/problem=88
-:content: "\r\n\n<p>A natural number, N, that can be written as the sum and product
-  of a given set of at least two natural numbers, {<i>a</i><sub>1</sub>, <i>a</i><sub>2</sub>,
-  ... , <i>a</i><sub><i>k</i></sub>} is called a product-sum number: N = <i>a</i><sub>1</sub>
-  + <i>a</i><sub>2</sub> + ... + <i>a</i><sub><i>k</i></sub> = <i>a</i><sub>1</sub><img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"><i>a</i><sub>2</sub><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  ... <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"><i>a</i><sub><i>k</i></sub>.</p>\n<p>For example,
-  6 = 1 + 2 + 3 = 1 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 2 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  3.</p>\n<p>For a given set of size, <i>k</i>, we shall call the smallest N with
-  this property a minimal product-sum number. The minimal product-sum numbers for
-  sets of size, <i>k</i> = 2, 3, 4, 5, and 6 are as follows.</p>\n<p style=\"margin-left:50px;\"><i>k</i>=2:
-  4 = 2 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 2 = 2 + 2<br><i>k</i>=3: 6 = 1 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  2 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 3 = 1 + 2 + 3<br><i>k</i>=4: 8 = 1 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  1 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 2 <img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 4 = 1 + 1
-  + 2 + 4<br><i>k</i>=5: 8 = 1 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 1 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  2 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 2 <img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 2  = 1 + 1
-  + 2 + 2 + 2<br><i>k</i>=6: 12 = 1 <img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 1 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  1 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 1 <img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 2 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  6 = 1 + 1 + 1 + 1 + 2 + 6</p>\n<p>Hence for 2<img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><i>k</i><img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">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.</p>\n<p>In fact, as the complete set of minimal product-sum
-  numbers for 2<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"><i>k</i><img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">12
-  is {4, 6, 8, 12, 15, 16}, the sum is 61.</p>\n<p>What is the sum of all the minimal
-  product-sum numbers for 2<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><i>k</i><img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">12000?</p>\n\r\n"
+: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> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  _a_<sub>2</sub> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  ... ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) _a_<sub><i>k</i></sub>.\n\nFor
+  example, 6 = 1 + 2 + 3 = 1 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 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 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  2 = 2 + 2  \n_k_=3: 6 = 1 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 3 =
+  1 + 2 + 3  \n_k_=4: 8 = 1 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  1 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  4 = 1 + 1 + 2 + 4  \n_k_=5: 8 = 1 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  1 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 2 =
+  1 + 1 + 2 + 2 + 2  \n_k_=6: 12 = 1 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  1 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 1 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  1 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  6 = 1 + 1 + 1 + 1 + 2 + 6\n\nHence for 2 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)_k_
+  ![≤](/home/will/src/euler-manager/config/../data/images/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 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)_k_
+  ![≤](/home/will/src/euler-manager/config/../data/images/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 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)_k_
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)12000?\n\n"

data/data/problems/89.yml

@@ -2,17 +2,16 @@
 :id: 89
 :name: Roman numerals
 :url: http://projecteuler.net/problem=89
-:content: "\r\n<p>The rules for writing Roman numerals allow for many ways of writing
-  each number (see <a href=\"about=roman_numerals\">About Roman Numerals...</a>).
-  However, there is always a \"best\" way of writing a particular number.</p>\r\n<p>For
-  example, the following represent all of the legitimate ways of writing the number
-  sixteen:</p>\r\n<p style=\"margin-left:50px;font-family:courier new,monospace;\">IIIIIIIIIIIIIIII<br>\r\nVIIIIIIIIIII<br>\r\nVVIIIIII<br>\r\nXIIIIII<br>\r\nVVVI<br>\r\nXVI</p>\r\n<p>The
-  last example being considered the most efficient, as it uses the least number of
-  numerals.</p>\r\n<p>The 11K text file, <a href=\"project/roman.txt\">roman.txt</a>
-  (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 <a href=\"about=roman_numerals\">About
-  Roman Numerals...</a> for the definitive rules for this problem).</p>\r\n<p>Find
-  the number of characters saved by writing each of these in their minimal form.</p>\r\n<p
-  class=\"note\">Note: You can assume that all the Roman numerals in the file contain
-  no more than four consecutive identical units.</p>\r\n\r\n"
+: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"

data/data/problems/9.yml

@@ -2,12 +2,9 @@
 :id: 9
 :name: Special Pythagorean triplet
 :url: http://projecteuler.net/problem=9
-:content: "\r\n<p>A Pythagorean triplet is a set of three natural numbers, <var>a</var>
-  <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>b</var> <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>c</var>,
-  for which,</p>\r\n<div style=\"text-align:center;\"> <var>a</var><sup>2</sup> +
-  <var>b</var><sup>2</sup> = <var>c</var><sup>2</sup>\n</div>\r\n<p>For example, 3<sup>2</sup>
-  + 4<sup>2</sup> = 9 + 16 = 25 = 5<sup>2</sup>.</p>\r\n<p>There exists exactly one
-  Pythagorean triplet for which <var>a</var> + <var>b</var> + <var>c</var> = 1000.<br>Find
-  the product <var>abc</var>.</p>\r\n\r\n"
+:content: "A Pythagorean triplet is a set of three natural numbers, <var>a</var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>b</var> ![<](/home/will/src/euler-manager/config/../data/images/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"

data/data/problems/90.yml

@@ -2,22 +2,20 @@
 :id: 90
 :name: Cube digit pairs
 :url: http://projecteuler.net/problem=90
-:content: "\r\n<p>Each of the six faces on a cube has a different digit (0 to 9) written
+:content: "Each of the six faces on a cube has a different digit (0 to 9) written
   on it; the same is done to a second cube. By placing the two cubes side-by-side
-  in different positions we can form a variety of 2-digit numbers.</p>\r\n\r\n<p>For
-  example, the square number 64 could be formed:</p>\r\n\r\n<div style=\"text-align:center;\">\r\n<img
-  src=\"project/images/p_090.gif\" alt=\"\"><br>\n</div>\r\n\r\n<p>In fact, by carefully
-  choosing the digits on both cubes it is possible to display all of the square numbers
-  below one-hundred: 01, 04, 09, 16, 25, 36, 49, 64, and 81.</p>\r\n\r\n<p>For example,
-  one way this can be achieved is by placing {0, 5, 6, 7, 8, 9} on one cube and {1,
-  2, 3, 4, 8, 9} on the other cube.</p>\r\n\r\n<p>However, for this problem we shall
-  allow the 6 or 9 to be turned upside-down so that an arrangement like {0, 5, 6,
-  7, 8, 9} and {1, 2, 3, 4, 6, 7} allows for all nine square numbers to be displayed;
-  otherwise it would be impossible to obtain 09.</p>\r\n\r\n<p>In determining a distinct
-  arrangement we are interested in the digits on each cube, not the order.</p>\r\n\r\n<p
-  style=\"margin-left:50px;\">{1, 2, 3, 4, 5, 6} is equivalent to {3, 6, 4, 1, 2,
-  5}<br>\r\n{1, 2, 3, 4, 5, 6} is distinct from {1, 2, 3, 4, 5, 9}</p>\r\n\r\n<p>But
-  because we are allowing 6 and 9 to be reversed, the two distinct sets in the last
-  example both represent the extended set {1, 2, 3, 4, 5, 6, 9} for the purpose of
-  forming 2-digit numbers.</p>\r\n\r\n<p>How many distinct arrangements of the two
-  cubes allow for all of the square numbers to be displayed?</p>\r\n"
+  in different positions we can form a variety of 2-digit numbers.\n\nFor example,
+  the square number 64 could be formed:\n\n ![](/home/will/src/euler-manager/config/../data/images/p_090.gif)
+  \ \n\nIn fact, by carefully choosing the digits on both cubes it is possible to
+  display all of the square numbers below one-hundred: 01, 04, 09, 16, 25, 36, 49,
+  64, and 81.\n\nFor example, one way this can be achieved is by placing {0, 5, 6,
+  7, 8, 9} on one cube and {1, 2, 3, 4, 8, 9} on the other cube.\n\nHowever, for this
+  problem we shall allow the 6 or 9 to be turned upside-down so that an arrangement
+  like {0, 5, 6, 7, 8, 9} and {1, 2, 3, 4, 6, 7} allows for all nine square numbers
+  to be displayed; otherwise it would be impossible to obtain 09.\n\nIn determining
+  a distinct arrangement we are interested in the digits on each cube, not the order.\n\n{1,
+  2, 3, 4, 5, 6} is equivalent to {3, 6, 4, 1, 2, 5}  \n\r{1, 2, 3, 4, 5, 6} is distinct
+  from {1, 2, 3, 4, 5, 9}\n\nBut because we are allowing 6 and 9 to be reversed, the
+  two distinct sets in the last example both represent the extended set {1, 2, 3,
+  4, 5, 6, 9} for the purpose of forming 2-digit numbers.\n\nHow many distinct arrangements
+  of the two cubes allow for all of the square numbers to be displayed?\n\n"

data/data/problems/91.yml

@@ -2,18 +2,13 @@
 :id: 91
 :name: Right triangles with integer coordinates
 :url: http://projecteuler.net/problem=91
-:content: "\r\n<p>The points P (<i>x</i><sub>1</sub>, <i>y</i><sub>1</sub>) and Q
-  (<i>x</i><sub>2</sub>, <i>y</i><sub>2</sub>) are plotted at integer co-ordinates
-  and are joined to the origin, O(0,0), to form ΔOPQ.</p>\r\n\r\n<div style=\"text-align:center;\">\r\n<img
-  src=\"project/images/p_091_1.gif\" alt=\"\"><br>\n</div>\r\n\r\n<p>There are exactly
-  fourteen triangles containing a right angle that can be formed when each co-ordinate
-  lies between 0 and 2 inclusive; that is,<br>0 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><i>x</i><sub>1</sub>,
-  <i>y</i><sub>1</sub>, <i>x</i><sub>2</sub>, <i>y</i><sub>2</sub><img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  2.</p>\r\n\r\n<div style=\"text-align:center;\">\r\n<img src=\"project/images/p_091_2.gif\"
-  alt=\"\"><br>\n</div>\r\n\r\n<p>Given that 0 <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><i>x</i><sub>1</sub>,
-  <i>y</i><sub>1</sub>, <i>x</i><sub>2</sub>, <i>y</i><sub>2</sub><img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  50, how many right triangles can be formed?</p>\r\n"
+:content: "The points P (_x_<sub>1</sub>, _y_<sub>1</sub>) and Q (_x_<sub>2</sub>,
+  _y_<sub>2</sub>) are plotted at integer co-ordinates and are joined to the origin,
+  O(0,0), to form ΔOPQ.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_091_1.gif)
+  \ \n\nThere are exactly fourteen triangles containing a right angle that can be
+  formed when each co-ordinate lies between 0 and 2 inclusive; that is,  \n0 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  _x_<sub>1</sub>, _y_<sub>1</sub>, _x_<sub>2</sub>, _y_<sub>2</sub> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  2.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_091_2.gif)  \n\nGiven
+  that 0 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) _x_<sub>1</sub>,
+  _y_<sub>1</sub>, _x_<sub>2</sub>, _y_<sub>2</sub> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  50, how many right triangles can be formed?\n\n"

data/data/problems/92.yml

@@ -2,28 +2,17 @@
 :id: 92
 :name: Square digit chains
 :url: http://projecteuler.net/problem=92
-:content: "\r\n\n<p>A number chain is created by continuously adding the square of
-  the digits in a number to form a new number until it has been seen before.</p>\n<p>For
-  example,</p>\n<p style=\"margin-left:50px;\">44 <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\">
-  32 <img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 13 <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 10 <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"><b>1</b>
-  <img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"><b>1</b><br>\n85 <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"><b>89</b>
-  <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;\"> 42 <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\">
-  20 <img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 4 <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 16 <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\">
-  37 <img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 58 <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"><b>89</b></p>\n<p>Therefore
-  any chain that arrives at 1 or 89 will become stuck in an endless loop. What is
-  most amazing is that EVERY starting number will eventually arrive at 1 or 89.</p>\n<p>How
-  many starting numbers below ten million will arrive at 89?</p>\n\r\n"
+:content: "A number chain is created by continuously adding the square of the digits
+  in a number to form a new number until it has been seen before.\n\nFor example,\n\n44
+  ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 32 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  13 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 10 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  **1** ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) **1**
+  \ \n85 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  **89** ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  145 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 42
+  ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 20 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  4 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 16 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  37 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 58 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  **89**\n\nTherefore any chain that arrives at 1 or 89 will become stuck in an endless
+  loop. What is most amazing is that EVERY starting number will eventually arrive
+  at 1 or 89.\n\nHow many starting numbers below ten million will arrive at 89?\n\n"

data/data/problems/93.yml

@@ -2,20 +2,16 @@
 :id: 93
 :name: Arithmetic expressions
 :url: http://projecteuler.net/problem=93
-:content: "\r\n\n<p>By using each of the digits from the set, {1, 2, 3, 4}, exactly
-  once, and making use of the four arithmetic operations (+, <img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">,
-  *, /) and brackets/parentheses, it is possible to form different positive integer
-  targets.</p>\n<p>For example,</p>\n<p style=\"margin-left:50px;font-family:courier
-  new;\">8 = (4 * (1 + 3)) / 2<br>\n14 = 4 * (3 + 1 / 2)<br>\n19 = 4 * (2 + 3) <img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"> 1<br>\n36 = 3 * 4 * (2 + 1)</p>\n<p>Note that
-  concatenations of the digits, like 12 + 34, are not allowed.</p>\n<p>Using the set,
-  {1, 2, 3, 4}, it is possible to obtain thirty-one different target numbers of which
-  36 is the maximum, and each of the numbers 1 to 28 can be obtained before encountering
-  the first non-expressible number.</p>\n<p>Find the set of four distinct digits,
-  <i>a</i> <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  border=\"0\" style=\"vertical-align:middle;\"><i>b</i> &amp;lt <i>c</i> <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><i>d</i>,
-  for which the longest set of consecutive positive integers, 1 to <i>n</i>, can be
-  obtained, giving your answer as a string: <i>abcd</i>.</p>\n\r\n"
+:content: "By using each of the digits from the set, {1, 2, 3, 4}, exactly once, and
+  making use of the four arithmetic operations (+, ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif),
+  \\*, /) and brackets/parentheses, it is possible to form different positive integer
+  targets.\n\nFor example,\n\n8 = (4 \\* (1 + 3)) / 2  \n14 = 4 \\* (3 + 1 / 2)  \n19
+  = 4 \\* (2 + 3) ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  1  \n36 = 3 \\* 4 \\* (2 + 1)\n\nNote that concatenations of the digits, like 12
+  + 34, are not allowed.\n\nUsing the set, {1, 2, 3, 4}, it is possible to obtain
+  thirty-one different target numbers of which 36 is the maximum, and each of the
+  numbers 1 to 28 can be obtained before encountering the first non-expressible number.\n\nFind
+  the set of four distinct digits, _a_ ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  _b_ &lt _c_ ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  _d_, for which the longest set of consecutive positive integers, 1 to _n_, can be
+  obtained, giving your answer as a string: _abcd_.\n\n"

data/data/problems/94.yml

@@ -2,10 +2,10 @@
 :id: 94
 :name: Almost equilateral triangles
 :url: http://projecteuler.net/problem=94
-:content: "\r\n<p>It is easily proved that no equilateral triangle exists with integral
-  length sides and integral area. However, the <i>almost equilateral triangle</i>
-  5-5-6 has an area of 12 square units.</p>\r\n<p>We shall define an <i>almost equilateral
-  triangle</i> to be a triangle for which two sides are equal and the third differs
-  by no more than one unit.</p>\r\n<p>Find the sum of the perimeters of all <i>almost
-  equilateral triangles</i> with integral side lengths and area and whose perimeters
-  do not exceed one billion (1,000,000,000).</p>\r\n\r\n"
+:content: |+
+  It is easily proved that no equilateral triangle exists with integral length sides and integral area. However, the _almost equilateral triangle_ 5-5-6 has an area of 12 square units.
+
+  We shall define an _almost equilateral triangle_ to be a triangle for which two sides are equal and the third differs by no more than one unit.
+
+  Find the sum of the perimeters of all _almost equilateral triangles_ with integral side lengths and area and whose perimeters do not exceed one billion (1,000,000,000).
+

data/data/problems/95.yml

@@ -2,22 +2,16 @@
 :id: 95
 :name: Amicable chains
 :url: http://projecteuler.net/problem=95
-:content: "\r\n<p>The proper divisors of a number are all the divisors excluding the
-  number itself. For example, the proper divisors of 28 are 1, 2, 4, 7, and 14. As
-  the sum of these divisors is equal to 28, we call it a perfect number.</p>\r\n<p>Interestingly
-  the sum of the proper divisors of 220 is 284 and the sum of the proper divisors
-  of 284 is 220, forming a chain of two numbers. For this reason, 220 and 284 are
-  called an amicable pair.</p>\r\n<p>Perhaps less well known are longer chains. For
-  example, starting with 12496, we form a chain of five numbers:</p>\r\n<p style=\"text-align:center;\">12496
-  <img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 14288 <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 15472 <img
-  src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 14536 <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 14264 (<img
-  src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 12496 <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> ...)</p>\r\n<p>Since
-  this chain returns to its starting point, it is called an amicable chain.</p>\r\n<p>Find
-  the smallest member of the longest amicable chain with no element exceeding one
-  million.</p>\r\n\r\n"
+:content: |+
+  The proper divisors of a number are all the divisors excluding the number itself. For example, the proper divisors of 28 are 1, 2, 4, 7, and 14. As the sum of these divisors is equal to 28, we call it a perfect number.
+
+  Interestingly the sum of the proper divisors of 220 is 284 and the sum of the proper divisors of 284 is 220, forming a chain of two numbers. For this reason, 220 and 284 are called an amicable pair.
+
+  Perhaps less well known are longer chains. For example, starting with 12496, we form a chain of five numbers:
+
+  12496 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 14288 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 15472 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 14536 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 14264 ( ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 12496 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) ...)
+
+  Since this chain returns to its starting point, it is called an amicable chain.
+
+  Find the smallest member of the longest amicable chain with no element exceeding one million.
+

data/data/problems/96.yml

@@ -2,45 +2,29 @@
 :id: 96
 :name: Su Doku
 :url: http://projecteuler.net/problem=96
-:content: "\r\n<p>Su Doku (Japanese meaning <i>number place</i>) is the name given
-  to a popular puzzle concept. Its origin is unclear, but credit must be attributed
-  to Leonhard Euler who invented a similar, and much more difficult, puzzle idea called
-  Latin Squares. The objective of Su Doku puzzles, however, is to replace the blanks
-  (or zeros) in a 9 by 9 grid in such that each row, column, and 3 by 3 box contains
-  each of the digits 1 to 9. Below is an example of a typical starting puzzle grid
-  and its solution grid.</p>\r\n<div style=\"text-align:center;\">\r\n<table border=\"0\"
-  cellpadding=\"0\" cellspacing=\"0\" align=\"center\"><tr>\n<td>\r\n<table cellpadding=\"5\"
-  cellspacing=\"0\" border=\"1\">\n<tr>\n<td style=\"font-family:courier new;font-size:14pt;\">0
-  0 3<br>9 0 0<br>0 0 1</td>\r\n<td style=\"font-family:courier new;font-size:14pt;\">0
-  2 0<br>3 0 5<br>8 0 6</td>\r\n<td style=\"font-family:courier new;font-size:14pt;\">6
-  0 0<br>0 0 1<br>4 0 0</td>\r\n</tr>\n<tr>\n<td style=\"font-family:courier new;font-size:14pt;\">0
-  0 8<br>7 0 0<br>0 0 6</td>\r\n<td style=\"font-family:courier new;font-size:14pt;\">1
-  0 2<br>0 0 0<br>7 0 8</td>\r\n<td style=\"font-family:courier new;font-size:14pt;\">9
-  0 0<br>0 0 8<br>2 0 0</td>\r\n</tr>\n<tr>\n<td style=\"font-family:courier new;font-size:14pt;\">0
-  0 2<br>8 0 0<br>0 0 5</td>\r\n<td style=\"font-family:courier new;font-size:14pt;\">6
-  0 9<br>2 0 3<br>0 1 0</td>\r\n<td style=\"font-family:courier new;font-size:14pt;\">5
-  0 0<br>0 0 9<br>3 0 0</td>\r\n</tr>\n</table>\n</td>\r\n<td width=\"50\">\n<img
-  src=\"images/spacer.gif\" width=\"50\" height=\"1\" alt=\"\"><br>\n</td>\r\n<td>\r\n<table
-  cellpadding=\"5\" cellspacing=\"0\" border=\"1\">\n<tr>\n<td style=\"font-family:courier
-  new;font-size:14pt;\">4 8 3<br>9 6 7<br>2 5 1</td>\r\n<td style=\"font-family:courier
-  new;font-size:14pt;\">9 2 1<br>3 4 5<br>8 7 6</td>\r\n<td style=\"font-family:courier
-  new;font-size:14pt;\">6 5 7<br>8 2 1<br>4 9 3</td>\r\n</tr>\n<tr>\n<td style=\"font-family:courier
-  new;font-size:14pt;\">5 4 8<br>7 2 9<br>1 3 6</td>\r\n<td style=\"font-family:courier
-  new;font-size:14pt;\">1 3 2<br>5 6 4<br>7 9 8</td>\r\n<td style=\"font-family:courier
-  new;font-size:14pt;\">9 7 6<br>1 3 8<br>2 4 5</td>\r\n</tr>\n<tr>\n<td style=\"font-family:courier
-  new;font-size:14pt;\">3 7 2<br>8 1 4<br>6 9 5</td>\r\n<td style=\"font-family:courier
-  new;font-size:14pt;\">6 8 9<br>2 5 3<br>4 1 7</td>\r\n<td style=\"font-family:courier
-  new;font-size:14pt;\">5 1 4<br>7 6 9<br>3 8 2</td>\r\n</tr>\n</table>\n</td>\r\n</tr></table>\n</div>\r\n<p>A
-  well constructed Su Doku puzzle has a unique solution and can be solved by logic,
-  although it may be necessary to employ \"guess and test\" methods in order to eliminate
-  options (there is much contested opinion over this). The complexity of the search
-  determines the difficulty of the puzzle; the example above is considered <i>easy</i>
-  because it can be solved by straight forward direct deduction.</p>\r\n<p>The 6K
-  text file, <a href=\"project/sudoku.txt\">sudoku.txt</a> (right click and 'Save
-  Link/Target As...'), contains fifty different Su Doku puzzles ranging in difficulty,
-  but all with unique solutions (the first puzzle in the file is the example above).</p>\r\n<p>By
+:content: "Su Doku (Japanese meaning _number place_) is the name given to a popular
+  puzzle concept. Its origin is unclear, but credit must be attributed to Leonhard
+  Euler who invented a similar, and much more difficult, puzzle idea called Latin
+  Squares. The objective of Su Doku puzzles, however, is to replace the blanks (or
+  zeros) in a 9 by 9 grid in such that each row, column, and 3 by 3 box contains each
+  of the digits 1 to 9. Below is an example of a typical starting puzzle grid and
+  its solution grid.\n\n| \n\n| 0 0 3  \n9 0 0  \n0 0 1 | 0 2 0  \n3 0 5  \n8 0 6
+  | 6 0 0  \n0 0 1  \n4 0 0 |\n| 0 0 8  \n7 0 0  \n0 0 6 | 1 0 2  \n0 0 0  \n7 0 8
+  | 9 0 0  \n0 0 8  \n2 0 0 |\n| 0 0 2  \n8 0 0  \n0 0 5 | 6 0 9  \n2 0 3  \n0 1 0
+  | 5 0 0  \n0 0 9  \n3 0 0 |\n\n | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  \ \n | \n\n| 4 8 3  \n9 6 7  \n2 5 1 | 9 2 1  \n3 4 5  \n8 7 6 | 6 5 7  \n8 2 1
+  \ \n4 9 3 |\n| 5 4 8  \n7 2 9  \n1 3 6 | 1 3 2  \n5 6 4  \n7 9 8 | 9 7 6  \n1 3
+  8  \n2 4 5 |\n| 3 7 2  \n8 1 4  \n6 9 5 | 6 8 9  \n2 5 3  \n4 1 7 | 5 1 4  \n7 6
+  9  \n3 8 2 |\n\n |\n\nA well constructed Su Doku puzzle has a unique solution and
+  can be solved by logic, although it may be necessary to employ \"guess and test\"
+  methods in order to eliminate options (there is much contested opinion over this).
+  The complexity of the search determines the difficulty of the puzzle; the example
+  above is considered _easy_ because it can be solved by straight forward direct deduction.\n\nThe
+  6K text file, [sudoku.txt](project/sudoku.txt) (right click and 'Save Link/Target
+  As...'), contains fifty different Su Doku puzzles ranging in difficulty, but all
+  with unique solutions (the first puzzle in the file is the example above).\n\nBy
   solving all fifty puzzles find the sum of the 3-digit numbers found in the top left
   corner of each solution grid; for example, 483 is the 3-digit number found in the
-  top left corner of the solution grid above.</p>\r\n<!--<p class='info'>Note: If
-  you're convinced that &quot;guess and test&quot; methods need not be employed please
-  tell how you would solve #6 and #46. (c;</p>-->\r\n\r\n"
+  top left corner of the solution grid above.\n\n<!--<p class='info'>Note: If you're
+  convinced that &quot;guess and test&quot; methods need not be employed please tell
+  how you would solve #6 and #46. (c;</p>-->\n"

data/data/problems/97.yml

@@ -2,13 +2,10 @@
 :id: 97
 :name: Large non-Mersenne prime
 :url: http://projecteuler.net/problem=97
-:content: "\r\n<p>The first known prime found to exceed one million digits was discovered
-  in 1999, and is a Mersenne prime of the form 2<sup>6972593</sup><img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">1;
-  it contains exactly 2,098,960 digits. Subsequently other Mersenne primes, of the
-  form 2<sup><i>p</i></sup><img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\"
-  alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">1, have been found which
-  contain more digits.</p>\r\n<p>However, in 2004 there was found a massive non-Mersenne
-  prime which contains 2,357,207 digits: 28433<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">2<sup>7830457</sup>+1.</p>\r\n<p>Find
-  the last ten digits of this prime number.</p>\r\n\r\n"
+:content: |+
+  The first known prime found to exceed one million digits was discovered in 1999, and is a Mersenne prime of the form 2<sup>6972593</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)1; it contains exactly 2,098,960 digits. Subsequently other Mersenne primes, of the form 2<sup><i>p</i></sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)1, have been found which contain more digits.
+
+  However, in 2004 there was found a massive non-Mersenne prime which contains 2,357,207 digits: 28433 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)2<sup>7830457</sup>+1.
+
+  Find the last ten digits of this prime number.
+

data/data/problems/98.yml

@@ -2,15 +2,12 @@
 :id: 98
 :name: Anagramic squares
 :url: http://projecteuler.net/problem=98
-:content: "\r\n<p>By replacing each of the letters in the word CARE with 1, 2, 9,
-  and 6 respectively, we form a square number: 1296 = 36<sup>2</sup>. What is remarkable
-  is that, by using the same digital substitutions, the anagram, RACE, also forms
-  a square number: 9216 = 96<sup>2</sup>. We shall call CARE (and RACE) a square anagram
-  word pair and specify further that leading zeroes are not permitted, neither may
-  a different letter have the same digital value as another letter.</p>\r\n<p>Using
-  <a href=\"project/words.txt\">words.txt</a> (right click and 'Save Link/Target As...'),
-  a 16K text file containing nearly two-thousand common English words, find all the
-  square anagram word pairs (a palindromic word is NOT considered to be an anagram
-  of itself).</p>\r\n<p>What is the largest square number formed by any member of
-  such a pair?</p>\r\n<p class=\"info\">NOTE: All anagrams formed must be contained
-  in the given text file.</p>\r\n\r\n"
+:content: |+
+  By replacing each of the letters in the word CARE with 1, 2, 9, and 6 respectively, we form a square number: 1296 = 36<sup>2</sup>. What is remarkable is that, by using the same digital substitutions, the anagram, RACE, also forms a square number: 9216 = 96<sup>2</sup>. We shall call CARE (and RACE) a square anagram word pair and specify further that leading zeroes are not permitted, neither may a different letter have the same digital value as another letter.
+
+  Using [words.txt](project/words.txt) (right click and 'Save Link/Target As...'), a 16K text file containing nearly two-thousand common English words, find all the square anagram word pairs (a palindromic word is NOT considered to be an anagram of itself).
+
+  What is the largest square number formed by any member of such a pair?
+
+  NOTE: All anagrams formed must be contained in the given text file.
+

data/data/problems/99.yml

@@ -2,15 +2,12 @@
 :id: 99
 :name: Largest exponential
 :url: http://projecteuler.net/problem=99
-:content: "\r\n\n<p>Comparing two numbers written in index form like 2<sup>11</sup>
-  and 3<sup>7</sup> is not difficult, as any calculator would confirm that 2<sup>11</sup>
-  = 2048 <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  border=\"0\" style=\"vertical-align:middle;\"> 3<sup>7</sup> = 2187.</p>\n<p>However,
-  confirming that 632382<sup>518061</sup><img src=\"images/symbol_gt.gif\" width=\"10\"
-  height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\"> 519432<sup>525806</sup>
-  would be much more difficult, as both numbers contain over three million digits.</p>\n<p>Using
-  <a href=\"project/base_exp.txt\">base_exp.txt</a> (right click and 'Save Link/Target
-  As...'), a 22K text file containing one thousand lines with a base/exponent pair
-  on each line, determine which line number has the greatest numerical value.</p>\n<p
-  class=\"info\">NOTE: The first two lines in the file represent the numbers in the
-  example given above.</p>\n\r\n"
+:content: |+
+  Comparing two numbers written in index form like 2<sup>11</sup> and 3<sup>7</sup> is not difficult, as any calculator would confirm that 2<sup>11</sup> = 2048 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 3<sup>7</sup> = 2187.
+
+  However, confirming that 632382<sup>518061</sup> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif) 519432<sup>525806</sup> would be much more difficult, as both numbers contain over three million digits.
+
+  Using [base\_exp.txt](project/base_exp.txt) (right click and 'Save Link/Target As...'), a 22K text file containing one thousand lines with a base/exponent pair on each line, determine which line number has the greatest numerical value.
+
+  NOTE: The first two lines in the file represent the numbers in the example given above.
+

data/euler-manager.gemspec

@@ -31,4 +31,5 @@ Gem::Specification.new do |spec|
   spec.add_development_dependency 'fakefs', '~> 0.5.2'
 
   spec.add_development_dependency 'nokogiri'
+  spec.add_development_dependency 'reverse_markdown'
 end

data/example/1/README.md

@@ -1,6 +1,6 @@
 # [Multiples of 3 and 5](http://projecteuler.net/problem=1)
 
-
-<p>If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.</p>
-<p>Find the sum of all the multiples of 3 or 5 below 1000.</p>
-
+If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
+
+Find the sum of all the multiples of 3 or 5 below 1000.
+

data/example/15/README.md

@@ -0,0 +1,8 @@
+# [Lattice paths](http://projecteuler.net/problem=15)
+
+Starting in the top left corner of a 2 ![×](https://raw.githubusercontent.com/yaworsw/euler-manager/develop/.data/images/symbol_times.gif)2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.
+
+ ![](https://raw.githubusercontent.com/yaworsw/euler-manager/develop/.data/images/p_015.gif)
+
+How many such routes are there through a 20 ![×](https://raw.githubusercontent.com/yaworsw/euler-manager/develop/.data/images/symbol_times.gif)20 grid?
+

data/example/15/python/15.py

@@ -0,0 +1,5 @@
+import euler
+
+answer = 0
+
+print(answer)