euler-manager 0.0.5 → 0.0.6

data/data/problems/10.yml

@@ -2,7 +2,6 @@
 :id: 10
 :name: Summation of primes
 :url: http://projecteuler.net/problem=10
-:content: "\r\n<p>The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.</p>\r\n<p>Find
-  the sum of all the primes below two million.</p>\r\n<!--\r\n<p class=\"note\">Note:
-  This problem has been changed recently, please check that you are using the right
-  parameters.</p>\r\n-->\r\n\r\n\r\n"
+:content: "The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.\n\nFind the sum of
+  all the primes below two million.\n\n<!--\r\n<p class=\"note\">Note: This problem
+  has been changed recently, please check that you are using the right parameters.</p>\r\n-->\n"

data/data/problems/100.yml

@@ -2,12 +2,10 @@
 :id: 100
 :name: Arranged probability
 :url: http://projecteuler.net/problem=100
-:content: "\r\n\n<p>If a box contains twenty-one coloured discs, composed of fifteen
-  blue discs and six red discs, and two discs were taken at random, it can be seen
-  that the probability of taking two blue discs, P(BB) = (15/21)<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">(14/20)
-  = 1/2.</p>\n<p>The next such arrangement, for which there is exactly 50% chance
-  of taking two blue discs at random, is a box containing eighty-five blue discs and
-  thirty-five red discs.</p>\n<p>By finding the first arrangement to contain over
-  10<sup>12</sup> = 1,000,000,000,000 discs in total, determine the number of blue
-  discs that the box would contain.</p>\n\r\n"
+:content: |+
+  If a box contains twenty-one coloured discs, composed of fifteen blue discs and six red discs, and two discs were taken at random, it can be seen that the probability of taking two blue discs, P(BB) = (15/21) ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)(14/20) = 1/2.
+
+  The next such arrangement, for which there is exactly 50% chance of taking two blue discs at random, is a box containing eighty-five blue discs and thirty-five red discs.
+
+  By finding the first arrangement to contain over 10<sup>12</sup> = 1,000,000,000,000 discs in total, determine the number of blue discs that the box would contain.
+

data/data/problems/101.yml

@@ -2,48 +2,35 @@
 :id: 101
 :name: Optimum polynomial
 :url: http://projecteuler.net/problem=101
-:content: "\r\n<p>If we are presented with the first <var>k</var> terms of a sequence
-  it is impossible to say with certainty the value of the next term, as there are
-  infinitely many polynomial functions that can model the sequence.</p>\r\n<p>As an
-  example, let us consider the sequence of cube numbers. This is defined by the generating
-  function, <br><var>u</var><sub><var>n</var></sub> = <var>n</var><sup>3</sup>: 1,
-  8, 27, 64, 125, 216, ...</p>\r\n<p>Suppose we were only given the first two terms
-  of this sequence. Working on the principle that \"simple is best\" we should assume
-  a linear relationship and predict the next term to be 15 (common difference 7).
-  Even if we were presented with the first three terms, by the same principle of simplicity,
-  a quadratic relationship should be assumed.</p>\r\n<p>We shall define OP(<var>k</var>,
-  <var>n</var>) to be the <var>n</var><sup>th</sup> term of the optimum polynomial
-  generating function for the first <var>k</var> terms of a sequence. It should be
-  clear that OP(<var>k</var>, <var>n</var>) will accurately generate the terms of
-  the sequence for <var>n</var> <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>k</var>, and potentially
-  the <i>first incorrect term</i> (FIT) will be OP(<var>k</var>, <var>k</var>+1);
-  in which case we shall call it a <i>bad OP</i> (BOP).</p>\r\n<p>As a basis, if we
-  were only given the first term of sequence, it would be most sensible to assume
-  constancy; that is, for <var>n</var> <img src=\"images/symbol_ge.gif\" width=\"10\"
-  height=\"12\" alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\"> 2, OP(1,
-  <var>n</var>) = <var>u</var><sub>1</sub>.</p>\r\n<p>Hence we obtain the following
-  OPs for the cubic sequence:</p>\r\n<div style=\"margin-left:50px;\">\r\n<table>\n<tr>\n<td>OP(1,
-  <var>n</var>) = 1</td>\r\n<td>1, <span style=\"color:red;\"><b>1</b></span>, 1,
-  1, ...</td>\r\n</tr>\n<tr>\n<td>OP(2, <var>n</var>) = 7<var>n</var><img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">6</td>\r\n<td>1,
-  8, <span style=\"color:red;\"><b>15</b></span>, ...</td>\r\n</tr>\n<tr>\n<td>OP(3,
-  <var>n</var>) = 6<var>n</var><sup>2</sup><img src=\"images/symbol_minus.gif\" width=\"9\"
-  height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">11<var>n</var>+6     </td>\r\n<td>1,
-  8, 27, <span style=\"color:red;\"><b>58</b></span>, ...</td>\r\n</tr>\n<tr>\n<td>OP(4,
-  <var>n</var>) = <var>n</var><sup>3</sup>\n</td>\r\n<td>1, 8, 27, 64, 125, ...</td>\r\n</tr>\n</table>\n</div>\r\n<p>Clearly
-  no BOPs exist for <var>k</var> <img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\"
-  alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\"> 4.</p>\r\n<p>By considering
-  the sum of FITs generated by the BOPs (indicated in <span style=\"color:red;\"><b>red</b></span>
-  above), we obtain 1 + 15 + 58 = 74.</p>\r\n<p>Consider the following tenth degree
-  polynomial generating function:</p>\r\n<p style=\"text-align:center;\"><var>u</var><sub><var>n</var></sub>
-  = 1 <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>n</var> + <var>n</var><sup>2</sup><img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var><sup>3</sup>
-  + <var>n</var><sup>4</sup><img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\"
-  alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var><sup>5</sup>
-  + <var>n</var><sup>6</sup><img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\"
-  alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var><sup>7</sup>
-  + <var>n</var><sup>8</sup><img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\"
-  alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var><sup>9</sup>
-  + <var>n</var><sup>10</sup></p>\r\n<p>Find the sum of FITs for the BOPs.</p>\r\n\r\n"
+:content: "If we are presented with the first <var>k</var> terms of a sequence it
+  is impossible to say with certainty the value of the next term, as there are infinitely
+  many polynomial functions that can model the sequence.\n\nAs an example, let us
+  consider the sequence of cube numbers. This is defined by the generating function,
+  \  \n<var>u</var><sub><var>n</var></sub> = <var>n</var><sup>3</sup>: 1, 8, 27, 64,
+  125, 216, ...\n\nSuppose we were only given the first two terms of this sequence.
+  Working on the principle that \"simple is best\" we should assume a linear relationship
+  and predict the next term to be 15 (common difference 7). Even if we were presented
+  with the first three terms, by the same principle of simplicity, a quadratic relationship
+  should be assumed.\n\nWe shall define OP(<var>k</var>, <var>n</var>) to be the <var>n</var><sup>th</sup>
+  term of the optimum polynomial generating function for the first <var>k</var> terms
+  of a sequence. It should be clear that OP(<var>k</var>, <var>n</var>) will accurately
+  generate the terms of the sequence for <var>n</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>k</var>, and potentially the _first incorrect term_ (FIT) will be OP(<var>k</var>,
+  <var>k</var>+1); in which case we shall call it a _bad OP_ (BOP).\n\nAs a basis,
+  if we were only given the first term of sequence, it would be most sensible to assume
+  constancy; that is, for <var>n</var> ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  2, OP(1, <var>n</var>) = <var>u</var><sub>1</sub>.\n\nHence we obtain the following
+  OPs for the cubic sequence:\n\n| OP(1, <var>n</var>) = 1 | 1, **1** , 1, 1, ...
+  |\n| OP(2, <var>n</var>) = 7<var>n</var> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)6
+  | 1, 8, **15** , ... |\n| OP(3, <var>n</var>) = 6<var>n</var><sup>2</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)11<var>n</var>+6     
+  | 1, 8, 27, **58** , ... |\n| OP(4, <var>n</var>) = <var>n</var><sup>3</sup> | 1,
+  8, 27, 64, 125, ... |\n\nClearly no BOPs exist for <var>k</var> ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  4.\n\nBy considering the sum of FITs generated by the BOPs (indicated in **red**
+  above), we obtain 1 + 15 + 58 = 74.\n\nConsider the following tenth degree polynomial
+  generating function:\n\n<var>u</var><sub><var>n</var></sub> = 1 ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  <var>n</var> + <var>n</var><sup>2</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  <var>n</var><sup>3</sup> + <var>n</var><sup>4</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  <var>n</var><sup>5</sup> + <var>n</var><sup>6</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  <var>n</var><sup>7</sup> + <var>n</var><sup>8</sup> ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  <var>n</var><sup>9</sup> + <var>n</var><sup>10</sup>\n\nFind the sum of FITs for
+  the BOPs.\n\n"

data/data/problems/102.yml

@@ -2,15 +2,14 @@
 :id: 102
 :name: Triangle containment
 :url: http://projecteuler.net/problem=102
-:content: "\r\n\n<p>Three distinct points are plotted at random on a Cartesian plane,
-  for which -1000 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"><i>x</i>, <i>y</i> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  1000, such that a triangle is formed.</p>\n<p>Consider the following two triangles:</p>\n<p
-  style=\"text-align:center;\">A(-340,495), B(-153,-910), C(835,-947)<br><br>\nX(-175,41),
-  Y(-421,-714), Z(574,-645)</p>\n<p>It can be verified that triangle ABC contains
-  the origin, whereas triangle XYZ does not.</p>\n<p>Using <a href=\"project/triangles.txt\">triangles.txt</a>
-  (right click and 'Save Link/Target As...'), a 27K text file containing the co-ordinates
-  of one thousand \"random\" triangles, find the number of triangles for which the
-  interior contains the origin.</p>\n<p class=\"info\">NOTE: The first two examples
-  in the file represent the triangles in the example given above.</p>\n\r\n"
+:content: "Three distinct points are plotted at random on a Cartesian plane, for which
+  -1000 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) _x_,
+  _y_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 1000,
+  such that a triangle is formed.\n\nConsider the following two triangles:\n\nA(-340,495),
+  B(-153,-910), C(835,-947)  \n  \n  \nX(-175,41), Y(-421,-714), Z(574,-645)\n\nIt
+  can be verified that triangle ABC contains the origin, whereas triangle XYZ does
+  not.\n\nUsing [triangles.txt](project/triangles.txt) (right click and 'Save Link/Target
+  As...'), a 27K text file containing the co-ordinates of one thousand \"random\"
+  triangles, find the number of triangles for which the interior contains the origin.\n\nNOTE:
+  The first two examples in the file represent the triangles in the example given
+  above.\n\n"

data/data/problems/103.yml

@@ -2,25 +2,21 @@
 :id: 103
 :name: 'Special subset sums: optimum'
 :url: http://projecteuler.net/problem=103
-:content: "\r\n<p>Let S(A) represent the sum of elements in set A of size <i>n</i>.
-  We shall call it a special sum set if for any two non-empty disjoint subsets, B
-  and C, the following properties are true:</p>\r\n<ol style=\"list-style-type:lower-roman;\">\n<li>S(B)
-  <img src=\"images/symbol_ne.gif\" width=\"11\" height=\"10\" alt=\"≠\" border=\"0\"
-  style=\"vertical-align:middle;\"> S(C); that is, sums of subsets cannot be equal.</li>\r\n<li>If
-  B contains more elements than C then S(B) <img src=\"images/symbol_gt.gif\" width=\"10\"
-  height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\"> S(C).</li>\r\n</ol>\n<p>If
-  S(A) is minimised for a given <i>n</i>, we shall call it an optimum special sum
-  set. The first five optimum special sum sets are given below.</p>\r\n<p style=\"margin-left:50px;\"><i>n</i>
-  = 1: {1}<br><i>n</i> = 2: {1, 2}<br><i>n</i> = 3: {2, 3, 4}<br><i>n</i> = 4: {3,
-  5, 6, 7}<br><i>n</i> = 5: {6, 9, 11, 12, 13}</p>\r\n<p>It <i>seems</i> that for
-  a given optimum set, A = {<i>a</i><sub>1</sub>, <i>a</i><sub>2</sub>, ... , <i>a</i><sub>n</sub>},
-  the next optimum set is of the form B = {<i>b</i>, <i>a</i><sub>1</sub>+<i>b</i>,
-  <i>a</i><sub>2</sub>+<i>b</i>, ... ,<i>a</i><sub>n</sub>+<i>b</i>}, where <i>b</i>
-  is the \"middle\" element on the previous row.</p>\r\n<p>By applying this \"rule\"
-  we would expect the optimum set for <i>n</i> = 6 to be A = {11, 17, 20, 22, 23,
-  24}, with S(A) = 117. However, this is not the optimum set, as we have merely applied
-  an algorithm to provide a near optimum set. The optimum set for <i>n</i> = 6 is
-  A = {11, 18, 19, 20, 22, 25}, with S(A) = 115 and corresponding set string: 111819202225.</p>\r\n<p>Given
-  that A is an optimum special sum set for <i>n</i> = 7, find its set string.</p>\r\n<p
-  class=\"note\">NOTE: This problem is related to <a href=\"problem=105\">Problem
-  105</a> and <a href=\"problem=106\">Problem 106</a>.</p>\r\n"
+:content: "Let S(A) represent the sum of elements in set A of size _n_. We shall call
+  it a special sum set if for any two non-empty disjoint subsets, B and C, the following
+  properties are true:\n\n1. S(B) ![≠](/home/will/src/euler-manager/config/../data/images/symbol_ne.gif)
+  S(C); that is, sums of subsets cannot be equal.\n2. If B contains more elements
+  than C then S(B) ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)
+  S(C).\n\nIf S(A) is minimised for a given _n_, we shall call it an optimum special
+  sum set. The first five optimum special sum sets are given below.\n\n_n_ = 1: {1}
+  \ \n_n_ = 2: {1, 2}  \n_n_ = 3: {2, 3, 4}  \n_n_ = 4: {3, 5, 6, 7}  \n_n_ = 5: {6,
+  9, 11, 12, 13}\n\nIt _seems_ that for a given optimum set, A = {_a_<sub>1</sub>,
+  _a_<sub>2</sub>, ... , _a_<sub>n</sub>}, the next optimum set is of the form B =
+  {_b_, _a_<sub>1</sub>+_b_, _a_<sub>2</sub>+_b_, ... ,_a_<sub>n</sub>+_b_}, where
+  _b_ is the \"middle\" element on the previous row.\n\nBy applying this \"rule\"
+  we would expect the optimum set for _n_ = 6 to be A = {11, 17, 20, 22, 23, 24},
+  with S(A) = 117. However, this is not the optimum set, as we have merely applied
+  an algorithm to provide a near optimum set. The optimum set for _n_ = 6 is A = {11,
+  18, 19, 20, 22, 25}, with S(A) = 115 and corresponding set string: 111819202225.\n\nGiven
+  that A is an optimum special sum set for _n_ = 7, find its set string.\n\nNOTE:
+  This problem is related to [Problem 105](problem=105) and [Problem 106](problem=106).\n\n"

data/data/problems/104.yml

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

data/data/problems/105.yml

@@ -2,20 +2,15 @@
 :id: 105
 :name: 'Special subset sums: testing'
 :url: http://projecteuler.net/problem=105
-:content: "\r\n<p>Let S(A) represent the sum of elements in set A of size <i>n</i>.
-  We shall call it a special sum set if for any two non-empty disjoint subsets, B
-  and C, the following properties are true:</p>\r\n<ol style=\"list-style-type:lower-roman;\">\n<li>S(B)
-  <img src=\"images/symbol_ne.gif\" width=\"11\" height=\"10\" alt=\"≠\" border=\"0\"
-  style=\"vertical-align:middle;\"> S(C); that is, sums of subsets cannot be equal.</li>\r\n<li>If
-  B contains more elements than C then S(B) <img src=\"images/symbol_gt.gif\" width=\"10\"
-  height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\"> S(C).</li>\r\n</ol>\n<p>For
-  example, {81, 88, 75, 42, 87, 84, 86, 65} is not a special sum set because 65 +
-  87 + 88 = 75 + 81 + 84, whereas {157, 150, 164, 119, 79, 159, 161, 139, 158} satisfies
-  both rules for all possible subset pair combinations and S(A) = 1286.</p>\r\n<p>Using
-  <a href=\"project/sets.txt\">sets.txt</a> (right click and \"Save Link/Target As...\"),
-  a 4K text file with one-hundred sets containing seven to twelve elements (the two
-  examples given above are the first two sets in the file), identify all the special
-  sum sets, A<sub>1</sub>, A<sub>2</sub>, ..., A<sub><i>k</i></sub>, and find the
-  value of S(A<sub>1</sub>) + S(A<sub>2</sub>) + ... + S(A<sub><i>k</i></sub>).</p>\r\n<p
-  class=\"note\">NOTE: This problem is related to <a href=\"problem=103\">Problem
-  103</a> and <a href=\"problem=106\">Problem 106</a>.</p>\r\n"
+:content: |+
+  Let S(A) represent the sum of elements in set A of size _n_. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the following properties are true:
+
+  1. S(B) ![≠](/home/will/src/euler-manager/config/../data/images/symbol_ne.gif) S(C); that is, sums of subsets cannot be equal.
+  2. If B contains more elements than C then S(B) ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif) S(C).
+
+  For example, {81, 88, 75, 42, 87, 84, 86, 65} is not a special sum set because 65 + 87 + 88 = 75 + 81 + 84, whereas {157, 150, 164, 119, 79, 159, 161, 139, 158} satisfies both rules for all possible subset pair combinations and S(A) = 1286.
+
+  Using [sets.txt](project/sets.txt) (right click and "Save Link/Target As..."), a 4K text file with one-hundred sets containing seven to twelve elements (the two examples given above are the first two sets in the file), identify all the special sum sets, A<sub>1</sub>, A<sub>2</sub>, ..., A<sub><i>k</i></sub>, and find the value of S(A<sub>1</sub>) + S(A<sub>2</sub>) + ... + S(A<sub><i>k</i></sub>).
+
+  NOTE: This problem is related to [Problem 103](problem=103) and [Problem 106](problem=106).
+

data/data/problems/106.yml

@@ -2,18 +2,17 @@
 :id: 106
 :name: 'Special subset sums: meta-testing'
 :url: http://projecteuler.net/problem=106
-:content: "\r\n<p>Let S(A) represent the sum of elements in set A of size <i>n</i>.
-  We shall call it a special sum set if for any two non-empty disjoint subsets, B
-  and C, the following properties are true:</p>\r\n<ol style=\"list-style-type:lower-roman;\">\n<li>S(B)
-  <img src=\"images/symbol_ne.gif\" width=\"11\" height=\"10\" alt=\"≠\" border=\"0\"
-  style=\"vertical-align:middle;\"> S(C); that is, sums of subsets cannot be equal.</li>\r\n<li>If
-  B contains more elements than C then S(B) <img src=\"images/symbol_gt.gif\" width=\"10\"
-  height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\"> S(C).</li>\r\n</ol>\n<p>For
-  this problem we shall assume that a given set contains <i>n</i> strictly increasing
-  elements and it already satisfies the second rule.</p>\r\n<p>Surprisingly, out of
-  the 25 possible subset pairs that can be obtained from a set for which <i>n</i>
-  = 4, only 1 of these pairs need to be tested for equality (first rule). Similarly,
-  when <i>n</i> = 7, only 70 out of the 966 subset pairs need to be tested.</p>\r\n<p>For
-  <i>n</i> = 12, how many of the 261625 subset pairs that can be obtained need to
-  be tested for equality?</p>\r\n<p class=\"note\">NOTE: This problem is related to
-  <a href=\"problem=103\">Problem 103</a> and <a href=\"problem=105\">Problem 105</a>.</p>\r\n"
+:content: |+
+  Let S(A) represent the sum of elements in set A of size _n_. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the following properties are true:
+
+  1. S(B) ![≠](/home/will/src/euler-manager/config/../data/images/symbol_ne.gif) S(C); that is, sums of subsets cannot be equal.
+  2. If B contains more elements than C then S(B) ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif) S(C).
+
+  For this problem we shall assume that a given set contains _n_ strictly increasing elements and it already satisfies the second rule.
+
+  Surprisingly, out of the 25 possible subset pairs that can be obtained from a set for which _n_ = 4, only 1 of these pairs need to be tested for equality (first rule). Similarly, when _n_ = 7, only 70 out of the 966 subset pairs need to be tested.
+
+  For _n_ = 12, how many of the 261625 subset pairs that can be obtained need to be tested for equality?
+
+  NOTE: This problem is related to [Problem 103](problem=103) and [Problem 105](problem=105).
+

data/data/problems/107.yml

@@ -2,19 +2,19 @@
 :id: 107
 :name: Minimal network
 :url: http://projecteuler.net/problem=107
-:content: "\r\n\n<p>The following undirected network consists of seven vertices and
-  twelve edges with a total weight of 243.</p>\n<div style=\"text-align:center;\">\n<img
-  src=\"project/images/p_107_1.gif\" width=\"381\" height=\"278\" alt=\"\"><br>\n</div>\n<p>The
-  same network can be represented by the matrix below.</p>\n<table cellpadding=\"5\"
-  cellspacing=\"0\" border=\"1\" align=\"center\">\n<tr>\n<td>    </td>\n<td><b>A</b></td>\n<td><b>B</b></td>\n<td><b>C</b></td>\n<td><b>D</b></td>\n<td><b>E</b></td>\n<td><b>F</b></td>\n<td><b>G</b></td>\n</tr>\n<tr>\n<td><b>A</b></td>\n<td>-</td>\n<td>16</td>\n<td>12</td>\n<td>21</td>\n<td>-</td>\n<td>-</td>\n<td>-</td>\n</tr>\n<tr>\n<td><b>B</b></td>\n<td>16</td>\n<td>-</td>\n<td>-</td>\n<td>17</td>\n<td>20</td>\n<td>-</td>\n<td>-</td>\n</tr>\n<tr>\n<td><b>C</b></td>\n<td>12</td>\n<td>-</td>\n<td>-</td>\n<td>28</td>\n<td>-</td>\n<td>31</td>\n<td>-</td>\n</tr>\n<tr>\n<td><b>D</b></td>\n<td>21</td>\n<td>17</td>\n<td>28</td>\n<td>-</td>\n<td>18</td>\n<td>19</td>\n<td>23</td>\n</tr>\n<tr>\n<td><b>E</b></td>\n<td>-</td>\n<td>20</td>\n<td>-</td>\n<td>18</td>\n<td>-</td>\n<td>-</td>\n<td>11</td>\n</tr>\n<tr>\n<td><b>F</b></td>\n<td>-</td>\n<td>-</td>\n<td>31</td>\n<td>19</td>\n<td>-</td>\n<td>-</td>\n<td>27</td>\n</tr>\n<tr>\n<td><b>G</b></td>\n<td>-</td>\n<td>-</td>\n<td>-</td>\n<td>23</td>\n<td>11</td>\n<td>27</td>\n<td>-</td>\n</tr>\n</table>\n<p>However,
-  it is possible to optimise the network by removing some edges and still ensure that
-  all points on the network remain connected. The network which achieves the maximum
-  saving is shown below. It has a weight of 93, representing a saving of 243 <img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"> 93 = 150 from the original network.</p>\n<div
-  style=\"text-align:center;\">\n<img src=\"project/images/p_107_2.gif\" width=\"385\"
-  height=\"288\" alt=\"\"><br>\n</div>\n<p>Using <a href=\"project/network.txt\">network.txt</a>
-  (right click and 'Save Link/Target As...'), a 6K text file containing a network
-  with forty vertices, and given in matrix form, find the maximum saving which can
-  be achieved by removing redundant edges whilst ensuring that the network remains
-  connected.</p>\n\r\n"
+:content: "The following undirected network consists of seven vertices and twelve
+  edges with a total weight of 243.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_107_1.gif)
+  \ \n\nThe same network can be represented by the matrix below.\n\n|      | **A**
+  | **B** | **C** | **D** | **E** | **F** | **G** |\n| **A** | - | 16 | 12 | 21 |
+  - | - | - |\n| **B** | 16 | - | - | 17 | 20 | - | - |\n| **C** | 12 | - | - | 28
+  | - | 31 | - |\n| **D** | 21 | 17 | 28 | - | 18 | 19 | 23 |\n| **E** | - | 20 |
+  - | 18 | - | - | 11 |\n| **F** | - | - | 31 | 19 | - | - | 27 |\n| **G** | - | -
+  | - | 23 | 11 | 27 | - |\n\nHowever, it is possible to optimise the network by removing
+  some edges and still ensure that all points on the network remain connected. The
+  network which achieves the maximum saving is shown below. It has a weight of 93,
+  representing a saving of 243 ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  93 = 150 from the original network.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_107_2.gif)
+  \ \n\nUsing [network.txt](project/network.txt) (right click and 'Save Link/Target
+  As...'), a 6K text file containing a network with forty vertices, and given in matrix
+  form, find the maximum saving which can be achieved by removing redundant edges
+  whilst ensuring that the network remains connected.\n\n"

data/data/problems/108.yml

@@ -2,31 +2,20 @@
 :id: 108
 :name: Diophantine reciprocals I
 :url: http://projecteuler.net/problem=108
-:content: "\r\n<p>In the following equation <var>x</var>, <var>y</var>, and <var>n</var>
-  are positive integers.</p>\r\n<div style=\"text-align:center;\">\r\n<table align=\"center\"><tr>\n<td><div
-  style=\"text-align:center;\">1<br><img src=\"images/blackdot.gif\" width=\"15\"
-  height=\"1\" alt=\"\"><br><var>x</var>\n</div></td>\r\n<td> + </td>\r\n<td><div
-  style=\"text-align:center;\">1<br><img src=\"images/blackdot.gif\" width=\"15\"
-  height=\"1\" alt=\"\"><br><var>y</var>\n</div></td>\r\n<td> = </td>\r\n<td><div
-  style=\"text-align:center;\">1<br><img src=\"images/blackdot.gif\" width=\"15\"
-  height=\"1\" alt=\"\"><br><var>n</var>\n</div></td>\r\n</tr></table>\n</div>\r\n<p>For
-  <var>n</var> = 4 there are exactly three distinct solutions:</p>\r\n<div style=\"text-align:center;\">\r\n<table
-  align=\"center\">\n<tr>\n<td><div style=\"text-align:center;\">1<br><img src=\"images/blackdot.gif\"
-  width=\"15\" height=\"1\" alt=\"\"><br> 5</div></td>\r\n<td> + </td>\r\n<td><div
-  style=\"text-align:center;\">1<br><img src=\"images/blackdot.gif\" width=\"15\"
-  height=\"1\" alt=\"\"><br> 20</div></td>\r\n<td> = </td>\r\n<td><div style=\"text-align:center;\">1<br><img
-  src=\"images/blackdot.gif\" width=\"15\" height=\"1\" alt=\"\"><br> 4</div></td>\r\n</tr>\n<tr>\n<td><div
-  style=\"text-align:center;\">1<br><img src=\"images/blackdot.gif\" width=\"15\"
-  height=\"1\" alt=\"\"><br> 6</div></td>\r\n<td> + </td>\r\n<td><div style=\"text-align:center;\">1<br><img
-  src=\"images/blackdot.gif\" width=\"15\" height=\"1\" alt=\"\"><br> 12</div></td>\r\n<td>
-  = </td>\r\n<td><div style=\"text-align:center;\">1<br><img src=\"images/blackdot.gif\"
-  width=\"15\" height=\"1\" alt=\"\"><br> 4</div></td>\r\n</tr>\n<tr>\n<td><div style=\"text-align:center;\">1<br><img
-  src=\"images/blackdot.gif\" width=\"15\" height=\"1\" alt=\"\"><br> 8</div></td>\r\n<td>
-  + </td>\r\n<td><div style=\"text-align:center;\">1<br><img src=\"images/blackdot.gif\"
-  width=\"15\" height=\"1\" alt=\"\"><br> 8</div></td>\r\n<td> = </td>\r\n<td><div
-  style=\"text-align:center;\">1<br><img src=\"images/blackdot.gif\" width=\"15\"
-  height=\"1\" alt=\"\"><br> 4</div></td>\r\n</tr>\n</table>\n</div>\r\n<p>What is
-  the least value of <var>n</var> for which the number of distinct solutions exceeds
-  one-thousand?</p>\r\n<p class=\"note\">NOTE: This problem is an easier version of
-  <a href=\"problem=110\">Problem 110</a>; it is strongly advised that you solve this
-  one first.</p>\r\n"
+:content: "In the following equation <var>x</var>, <var>y</var>, and <var>n</var>
+  are positive integers.\n\n| \n1  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n <var>x</var>\n | + | \n1  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n <var>y</var>\n | = | \n1  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n <var>n</var>\n |\n\nFor <var>n</var> = 4 there are exactly three distinct solutions:\n\n|
+  \n1  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)  \n
+  5\n | + | \n1  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n 20\n | = | \n1  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n 4\n |\n| \n1  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n 6\n | + | \n1  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n 12\n | = | \n1  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n 4\n |\n| \n1  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n 8\n | + | \n1  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n 8\n | = | \n1  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n 4\n |\n\nWhat is the least value of <var>n</var> for which the number of distinct
+  solutions exceeds one-thousand?\n\nNOTE: This problem is an easier version of [Problem
+  110](problem=110); it is strongly advised that you solve this one first.\n\n"

data/data/problems/109.yml

@@ -2,32 +2,30 @@
 :id: 109
 :name: Darts
 :url: http://projecteuler.net/problem=109
-:content: "\r\n<p>In the game of darts a player throws three darts at a target board
-  which is split into twenty equal sized sections numbered one to twenty.</p>\r\n<div
-  style=\"text-align:center;\">\r\n<img src=\"project/images/p_109.gif\" width=\"400\"
-  height=\"400\" alt=\"\"><br>\n</div>\r\n<p>The score of a dart is determined by
-  the number of the region that the dart lands in. A dart landing outside the red/green
-  outer ring scores zero. The black and cream regions inside this ring represent single
-  scores. However, the red/green outer ring and middle ring score double and treble
-  scores respectively.</p>\r\n<p>At the centre of the board are two concentric circles
-  called the bull region, or bulls-eye. The outer bull is worth 25 points and the
-  inner bull is a double, worth 50 points.</p>\r\n<p>There are many variations of
-  rules but in the most popular game the players will begin with a score 301 or 501
-  and the first player to reduce their running total to zero is a winner. However,
-  it is normal to play a \"doubles out\" system, which means that the player must
-  land a double (including the double bulls-eye at the centre of the board) on their
-  final dart to win; any other dart that would reduce their running total to one or
-  lower means the score for that set of three darts is \"bust\".</p>\r\n<p>When a
-  player is able to finish  on their current score it is called a \"checkout\" and
-  the highest checkout is 170: T20 T20 D25 (two treble 20s and double bull).</p>\r\n<p>There
-  are exactly eleven distinct ways to checkout on a score of 6:</p>\r\n<div style=\"text-align:center;\">\r\n<table
-  border=\"1\" cellpadding=\"3\" cellspacing=\"0\" align=\"center\">\n<tr>\n<td>\n<img
-  src=\"images/spacer.gif\" width=\"80\" height=\"1\" alt=\"\"><br>D3</td>\r\n<td>\n<img
-  src=\"images/spacer.gif\" width=\"80\" height=\"1\" alt=\"\"><br> </td>\r\n<td>\n<img
-  src=\"images/spacer.gif\" width=\"80\" height=\"1\" alt=\"\"><br> </td>\r\n</tr>\n<tr>\n<td>D1</td>\r\n<td>D2</td>\r\n<td> </td>\r\n</tr>\n<tr>\n<td>S2</td>\r\n<td>D2</td>\r\n<td> </td>\r\n</tr>\n<tr>\n<td>D2</td>\r\n<td>D1</td>\r\n<td> </td>\r\n</tr>\n<tr>\n<td>S4</td>\r\n<td>D1</td>\r\n<td> </td>\r\n</tr>\n<tr>\n<td>S1</td>\r\n<td>S1</td>\r\n<td>D2</td>\r\n</tr>\n<tr>\n<td>S1</td>\r\n<td>T1</td>\r\n<td>D1</td>\r\n</tr>\n<tr>\n<td>S1</td>\r\n<td>S3</td>\r\n<td>D1</td>\r\n</tr>\n<tr>\n<td>D1</td>\r\n<td>D1</td>\r\n<td>D1</td>\r\n</tr>\n<tr>\n<td>D1</td>\r\n<td>S2</td>\r\n<td>D1</td>\r\n</tr>\n<tr>\n<td>S2</td>\r\n<td>S2</td>\r\n<td>D1</td>\r\n</tr>\n</table>\n</div>\r\n<p>Note
-  that D1 D2 is considered <b>different</b> to D2 D1 as they finish on different doubles.
-  However, the combination S1 T1 D1 is considered the <b>same</b> as T1 S1 D1.</p>\r\n<p>In
-  addition we shall not include misses in considering combinations; for example, D3
-  is the <b>same</b> as 0 D3 and 0 0 D3.</p>\r\n<p>Incredibly there are 42336 distinct
-  ways of checking out in total.</p>\r\n<p>How many distinct ways can a player checkout
-  with a score less than 100?</p>\r\n\r\n"
+:content: "In the game of darts a player throws three darts at a target board which
+  is split into twenty equal sized sections numbered one to twenty.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_109.gif)
+  \ \n\nThe score of a dart is determined by the number of the region that the dart
+  lands in. A dart landing outside the red/green outer ring scores zero. The black
+  and cream regions inside this ring represent single scores. However, the red/green
+  outer ring and middle ring score double and treble scores respectively.\n\nAt the
+  centre of the board are two concentric circles called the bull region, or bulls-eye.
+  The outer bull is worth 25 points and the inner bull is a double, worth 50 points.\n\nThere
+  are many variations of rules but in the most popular game the players will begin
+  with a score 301 or 501 and the first player to reduce their running total to zero
+  is a winner. However, it is normal to play a \"doubles out\" system, which means
+  that the player must land a double (including the double bulls-eye at the centre
+  of the board) on their final dart to win; any other dart that would reduce their
+  running total to one or lower means the score for that set of three darts is \"bust\".\n\nWhen
+  a player is able to finish on their current score it is called a \"checkout\" and
+  the highest checkout is 170: T20 T20 D25 (two treble 20s and double bull).\n\nThere
+  are exactly eleven distinct ways to checkout on a score of 6:\n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  \ \nD3 | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)  \n 
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)  \n  |\n| D1
+  | D2 |   |\n| S2 | D2 |   |\n| D2 | D1 |   |\n| S4 | D1 |   |\n| S1 | S1 | D2 |\n|
+  S1 | T1 | D1 |\n| S1 | S3 | D1 |\n| D1 | D1 | D1 |\n| D1 | S2 | D1 |\n| S2 | S2
+  | D1 |\n\nNote that D1 D2 is considered **different** to D2 D1 as they finish on
+  different doubles. However, the combination S1 T1 D1 is considered the **same**
+  as T1 S1 D1.\n\nIn addition we shall not include misses in considering combinations;
+  for example, D3 is the **same** as 0 D3 and 0 0 D3.\n\nIncredibly there are 42336
+  distinct ways of checking out in total.\n\nHow many distinct ways can a player checkout
+  with a score less than 100?\n\n"

data/data/problems/11.yml

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