euler-manager 0.0.5 → 0.0.6

data/data/problems/380.yml

@@ -2,21 +2,18 @@
 :id: 380
 :name: Amazing Mazes!
 :url: http://projecteuler.net/problem=380
-:content: "\r\n<p>\r\nAn m<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">n maze is an m<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">n
+:content: "An m ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)n
+  maze is an m ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)n
   rectangular grid with walls placed between grid cells such that there is exactly
-  one path from the top-left square to any other square. <br>The following are examples
-  of a 9<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">12 maze and a 15<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">20
-  maze:\r\n</p>\r\n<p>\r\n<img src=\"project/images/p_380_mazes.gif\"></p>\r\n<p>\r\nLet
-  C(m,n) be the number of distinct m<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">n mazes. Mazes
-  which can be formed by rotation and reflection from another maze are considered
-  distinct.\r\n</p>\r\n<p>\r\nIt can be verified that C(1,1) = 1, C(2,2) = 4, C(3,4)
-  = 2415, and C(9,12) = 2.5720e46 (in scientific notation rounded to 5 significant
-  digits).<br>\r\nFind C(100,500) and write your answer in scientific notation rounded
-  to 5 significant digits.\r\n</p>\r\n<p>\r\nWhen giving your answer, use a lowercase
-  e to separate mantissa and exponent.\r\nE.g. if the answer is 1234567891011 then
-  the answer format would be 1.2346e12.\r\n\r\n</p> \r\n\r\n\r\n\r\n\r\n"
+  one path from the top-left square to any other square.   \nThe following are examples
+  of a 9 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)12
+  maze and a 15 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)20
+  maze:\n\n![](/home/will/src/euler-manager/config/../data/images/p_380_mazes.gif)\n\nLet
+  C(m,n) be the number of distinct m ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)n
+  mazes. Mazes which can be formed by rotation and reflection from another maze are
+  considered distinct.\n\nIt can be verified that C(1,1) = 1, C(2,2) = 4, C(3,4) =
+  2415, and C(9,12) = 2.5720e46 (in scientific notation rounded to 5 significant digits).
+  \ \n\rFind C(100,500) and write your answer in scientific notation rounded to 5
+  significant digits.\n\nWhen giving your answer, use a lowercase e to separate mantissa
+  and exponent.\rE.g. if the answer is 1234567891011 then the answer format would
+  be 1.2346e12.\n\n"

data/data/problems/381.yml

@@ -1,21 +1,15 @@
 ---
 :id: 381
-:name: "(prime-k) factorial"
+:name: (prime-k) factorial
 :url: http://projecteuler.net/problem=381
-:content: "\r\n<p>\r\nFor a prime p let S(p) = (<img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">(p-k)!)
-  mod(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;\">
-  5.\r\n</p>\r\n<p>\r\nFor example, if p=7,<br>\r\n(7-1)! + (7-2)! + (7-3)! + (7-4)!
-  + (7-5)! = 6! + 5! + 4! + 3! + 2! = 720+120+24+6+2 = 872.<br> \r\nAs 872 mod(7)
-  = 4, S(7) = 4.\r\n</p>\r\n<p>\r\nIt can be verified that <img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">S(p)
-  = 480 for 5 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"> p <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">
-  100.\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;\">S(p) for 5 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  p <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> 10<sup>8</sup>.\r\n</p>\r\n\r\n\r\n\r\n"
+:content: "For a prime p let S(p) = ( ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)(p-k)!)
+  mod(p) for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  k ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 5.\n\nFor
+  example, if p=7,  \n\r(7-1)! + (7-2)! + (7-3)! + (7-4)! + (7-5)! = 6! + 5! + 4!
+  + 3! + 2! = 720+120+24+6+2 = 872.  \n \rAs 872 mod(7) = 4, S(7) = 4.\n\nIt can be
+  verified that ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)S(p)
+  = 480 for 5 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  p ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 100.\n\nFind
+  ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)S(p) for
+  5 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) p ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  10<sup>8</sup>.\n\n"

data/data/problems/382.yml

@@ -2,22 +2,19 @@
 :id: 382
 :name: Generating polygons
 :url: http://projecteuler.net/problem=382
-:content: "\r\n<p>\r\nA <b>polygon</b> is a flat shape consisting of straight line
-  segments that are joined to form a closed chain or circuit. A polygon consists of
-  at least three sides and does not self-intersect.\r\n</p>\r\n\r\n<p>\r\nA set S
-  of positive numbers is said to <i>generate a polygon</i> P if:</p>\n<ul>\n<li> no
-  two sides of P are the same length,\r\n</li>\n<li> the length of every side of P
-  is in S, and\r\n</li>\n<li> S contains no other value.\r\n</li>\n</ul>\n<p>\r\nFor
-  example:<br>\r\nThe set {3, 4, 5} generates a polygon with sides 3, 4, and 5 (a
-  triangle).<br>\r\nThe set {6, 9, 11, 24} generates a polygon with sides 6, 9, 11,
-  and 24 (a quadrilateral).<br>\r\nThe sets {1, 2, 3} and {2, 3, 4, 9} do not generate
-  any polygon at all.<br></p>\r\n\r\n<p>\r\nConsider the sequence s, defined as follows:</p>\n<ul>\n<li>s<sub>1</sub>
-  = 1, s<sub>2</sub> = 2, s<sub>3</sub> = 3\r\n</li>\n<li>s<sub><var>n</var></sub>
-  = s<sub><var>n</var>-1</sub> + s<sub><var>n</var>-3</sub> for <var>n</var> <img
-  src=\"images/symbol_gt.gif\" width=\"10\" height=\"10\" alt=\"&gt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> 3.\r\n</li>\n</ul>\n<p>\r\nLet U<sub><var>n</var></sub>
-  be the set {s<sub>1</sub>, s<sub>2</sub>, ..., s<sub><var>n</var></sub>}. For example,
-  U<sub>10</sub> = {1, 2, 3, 4, 6, 9, 13, 19, 28, 41}.<br>\r\nLet f(<var>n</var>)
-  be the number of subsets of U<sub><var>n</var></sub> which generate at least one
-  polygon.<br>\r\nFor example, f(5) = 7, f(10) = 501 and f(25) = 18635853.\r\n</p>\r\n\r\n<p>\r\nFind
-  the last 9 digits of f(10<sup>18</sup>).\r\n</p>\r\n"
+:content: "A **polygon** is a flat shape consisting of straight line segments that
+  are joined to form a closed chain or circuit. A polygon consists of at least three
+  sides and does not self-intersect.\n\nA set S of positive numbers is said to _generate
+  a polygon_ P if:\n\n- no two sides of P are the same length,\r\n- the length of
+  every side of P is in S, and\r\n- S contains no other value.\r\n\nFor example:  \n\rThe
+  set {3, 4, 5} generates a polygon with sides 3, 4, and 5 (a triangle).  \n\rThe
+  set {6, 9, 11, 24} generates a polygon with sides 6, 9, 11, and 24 (a quadrilateral).
+  \ \n\rThe sets {1, 2, 3} and {2, 3, 4, 9} do not generate any polygon at all.\n\nConsider
+  the sequence s, defined as follows:\n\n- s<sub>1</sub> = 1, s<sub>2</sub> = 2, s<sub>3</sub>
+  = 3\r\n- s<sub><var>n</var></sub> = s<sub><var>n</var>-1</sub> + s<sub><var>n</var>-3</sub>
+  for <var>n</var> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)
+  3.\r\n\nLet U<sub><var>n</var></sub> be the set {s<sub>1</sub>, s<sub>2</sub>, ...,
+  s<sub><var>n</var></sub>}. For example, U<sub>10</sub> = {1, 2, 3, 4, 6, 9, 13,
+  19, 28, 41}.  \n\rLet f(<var>n</var>) be the number of subsets of U<sub><var>n</var></sub>
+  which generate at least one polygon.  \n\rFor example, f(5) = 7, f(10) = 501 and
+  f(25) = 18635853.\n\nFind the last 9 digits of f(10<sup>18</sup>).\n\n"

data/data/problems/383.yml

@@ -2,12 +2,10 @@
 :id: 383
 :name: Divisibility comparison between factorials
 :url: http://projecteuler.net/problem=383
-:content: "\r\n<p>\r\nLet f<sub>5</sub>(<var>n</var>) be the largest integer <var>x</var>
-  for which 5<sup><var>x</var></sup> divides <var>n</var>.<br>\r\nFor example, f<sub>5</sub>(625000)
-  = 7.\r\n</p>\r\n\r\n<p>\r\nLet T<sub>5</sub>(<var>n</var>) be the number of integers
-  <var>i</var> which satisfy f<sub>5</sub>((2·<var>i</var>-1)!) 5(<var>i</var>!) and
-  1 <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;\"><var>n</var>.<br>\r\nIt
-  can be verified that T<sub>5</sub>(10<sup>3</sup>) = 68 and T<sub>5</sub>(10<sup>9</sup>)
-  = 2408210.\r\n</p>\r\n\r\n<p>\r\nFind T<sub>5</sub>(10<sup>18</sup>).\r\n</p>\r\n"
+:content: "Let f<sub>5</sub>(<var>n</var>) be the largest integer <var>x</var> for
+  which 5<sup><var>x</var></sup> divides <var>n</var>.  \n\rFor example, f<sub>5</sub>(625000)
+  = 7.\n\nLet T<sub>5</sub>(<var>n</var>) be the number of integers <var>i</var> which
+  satisfy f<sub>5</sub>((2·<var>i</var>-1)!) 5(<var>i</var>!) and 1 ![≤](/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)
+  <var>n</var>.  \n\rIt can be verified that T<sub>5</sub>(10<sup>3</sup>) = 68 and
+  T<sub>5</sub>(10<sup>9</sup>) = 2408210.\n\nFind T<sub>5</sub>(10<sup>18</sup>).\n\n"

data/data/problems/384.yml

@@ -2,27 +2,23 @@
 :id: 384
 :name: Rudin-Shapiro sequence
 :url: http://projecteuler.net/problem=384
-:content: "\r\n<p>Define the sequence a(n) as the number of adjacent pairs of ones
-  in the binary expansion of n (possibly overlapping).\r\n<br>E.g.: a(5) = a(101<sub>2</sub>)
-  = 0, a(6) = a(110<sub>2</sub>) = 1, a(7) = a(111<sub>2</sub>) = 2</p>\r\n\r\n<p>Define
-  the sequence b(n) = (-1)<sup>a(n)</sup>.\r\n<br>This sequence is called the <b>Rudin-Shapiro</b>
-  sequence.</p>\r\n<p>Also consider the summatory sequence of b(n): <img src=\"project/images/p_384_formula.gif\"
-  style=\"margin-top:-9px;\">.</p>\r\n\r\n<p>The first couple of values of these sequences
-  are:\r\n<br><tt>n    &amp;nbsp   0 &amp;nbsp   1 &amp;nbsp   2 &amp;nbsp   3 &amp;nbsp
-    4 &amp;nbsp   5 &amp;nbsp   6 &amp;nbsp   7\r\n<br>a(n) &amp;nbsp   0 &amp;nbsp
-    0 &amp;nbsp   0 &amp;nbsp   1 &amp;nbsp   0 &amp;nbsp   0 &amp;nbsp   1 &amp;nbsp
-    2\r\n<br>b(n) &amp;nbsp   1 &amp;nbsp   1 &amp;nbsp   1 &amp;nbsp  -1 &amp;nbsp
-    1 &amp;nbsp   1 &amp;nbsp  -1 &amp;nbsp   1\r\n<br>s(n) &amp;nbsp   1 &amp;nbsp
-    2 &amp;nbsp   3 &amp;nbsp   2 &amp;nbsp   3 &amp;nbsp   4 &amp;nbsp   3 &amp;nbsp
-    4</tt></p>\r\n\r\n<p>The sequence s(n) has the remarkable property that all elements
-  are positive and every positive integer k occurs exactly k times.</p>\r\n\r\n<p>Define
-  g(t,c), with 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"> c <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  t, as the index in s(n) for which t occurs for the c'th time in s(n).\r\n<br>E.g.:
-  g(3,3) = 6, g(4,2) = 7 and g(54321,12345) = 1220847710.</p>\r\n\r\n<p>Let F(n) be
-  the fibonacci sequence defined by:\r\n<br>F(0)=F(1)=1 and\r\n<br>F(n)=F(n-1)+F(n-2)
-  for n&gt;1.</p>\r\n\r\n<p>Define GF(t)=g(F(t),F(t-1)).</p>\r\n\r\n<p>Find ΣGF(t)
-  for 2<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\">t<img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">45.</p>\r\n"
+:content: "Define the sequence a(n) as the number of adjacent pairs of ones in the
+  binary expansion of n (possibly overlapping).\r  \nE.g.: a(5) = a(101<sub>2</sub>)
+  = 0, a(6) = a(110<sub>2</sub>) = 1, a(7) = a(111<sub>2</sub>) = 2\n\nDefine the
+  sequence b(n) = (-1)<sup>a(n)</sup>.\r  \nThis sequence is called the **Rudin-Shapiro**
+  sequence.\n\nAlso consider the summatory sequence of b(n): ![](/home/will/src/euler-manager/config/../data/images/p_384_formula.gif).\n\nThe
+  first couple of values of these sequences are:\r  \n<tt>n    &amp;nbsp   0 &amp;nbsp
+    1 &amp;nbsp   2 &amp;nbsp   3 &amp;nbsp   4 &amp;nbsp   5 &amp;nbsp   6 &amp;nbsp
+    7\r\n<br>a(n) &amp;nbsp   0 &amp;nbsp   0 &amp;nbsp   0 &amp;nbsp   1 &amp;nbsp
+    0 &amp;nbsp   0 &amp;nbsp   1 &amp;nbsp   2\r\n<br>b(n) &amp;nbsp   1 &amp;nbsp
+    1 &amp;nbsp   1 &amp;nbsp  -1 &amp;nbsp   1 &amp;nbsp   1 &amp;nbsp  -1 &amp;nbsp
+    1\r\n<br>s(n) &amp;nbsp   1 &amp;nbsp   2 &amp;nbsp   3 &amp;nbsp   2 &amp;nbsp
+    3 &amp;nbsp   4 &amp;nbsp   3 &amp;nbsp   4</tt>\n\nThe sequence s(n) has the
+  remarkable property that all elements are positive and every positive integer k
+  occurs exactly k times.\n\nDefine g(t,c), with 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  c ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) t, as the
+  index in s(n) for which t occurs for the c'th time in s(n).\r  \nE.g.: g(3,3) =
+  6, g(4,2) = 7 and g(54321,12345) = 1220847710.\n\nLet F(n) be the fibonacci sequence
+  defined by:\r  \nF(0)=F(1)=1 and\r  \nF(n)=F(n-1)+F(n-2) for n>1.\n\nDefine GF(t)=g(F(t),F(t-1)).\n\nFind
+  ΣGF(t) for 2 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)t
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)45.\n\n"

data/data/problems/385.yml

@@ -2,21 +2,17 @@
 :id: 385
 :name: Ellipses inside triangles
 :url: http://projecteuler.net/problem=385
-:content: "\r\n<p>\r\nFor any triangle <var>T</var> in the plane, it can be shown
-  that there is a unique ellipse with largest area that is completely inside <var>T</var>.\r\n</p>\n<p
-  align=\"center\">\r\n<img src=\"project/images/p_385_ellipsetriangle.png\"></p>\r\n<p>\r\nFor
-  a given <var>n</var>, consider triangles <var>T</var> such that:<br>\r\n- the vertices
-  of <var>T</var> have integer coordinates with absolute value <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  n, and <br>\r\n- the <b>foci</b><sup>1</sup> of the largest-area ellipse inside
-  <var>T</var> are (<img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\"
-  alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">13,0) and (-<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">13,0).<br>\r\nLet
-  A(<var>n</var>) be the sum of the areas of all such triangles.\r\n</p>\r\n<p>\r\nFor
+:content: "For any triangle <var>T</var> in the plane, it can be shown that there
+  is a unique ellipse with largest area that is completely inside <var>T</var>.\n\n![](/home/will/src/euler-manager/config/../data/images/p_385_ellipsetriangle.png)\n\nFor
+  a given <var>n</var>, consider triangles <var>T</var> such that:  \n\r- the vertices
+  of <var>T</var> have integer coordinates with absolute value ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  n, and   \n\r- the **foci** <sup>1</sup> of the largest-area ellipse inside <var>T</var>
+  are ( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)13,0)
+  and (- ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)13,0).
+  \ \n\rLet A(<var>n</var>) be the sum of the areas of all such triangles.\n\nFor
   example, if <var>n</var> = 8, there are two such triangles. Their vertices are (-4,-3),(-4,3),(8,0)
   and (4,3),(4,-3),(-8,0), and the area of each triangle is 36. Thus A(8) = 36 + 36
-  = 72.\r\n</p>\r\n<p>\r\nIt can be verified that A(10) = 252, A(100) = 34632 and
-  A(1000) = 3529008.\r\n</p>\r\n<p>\r\nFind A(1 000 000 000).\r\n</p>\r\n<p>\r\n\r\n<sup>1</sup>The
-  <b>foci</b> (plural of <b>focus</b>) of an ellipse are two points A and B such that
-  for every point P on the boundary of the ellipse, <var>AP</var> + <var>PB</var>
-  is constant.\r\n\r\n\r\n</p>\r\n\r\n\r\n\r\n"
+  = 72.\n\nIt can be verified that A(10) = 252, A(100) = 34632 and A(1000) = 3529008.\n\nFind
+  A(1 000 000 000).\n\n<sup>1</sup>The **foci** (plural of **focus** ) of an ellipse
+  are two points A and B such that for every point P on the boundary of the ellipse,
+  <var>AP</var> + <var>PB</var> is constant.\n\n"

data/data/problems/386.yml

@@ -2,15 +2,13 @@
 :id: 386
 :name: Maximum length of an antichain
 :url: http://projecteuler.net/problem=386
-:content: "\r\n<p>Let <var>n</var> be an integer and <var>S</var>(<var>n</var>) be
-  the set of factors of <var>n</var>.</p>\r\n\r\n<p>A subset <var>A</var> of <var>S</var>(<var>n</var>)
-  is called an <b>antichain</b> of <var>S</var>(<var>n</var>) if <var>A</var> contains
+:content: "Let <var>n</var> be an integer and <var>S</var>(<var>n</var>) be the set
+  of factors of <var>n</var>.\n\nA subset <var>A</var> of <var>S</var>(<var>n</var>)
+  is called an **antichain** of <var>S</var>(<var>n</var>) if <var>A</var> contains
   only one element or if none of the elements of <var>A</var> divides any of the other
-  elements of <var>A</var>.</p>\r\n\r\n<p>For example: <var>S</var>(30) = {1, 2, 3,
-  5, 6, 10, 15, 30}\r\n<br>{2, 5, 6} is not an antichain of <var>S</var>(30).\r\n<br>{2,
-  3, 5} is an antichain of <var>S</var>(30).</p>\r\n\r\n<p>Let <var>N</var>(<var>n</var>)
-  be the maximum length of an antichain of <var>S</var>(<var>n</var>).</p>\r\n\r\n<p>Find
-  Σ<var>N</var>(<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>8</sup></p>\r\n"
+  elements of <var>A</var>.\n\nFor example: <var>S</var>(30) = {1, 2, 3, 5, 6, 10,
+  15, 30}\r  \n{2, 5, 6} is not an antichain of <var>S</var>(30).\r  \n{2, 3, 5} is
+  an antichain of <var>S</var>(30).\n\nLet <var>N</var>(<var>n</var>) be the maximum
+  length of an antichain of <var>S</var>(<var>n</var>).\n\nFind Σ<var>N</var>(<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>8</sup>\n\n"

data/data/problems/387.yml

@@ -2,18 +2,17 @@
 :id: 387
 :name: Harshad Numbers
 :url: http://projecteuler.net/problem=387
-:content: "\r\n<p>A <b>Harshad or Niven number</b> is a number that is divisible by
-  the sum of its digits.\r\n<br>201 is a Harshad number because it is divisible by
-  3 (the sum of its digits.)\r\n<br>When we truncate the last digit from 201, we get
-  20, which is a Harshad number.\r\n<br>When we truncate the last digit from 20, we
-  get 2, which is also a Harshad number.\r\n<br>Let's call a Harshad number that,
-  while recursively truncating the last digit, always results in a Harshad number
-  a <i>right truncatable Harshad number.</i></p>  \r\n\r\n<p>Also:\r\n<br>201/3=67
-  which is prime.\r\n<br>Let's call a Harshad number that, when divided by the sum
-  of its digits, results in a prime a <i>strong Harshad number</i>.</p>\r\n\r\n<p>Now
-  take the number 2011 which is prime.\r\n<br>When we truncate the last digit from
-  it we get 201, a strong Harshad number that is also right truncatable.\r\n<br>Let's
-  call such primes <i>strong, right truncatable Harshad primes</i>.</p>\r\n\r\n<p>You
-  are given that the sum of the strong, right truncatable Harshad primes less than
-  10000 is 90619.</p>\r\n\r\n<p>Find the sum of the strong, right truncatable Harshad
-  primes less than 10<sup>14</sup>.</p>\r\n"
+:content: "A **Harshad or Niven number** is a number that is divisible by the sum
+  of its digits.\r  \n201 is a Harshad number because it is divisible by 3 (the sum
+  of its digits.)\r  \nWhen we truncate the last digit from 201, we get 20, which
+  is a Harshad number.\r  \nWhen we truncate the last digit from 20, we get 2, which
+  is also a Harshad number.\r  \nLet's call a Harshad number that, while recursively
+  truncating the last digit, always results in a Harshad number a _right truncatable
+  Harshad number._\n\nAlso:\r  \n201/3=67 which is prime.\r  \nLet's call a Harshad
+  number that, when divided by the sum of its digits, results in a prime a _strong
+  Harshad number_.\n\nNow take the number 2011 which is prime.\r  \nWhen we truncate
+  the last digit from it we get 201, a strong Harshad number that is also right truncatable.\r
+  \ \nLet's call such primes _strong, right truncatable Harshad primes_.\n\nYou are
+  given that the sum of the strong, right truncatable Harshad primes less than 10000
+  is 90619.\n\nFind the sum of the strong, right truncatable Harshad primes less than
+  10<sup>14</sup>.\n\n"

data/data/problems/388.yml

@@ -2,11 +2,9 @@
 :id: 388
 :name: Distinct Lines
 :url: http://projecteuler.net/problem=388
-:content: "\r\n<p>\r\nConsider all lattice points (a,b,c) with 0 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  a,b,c <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> N.\r\n</p>\r\n<p>\r\nFrom the origin O(0,0,0)
-  all lines are drawn to the other lattice points.<br>\r\nLet D(N) be the number of
-  <i>distinct</i> such lines.\r\n</p>\r\n<p>\r\nYou are given that D(1 000 000) =
-  831909254469114121.\r\n</p>\n<p>\r\nFind D(10<sup>10</sup>). Give as your answer
-  the first nine digits followed by the last nine digits.\r\n</p>\r\n\r\n\r\n\r\n"
+:content: "Consider all lattice points (a,b,c) with 0 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  a,b,c ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) N.\n\nFrom
+  the origin O(0,0,0) all lines are drawn to the other lattice points.  \n\rLet D(N)
+  be the number of _distinct_ such lines.\n\nYou are given that D(1 000 000) = 831909254469114121.\n\nFind
+  D(10<sup>10</sup>). Give as your answer the first nine digits followed by the last
+  nine digits.\n\n"

data/data/problems/389.yml

@@ -2,11 +2,11 @@
 :id: 389
 :name: Platonic Dice
 :url: http://projecteuler.net/problem=389
-:content: "\r\n<p>\r\nAn unbiased single 4-sided die is thrown and its value, <var>T</var>,
-  is noted.<br><var>T</var> unbiased 6-sided dice are thrown and their scores are
-  added together. The sum, <var>C</var>, is noted.<br><var>C</var> unbiased 8-sided
-  dice are thrown and their scores are added together. The sum, <var>O</var>, is noted.<br><var>O</var>
-  unbiased 12-sided dice are thrown and their scores are added together. The sum,
-  <var>D</var>, is noted.<br><var>D</var> unbiased 20-sided dice are thrown and their
-  scores are added together. The sum, <var>I</var>, is noted.<br>\r\nFind the variance
-  of <var>I</var>, and give your answer rounded to 4 decimal places.\r\n</p>\r\n"
+:content: "An unbiased single 4-sided die is thrown and its value, <var>T</var>, is
+  noted.  \n<var>T</var> unbiased 6-sided dice are thrown and their scores are added
+  together. The sum, <var>C</var>, is noted.  \n<var>C</var> unbiased 8-sided dice
+  are thrown and their scores are added together. The sum, <var>O</var>, is noted.
+  \ \n<var>O</var> unbiased 12-sided dice are thrown and their scores are added together.
+  The sum, <var>D</var>, is noted.  \n<var>D</var> unbiased 20-sided dice are thrown
+  and their scores are added together. The sum, <var>I</var>, is noted.  \n\rFind
+  the variance of <var>I</var>, and give your answer rounded to 4 decimal places.\n\n"

data/data/problems/39.yml

@@ -2,9 +2,10 @@
 :id: 39
 :name: Integer right triangles
 :url: http://projecteuler.net/problem=39
-:content: "\r\n<p>If <i>p</i> is the perimeter of a right angle triangle with integral
-  length sides, {<i>a</i>,<i>b</i>,<i>c</i>}, there are exactly three solutions for
-  <i>p</i> = 120.</p>\r\n<p style=\"\\'text-align:center;\\'\">{20,48,52}, {24,45,51},
-  {30,40,50}</p>\r\n<p>For which value of <i>p</i> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  1000, is the number of solutions maximised?</p>\r\n\r\n"
+:content: |+
+  If _p_ is the perimeter of a right angle triangle with integral length sides, {_a_,_b_,_c_}, there are exactly three solutions for _p_ = 120.
+
+  {20,48,52}, {24,45,51}, {30,40,50}
+
+  For which value of _p_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 1000, is the number of solutions maximised?
+

data/data/problems/390.yml

@@ -2,17 +2,12 @@
 :id: 390
 :name: Triangles with non rational sides and integral area
 :url: http://projecteuler.net/problem=390
-:content: "\r\n<p>Consider the triangle with sides <img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">5,
-  <img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">65 and <img src=\"images/symbol_radic.gif\" width=\"14\"
-  height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">68.\r\nIt
-  can be shown that this triangle has area 9.</p>\r\n\r\n<p>S(n) is the sum of the
-  areas of  all triangles with sides <img src=\"images/symbol_radic.gif\" width=\"14\"
-  height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">(1+b<sup>2</sup>),
-  <img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">(1+c<sup>2</sup>) and <img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">(b<sup>2</sup>+c<sup>2</sup>)
-  (for positive integers b and c ) that have an integral area not exceeding n.</p>\r\n\r\n<p>The
-  example triangle has b=2 and c=8.</p>\r\n\r\n<p>S(10<sup>6</sup>)=18018206.</p>\r\n\r\n<p>Find
-  S(10<sup>10</sup>).</p>\r\n"
+:content: "Consider the triangle with sides ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)5,
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)65 and
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)68.\rIt
+  can be shown that this triangle has area 9.\n\nS(n) is the sum of the areas of all
+  triangles with sides ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)(1+b<sup>2</sup>),
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)(1+c<sup>2</sup>)
+  and ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)(b<sup>2</sup>+c<sup>2</sup>)
+  (for positive integers b and c ) that have an integral area not exceeding n.\n\nThe
+  example triangle has b=2 and c=8.\n\nS(10<sup>6</sup>)=18018206.\n\nFind S(10<sup>10</sup>).\n\n"

data/data/problems/391.yml

@@ -2,28 +2,24 @@
 :id: 391
 :name: Hopping Game
 :url: http://projecteuler.net/problem=391
-:content: "\r\n<p>\r\nLet <var>s<sub>k</sub></var> be the number of 1’s when writing
-  the numbers from 0 to <var>k</var> in binary.<br>\r\nFor example, writing 0 to 5
-  in binary, we have 0, 1, 10, 11, 100, 101. There are seven 1’s, so <var>s</var><sub>5</sub>
-  = 7.<br>\r\nThe sequence S = {<var>s<sub>k</sub></var> : <var>k</var> <img src=\"images/symbol_ge.gif\"
-  width=\"10\" height=\"12\" alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\">
-  0} starts {0, 1, 2, 4, 5, 7, 9, 12, ...}.<br></p>\r\n\r\n<p>\r\nA game is played
-  by two players. Before the game starts, a number <var>n</var> is chosen. A counter
-  <var>c</var> starts at 0. At each turn, the player chooses a number from 1 to <var>n</var>
-  (inclusive) and increases <var>c</var> by that number. The resulting value of <var>c</var>
-  must be a member of S. If there are no more valid moves, the player loses.\r\n</p>\r\n\r\n<p>\r\nFor
-  example:<br>\r\nLet <var>n</var> = 5. <var>c</var> starts at 0.<br>\r\nPlayer 1
-  chooses 4, so <var>c</var> becomes 0 + 4 = 4.<br>\r\nPlayer 2 chooses 5, so <var>c</var>
-  becomes 4 + 5 = 9.<br>\r\nPlayer 1 chooses 3, so <var>c</var> becomes 9 + 3 = 12.<br>\r\netc.<br>\r\nNote
-  that <var>c</var> must always belong to S, and each player can increase <var>c</var>
-  by at most <var>n</var>.\r\n</p>\r\n\r\n<p>\r\nLet M(<var>n</var>) be the highest
-  number the first player can choose at her first turn to force a win, and M(<var>n</var>)
-  = 0 if there is no such move. For example, M(2) = 2, M(7) = 1 and M(20) = 4.\r\n</p>\r\n\r\n<p>\r\nGiven
-  Σ(M(<var>n</var>))<sup>3</sup> = 8150 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;\"> 20.\r\n</p>\r\n\r\n<p>\r\nFind Σ(M(<var>n</var>))<sup>3</sup>
-  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;\">
-  1000.\r\n</p>\r\n"
+:content: "Let <var>s<sub>k</sub></var> be the number of 1’s when writing the numbers
+  from 0 to <var>k</var> in binary.  \n\rFor example, writing 0 to 5 in binary, we
+  have 0, 1, 10, 11, 100, 101. There are seven 1’s, so <var>s</var><sub>5</sub> =
+  7.  \n\rThe sequence S = {<var>s<sub>k</sub></var> : <var>k</var> ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  0} starts {0, 1, 2, 4, 5, 7, 9, 12, ...}.\n\nA game is played by two players. Before
+  the game starts, a number <var>n</var> is chosen. A counter <var>c</var> starts
+  at 0. At each turn, the player chooses a number from 1 to <var>n</var> (inclusive)
+  and increases <var>c</var> by that number. The resulting value of <var>c</var> must
+  be a member of S. If there are no more valid moves, the player loses.\n\nFor example:
+  \ \n\rLet <var>n</var> = 5. <var>c</var> starts at 0.  \n\rPlayer 1 chooses 4, so
+  <var>c</var> becomes 0 + 4 = 4.  \n\rPlayer 2 chooses 5, so <var>c</var> becomes
+  4 + 5 = 9.  \n\rPlayer 1 chooses 3, so <var>c</var> becomes 9 + 3 = 12.  \n\retc.
+  \ \n\rNote that <var>c</var> must always belong to S, and each player can increase
+  <var>c</var> by at most <var>n</var>.\n\nLet M(<var>n</var>) be the highest number
+  the first player can choose at her first turn to force a win, and M(<var>n</var>)
+  = 0 if there is no such move. For example, M(2) = 2, M(7) = 1 and M(20) = 4.\n\nGiven
+  Σ(M(<var>n</var>))<sup>3</sup> = 8150 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)
+  20.\n\nFind Σ(M(<var>n</var>))<sup>3</sup> 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)
+  1000.\n\n"

data/data/problems/392.yml

@@ -2,21 +2,20 @@
 :id: 392
 :name: Enmeshed unit circle
 :url: http://projecteuler.net/problem=392
-:content: "\r\n<p>\r\nA rectilinear grid is an orthogonal grid where the spacing between
-  the gridlines does not have to be equidistant.<br>\r\nAn example of such grid is
-  logarithmic graph paper.\r\n</p>\r\n<p>\r\nConsider rectilinear grids in the Cartesian
-  coordinate system with the following properties:<br></p>\n<ul>\n<li>The gridlines
-  are parallel to the axes of the Cartesian coordinate system.</li>\n<li>There are
-  N+2 vertical and N+2 horizontal gridlines. Hence there are (N+1) x (N+1) rectangular
-  cells.</li>\n<li>The equations of the two outer vertical gridlines are x = -1 and
-  x = 1.</li>\n<li>The equations of the two outer horizontal gridlines are y = -1
-  and y = 1.</li>\n<li>The grid cells are colored red if they overlap with the <dfn
-  title=\"The unit circle is the circle that has radius 1 and is centered at the origin\">unit
-  circle</dfn>, black otherwise.</li>\n</ul>For this problem we would like you to
-  find the postions of the remaining N inner horizontal and N inner vertical gridlines
-  so that the area occupied by the red cells is minimized.\r\n\r\n<p>\r\nE.g. here
-  is a picture of the solution for N = 10:\r\n</p>\n<p align=\"center\">\r\n<img src=\"project/images/p392_gridlines.png\"></p>\r\n\r\n\r\nThe
+:content: "A rectilinear grid is an orthogonal grid where the spacing between the
+  gridlines does not have to be equidistant.  \n\rAn example of such grid is logarithmic
+  graph paper.\n\nConsider rectilinear grids in the Cartesian coordinate system with
+  the following properties:\n\n- The gridlines are parallel to the axes of the Cartesian
+  coordinate system.\n- There are N+2 vertical and N+2 horizontal gridlines. Hence
+  there are (N+1) x (N+1) rectangular cells.\n- The equations of the two outer vertical
+  gridlines are x = -1 and x = 1.\n- The equations of the two outer horizontal gridlines
+  are y = -1 and y = 1.\n- The grid cells are colored red if they overlap with the
+  <dfn title=\"The unit circle is the circle that has radius 1 and is centered at
+  the origin\">unit circle</dfn>, black otherwise.\nFor this problem we would like
+  you to find the postions of the remaining N inner horizontal and N inner vertical
+  gridlines so that the area occupied by the red cells is minimized.\r\r\n\nE.g. here
+  is a picture of the solution for N = 10:\n\n![](/home/will/src/euler-manager/config/../data/images/p392_gridlines.png)\n\n\r\r\rThe
   area occupied by the red cells for N = 10 rounded to 10 digits behind the decimal
-  point is 3.3469640797.\r\n\r\n<p>\r\nFind the positions for N = 400.<br> \r\nGive
-  as your answer the area occupied by the red cells rounded to 10 digits behind the
-  decimal point.\r\n</p>\r\n\r\n"
+  point is 3.3469640797.\r\r\n\nFind the positions for N = 400.  \n \rGive as your
+  answer the area occupied by the red cells rounded to 10 digits behind the decimal
+  point.\n\n"

data/data/problems/393.yml

@@ -2,11 +2,10 @@
 :id: 393
 :name: Migrating ants
 :url: http://projecteuler.net/problem=393
-:content: "\r\n<p>\r\nAn  <var>n</var><img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>
-  grid of squares contains  <var>n</var><sup>2</sup> ants, one ant per square.<br>\r\nAll
+:content: "An <var>n</var> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)<var>n</var>
+  grid of squares contains <var>n</var><sup>2</sup> ants, one ant per square.  \n\rAll
   ants decide to move simultaneously to an adjacent square (usually 4 possibilities,
-  except for ants on the edge of the grid or at the corners).<br>\r\nWe define <var>f</var>(<var>n</var>)
+  except for ants on the edge of the grid or at the corners).  \n\rWe define <var>f</var>(<var>n</var>)
   to be the number of ways this can happen without any ants ending on the same square
-  and without any two ants crossing the same edge between two squares.\r\n</p>\r\n<p>\r\nYou
-  are given that <var>f</var>(4) = 88.<br>\r\nFind  <var>f</var>(10).\r\n</p>\r\n\r\n"
+  and without any two ants crossing the same edge between two squares.\n\nYou are
+  given that <var>f</var>(4) = 88.  \n\rFind <var>f</var>(10).\n\n"

data/data/problems/394.yml

@@ -2,21 +2,18 @@
 :id: 394
 :name: Eating pie
 :url: http://projecteuler.net/problem=394
-:content: "\r\n<p>\r\nJeff eats a pie in an unusual way.<br>\r\nThe pie is circular.
-  He starts with slicing an initial cut in the pie along a radius.<br>\r\nWhile there
-  is at least a given fraction <var>F</var> of pie left, he performs the following
-  procedure:<br>\r\n- He makes two slices from the pie centre to any point of what
-  is remaining of the pie border, any point on the remaining pie border equally likely.
-  This will divide the remaining pie into three pieces.<br> \r\n- Going counterclockwise
-  from the initial cut, he takes the first two pie pieces and eats them.<br>\r\nWhen
-  less than a fraction <var>F</var> of pie remains, he does not repeat this procedure.
-  Instead, he eats all of the remaining pie.\r\n</p>\r\n<p align=\"center\">\r\n<img
-  src=\"project/images/p_394_eatpie.gif\"></p>\r\n\r\n\r\n<p>\r\nFor <var>x</var>
-  <img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\" border=\"0\"
-  style=\"vertical-align:middle;\"> 1, let E(<var>x</var>) be the expected number
-  of times Jeff repeats the procedure above with <var>F</var> = <sup>1</sup>/<sub><var>x</var></sub>.<br>\r\nIt
-  can be verified that  E(1) = 1, E(2) <img src=\"images/symbol_asymp.gif\" width=\"11\"
-  height=\"9\" alt=\"≈\" border=\"0\" style=\"vertical-align:middle;\"> 1.2676536759,
-  and E(7.5) <img src=\"images/symbol_asymp.gif\" width=\"11\" height=\"9\" alt=\"≈\"
-  border=\"0\" style=\"vertical-align:middle;\"> 2.1215732071.\r\n</p>\r\n<p>\r\nFind
-  E(40) rounded to 10 decimal places behind the decimal point.\r\n</p>\r\n\r\n\r\n"
+:content: "Jeff eats a pie in an unusual way.  \n\rThe pie is circular. He starts
+  with slicing an initial cut in the pie along a radius.  \n\rWhile there is at least
+  a given fraction <var>F</var> of pie left, he performs the following procedure:
+  \ \n\r- He makes two slices from the pie centre to any point of what is remaining
+  of the pie border, any point on the remaining pie border equally likely. This will
+  divide the remaining pie into three pieces.  \n \r- Going counterclockwise from
+  the initial cut, he takes the first two pie pieces and eats them.  \n\rWhen less
+  than a fraction <var>F</var> of pie remains, he does not repeat this procedure.
+  Instead, he eats all of the remaining pie.\n\n![](/home/will/src/euler-manager/config/../data/images/p_394_eatpie.gif)\n\nFor
+  <var>x</var> ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  1, let E(<var>x</var>) be the expected number of times Jeff repeats the procedure
+  above with <var>F</var> = <sup>1</sup>/<sub><var>x</var></sub>.  \n\rIt can be verified
+  that E(1) = 1, E(2) ![≈](/home/will/src/euler-manager/config/../data/images/symbol_asymp.gif)
+  1.2676536759, and E(7.5) ![≈](/home/will/src/euler-manager/config/../data/images/symbol_asymp.gif)
+  2.1215732071.\n\nFind E(40) rounded to 10 decimal places behind the decimal point.\n\n"