euler-manager 0.0.5 → 0.0.6

data/data/problems/186.yml

@@ -2,27 +2,19 @@
 :id: 186
 :name: Connectedness of a network
 :url: http://projecteuler.net/problem=186
-:content: "\r\n<p>Here are the records from a busy telephone system with one million
-  users:</p>\r\n<div style=\"text-align:center;\">\r\n<table cellspacing=\"0\" cellpadding=\"2\"
-  border=\"1\" align=\"center\">\n<tr style=\"background-color:#c1daf9;\">\n<td>RecNr</td>\n<td
-  width=\"60\" align=\"center\">Caller</td>\n<td width=\"60\" align=\"center\">Called</td>\n</tr>\n<tr>\n<td
-  align=\"center\">1</td>\n<td align=\"center\">200007</td>\n<td align=\"center\">100053</td>\n</tr>\n<tr>\n<td
-  align=\"center\">2</td>\n<td align=\"center\">600183</td>\n<td align=\"center\">500439</td>\n</tr>\n<tr>\n<td
-  align=\"center\">3</td>\n<td align=\"center\">600863</td>\n<td align=\"center\">701497</td>\n</tr>\n<tr>\n<td
-  align=\"center\">...</td>\n<td align=\"center\">...</td>\n<td align=\"center\">...</td>\n</tr>\n</table>\n</div>\r\n<p>The
-  telephone number of the caller and the called number in record n are Caller(n) =
-  S<sub>2n-1</sub> and Called(n) = S<sub>2n</sub> where S<sub>1,2,3,...</sub> come
-  from the \"Lagged Fibonacci Generator\":</p>\r\n\r\n<p>For 1 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  k <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 55, S<sub>k</sub> = [100003 - 200003k + 300007k<sup>3</sup>]
-  (modulo 1000000)<br>\r\nFor 56 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> k, S<sub>k</sub> = [S<sub>k-24</sub>
-  + S<sub>k-55</sub>] (modulo 1000000)</p>\r\n\r\n<p>If Caller(n) = Called(n) then
-  the user is assumed to have misdialled and the call fails; otherwise the call is
-  successful.</p>\r\n\r\n<p>From the start of the records, we say that any pair of
-  users X and Y are friends if X calls Y or vice-versa. Similarly, X is a friend of
-  a friend of Z if X is a friend of Y and Y is a friend of Z; and so on for longer
-  chains.</p>\r\n\r\n<p>The Prime Minister's phone number is 524287. After how many
-  successful calls, not counting misdials, will 99% of the users (including the PM)
-  be a friend, or a friend of a friend etc., of the Prime Minister?</p>\r\n\r\n"
+:content: "Here are the records from a busy telephone system with one million users:\n\n|
+  RecNr | Caller | Called |\n| 1 | 200007 | 100053 |\n| 2 | 600183 | 500439 |\n| 3
+  | 600863 | 701497 |\n| ... | ... | ... |\n\nThe telephone number of the caller and
+  the called number in record n are Caller(n) = S<sub>2n-1</sub> and Called(n) = S<sub>2n</sub>
+  where S<sub>1,2,3,...</sub> come from the \"Lagged Fibonacci Generator\":\n\nFor
+  1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) k ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  55, S<sub>k</sub> = [100003 - 200003k + 300007k<sup>3</sup>] (modulo 1000000)  \n\rFor
+  56 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) k, S<sub>k</sub>
+  = [S<sub>k-24</sub> + S<sub>k-55</sub>] (modulo 1000000)\n\nIf Caller(n) = Called(n)
+  then the user is assumed to have misdialled and the call fails; otherwise the call
+  is successful.\n\nFrom the start of the records, we say that any pair of users X
+  and Y are friends if X calls Y or vice-versa. Similarly, X is a friend of a friend
+  of Z if X is a friend of Y and Y is a friend of Z; and so on for longer chains.\n\nThe
+  Prime Minister's phone number is 524287. After how many successful calls, not counting
+  misdials, will 99% of the users (including the PM) be a friend, or a friend of a
+  friend etc., of the Prime Minister?\n\n"

data/data/problems/187.yml

@@ -2,15 +2,12 @@
 :id: 187
 :name: Semiprimes
 :url: http://projecteuler.net/problem=187
-:content: "\r\n<p>A composite is a number containing at least two prime factors. For
-  example, 15 = 3 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\"
-  border=\"0\" style=\"vertical-align:middle;\"> 5; 9 = 3 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  3; 12 = 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;\">
-  3.</p>\r\n\r\n<p>There are ten composites below thirty containing precisely two,
-  not necessarily distinct, prime factors:\r\n4, 6, 9, 10, 14, 15, 21, 22, 25, 26.</p>\r\n\r\n<p>How
-  many composite integers, <var>n</var> <img src=\"images/symbol_lt.gif\" width=\"10\"
-  height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"> 10<sup>8</sup>,
-  have precisely two, not necessarily distinct, prime factors?</p>\r\n"
+:content: "A composite is a number containing at least two prime factors. For example,
+  15 = 3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  5; 9 = 3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  3; 12 = 2 ![×](/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\nThere
+  are ten composites below thirty containing precisely two, not necessarily distinct,
+  prime factors:\r4, 6, 9, 10, 14, 15, 21, 22, 25, 26.\n\nHow many composite integers,
+  <var>n</var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  10<sup>8</sup>, have precisely two, not necessarily distinct, prime factors?\n\n"

data/data/problems/188.yml

@@ -2,9 +2,8 @@
 :id: 188
 :name: The hyperexponentiation of a number
 :url: http://projecteuler.net/problem=188
-:content: "\r\n<p>The <span style=\"font-style: italic\">hyperexponentiation</span>
-  or <span style=\"font-style: italic\">tetration</span> of a number a by a positive
-  integer b, denoted by a↑↑b or <sup>b</sup>a, is recursively defined by:<br><br>\r\na↑↑1
-  = a,<br>\r\na↑↑(k+1) = a<sup>(a↑↑k)</sup>.</p>\r\n<p>\r\nThus we have e.g. 3↑↑2
-  = 3<sup>3</sup> = 27, hence 3↑↑3 = 3<sup>27</sup> = 7625597484987 and 3↑↑4 is roughly
-  10<sup>3.6383346400240996*10^12</sup>.</p>\r\n<p>Find the last 8 digits of 1777↑↑1855.</p>\r\n"
+:content: "The hyperexponentiation or tetration of a number a by a positive integer
+  b, denoted by a↑↑b or <sup>b</sup>a, is recursively defined by:  \n  \n  \n\ra↑↑1
+  = a,  \n\ra↑↑(k+1) = a<sup>(a↑↑k)</sup>.\n\nThus we have e.g. 3↑↑2 = 3<sup>3</sup>
+  = 27, hence 3↑↑3 = 3<sup>27</sup> = 7625597484987 and 3↑↑4 is roughly 10<sup>3.6383346400240996*10^12</sup>.\n\nFind
+  the last 8 digits of 1777↑↑1855.\n\n"

data/data/problems/189.yml

@@ -2,14 +2,12 @@
 :id: 189
 :name: Tri-colouring a triangular grid
 :url: http://projecteuler.net/problem=189
-:content: "\r\n<p>Consider the following configuration of 64 triangles:</p>\r\n\r\n<div
-  style=\"text-align:center;\"><img src=\"project/images/p_189_grid.gif\" alt=\"\"></div>\r\n\r\n<p>We
+:content: "Consider the following configuration of 64 triangles:\n\n ![](/home/will/src/euler-manager/config/../data/images/p_189_grid.gif)\n\nWe
   wish to colour the interior of each triangle with one of three colours: red, green
   or blue, so that no two neighbouring triangles have the same colour. Such a colouring
   shall be called valid. Here, two triangles are said to be neighbouring if they share
-  an edge.<br>\r\nNote: if they only share a vertex, then they are not neighbours.</p>
-  \r\n\r\n<p>For example, here is a valid colouring of the above grid:</p>\r\n<div
-  style=\"text-align:center;\"><img src=\"project/images/p_189_colours.gif\" alt=\"\"></div>\r\n\r\n<p>A
+  an edge.  \n\rNote: if they only share a vertex, then they are not neighbours.\n\nFor
+  example, here is a valid colouring of the above grid:\n\n ![](/home/will/src/euler-manager/config/../data/images/p_189_colours.gif)\n\nA
   colouring C' which is obtained from a colouring C by rotation or reflection is considered
-  <i>distinct</i> from C unless the two are identical.</p>\r\n\r\n<p>How many distinct
-  valid colourings are there for the above configuration?</p>\r\n\r\n"
+  _distinct_ from C unless the two are identical.\n\nHow many distinct valid colourings
+  are there for the above configuration?\n\n"

data/data/problems/19.yml

@@ -2,11 +2,10 @@
 :id: 19
 :name: Counting Sundays
 :url: http://projecteuler.net/problem=19
-:content: "\r\n\n<p>You are given the following information, but you may prefer to
-  do some research for yourself.</p>\n<ul>\n<li>1 Jan 1900 was a Monday.</li>\n<li>Thirty
-  days has September,<br>\nApril, June and November.<br>\nAll the rest have thirty-one,<br>\nSaving
-  February alone,<br>\nWhich has twenty-eight, rain or shine.<br>\nAnd on leap years,
-  twenty-nine.</li>\n<li>A leap year occurs on any year evenly divisible by 4, but
-  not on a century unless it is divisible by 400.</li>\n</ul>\n<p>How many Sundays
-  fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec
-  2000)?</p>\n\r\n"
+:content: "You are given the following information, but you may prefer to do some
+  research for yourself.\n\n- 1 Jan 1900 was a Monday.\n- Thirty days has September,
+  \ \nApril, June and November.  \nAll the rest have thirty-one,  \nSaving February
+  alone,  \nWhich has twenty-eight, rain or shine.  \nAnd on leap years, twenty-nine.\n-
+  A leap year occurs on any year evenly divisible by 4, but not on a century unless
+  it is divisible by 400.\n\nHow many Sundays fell on the first of the month during
+  the twentieth century (1 Jan 1901 to 31 Dec 2000)?\n\n"

data/data/problems/190.yml

@@ -2,12 +2,10 @@
 :id: 190
 :name: Maximising a weighted product
 :url: http://projecteuler.net/problem=190
-:content: "\r\n<p>Let S<sub>m</sub> = (x<sub>1</sub>, x<sub>2</sub>, ... , x<sub>m</sub>)
-  be the m-tuple of positive real numbers with x<sub>1</sub> + x<sub>2</sub> + ...
-  + x<sub>m</sub> = m for which P<sub>m</sub> = x<sub>1</sub> * x<sub>2</sub><sup>2</sup>
-  * ... * x<sub>m</sub><sup>m</sup> is maximised.</p>\r\n\r\n<p>For example, it can
-  be verified that [P<sub>10</sub>] = 4112 ([ ] is the integer part function).</p>\r\n\r\n<p>Find
-  Σ[P<sub>m</sub>] for 2 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> m <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  15.</p>\r\n"
+:content: |+
+  Let S<sub>m</sub> = (x<sub>1</sub>, x<sub>2</sub>, ... , x<sub>m</sub>) be the m-tuple of positive real numbers with x<sub>1</sub> + x<sub>2</sub> + ... + x<sub>m</sub> = m for which P<sub>m</sub> = x<sub>1</sub> \* x<sub>2</sub><sup>2</sup> \* ... \* x<sub>m</sub><sup>m</sup> is maximised.
+
+  For example, it can be verified that [P<sub>10</sub>] = 4112 ([] is the integer part function).
+
+  Find Σ[P<sub>m</sub>] for 2 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) m ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 15.
+

data/data/problems/191.yml

@@ -2,14 +2,13 @@
 :id: 191
 :name: Prize Strings
 :url: http://projecteuler.net/problem=191
-:content: "\r\n<p>A particular school offers cash rewards to children with good attendance
+:content: "A particular school offers cash rewards to children with good attendance
   and punctuality. If they are absent for three consecutive days or late on more than
-  one occasion then they forfeit their prize.</p>\r\n\r\n<p>During an n-day period
-  a trinary string is formed for each child consisting of L's (late), O's (on time),
-  and A's (absent).</p>\r\n\r\n<p>Although there are eighty-one trinary strings for
-  a 4-day period that can be formed, exactly forty-three strings would lead to a prize:</p>\r\n\r\n<p
-  style=\"margin-left:50px;font-family:'Courier New',monospace;\">OOOO OOOA OOOL OOAO
-  OOAA OOAL OOLO OOLA OAOO OAOA<br>\r\nOAOL OAAO OAAL OALO OALA OLOO OLOA OLAO OLAA
-  AOOO<br>\r\nAOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL<br>\r\nAALO AALA ALOO
-  ALOA ALAO ALAA LOOO LOOA LOAO LOAA<br>\r\nLAOO LAOA LAAO</p>\r\n\r\n<p>How many
-  \"prize\" strings exist over a 30-day period?</p>\r\n"
+  one occasion then they forfeit their prize.\n\nDuring an n-day period a trinary
+  string is formed for each child consisting of L's (late), O's (on time), and A's
+  (absent).\n\nAlthough there are eighty-one trinary strings for a 4-day period that
+  can be formed, exactly forty-three strings would lead to a prize:\n\nOOOO OOOA OOOL
+  OOAO OOAA OOAL OOLO OOLA OAOO OAOA  \n\rOAOL OAAO OAAL OALO OALA OLOO OLOA OLAO
+  OLAA AOOO  \n\rAOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL  \n\rAALO AALA
+  ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA  \n\rLAOO LAOA LAAO\n\nHow many \"prize\"
+  strings exist over a 30-day period?\n\n"

data/data/problems/192.yml

@@ -2,26 +2,18 @@
 :id: 192
 :name: Best Approximations
 :url: http://projecteuler.net/problem=192
-:content: "\r\n<p>Let <var>x</var> be a real number.<br>\r\nA <i>best approximation</i>
-  to <var>x</var> for the <i>denominator bound</i> <var>d</var> is a rational number
-  <var>r</var>/<var>s</var> <i>in reduced form</i>, with <var>s</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>d</var>,
-  such that any rational number which is closer to <var>x</var> than <var>r</var>/<var>s</var>
-  has a denominator larger than <var>d</var>:</p>\r\n\r\n<div style=\"text-align:center;\">|<var>p</var>/<var>q</var>-<var>x</var>|
-  <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> |<var>r</var>/<var>s</var>-<var>x</var>| <img
-  src=\"images/symbol_implies.gif\" width=\"15\" height=\"11\" alt=\"⇒\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>q</var> <img src=\"images/symbol_gt.gif\"
-  width=\"10\" height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\"><var>d</var>\n</div>\r\n\r\n<p>For
-  example, the best approximation to <img src=\"images/symbol_radic.gif\" width=\"14\"
-  height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">13 for the
-  denominator bound 20 is 18/5 and the best approximation to <img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">13
-  for the denominator bound 30 is 101/28.</p>\r\n\r\n<p>Find the sum of all denominators
-  of the best approximations to <img src=\"images/symbol_radic.gif\" width=\"14\"
-  height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>
+:content: "Let <var>x</var> be a real number.  \n\rA _best approximation_ to <var>x</var>
+  for the _denominator bound_ <var>d</var> is a rational number <var>r</var>/<var>s</var>
+  _in reduced form_, with <var>s</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>d</var>, such that any rational number which is closer to <var>x</var> than
+  <var>r</var>/<var>s</var> has a denominator larger than <var>d</var>:\n\n|<var>p</var>/<var>q</var>-<var>x</var>|
+  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) |<var>r</var>/<var>s</var>-<var>x</var>|
+  ![⇒](/home/will/src/euler-manager/config/../data/images/symbol_implies.gif) <var>q</var>
+  ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif) <var>d</var>\n\nFor
+  example, the best approximation to ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)13
+  for the denominator bound 20 is 18/5 and the best approximation to ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)13
+  for the denominator bound 30 is 101/28.\n\nFind the sum of all denominators of the
+  best approximations to ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)<var>n</var>
   for the denominator bound 10<sup>12</sup>, where <var>n</var> is not a perfect square
-  and 1 <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>n</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  100000.</p>\r\n"
+  and 1 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) <var>n</var>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 100000.\n\n"

data/data/problems/193.yml

@@ -2,6 +2,8 @@
 :id: 193
 :name: Squarefree Numbers
 :url: http://projecteuler.net/problem=193
-:content: "\r\n<p>A positive integer <var>n</var> is called squarefree, if no square
-  of a prime divides <var>n</var>, thus 1, 2, 3, 5, 6, 7, 10, 11 are squarefree, but
-  not 4, 8, 9, 12.</p>\r\n\r\n<p>How many squarefree numbers are there below 2<sup>50</sup>?</p>\r\n\r\n"
+:content: |+
+  A positive integer <var>n</var> is called squarefree, if no square of a prime divides <var>n</var>, thus 1, 2, 3, 5, 6, 7, 10, 11 are squarefree, but not 4, 8, 9, 12.
+
+  How many squarefree numbers are there below 2<sup>50</sup>?
+

data/data/problems/194.yml

@@ -2,17 +2,14 @@
 :id: 194
 :name: Coloured Configurations
 :url: http://projecteuler.net/problem=194
-:content: "\r\n<p>Consider graphs built with the units A: <img src=\"project/images/p_194_GraphA.png\"
-  style=\"vertical-align:middle;\" alt=\"\">\r\nand B: <img src=\"project/images/p_194_GraphB.png\"
-  style=\"vertical-align:middle;\" alt=\"\">, where the units are glued along\r\nthe
-  vertical edges as in the graph <img src=\"project/images/p_194_Fig.png\" style=\"vertical-align:middle;\"
-  alt=\"\">.</p>\r\n\r\n<p>A configuration of type (<var>a</var>,<var>b</var>,<var>c</var>)
-  is a graph thus built of <var>a</var> units A and <var>b</var> units B, where the
-  graph's vertices are coloured using up to <var>c</var> colours, so that no two adjacent
-  vertices have the same colour.<br>\r\nThe compound graph above is an example of
-  a configuration of type (2,2,6), in fact of type (2,2,<var>c</var>) for all <var>c</var>
-  <img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\" border=\"0\"
-  style=\"vertical-align:middle;\"> 4.</p>\r\n\r\n<p>Let N(<var>a</var>,<var>b</var>,<var>c</var>)
-  be the number of configurations of type (<var>a</var>,<var>b</var>,<var>c</var>).<br>\r\nFor
-  example, N(1,0,3) = 24, N(0,2,4) = 92928 and N(2,2,3) = 20736.</p>\r\n\r\n<p>Find
-  the last 8 digits of N(25,75,1984).</p>\r\n"
+:content: "Consider graphs built with the units A: ![](/home/will/src/euler-manager/config/../data/images/p_194_GraphA.png)\rand
+  B: ![](/home/will/src/euler-manager/config/../data/images/p_194_GraphB.png), where
+  the units are glued along\rthe vertical edges as in the graph ![](/home/will/src/euler-manager/config/../data/images/p_194_Fig.png).\n\nA
+  configuration of type (<var>a</var>,<var>b</var>,<var>c</var>) is a graph thus built
+  of <var>a</var> units A and <var>b</var> units B, where the graph's vertices are
+  coloured using up to <var>c</var> colours, so that no two adjacent vertices have
+  the same colour.  \n\rThe compound graph above is an example of a configuration
+  of type (2,2,6), in fact of type (2,2,<var>c</var>) for all <var>c</var> ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  4.\n\nLet N(<var>a</var>,<var>b</var>,<var>c</var>) be the number of configurations
+  of type (<var>a</var>,<var>b</var>,<var>c</var>).  \n\rFor example, N(1,0,3) = 24,
+  N(0,2,4) = 92928 and N(2,2,3) = 20736.\n\nFind the last 8 digits of N(25,75,1984).\n\n"

data/data/problems/195.yml

@@ -2,12 +2,10 @@
 :id: 195
 :name: Inscribed circles of triangles with one angle of 60 degrees
 :url: http://projecteuler.net/problem=195
-:content: "\r\n<p>Let's call an integer sided triangle with exactly one angle of 60
-  degrees a 60-degree triangle.<br>\r\nLet <var>r</var> be the radius of the inscribed
-  circle of such a 60-degree triangle.</p>\r\n<p>There are 1234 60-degree triangles
-  for which <var>r</var> <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 100.\r\n<br>Let T(<var>n</var>)
-  be the number of 60-degree triangles for which <var>r</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>,
-  so<br>\r\n T(100) = 1234,  T(1000) = 22767, and  T(10000) = 359912.</p>\r\n\r\n<p>Find
-  T(1053779).</p>\r\n\r\n"
+:content: "Let's call an integer sided triangle with exactly one angle of 60 degrees
+  a 60-degree triangle.  \n\rLet <var>r</var> be the radius of the inscribed circle
+  of such a 60-degree triangle.\n\nThere are 1234 60-degree triangles for which <var>r</var>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 100.\r  \nLet
+  T(<var>n</var>) be the number of 60-degree triangles for which <var>r</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>n</var>, so  \n\r T(100) = 1234,  T(1000) = 22767, and  T(10000) = 359912.\n\nFind
+  T(1053779).\n\n"

data/data/problems/196.yml

@@ -2,24 +2,16 @@
 :id: 196
 :name: Prime triplets
 :url: http://projecteuler.net/problem=196
-:content: "\r\n<p>Build a triangle from all positive integers in the following way:</p>\r\n\r\n<p
-  style=\"font-family:courier new,monospace;font-weight:bold;margin-left:50px;\"> 1<br>\r\n <span
-  style=\"color:red;\">2</span>  <span style=\"color:red;\">3</span><br>\r\n 4  <span
-  style=\"color:red;\">5</span>  6<br>\r\n <span style=\"color:red;\">7</span>  8  9
-  10<br><span style=\"color:red;\">11</span> 12 <span style=\"color:red;\">13</span>
-  14 15<br>\r\n16 <span style=\"color:red;\">17</span> 18 <span style=\"color:red;\">19</span>
-  20 21<br>\r\n22 <span style=\"color:red;\">23</span> 24 25 26 27 28<br><span style=\"color:red;\">29</span>
-  30 <span style=\"color:red;\">31</span> 32 33 34 35 36<br><span style=\"color:red;\">37</span>
-  38 39 40 <span style=\"color:red;\">41</span> 42 <span style=\"color:red;\">43</span>
-  44 45<br>\r\n46 <span style=\"color:red;\">47</span> 48 49 50 51 52 <span style=\"color:red;\">53</span>
-  54 55<br>\r\n56 57 58 <span style=\"color:red;\">59</span> 60 <span style=\"color:red;\">61</span>
-  62 63 64 65 66<br>\r\n. . .</p>\r\n\r\n<p>Each positive integer has up to eight
-  neighbours in the triangle.</p>\r\n\r\n<p>A set of three primes is called a <i>prime
-  triplet</i> if one of the three primes has the other two as neighbours in the triangle.</p>\r\n\r\n<p>For
-  example, in the second row, the prime numbers 2 and 3 are elements of some prime
-  triplet.</p>\r\n\r\n<p>If row 8 is considered, it contains two primes which are
-  elements of some prime triplet, i.e. 29 and 31.<br>\r\nIf row 9 is considered, it
-  contains only one prime which is an element of some prime triplet: 37.</p>\r\n\r\n<p>Define
-  S(<var>n</var>) as the sum of the primes in row <var>n</var> which are elements
-  of any prime triplet.<br>\r\nThen S(8)=60 and S(9)=37.</p>\r\n\r\n<p>You are given
-  that S(10000)=950007619.</p>\r\n\r\n<p>Find  S(5678027) + S(7208785).</p>\r\n\r\n"
+:content: "Build a triangle from all positive integers in the following way:\n\n 1
+  \ \n\r 2  3  \n\r 4  5  6  \n\r 7  8  9 10  \n11 12 13 14 15  \n\r16 17 18 19 20
+  21  \n\r22 23 24 25 26 27 28  \n29 30 31 32 33 34 35 36  \n37 38 39 40 41 42 43
+  44 45  \n\r46 47 48 49 50 51 52 53 54 55  \n\r56 57 58 59 60 61 62 63 64 65 66  \n\r.
+  . .\n\nEach positive integer has up to eight neighbours in the triangle.\n\nA set
+  of three primes is called a _prime triplet_ if one of the three primes has the other
+  two as neighbours in the triangle.\n\nFor example, in the second row, the prime
+  numbers 2 and 3 are elements of some prime triplet.\n\nIf row 8 is considered, it
+  contains two primes which are elements of some prime triplet, i.e. 29 and 31.  \n\rIf
+  row 9 is considered, it contains only one prime which is an element of some prime
+  triplet: 37.\n\nDefine S(<var>n</var>) as the sum of the primes in row <var>n</var>
+  which are elements of any prime triplet.  \n\rThen S(8)=60 and S(9)=37.\n\nYou are
+  given that S(10000)=950007619.\n\nFind  S(5678027) + S(7208785).\n\n"

data/data/problems/197.yml

@@ -2,15 +2,11 @@
 :id: 197
 :name: Investigating the behaviour of a recursively defined sequence
 :url: http://projecteuler.net/problem=197
-:content: "\r\n<p>Given is the function <var>f</var>(<var>x</var>) = <img src=\"images/symbol_lfloor.gif\"
-  width=\"6\" height=\"16\" alt=\"⌊\" border=\"0\" style=\"vertical-align:middle;\">2<sup>30.403243784-<var>x</var><sup>2</sup></sup><img
-  src=\"images/symbol_rfloor.gif\" width=\"6\" height=\"16\" alt=\"⌋\" border=\"0\"
-  style=\"vertical-align:middle;\"><img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 10<sup>-9</sup>
-  ( <img src=\"images/symbol_lfloor.gif\" width=\"6\" height=\"16\" alt=\"⌊\" border=\"0\"
-  style=\"vertical-align:middle;\"><img src=\"images/symbol_rfloor.gif\" width=\"6\"
-  height=\"16\" alt=\"⌋\" border=\"0\" style=\"vertical-align:middle;\"> is the floor-function),<br>\r\nthe
-  sequence <var>u<sub>n</sub></var> is defined by <var>u</var><sub>0</sub> = -1 and
-  <var>u</var><sub><var>n</var>+1</sub> = <var>f</var>(<var>u<sub>n</sub></var>).</p>\r\n\r\n<p>Find
+:content: "Given is the function <var>f</var>(<var>x</var>) = ![⌊](/home/will/src/euler-manager/config/../data/images/symbol_lfloor.gif)2<sup>30.403243784-<var>x</var><sup>2</sup></sup>
+  ![⌋](/home/will/src/euler-manager/config/../data/images/symbol_rfloor.gif) ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  10<sup>-9</sup> ( ![⌊](/home/will/src/euler-manager/config/../data/images/symbol_lfloor.gif)
+  ![⌋](/home/will/src/euler-manager/config/../data/images/symbol_rfloor.gif) is the
+  floor-function),  \n\rthe sequence <var>u<sub>n</sub></var> is defined by <var>u</var><sub>0</sub>
+  = -1 and <var>u</var><sub><var>n</var>+1</sub> = <var>f</var>(<var>u<sub>n</sub></var>).\n\nFind
   <var>u<sub>n</sub></var> + <var>u</var><sub><var>n</var>+1</sub> for <var>n</var>
-  = 10<sup>12</sup>.<br>\r\nGive your answer with 9 digits after the decimal point.</p>\r\n"
+  = 10<sup>12</sup>.  \n\rGive your answer with 9 digits after the decimal point.\n\n"

data/data/problems/198.yml

@@ -2,20 +2,17 @@
 :id: 198
 :name: Ambiguous Numbers
 :url: http://projecteuler.net/problem=198
-:content: "\r\n<p>A best approximation to a real number <var>x</var> for the denominator
+:content: "A best approximation to a real number <var>x</var> for the denominator
   bound <var>d</var> is a rational number <var>r</var>/<var>s</var> (in reduced form)
-  with <var>s</var> <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>d</var>, so that any rational
-  number <var>p</var>/<var>q</var> which is closer to <var>x</var> than <var>r</var>/<var>s</var>
-  has <var>q</var> <img src=\"images/symbol_gt.gif\" width=\"10\" height=\"10\" alt=\"&gt;\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>d</var>.</p>\r\n\r\n<p>Usually
-  the best approximation to a real number is uniquely determined for all denominator
-  bounds. However, there are some exceptions, e.g. 9/40 has the two best approximations
-  1/4 and 1/5 for the denominator bound 6.\r\nWe shall call a real number <var>x</var>
-  <i>ambiguous</i>, if there is at least one denominator bound for which <var>x</var>
-  possesses two best approximations. Clearly, an ambiguous number is necessarily rational.</p>\r\n\r\n<p>How
-  many ambiguous numbers <var>x</var> = <var>p</var>/<var>q</var>,\r\n0 <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>x</var>
-  <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> 1/100, are there whose denominator <var>q</var>
-  does not exceed 10<sup>8</sup>?</p>\r\n"
+  with <var>s</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>d</var>, so that any rational number <var>p</var>/<var>q</var> which is closer
+  to <var>x</var> than <var>r</var>/<var>s</var> has <var>q</var> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)
+  <var>d</var>.\n\nUsually the best approximation to a real number is uniquely determined
+  for all denominator bounds. However, there are some exceptions, e.g. 9/40 has the
+  two best approximations 1/4 and 1/5 for the denominator bound 6.\rWe shall call
+  a real number <var>x</var> _ambiguous_, if there is at least one denominator bound
+  for which <var>x</var> possesses two best approximations. Clearly, an ambiguous
+  number is necessarily rational.\n\nHow many ambiguous numbers <var>x</var> = <var>p</var>/<var>q</var>,\r0
+  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) <var>x</var>
+  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 1/100, are
+  there whose denominator <var>q</var> does not exceed 10<sup>8</sup>?\n\n"

data/data/problems/199.yml

@@ -2,13 +2,13 @@
 :id: 199
 :name: Iterative Circle Packing
 :url: http://projecteuler.net/problem=199
-:content: "\r\n<p>Three circles of equal radius are placed inside a larger circle
-  such that each pair of circles is tangent to one another and the inner circles do
-  not overlap. There are four uncovered \"gaps\" which are to be filled iteratively
-  with more tangent circles.</p>\r\n<div style=\"text-align:center;\">\r\n<img src=\"project/images/p_199_circles_in_circles.gif\"
-  alt=\"\">\n</div>\r\n<p>\r\nAt each iteration, a maximally sized circle is placed
-  in each gap, which creates more gaps for the next iteration. After 3 iterations
-  (pictured), there are 108 gaps and the fraction of the area which is not covered
-  by circles is 0.06790342, rounded to eight decimal places.\r\n</p>\r\n<p>\r\nWhat
-  fraction of the area is not covered by circles after 10 iterations?<br>\r\nGive
-  your answer rounded to eight decimal places using the format x.xxxxxxxx .\r\n</p>\r\n"
+:content: "Three circles of equal radius are placed inside a larger circle such that
+  each pair of circles is tangent to one another and the inner circles do not overlap.
+  There are four uncovered \"gaps\" which are to be filled iteratively with more tangent
+  circles.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_199_circles_in_circles.gif)\n\nAt
+  each iteration, a maximally sized circle is placed in each gap, which creates more
+  gaps for the next iteration. After 3 iterations (pictured), there are 108 gaps and
+  the fraction of the area which is not covered by circles is 0.06790342, rounded
+  to eight decimal places.\n\nWhat fraction of the area is not covered by circles
+  after 10 iterations?  \n\rGive your answer rounded to eight decimal places using
+  the format x.xxxxxxxx .\n\n"

data/data/problems/2.yml

@@ -2,9 +2,9 @@
 :id: 2
 :name: Even Fibonacci numbers
 :url: http://projecteuler.net/problem=2
-:content: "\r\n<p>Each new term in the Fibonacci sequence is generated by adding the
-  previous two terms. By starting with 1 and 2, the first 10 terms will be:</p>\r\n<p
-  style=\"text-align:center;\">1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...</p>\r\n<p>By
-  considering the terms in the Fibonacci sequence whose values do not exceed four
-  million, find the sum of the even-valued terms.</p>\r\n<!--\r\nNote: This problem
-  has been changed recently, please check that you are using the right parameters.\r\n-->\r\n"
+:content: "Each new term in the Fibonacci sequence is generated by adding the previous
+  two terms. By starting with 1 and 2, the first 10 terms will be:\n\n1, 2, 3, 5,
+  8, 13, 21, 34, 55, 89, ...\n\nBy considering the terms in the Fibonacci sequence
+  whose values do not exceed four million, find the sum of the even-valued terms.\n\n<!--\r\nNote:
+  This problem has been changed recently, please check that you are using the right
+  parameters.\r\n-->\n"

data/data/problems/20.yml

@@ -2,21 +2,13 @@
 :id: 20
 :name: Factorial digit sum
 :url: http://projecteuler.net/problem=20
-:content: "\r\n<p><i>n</i>! means <i>n</i> <img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> (<i>n</i>
-  <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" 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;\"> ... <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  3 <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;\"> 1</p>\r\n<p>For
-  example, 10! = 10 <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;\">
-  ... <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 3 <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;\">
-  1 = 3628800,<br>and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8
-  + 0 + 0 = 27.</p>\r\n<p>Find the sum of the digits in the number 100!</p>\r\n\r\n"
+:content: "_n_! means _n_ ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  (_n_ ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) 1)
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) ... ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  1\n\nFor example, 10! = 10 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  9 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) ...
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 1 =
+  3628800,  \nand the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0
+  + 0 = 27.\n\nFind the sum of the digits in the number 100!\n\n"

data/data/problems/200.yml

@@ -2,11 +2,11 @@
 :id: 200
 :name: Find the 200th prime-proof sqube containing the contiguous sub-string "200"
 :url: http://projecteuler.net/problem=200
-:content: "\r\n<p>We shall define a sqube to be a number of the form, <var>p</var><sup>2</sup><var>q</var><sup>3</sup>,
-  where <var>p</var> and <var>q</var> are distinct primes.<br>\r\nFor example, 200
-  = 5<sup>2</sup>2<sup>3</sup> or 120072949 = 23<sup>2</sup>61<sup>3</sup>.</p>\r\n\r\n<p>The
-  first five squbes are 72, 108, 200, 392, and 500.</p>\r\n\r\n<p>Interestingly, 200
-  is also the first number for which you cannot change any single digit to make a
-  prime; we shall call such numbers, prime-proof. The next prime-proof sqube which
-  contains the contiguous sub-string \"200\" is 1992008.</p>\r\n\r\n<p>Find the 200th
-  prime-proof sqube containing the contiguous sub-string \"200\".</p>\r\n"
+:content: "We shall define a sqube to be a number of the form, <var>p</var><sup>2</sup><var>q</var><sup>3</sup>,
+  where <var>p</var> and <var>q</var> are distinct primes.  \n\rFor example, 200 =
+  5<sup>2</sup>2<sup>3</sup> or 120072949 = 23<sup>2</sup>61<sup>3</sup>.\n\nThe first
+  five squbes are 72, 108, 200, 392, and 500.\n\nInterestingly, 200 is also the first
+  number for which you cannot change any single digit to make a prime; we shall call
+  such numbers, prime-proof. The next prime-proof sqube which contains the contiguous
+  sub-string \"200\" is 1992008.\n\nFind the 200th prime-proof sqube containing the
+  contiguous sub-string \"200\".\n\n"

data/data/problems/201.yml

@@ -2,19 +2,17 @@
 :id: 201
 :name: Subsets with a unique sum
 :url: http://projecteuler.net/problem=201
-:content: "\r\n<p>For any set A of numbers, let sum(A) be the sum of the elements
-  of A.<br>\r\nConsider the set B = {1,3,6,8,10,11}.<br> There are 20 subsets of B
-  containing three elements, and their sums are:</p>\r\n\r\n<p style=\"margin-left:100px\">\r\nsum({1,3,6})
-  = 10,<br>\r\nsum({1,3,8}) = 12,<br>\r\nsum({1,3,10}) = 14,<br>\r\nsum({1,3,11})
-  = 15,<br>\r\nsum({1,6,8}) = 15,<br>\r\nsum({1,6,10}) = 17,<br>\r\nsum({1,6,11})
-  = 18,<br>\r\nsum({1,8,10}) = 19,<br>\r\nsum({1,8,11}) = 20,<br>\r\nsum({1,10,11})
-  = 22,<br>\r\nsum({3,6,8}) = 17,<br>\r\nsum({3,6,10}) = 19,<br>\r\nsum({3,6,11})
-  = 20,<br>\r\nsum({3,8,10}) = 21,<br>\r\nsum({3,8,11}) = 22,<br>\r\nsum({3,10,11})
-  = 24,<br>\r\nsum({6,8,10}) = 24,<br>\r\nsum({6,8,11}) = 25,<br>\r\nsum({6,10,11})
-  = 27,<br>\r\nsum({8,10,11}) = 29.</p>\r\n\r\n<p>Some of these sums occur more than
-  once, others are unique.<br>\r\nFor a set A, let U(A,k) be the set of unique sums
-  of k-element subsets of A, in our example we find U(B,3) = {10,12,14,18,21,25,27,29}
-  and sum(U(B,3)) = 156.</p>\r\n\r\n<p>Now consider the 100-element set S = {1<sup>2</sup>,
-  2<sup>2</sup>, ... , 100<sup>2</sup>}.<br>\r\nS has 100891344545564193334812497256
-  50-element subsets.</p>\r\n\r\n<p>Determine the sum of all integers which are the
-  sum of exactly one of the 50-element subsets of S, i.e. find sum(U(S,50)).</p>\r\n"
+:content: "For any set A of numbers, let sum(A) be the sum of the elements of A.  \n\rConsider
+  the set B = {1,3,6,8,10,11}.  \n There are 20 subsets of B containing three elements,
+  and their sums are:\n\nsum({1,3,6}) = 10,  \n\rsum({1,3,8}) = 12,  \n\rsum({1,3,10})
+  = 14,  \n\rsum({1,3,11}) = 15,  \n\rsum({1,6,8}) = 15,  \n\rsum({1,6,10}) = 17,
+  \ \n\rsum({1,6,11}) = 18,  \n\rsum({1,8,10}) = 19,  \n\rsum({1,8,11}) = 20,  \n\rsum({1,10,11})
+  = 22,  \n\rsum({3,6,8}) = 17,  \n\rsum({3,6,10}) = 19,  \n\rsum({3,6,11}) = 20,
+  \ \n\rsum({3,8,10}) = 21,  \n\rsum({3,8,11}) = 22,  \n\rsum({3,10,11}) = 24,  \n\rsum({6,8,10})
+  = 24,  \n\rsum({6,8,11}) = 25,  \n\rsum({6,10,11}) = 27,  \n\rsum({8,10,11}) = 29.\n\nSome
+  of these sums occur more than once, others are unique.  \n\rFor a set A, let U(A,k)
+  be the set of unique sums of k-element subsets of A, in our example we find U(B,3)
+  = {10,12,14,18,21,25,27,29} and sum(U(B,3)) = 156.\n\nNow consider the 100-element
+  set S = {1<sup>2</sup>, 2<sup>2</sup>, ... , 100<sup>2</sup>}.  \n\rS has 100891344545564193334812497256
+  50-element subsets.\n\nDetermine the sum of all integers which are the sum of exactly
+  one of the 50-element subsets of S, i.e. find sum(U(S,50)).\n\n"