euler-manager 0.0.5 → 0.0.6

data/data/problems/407.yml

@@ -2,19 +2,12 @@
 :id: 407
 :name: Idempotents
 :url: http://projecteuler.net/problem=407
-:content: "\r\n<p>\r\nIf we calculate <var>a</var><sup>2</sup> mod 6 for 0 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>a</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 5 we get: 0,1,4,3,4,1.\r\n</p>\r\n<p>\r\nThe largest
-  value of <var>a</var> such that <var>a</var><sup>2</sup><img src=\"images/symbol_cong.gif\"
-  width=\"9\" height=\"11\" alt=\"≡\" border=\"0\" style=\"vertical-align:middle;\"><var>a</var>
-  mod 6 is 4.<br>\r\nLet's call M(<var>n</var>) the largest value of <var>a</var>
-  <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>n</var> such that <var>a</var><sup>2</sup><img
-  src=\"images/symbol_cong.gif\" width=\"9\" height=\"11\" alt=\"≡\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>a</var> (mod <var>n</var>).<br>\r\nSo M(6)
-  = 4.\r\n</p>\r\n<p>\r\nFind <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\"
-  alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">M(<var>n</var>) for 1 <img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" 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;\"> 10<sup>7</sup>.\r\n</p>\r\n\r\n"
+:content: "If we calculate <var>a</var><sup>2</sup> mod 6 for 0 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>a</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  5 we get: 0,1,4,3,4,1.\n\nThe largest value of <var>a</var> such that <var>a</var><sup>2</sup>
+  ![≡](/home/will/src/euler-manager/config/../data/images/symbol_cong.gif) <var>a</var>
+  mod 6 is 4.  \n\rLet's call M(<var>n</var>) the largest value of <var>a</var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>n</var> such that <var>a</var><sup>2</sup> ![≡](/home/will/src/euler-manager/config/../data/images/symbol_cong.gif)
+  <var>a</var> (mod <var>n</var>).  \n\rSo M(6) = 4.\n\nFind ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)M(<var>n</var>)
+  for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>n</var>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 10<sup>7</sup>.\n\n"

data/data/problems/408.yml

@@ -2,13 +2,13 @@
 :id: 408
 :name: Admissible paths through a grid
 :url: http://projecteuler.net/problem=408
-:content: "\r\n<p>Let's call a lattice point (<var>x</var>, <var>y</var>) <i>inadmissible</i>
+:content: "Let's call a lattice point (<var>x</var>, <var>y</var>) _inadmissible_
   if <var>x</var>, <var>y</var> and <var>x</var> + <var>y</var> are all positive perfect
-  squares.<br>\r\nFor example, (9, 16) is inadmissible, while (0, 4), (3, 1) and (9,
-  4) are not.</p>\r\n\r\n<p>Consider a path from point (<var>x</var><sub>1</sub>,
-  <var>y</var><sub>1</sub>) to point (<var>x</var><sub>2</sub>, <var>y</var><sub>2</sub>)
-  using only unit steps north or east.<br>\r\nLet's call such a path <i>admissible</i>
-  if none of its intermediate points are inadmissible.</p>\r\n\r\n<p>Let P(<var>n</var>)
-  be the number of admissible paths from (0, 0) to (<var>n</var>, <var>n</var>).<br>\r\nIt
-  can be verified that P(5) = 252, P(16) = 596994440 and P(1000) mod 1 000 000 007
-  = 341920854.</p>\r\n\r\n<p>Find P(10 000 000) mod 1 000 000 007.</p>\r\n"
+  squares.  \n\rFor example, (9, 16) is inadmissible, while (0, 4), (3, 1) and (9,
+  4) are not.\n\nConsider a path from point (<var>x</var><sub>1</sub>, <var>y</var><sub>1</sub>)
+  to point (<var>x</var><sub>2</sub>, <var>y</var><sub>2</sub>) using only unit steps
+  north or east.  \n\rLet's call such a path _admissible_ if none of its intermediate
+  points are inadmissible.\n\nLet P(<var>n</var>) be the number of admissible paths
+  from (0, 0) to (<var>n</var>, <var>n</var>).  \n\rIt can be verified that P(5) =
+  252, P(16) = 596994440 and P(1000) mod 1 000 000 007 = 341920854.\n\nFind P(10 000 000)
+  mod 1 000 000 007.\n\n"

data/data/problems/409.yml

@@ -2,11 +2,9 @@
 :id: 409
 :name: Nim Extreme
 :url: http://projecteuler.net/problem=409
-:content: "\r\n<p>Let <var>n</var> be a positive integer. Consider <b>nim</b> positions
-  where:</p>\n<ul>\n<li>There are <var>n</var> non-empty piles.\r\n</li>\n<li>Each
-  pile has size less than 2<sup><var>n</var></sup>.\r\n</li>\n<li>No two piles have
-  the same size.\r\n</li>\n</ul>\n<p>Let W(<var>n</var>) be the number of winning
-  nim positions satisfying the above\r\nconditions (a position is winning if the first
+:content: "Let <var>n</var> be a positive integer. Consider **nim** positions where:\n\n-
+  There are <var>n</var> non-empty piles.\r\n- Each pile has size less than 2<sup><var>n</var></sup>.\r\n-
+  No two piles have the same size.\r\n\nLet W(<var>n</var>) be the number of winning
+  nim positions satisfying the above\rconditions (a position is winning if the first
   player has a winning strategy). For example, W(1) = 1, W(2) = 6, W(3) = 168, W(5)
-  = 19764360 and W(100) mod 1 000 000 007 = 384777056.\r\n</p>\r\n<p>Find W(10 000 000)
-  mod 1 000 000 007.\r\n</p>\r\n\r\n"
+  = 19764360 and W(100) mod 1 000 000 007 = 384777056.\n\nFind W(10 000 000) mod 1 000 000 007.\n\n"

data/data/problems/41.yml

@@ -2,7 +2,8 @@
 :id: 41
 :name: Pandigital prime
 :url: http://projecteuler.net/problem=41
-:content: "\r\n\n<p>We shall say that an <i>n</i>-digit number is pandigital if it
-  makes use of all the digits 1 to <i>n</i> exactly once. For example, 2143 is a 4-digit
-  pandigital and is also prime.</p>\n<p>What is the largest <i>n</i>-digit pandigital
-  prime that exists?</p>\n\r\n"
+:content: |+
+  We shall say that an _n_-digit number is pandigital if it makes use of all the digits 1 to _n_ exactly once. For example, 2143 is a 4-digit pandigital and is also prime.
+
+  What is the largest _n_-digit pandigital prime that exists?
+

data/data/problems/410.yml

@@ -2,18 +2,15 @@
 :id: 410
 :name: Circle and tangent line
 :url: http://projecteuler.net/problem=410
-:content: "\r\n<p>Let C be the circle with radius <var>r</var>, <var>x</var><sup>2</sup>
+:content: "Let C be the circle with radius <var>r</var>, <var>x</var><sup>2</sup>
   + <var>y</var><sup>2</sup> = <var>r</var><sup>2</sup>. We choose two points P(<var>a</var>,
   <var>b</var>) and Q(-<var>a</var>, <var>c</var>) so that the line passing through
-  P and Q is tangent to C.</p>\r\n\r\n<p>For example, the quadruplet (<var>r</var>,
-  <var>a</var>, <var>b</var>, <var>c</var>) = (2, 6, 2, -7) satisfies this property.</p>\r\n\r\n<p>Let
-  F(<var>R</var>, <var>X</var>) be the number of the integer quadruplets (<var>r</var>,
-  <var>a</var>, <var>b</var>, <var>c</var>) with this property, and with 0 <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>r</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>R</var> and 0 <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>a</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>X</var>.</p>\r\n\r\n<p>We can verify that
-  F(1, 5) = 10, F(2, 10) = 52 and F(10, 100) = 3384.<br>\r\nFind F(10<sup>8</sup>,
-  10<sup>9</sup>) + F(10<sup>9</sup>, 10<sup>8</sup>).</p>\r\n"
+  P and Q is tangent to C.\n\nFor example, the quadruplet (<var>r</var>, <var>a</var>,
+  <var>b</var>, <var>c</var>) = (2, 6, 2, -7) satisfies this property.\n\nLet F(<var>R</var>,
+  <var>X</var>) be the number of the integer quadruplets (<var>r</var>, <var>a</var>,
+  <var>b</var>, <var>c</var>) with this property, and with 0 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>r</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>R</var> and 0 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>a</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>X</var>.\n\nWe can verify that F(1, 5) = 10, F(2, 10) = 52 and F(10, 100) =
+  3384.  \n\rFind F(10<sup>8</sup>, 10<sup>9</sup>) + F(10<sup>9</sup>, 10<sup>8</sup>).\n\n"

data/data/problems/411.yml

@@ -2,22 +2,18 @@
 :id: 411
 :name: Uphill paths
 :url: http://projecteuler.net/problem=411
-:content: "\r\n<p>\r\nLet <var>n</var> be a positive integer. Suppose there are stations
-  at the coordinates (<var>x</var>, <var>y</var>) = (2<sup><var>i</var></sup> mod
-  <var>n</var>, 3<sup><var>i</var></sup> mod <var>n</var>) for 0 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 2<var>n</var>. We will consider stations with
-  the same coordinates as the same station.\r\n</p>\n<p>\r\nWe wish to form a path
-  from (0, 0) to (<var>n</var>, <var>n</var>) such that the x and y coordinates never
-  decrease.<br>\r\nLet S(<var>n</var>) be the maximum number of stations such a path
-  can pass through.\r\n</p>\n<p>\r\nFor example, if <var>n</var> = 22, there are 11
-  distinct stations, and a valid path can pass through at most 5 stations. Therefore,
-  S(22) = 5.\r\nThe case is illustrated below, with an example of an optimal path:\r\n</p>\r\n<p
-  align=\"center\"><img src=\"project/images/p411_longpath.png\"></p>\r\n<p>\r\nIt
-  can also be verified that S(123) = 14 and S(10000) = 48.\r\n</p>\n<p>\r\nFind <img
-  src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\"> S(<var>k</var><sup>5</sup>) for 1 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>k</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 30.\r\n</p>\r\n"
+:content: "Let <var>n</var> be a positive integer. Suppose there are stations at the
+  coordinates (<var>x</var>, <var>y</var>) = (2<sup><var>i</var></sup> mod <var>n</var>,
+  3<sup><var>i</var></sup> mod <var>n</var>) for 0 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>i</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  2<var>n</var>. We will consider stations with the same coordinates as the same station.\n\nWe
+  wish to form a path from (0, 0) to (<var>n</var>, <var>n</var>) such that the x
+  and y coordinates never decrease.  \n\rLet S(<var>n</var>) be the maximum number
+  of stations such a path can pass through.\n\nFor example, if <var>n</var> = 22,
+  there are 11 distinct stations, and a valid path can pass through at most 5 stations.
+  Therefore, S(22) = 5.\rThe case is illustrated below, with an example of an optimal
+  path:\n\n![](/home/will/src/euler-manager/config/../data/images/p411_longpath.png)\n\nIt
+  can also be verified that S(123) = 14 and S(10000) = 48.\n\nFind ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)
+  S(<var>k</var><sup>5</sup>) for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>k</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  30.\n\n"

data/data/problems/412.yml

@@ -2,18 +2,14 @@
 :id: 412
 :name: Gnomon numbering
 :url: http://projecteuler.net/problem=412
-:content: "\r\n<p>For integers <var>m</var>, <var>n</var> (0 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> <var>n</var> m),
-  let L(<var>m</var>, <var>n</var>) be an <var>m</var><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><var>m</var>
-  grid with the top-right <var>n</var><img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>
-  grid removed.</p>\r\n\r\n<p>For example, L(5, 3) looks like this:</p>\r\n\r\n<p><img
-  src=\"project/images/p412_table53.png\"></p>\r\n\r\n<p>We want to number each cell
-  of L(<var>m</var>, <var>n</var>) with consecutive integers 1, 2, 3, ... such that
-  the number in every cell is smaller than the number below it and to the left of
-  it.</p>\r\n\r\n<p>For example, here are two valid numberings of L(5, 3):</p>\r\n<p><img
-  src=\"project/images/p412_tablenums.png\"></p>\r\n\r\n<p>Let LC(<var>m</var>, <var>n</var>)
-  be the number of valid numberings of L(<var>m</var>, <var>n</var>).<br>\r\nIt can
-  be verified that LC(3, 0) = 42, LC(5, 3) = 250250, LC(6, 3) = 406029023400 and LC(10, 5)
-  mod 76543217 = 61251715.</p>\r\n\r\n<p>Find LC(10000, 5000) mod 76543217.</p>\r\n"
+:content: "For integers <var>m</var>, <var>n</var> (0  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>n</var> m),
+  let L(<var>m</var>, <var>n</var>) be an <var>m</var> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)<var>m</var>
+  grid with the top-right <var>n</var> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)<var>n</var>
+  grid removed.\n\nFor example, L(5, 3) looks like this:\n\n![](/home/will/src/euler-manager/config/../data/images/p412_table53.png)\n\nWe
+  want to number each cell of L(<var>m</var>, <var>n</var>) with consecutive integers
+  1, 2, 3, ... such that the number in every cell is smaller than the number below
+  it and to the left of it.\n\nFor example, here are two valid numberings of L(5, 3):\n\n![](/home/will/src/euler-manager/config/../data/images/p412_tablenums.png)\n\nLet
+  LC(<var>m</var>, <var>n</var>) be the number of valid numberings of L(<var>m</var>,
+  <var>n</var>).  \n\rIt can be verified that LC(3, 0) = 42, LC(5, 3) = 250250, LC(6, 3)
+  = 406029023400 and LC(10, 5) mod 76543217 = 61251715.\n\nFind LC(10000, 5000) mod
+  76543217.\n\n"

data/data/problems/413.yml

@@ -2,12 +2,12 @@
 :id: 413
 :name: One-child Numbers
 :url: http://projecteuler.net/problem=413
-:content: "\r\n<p>We say that a <var>d</var>-digit positive number (no leading zeros)
-  is a one-child number if exactly one of its sub-strings is divisible by <var>d</var>.</p>\r\n\r\n<p>For
+:content: "We say that a <var>d</var>-digit positive number (no leading zeros) is
+  a one-child number if exactly one of its sub-strings is divisible by <var>d</var>.\n\nFor
   example, 5671 is a 4-digit one-child number. Among all its sub-strings 5, 6, 7,
-  1, 56, 67, 71, 567, 671 and 5671, only 56 is divisible by 4.<br>\r\nSimilarly, 104
-  is a 3-digit one-child number because only 0 is divisible by 3.<br>\r\n1132451 is
-  a 7-digit one-child number because only 245 is divisible by 7.</p>\r\n\r\n<p>Let
-  F(<var>N</var>) be the number of the one-child numbers less than <var>N</var>.<br>\r\nWe
-  can verify that F(10) = 9, F(10<sup>3</sup>) = 389 and F(10<sup>7</sup>) = 277674.</p>\r\n\r\n<p>Find
-  F(10<sup>19</sup>).</p>\r\n"
+  1, 56, 67, 71, 567, 671 and 5671, only 56 is divisible by 4.  \n\rSimilarly, 104
+  is a 3-digit one-child number because only 0 is divisible by 3.  \n\r1132451 is
+  a 7-digit one-child number because only 245 is divisible by 7.\n\nLet F(<var>N</var>)
+  be the number of the one-child numbers less than <var>N</var>.  \n\rWe can verify
+  that F(10) = 9, F(10<sup>3</sup>) = 389 and F(10<sup>7</sup>) = 277674.\n\nFind
+  F(10<sup>19</sup>).\n\n"

data/data/problems/414.yml

@@ -2,39 +2,34 @@
 :id: 414
 :name: Kaprekar constant
 :url: http://projecteuler.net/problem=414
-:content: "\r\n<p>\r\n6174 is a remarkable number; if we sort its digits in increasing
-  order and subtract that number from the number you get when you sort the digits
-  in decreasing order, we get 7641-1467=6174.<br>\r\nEven more remarkable is that
-  if we start from any 4 digit number and repeat this process of sorting and subtracting,
-  we'll eventually end up with 6174 or immediately with 0 if all digits are equal.<br>
-  \r\nThis also works with numbers that have less than 4 digits if we pad the number
-  with leading zeroes until we have 4 digits.<br>\r\nE.g. let's start with the number
-  0837:<br>\r\n8730-0378=8352<br>\r\n8532-2358=6174\r\n</p>\r\n<p>\r\n6174 is called
-  the <b>Kaprekar constant</b>. The process of sorting and subtracting and repeating
-  this until either 0 or the Kaprekar constant is reached is called the <b>Kaprekar
-  routine</b>.\r\n</p>\r\n<p>\r\nWe can consider the Kaprekar routine for other bases
-  and number of digits.<br> \r\nUnfortunately, it is not guaranteed a Kaprekar constant
-  exists in all cases; either the routine can end up in a cycle for some input numbers
-  or the constant the routine arrives at can be different for different input numbers.<br>\r\nHowever,
-  it can be shown that for 5 digits and a base b = 6t+3<img src=\"images/symbol_ne.gif\"
-  width=\"11\" height=\"10\" alt=\"≠\" border=\"0\" style=\"vertical-align:middle;\">9,
-  a Kaprekar constant exists.<br>\r\nE.g. base 15: (10,4,14,9,5)<sub>15</sub><br>\r\nbase
-  21: (14,6,20,13,7)<sub>21</sub></p>\r\n<p>\r\nDefine <var>C<sub>b</sub></var> to
-  be the Kaprekar constant in base <var>b</var> for 5 digits.\r\nDefine the function
-  <var>sb(i)</var> to be\r\n</p>\n<ul>\n<li> 0 if i = <var>C<sub>b</sub></var> or
-  if <var>i</var> written in base <var>b</var> consists of 5 identical digits\r\n</li>\n<li>
-  the number of iterations it takes the Kaprekar routine in base <var>b</var> to arrive
-  at <var>C<sub>b</sub></var>, otherwise\r\n</li>\n</ul>\r\nNote that we can define
-  <var>sb(i)</var> for all integers <var>i</var> <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>b</var><sup>5</sup>.
+:content: "6174 is a remarkable number; if we sort its digits in increasing order
+  and subtract that number from the number you get when you sort the digits in decreasing
+  order, we get 7641-1467=6174.  \n\rEven more remarkable is that if we start from
+  any 4 digit number and repeat this process of sorting and subtracting, we'll eventually
+  end up with 6174 or immediately with 0 if all digits are equal.  \n \rThis also
+  works with numbers that have less than 4 digits if we pad the number with leading
+  zeroes until we have 4 digits.  \n\rE.g. let's start with the number 0837:  \n\r8730-0378=8352
+  \ \n\r8532-2358=6174\n\n6174 is called the **Kaprekar constant** . The process of
+  sorting and subtracting and repeating this until either 0 or the Kaprekar constant
+  is reached is called the **Kaprekar routine** .\n\nWe can consider the Kaprekar
+  routine for other bases and number of digits.  \n \rUnfortunately, it is not guaranteed
+  a Kaprekar constant exists in all cases; either the routine can end up in a cycle
+  for some input numbers or the constant the routine arrives at can be different for
+  different input numbers.  \n\rHowever, it can be shown that for 5 digits and a base
+  b = 6t+3 ![≠](/home/will/src/euler-manager/config/../data/images/symbol_ne.gif)9,
+  a Kaprekar constant exists.  \n\rE.g. base 15: (10,4,14,9,5)<sub>15</sub>  \n\rbase
+  21: (14,6,20,13,7)<sub>21</sub>\n\nDefine <var>C<sub>b</sub></var> to be the Kaprekar
+  constant in base <var>b</var> for 5 digits.\rDefine the function <var>sb(i)</var>
+  to be\n\n- 0 if i = <var>C<sub>b</sub></var> or if <var>i</var> written in base
+  <var>b</var> consists of 5 identical digits\r\n- the number of iterations it takes
+  the Kaprekar routine in base <var>b</var> to arrive at <var>C<sub>b</sub></var>,
+  otherwise\r\n\rNote that we can define <var>sb(i)</var> for all integers <var>i</var>
+  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) <var>b</var><sup>5</sup>.
   If <var>i</var> written in base <var>b</var> takes less than 5 digits, the number
   is padded with leading zero digits until we have 5 digits before applying the Kaprekar
-  routine.\r\n\r\n<p>\r\nDefine <var>S(b)</var> as the sum of <var>sb(i)</var> for
-  0 <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>i</var> <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>b</var><sup>5</sup>.<br>\r\nE.g.
-  S(15) = 5274369<br> \r\nS(111) = 400668930299\r\n</p>\r\n<p>\r\nFind the sum of
-  S(6k+3) for 2 <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;\">
-  300.<br>\r\nGive the last 18 digits as your answer.\r\n</p>\r\n\r\n"
+  routine.\r\r\n\nDefine <var>S(b)</var> as the sum of <var>sb(i)</var> for 0 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>i</var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>b</var><sup>5</sup>.  \n\rE.g. S(15) = 5274369  \n \rS(111) = 400668930299\n\nFind
+  the sum of S(6k+3) 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) 300.  \n\rGive
+  the last 18 digits as your answer.\n\n"

data/data/problems/415.yml

@@ -2,18 +2,15 @@
 :id: 415
 :name: Titanic sets
 :url: http://projecteuler.net/problem=415
-:content: "\r\n<p>A set of lattice points S is called a <i>titanic set</i> if there
-  exists a line passing through exactly two points in S.</p>\r\n\r\n<p>An example
-  of a titanic set is S = {(0, 0), (0, 1), (0, 2), (1, 1), (2, 0), (1, 0)}, where
-  the line passing through (0, 1) and (2, 0) does not pass through any other point
-  in S.</p>\r\n\r\n<p>On the other hand, the set {(0, 0), (1, 1), (2, 2), (4, 4)}
-  is not a titanic set since the line passing through any two points in the set also
-  passes through the other two.</p>\r\n\r\n<p>For any positive integer <var>N</var>,
-  let <var>T</var>(<var>N</var>) be the number of titanic sets S whose every point
-  (<var>x</var>, <var>y</var>) satisfies 0 <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>x</var>,
-  <var>y</var> <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>N</var>.\r\nIt can be verified
-  that <var>T</var>(1) = 11, <var>T</var>(2) = 494, <var>T</var>(4) = 33554178, <var>T</var>(111)
-  mod 10<sup>8</sup> = 13500401 and <var>T</var>(10<sup>5</sup>) mod 10<sup>8</sup>
-  = 63259062.</p>\r\n\r\n<p>Find <var>T</var>(10<sup>11</sup>) mod 10<sup>8</sup>.</p>\r\n\r\n"
+:content: "A set of lattice points S is called a _titanic set_ if there exists a line
+  passing through exactly two points in S.\n\nAn example of a titanic set is S = {(0,
+  0), (0, 1), (0, 2), (1, 1), (2, 0), (1, 0)}, where the line passing through (0,
+  1) and (2, 0) does not pass through any other point in S.\n\nOn the other hand,
+  the set {(0, 0), (1, 1), (2, 2), (4, 4)} is not a titanic set since the line passing
+  through any two points in the set also passes through the other two.\n\nFor any
+  positive integer <var>N</var>, let <var>T</var>(<var>N</var>) be the number of titanic
+  sets S whose every point (<var>x</var>, <var>y</var>) satisfies 0 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>x</var>, <var>y</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>N</var>.\rIt can be verified that <var>T</var>(1) = 11, <var>T</var>(2) = 494,
+  <var>T</var>(4) = 33554178, <var>T</var>(111) mod 10<sup>8</sup> = 13500401 and
+  <var>T</var>(10<sup>5</sup>) mod 10<sup>8</sup> = 63259062.\n\nFind <var>T</var>(10<sup>11</sup>) mod 10<sup>8</sup>.\n\n"

data/data/problems/416.yml

@@ -2,12 +2,12 @@
 :id: 416
 :name: A frog's trip
 :url: http://projecteuler.net/problem=416
-:content: "\r\n<p>A row of <var>n</var> squares contains a frog in the leftmost square.
-  By successive jumps the frog goes to the rightmost square and then back to the leftmost
+:content: "A row of <var>n</var> squares contains a frog in the leftmost square. By
+  successive jumps the frog goes to the rightmost square and then back to the leftmost
   square. On the outward trip he jumps one, two or three squares to the right, and
   on the homeward trip he jumps to the left in a similar manner. He cannot jump outside
-  the squares. He repeats the round-trip travel <var>m</var> times.</p>\r\n\r\n<p>Let
-  F(<var>m</var>, <var>n</var>) be the number of the ways the frog can travel so that
-  at most one square remains unvisited.<br>\r\nFor example, F(1, 3) = 4, F(1, 4) =
-  15, F(1, 5) = 46, F(2, 3) = 16 and F(2, 100) mod 10<sup>9</sup> = 429619151.</p>\r\n\r\n<p>Find
-  the last 9 digits of F(10, 10<sup>12</sup>).</p>\r\n"
+  the squares. He repeats the round-trip travel <var>m</var> times.\n\nLet F(<var>m</var>,
+  <var>n</var>) be the number of the ways the frog can travel so that at most one
+  square remains unvisited.  \n\rFor example, F(1, 3) = 4, F(1, 4) = 15, F(1, 5) =
+  46, F(2, 3) = 16 and F(2, 100) mod 10<sup>9</sup> = 429619151.\n\nFind the last
+  9 digits of F(10, 10<sup>12</sup>).\n\n"

data/data/problems/417.yml

@@ -2,20 +2,19 @@
 :id: 417
 :name: Reciprocal cycles II
 :url: http://projecteuler.net/problem=417
-:content: "\r\n<p>A unit fraction contains 1 in the numerator. The decimal representation
-  of the unit fractions with denominators 2 to 10 are given:</p>\r\n<blockquote>\r\n<table>\n<tr>\n<td>\n<sup>1</sup>/<sub>2</sub>\n</td>\n<td>= </td>\n<td>0.5</td>\r\n</tr>\n<tr>\n<td>\n<sup>1</sup>/<sub>3</sub>\n</td>\n<td>= </td>\n<td>0.(3)</td>\r\n</tr>\n<tr>\n<td>\n<sup>1</sup>/<sub>4</sub>\n</td>\n<td>= </td>\n<td>0.25</td>\r\n</tr>\n<tr>\n<td>\n<sup>1</sup>/<sub>5</sub>\n</td>\n<td>= </td>\n<td>0.2</td>\r\n</tr>\n<tr>\n<td>\n<sup>1</sup>/<sub>6</sub>\n</td>\n<td>= </td>\n<td>0.1(6)</td>\r\n</tr>\n<tr>\n<td>\n<sup>1</sup>/<sub>7</sub>\n</td>\n<td>= </td>\n<td>0.(142857)</td>\r\n</tr>\n<tr>\n<td>\n<sup>1</sup>/<sub>8</sub>\n</td>\n<td>= </td>\n<td>0.125</td>\r\n</tr>\n<tr>\n<td>\n<sup>1</sup>/<sub>9</sub>\n</td>\n<td>= </td>\n<td>0.(1)</td>\r\n</tr>\n<tr>\n<td>\n<sup>1</sup>/<sub>10</sub>\n</td>\n<td>= </td>\n<td>0.1</td>\r\n</tr>\n</table>\n</blockquote>\r\n<p>Where
-  0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that
-  <sup>1</sup>/<sub>7</sub> has a 6-digit recurring cycle.</p>\r\n<p>\r\nUnit fractions
-  whose denominator has no other prime factors than 2 and/or 5 are not considered
-  to have a recurring cycle.<br>\r\nWe define the length of the recurring cycle of
-  those unit fractions as 0. \r\n</p>\r\n<p>\r\nLet L(n) denote the length of the
-  recurring cycle of 1/n.\r\nYou are given that <img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">L(n)
-  for 3 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> n <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 1 000 000
-  equals 55535191115.\r\n</p>\r\n<p>\r\nFind <img src=\"images/symbol_sum.gif\" width=\"11\"
-  height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">L(n) for 3
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> n <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 100 000 000\r\n</p>"
+:content: "A unit fraction contains 1 in the numerator. The decimal representation
+  of the unit fractions with denominators 2 to 10 are given:\n\n> | <sup>1</sup>/<sub>2</sub>
+  | =  | 0.5 |\n> | <sup>1</sup>/<sub>3</sub> | =  | 0.(3) |\n> | <sup>1</sup>/<sub>4</sub>
+  | =  | 0.25 |\n> | <sup>1</sup>/<sub>5</sub> | =  | 0.2 |\n> | <sup>1</sup>/<sub>6</sub>
+  | =  | 0.1(6) |\n> | <sup>1</sup>/<sub>7</sub> | =  | 0.(142857) |\n> | <sup>1</sup>/<sub>8</sub>
+  | =  | 0.125 |\n> | <sup>1</sup>/<sub>9</sub> | =  | 0.(1) |\n> | <sup>1</sup>/<sub>10</sub>
+  | =  | 0.1 |\n\nWhere 0.1(6) means 0.166666..., and has a 1-digit recurring cycle.
+  It can be seen that <sup>1</sup>/<sub>7</sub> has a 6-digit recurring cycle.\n\nUnit
+  fractions whose denominator has no other prime factors than 2 and/or 5 are not considered
+  to have a recurring cycle.  \n\rWe define the length of the recurring cycle of those
+  unit fractions as 0.\n\nLet L(n) denote the length of the recurring cycle of 1/n.\rYou
+  are given that ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)L(n)
+  for 3 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) n ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  1 000 000 equals 55535191115.\n\nFind ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)L(n)
+  for 3 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) n ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  100 000 000\n\n"

data/data/problems/418.yml

@@ -2,16 +2,13 @@
 :id: 418
 :name: Factorisation triples
 :url: http://projecteuler.net/problem=418
-:content: "\r\n<p>\r\nLet <var>n</var> be a positive integer. An integer triple (<var>a</var>,
-  <var>b</var>, <var>c</var>) is called a <i>factorisation triple</i> of <var>n</var>
-  if:</p>\n<ul>\n<li> 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>a</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>b</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>c</var>\r\n</li>\n<li> <var>a</var>·<var>b</var>·<var>c</var>
-  = <var>n</var>.\r\n</li>\n</ul>\n<p>\r\nDefine <var>f</var>(<var>n</var>) to be
-  <var>a</var> + <var>b</var> + <var>c</var> for the factorisation triple (<var>a</var>,
+:content: "Let <var>n</var> be a positive integer. An integer triple (<var>a</var>,
+  <var>b</var>, <var>c</var>) is called a _factorisation triple_ of <var>n</var> if:\n\n-
+  1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>a</var>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>b</var>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>c</var>\n-
+  <var>a</var>·<var>b</var>·<var>c</var> = <var>n</var>.\r\n\nDefine <var>f</var>(<var>n</var>)
+  to be <var>a</var> + <var>b</var> + <var>c</var> for the factorisation triple (<var>a</var>,
   <var>b</var>, <var>c</var>) of <var>n</var> which minimises <var>c</var> / <var>a</var>.
-  One can show that this triple is unique.\r\n</p>\r\n<p>\r\nFor example, <var>f</var>(165)
-  = 19, <var>f</var>(100100) = 142 and <var>f</var>(20!) = 4034872.\r\n</p>\r\n<p>\r\nFind
-  <var>f</var>(43!).\r\n</p>\r\n"
+  One can show that this triple is unique.\n\nFor example, <var>f</var>(165) = 19,
+  <var>f</var>(100100) = 142 and <var>f</var>(20!) = 4034872.\n\nFind <var>f</var>(43!).\n\n"

data/data/problems/419.yml

@@ -2,21 +2,16 @@
 :id: 419
 :name: Look and say sequence
 :url: http://projecteuler.net/problem=419
-:content: "\r\n<p>\r\nThe <b>look and say</b> sequence goes 1, 11, 21, 1211, 111221,
-  312211, 13112221, 1113213211, ...<br>\r\nThe sequence starts with 1 and all other
-  members are obtained by describing the previous member in terms of consecutive digits.<br>\r\nIt
-  helps to do this out loud:<br>\r\n1 is 'one one' <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\">
-  11<br>\r\n11 is 'two ones' <img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\"
-  alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 21<br>\r\n21 is 'one two
-  and one one' <img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\"
-  border=\"0\" style=\"vertical-align:middle;\"> 1211 <br>\r\n1211 is 'one one, one
-  two and two ones' <img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\"
-  alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 111221<br>\r\n111221 is
-  'three ones, two twos and one one' <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 312211<br>\r\n...\r\n</p>\r\n<p>\r\nDefine
-  A(n), B(n) and C(n) as the number of ones, twos and threes in the n'th element of
-  the sequence respectively.<br>\r\nOne can verify that A(40) = 31254, B(40) = 20259
-  and C(40) = 11625.\r\n</p>\r\n<p>\r\nFind A(n), B(n) and C(n) for n = 10<sup>12</sup>.<br>
-  \r\nGive your answer modulo 2<sup>30</sup> and separate your values for A, B and
-  C by a comma.<br> \r\nE.g. for n = 40 the answer would be 31254,20259,11625\r\n</p>\r\n\r\n\r\n"
+:content: "The **look and say** sequence goes 1, 11, 21, 1211, 111221, 312211, 13112221,
+  1113213211, ...  \n\rThe sequence starts with 1 and all other members are obtained
+  by describing the previous member in terms of consecutive digits.  \n\rIt helps
+  to do this out loud:  \n\r1 is 'one one' ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  11  \n\r11 is 'two ones' ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  21  \n\r21 is 'one two and one one' ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  1211   \n\r1211 is 'one one, one two and two ones' ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  111221  \n\r111221 is 'three ones, two twos and one one' ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  312211  \n\r...\n\nDefine A(n), B(n) and C(n) as the number of ones, twos and threes
+  in the n'th element of the sequence respectively.  \n\rOne can verify that A(40)
+  = 31254, B(40) = 20259 and C(40) = 11625.\n\nFind A(n), B(n) and C(n) for n = 10<sup>12</sup>.
+  \ \n \rGive your answer modulo 2<sup>30</sup> and separate your values for A, B
+  and C by a comma.  \n \rE.g. for n = 40 the answer would be 31254,20259,11625\n\n"

data/data/problems/42.yml

@@ -2,13 +2,12 @@
 :id: 42
 :name: Coded triangle numbers
 :url: http://projecteuler.net/problem=42
-:content: "\r\n<p>The <i>n</i><sup>th</sup> term of the sequence of triangle numbers
-  is given by, <i>t<sub>n</sub></i> = ½<i>n</i>(<i>n</i>+1); so the first ten triangle
-  numbers are:</p>\r\n<p style=\"text-align:center;\">1, 3, 6, 10, 15, 21, 28, 36,
-  45, 55, ...</p>\r\n<p>By converting each letter in a word to a number corresponding
-  to its alphabetical position and adding these values we form a word value. For example,
-  the word value for SKY is 19 + 11 + 25 = 55 = <i>t</i><sub>10</sub>. If the word
-  value is a triangle number then we shall call the word a triangle word.</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, how many are
-  triangle words?</p>\r\n"
+:content: |+
+  The _n_<sup>th</sup> term of the sequence of triangle numbers is given by, _t<sub>n</sub>_ = ½_n_(_n_+1); so the first ten triangle numbers are:
+
+  1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
+
+  By converting each letter in a word to a number corresponding to its alphabetical position and adding these values we form a word value. For example, the word value for SKY is 19 + 11 + 25 = 55 = _t_<sub>10</sub>. If the word value is a triangle number then we shall call the word a triangle word.
+
+  Using [words.txt](project/words.txt) (right click and 'Save Link/Target As...'), a 16K text file containing nearly two-thousand common English words, how many are triangle words?
+

data/data/problems/420.yml

@@ -2,12 +2,11 @@
 :id: 420
 :name: 2x2 positive integer matrix
 :url: http://projecteuler.net/problem=420
-:content: "\r\n<p>A <i>positive integer matrix</i> is a matrix whose elements are
-  all positive integers.<br>\r\nSome positive integer matrices can be expressed as
-  a square of a positive integer matrix in two different ways. Here is an example:</p>\r\n\r\n<div
-  align=\"center\">\r\n<img src=\"project/images/p_420_matrix.gif\">\n</div>\r\n\r\n<p>\r\nWe
+:content: "A _positive integer matrix_ is a matrix whose elements are all positive
+  integers.  \n\rSome positive integer matrices can be expressed as a square of a
+  positive integer matrix in two different ways. Here is an example:\n\n ![](/home/will/src/euler-manager/config/../data/images/p_420_matrix.gif)\n\nWe
   define F(<var>N</var>) as the number of the 2x2 positive integer matrices which
   have a <dfn title=\"the sum of the elements on the main diagonal\">trace</dfn> less
   than <var>N</var> and which can be expressed as a square of a positive integer matrix
-  in two different ways.<br>\r\nWe can verify that F(50) = 7 and F(1000) = 1019.\r\n</p>\r\n\r\n<p>\r\nFind
-  F(10<sup>7</sup>).\r\n</p>\r\n"
+  in two different ways.  \n\rWe can verify that F(50) = 7 and F(1000) = 1019.\n\nFind
+  F(10<sup>7</sup>).\n\n"