euler-manager 0.0.5 → 0.0.6

data/data/problems/202.yml

@@ -2,13 +2,14 @@
 :id: 202
 :name: Laserbeam
 :url: http://projecteuler.net/problem=202
-:content: "\r\n<p>Three mirrors are arranged in the shape of an equilateral triangle,
-  with their reflective surfaces pointing inwards. There is an infinitesimal gap at
-  each vertex of the triangle through which a laser beam may pass.</p>\r\n\r\n<p>Label
-  the vertices A, B and C. There are 2 ways in which a laser beam may enter vertex
-  C, bounce off 11 surfaces, then exit through the same vertex: one way is shown below;
-  the other is the reverse of that.</p>\r\n\r\n<div style=\"text-align:center;\">\r\n
-  \ <img src=\"project/images/p_201_laserbeam.gif\" alt=\"\">\n</div>\r\n\r\n<p>There
-  are 80840 ways in which a laser beam may enter vertex C, bounce off 1000001 surfaces,
-  then exit through the same vertex.</p>\r\n\r\n<p>In how many ways can a laser beam
-  enter at vertex C, bounce off 12017639147 surfaces, then exit through the same vertex?</p>\r\n"
+:content: |+
+  Three mirrors are arranged in the shape of an equilateral triangle, with their reflective surfaces pointing inwards. There is an infinitesimal gap at each vertex of the triangle through which a laser beam may pass.
+
+  Label the vertices A, B and C. There are 2 ways in which a laser beam may enter vertex C, bounce off 11 surfaces, then exit through the same vertex: one way is shown below; the other is the reverse of that.
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_201_laserbeam.gif)
+
+  There are 80840 ways in which a laser beam may enter vertex C, bounce off 1000001 surfaces, then exit through the same vertex.
+
+  In how many ways can a laser beam enter at vertex C, bounce off 12017639147 surfaces, then exit through the same vertex?
+

data/data/problems/203.yml

@@ -2,20 +2,15 @@
 :id: 203
 :name: Squarefree Binomial Coefficients
 :url: http://projecteuler.net/problem=203
-:content: "\r\n<p>The binomial coefficients <sup>n</sup>C<sub>k</sub> can be arranged
-  in triangular form, Pascal's triangle, like this:</p>\r\n\r\n<div style=\"text-align:center;\">\r\n<table
-  align=\"center\">\n<tr>\n<td colspan=\"7\"></td>\n<td>1</td>\n<td colspan=\"7\"></td>\n</tr>\n<tr>\n<td
-  colspan=\"6\"></td>\n<td>1</td>\n<td></td>\n<td>1</td>\n<td colspan=\"6\"></td>\n</tr>\n<tr>\n<td
-  colspan=\"5\"></td>\n<td>1</td>\n<td></td>\n<td>2</td>\n<td></td>\n<td>1</td>\n<td
-  colspan=\"5\"></td>\n</tr>\n<tr>\n<td colspan=\"4\"></td>\n<td>1</td>\n<td></td>\n<td>3</td>\n<td></td>\n<td>3</td>\n<td></td>\n<td>1</td>\n<td
-  colspan=\"4\"></td>\n</tr>\n<tr>\n<td colspan=\"3\"></td>\n<td>1</td>\n<td></td>\n<td>4</td>\n<td></td>\n<td>6</td>\n<td></td>\n<td>4</td>\n<td></td>\n<td>1</td>\n<td
-  colspan=\"3\"></td>\n</tr>\n<tr>\n<td colspan=\"2\"></td>\n<td>1</td>\n<td></td>\n<td>5</td>\n<td></td>\n<td>10</td>\n<td></td>\n<td>10</td>\n<td></td>\n<td>5</td>\n<td></td>\n<td>1</td>\n<td
-  colspan=\"2\"></td>\n</tr>\n<tr>\n<td colspan=\"1\"></td>\n<td>1</td>\n<td></td>\n<td>6</td>\n<td></td>\n<td>15</td>\n<td></td>\n<td>20</td>\n<td></td>\n<td>15</td>\n<td></td>\n<td>6</td>\n<td></td>\n<td>1</td>\n<td
-  colspan=\"1\"></td>\n</tr>\n<tr>\n<td>1</td>\n<td></td>\n<td>7</td>\n<td></td>\n<td>21</td>\n<td></td>\n<td>35</td>\n<td></td>\n<td>35</td>\n<td></td>\n<td>21</td>\n<td></td>\n<td>7</td>\n<td></td>\n<td>1</td>\n</tr>\n</table>\r\n.........\r\n</div>\r\n\r\n<p>It
+:content: "The binomial coefficients <sup>n</sup>C<sub>k</sub> can be arranged in
+  triangular form, Pascal's triangle, like this:\n\n| | 1 | |\n| | 1 | | 1 | |\n|
+  | 1 | | 2 | | 1 | |\n| | 1 | | 3 | | 3 | | 1 | |\n| | 1 | | 4 | | 6 | | 4 | | 1
+  | |\n| | 1 | | 5 | | 10 | | 10 | | 5 | | 1 | |\n| | 1 | | 6 | | 15 | | 20 | | 15
+  | | 6 | | 1 | |\n| 1 | | 7 | | 21 | | 35 | | 35 | | 21 | | 7 | | 1 |\n\n\r.........\r\n\nIt
   can be seen that the first eight rows of Pascal's triangle contain twelve distinct
-  numbers: 1, 2, 3, 4, 5, 6, 7, 10, 15, 20, 21 and 35.</p>\r\n\r\n<p>A positive integer
-  <var>n</var> is called squarefree if no square of a prime divides <var>n</var>.\r\nOf
-  the twelve distinct numbers in the first eight rows of Pascal's triangle, all except
-  4 and 20 are squarefree.\r\nThe sum of the distinct squarefree numbers in the first
-  eight rows is 105.</p>\r\n\r\n<p>Find the sum of the distinct squarefree numbers
-  in the first 51 rows of Pascal's triangle.</p>\r\n"
+  numbers: 1, 2, 3, 4, 5, 6, 7, 10, 15, 20, 21 and 35.\n\nA positive integer <var>n</var>
+  is called squarefree if no square of a prime divides <var>n</var>.\rOf the twelve
+  distinct numbers in the first eight rows of Pascal's triangle, all except 4 and
+  20 are squarefree.\rThe sum of the distinct squarefree numbers in the first eight
+  rows is 105.\n\nFind the sum of the distinct squarefree numbers in the first 51
+  rows of Pascal's triangle.\n\n"

data/data/problems/204.yml

@@ -2,10 +2,10 @@
 :id: 204
 :name: Generalised Hamming Numbers
 :url: http://projecteuler.net/problem=204
-:content: "\r\n<p>A Hamming number is a positive number which has no prime factor
-  larger than 5.<br>\r\nSo the first few Hamming numbers are 1, 2, 3, 4, 5, 6, 8,
-  9, 10, 12, 15.<br>\r\nThere are 1105 Hamming numbers not exceeding 10<sup>8</sup>.</p>\r\n\r\n<p>We
-  will call a positive number a generalised Hamming number of type <var>n</var>, if
-  it has no prime factor larger than <var>n</var>.<br>\r\nHence the Hamming numbers
-  are the generalised Hamming numbers of type 5.</p>\r\n\r\n<p>How many generalised
-  Hamming numbers of type 100 are there which don't exceed 10<sup>9</sup>?</p>\r\n"
+:content: "A Hamming number is a positive number which has no prime factor larger
+  than 5.  \n\rSo the first few Hamming numbers are 1, 2, 3, 4, 5, 6, 8, 9, 10, 12,
+  15.  \n\rThere are 1105 Hamming numbers not exceeding 10<sup>8</sup>.\n\nWe will
+  call a positive number a generalised Hamming number of type <var>n</var>, if it
+  has no prime factor larger than <var>n</var>.  \n\rHence the Hamming numbers are
+  the generalised Hamming numbers of type 5.\n\nHow many generalised Hamming numbers
+  of type 100 are there which don't exceed 10<sup>9</sup>?\n\n"

data/data/problems/205.yml

@@ -2,9 +2,9 @@
 :id: 205
 :name: Dice Game
 :url: http://projecteuler.net/problem=205
-:content: "\r\n<p>Peter has nine four-sided (pyramidal) dice, each with faces numbered
-  1, 2, 3, 4.<br>\r\nColin has six six-sided (cubic) dice, each with faces numbered
-  1, 2, 3, 4, 5, 6.</p>\r\n\r\n<p>Peter and Colin roll their dice and compare totals:
-  the highest total wins. The result is a draw if the totals are equal.</p>\r\n\r\n<p>What
-  is the probability that Pyramidal Pete beats Cubic Colin? Give your answer rounded
-  to seven decimal places in the form 0.abcdefg</p>\r\n"
+:content: "Peter has nine four-sided (pyramidal) dice, each with faces numbered 1,
+  2, 3, 4.  \n\rColin has six six-sided (cubic) dice, each with faces numbered 1,
+  2, 3, 4, 5, 6.\n\nPeter and Colin roll their dice and compare totals: the highest
+  total wins. The result is a draw if the totals are equal.\n\nWhat is the probability
+  that Pyramidal Pete beats Cubic Colin? Give your answer rounded to seven decimal
+  places in the form 0.abcdefg\n\n"

data/data/problems/206.yml

@@ -2,5 +2,5 @@
 :id: 206
 :name: Concealed Square
 :url: http://projecteuler.net/problem=206
-:content: "\r\n<p>Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0,<br>
-  where each “_” is a single digit.</p>\r\n"
+:content: "Find the unique positive integer whose square has the form 1\\_2\\_3\\_4\\_5\\_6\\_7\\_8\\_9\\_0,
+  \ \n where each “\\_” is a single digit.\n\n"

data/data/problems/207.yml

@@ -2,19 +2,16 @@
 :id: 207
 :name: Integer partition equations
 :url: http://projecteuler.net/problem=207
-:content: "\r\n<p>For some positive integers <var>k</var>, there exists an integer
-  partition of the form   4<sup>t</sup> = 2<sup>t</sup> + <var>k</var>,<br>\r\nwhere
-  4<sup>t</sup>, 2<sup>t</sup>, and <var>k</var> are all positive integers and <var>t</var>
-  is a real number.</p>\r\n\r\n<p>The first two such partitions are 4<sup>1</sup>
-  = 2<sup>1</sup> + 2 and 4<sup>1.5849625...</sup> = 2<sup>1.5849625...</sup> + 6.</p>\r\n\r\n<p>Partitions
-  where <var>t</var> is also an integer are called <i>perfect</i>.<br> \r\nFor any
-  <var>m</var> <img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\"
-  border=\"0\" style=\"vertical-align:middle;\"> 1 let P(<var>m</var>) be the proportion
-  of such partitions that are perfect with <var>k</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>m</var>.<br>\r\nThus
-  P(6) = 1/2.</p>\r\n\r\n<p>In the following table are listed some values of P(<var>m</var>)</p>\r\n<p>   P(5)
-  = 1/1<br>\r\n   P(10) = 1/2<br>\r\n   P(15) = 2/3<br>\r\n   P(20) = 1/2<br>\r\n   P(25)
-  = 1/2<br>\r\n   P(30) = 2/5<br>\r\n   ...<br>\r\n   P(180) = 1/4<br>\r\n   P(185)
-  = 3/13</p>\r\n\r\n\r\n<p>Find the smallest <var>m</var> for which P(<var>m</var>)
-  <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> 1/12345</p>\r\n"
+:content: "For some positive integers <var>k</var>, there exists an integer partition
+  of the form   4<sup>t</sup> = 2<sup>t</sup> + <var>k</var>,  \n\rwhere 4<sup>t</sup>,
+  2<sup>t</sup>, and <var>k</var> are all positive integers and <var>t</var> is a
+  real number.\n\nThe first two such partitions are 4<sup>1</sup> = 2<sup>1</sup>
+  + 2 and 4<sup>1.5849625...</sup> = 2<sup>1.5849625...</sup> + 6.\n\nPartitions where
+  <var>t</var> is also an integer are called _perfect_.  \n \rFor any <var>m</var>
+  ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif) 1 let P(<var>m</var>)
+  be the proportion of such partitions that are perfect with <var>k</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>m</var>.  \n\rThus P(6) = 1/2.\n\nIn the following table are listed some values
+  of P(<var>m</var>)\n\n   P(5) = 1/1  \n\r   P(10) = 1/2  \n\r   P(15) = 2/3  \n\r   P(20)
+  = 1/2  \n\r   P(25) = 1/2  \n\r   P(30) = 2/5  \n\r   ...  \n\r   P(180) = 1/4  \n\r   P(185)
+  = 3/13\n\nFind the smallest <var>m</var> for which P(<var>m</var>) ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  1/12345\n\n"

data/data/problems/208.yml

@@ -2,11 +2,11 @@
 :id: 208
 :name: Robot Walks
 :url: http://projecteuler.net/problem=208
-:content: "\r\n<p>A robot moves in a series of one-fifth circular arcs (72°), with
-  a free choice of a clockwise or an anticlockwise arc for each step, but no turning
-  on the spot.</p>\r\n\r\n<p>One of 70932 possible closed paths of 25 arcs starting
-  northward is</p>\r\n<div style=\"text-align:center;\">\r\n<img src=\"http://projecteuler.net/project/images/p_208_robotwalk.gif\"
-  alt=\"\">\n</div>\r\n\r\n<p>Given that the robot starts facing North, how many journeys
-  of 70 arcs in length can it take that return it, after the final arc, to its starting
-  position?<br><!--(Journeys are allowed to return multiple times to the start.)-->\r\n(Any
-  arc may be traversed multiple times.) \r\n</p>\r\n\r\n"
+:content: "A robot moves in a series of one-fifth circular arcs (72°), with a free
+  choice of a clockwise or an anticlockwise arc for each step, but no turning on the
+  spot.\n\nOne of 70932 possible closed paths of 25 arcs starting northward is\n\n
+  ![](/home/will/src/euler-manager/config/../data/images/p_208_robotwalk.gif)\n\nGiven
+  that the robot starts facing North, how many journeys of 70 arcs in length can it
+  take that return it, after the final arc, to its starting position?  \n<!--(Journeys
+  are allowed to return multiple times to the start.)-->\r(Any arc may be traversed
+  multiple times.)\n\n"

data/data/problems/209.yml

@@ -2,26 +2,14 @@
 :id: 209
 :name: Circular Logic
 :url: http://projecteuler.net/problem=209
-:content: "\r\n<p>A <var>k</var>-input <i>binary truth table</i> is a map from <var>k</var>
-  input bits\r\n(binary digits, 0 [false] or 1 [true]) to 1 output bit. For example,
-  the 2-input binary truth tables for the logical AND and XOR functions are:</p>\r\n<div
-  style=\"text-align:center; margin-left:150px; margin-right:150px;\">\r\n<table cellspacing=\"0\"
-  cellpadding=\"2\" border=\"1\" align=\"left\">\n<tr style=\"background-color:#c1daf9;\">\n<td
-  width=\"30\" align=\"center\"><var>x</var></td>\r\n<td width=\"30\" align=\"center\"><var>y</var></td>\r\n<td>\n<var>x</var>
-  AND <var>y</var>\n</td>\n</tr>\n<tr>\n<td align=\"center\">0</td>\n<td align=\"center\">0</td>\n<td
-  align=\"center\">0</td>\n</tr>\n<tr>\n<td align=\"center\">0</td>\n<td align=\"center\">1</td>\n<td
-  align=\"center\">0</td>\n</tr>\n<tr>\n<td align=\"center\">1</td>\n<td align=\"center\">0</td>\n<td
-  align=\"center\">0</td>\n</tr>\n<tr>\n<td align=\"center\">1</td>\n<td align=\"center\">1</td>\n<td
-  align=\"center\">1</td>\n</tr>\n</table>\n<table cellspacing=\"0\" cellpadding=\"2\"
-  border=\"1\" align=\"right\">\n<tr style=\"background-color:#c1daf9;\">\n<td width=\"30\"
-  align=\"center\"><var>x</var></td>\r\n<td width=\"30\" align=\"center\"><var>y</var></td>\r\n<td>\n<var>x</var>
-  XOR <var>y</var>\n</td>\n</tr>\n<tr>\n<td align=\"center\">0</td>\n<td align=\"center\">0</td>\n<td
-  align=\"center\">0</td>\n</tr>\n<tr>\n<td align=\"center\">0</td>\n<td align=\"center\">1</td>\n<td
-  align=\"center\">1</td>\n</tr>\n<tr>\n<td align=\"center\">1</td>\n<td align=\"center\">0</td>\n<td
-  align=\"center\">1</td>\n</tr>\n<tr>\n<td align=\"center\">1</td>\n<td align=\"center\">1</td>\n<td
-  align=\"center\">0</td>\n</tr>\n</table>\n</div>\n<br clear=\"all\"><p>How many
-  6-input binary truth tables, τ, satisfy the formula</p>\r\n<div style=\"text-align:center;\">\r\nτ(<var>a</var>,
-  <var>b</var>, <var>c</var>, <var>d</var>, <var>e</var>, <var>f</var>) AND τ(<var>b</var>,
-  <var>c</var>, <var>d</var>, <var>e</var>, <var>f</var>, <var>a</var> XOR (<var>b</var>
-  AND <var>c</var>)) = 0\r\n</div>\n<br><p>for all 6-bit inputs (<var>a</var>, <var>b</var>,
-  <var>c</var>, <var>d</var>, <var>e</var>, <var>f</var>)?\r\n</p>\r\n"
+:content: "A <var>k</var>-input _binary truth table_ is a map from <var>k</var> input
+  bits\r(binary digits, 0 [false] or 1 [true]) to 1 output bit. For example, the 2-input
+  binary truth tables for the logical AND and XOR functions are:\n\n| <var>x</var>
+  | <var>y</var> | <var>x</var> AND <var>y</var> |\n| 0 | 0 | 0 |\n| 0 | 1 | 0 |\n|
+  1 | 0 | 0 |\n| 1 | 1 | 1 |\n\n| <var>x</var> | <var>y</var> | <var>x</var> XOR <var>y</var>
+  |\n| 0 | 0 | 0 |\n| 0 | 1 | 1 |\n| 1 | 0 | 1 |\n| 1 | 1 | 0 |\n\n  \n  \n\nHow many
+  6-input binary truth tables, τ, satisfy the formula\n\n\rτ(<var>a</var>, <var>b</var>,
+  <var>c</var>, <var>d</var>, <var>e</var>, <var>f</var>) AND τ(<var>b</var>, <var>c</var>,
+  <var>d</var>, <var>e</var>, <var>f</var>, <var>a</var> XOR (<var>b</var> AND <var>c</var>))
+  = 0\r\n  \n  \n\nfor all 6-bit inputs (<var>a</var>, <var>b</var>, <var>c</var>,
+  <var>d</var>, <var>e</var>, <var>f</var>)?\n\n"

data/data/problems/21.yml

@@ -2,12 +2,11 @@
 :id: 21
 :name: Amicable numbers
 :url: http://projecteuler.net/problem=21
-:content: "\r\n<p>Let d(<i>n</i>) be defined as the sum of proper divisors of <i>n</i>
-  (numbers less than <i>n</i> which divide evenly into <i>n</i>).<br>\r\nIf d(<i>a</i>)
-  = <i>b</i> and d(<i>b</i>) = <i>a</i>, where <i>a</i> <img src=\"images/symbol_ne.gif\"
-  width=\"11\" height=\"10\" alt=\"≠\" border=\"0\" style=\"vertical-align:middle;\"><i>b</i>,
-  then <i>a</i> and <i>b</i> are an amicable pair and each of <i>a</i> and <i>b</i>
-  are called amicable numbers.</p>\r\n<p>For example, the proper divisors of 220 are
-  1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors
-  of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.</p>\r\n<p>Evaluate the sum of all
-  the amicable numbers under 10000.</p>\r\n"
+:content: "Let d(_n_) be defined as the sum of proper divisors of _n_ (numbers less
+  than _n_ which divide evenly into _n_).  \n\rIf d(_a_) = _b_ and d(_b_) = _a_, where
+  _a_ ![≠](/home/will/src/euler-manager/config/../data/images/symbol_ne.gif) _b_,
+  then _a_ and _b_ are an amicable pair and each of _a_ and _b_ are called amicable
+  numbers.\n\nFor example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20,
+  22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2,
+  4, 71 and 142; so d(284) = 220.\n\nEvaluate the sum of all the amicable numbers
+  under 10000.\n\n"

data/data/problems/210.yml

@@ -2,9 +2,9 @@
 :id: 210
 :name: Obtuse Angled Triangles
 :url: http://projecteuler.net/problem=210
-:content: "\r\nConsider the set S(r) of points (x,y) with integer coordinates satisfying
-  |x| + |y| <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"> r. <br>\r\nLet O be the point (0,0)
-  and C the point (r/4,r/4). <br>\r\nLet N(r) be the number of points B in S(r), so
-  that the triangle OBC has an obtuse angle, i.e. the largest angle α satisfies 90°\r\nSo,
-  for example, N(4)=24 and N(8)=100.\r\n<p>\r\nWhat is N(1,000,000,000)?\r\n</p>\r\n\r\n\r\n\r\n"
+:content: "\rConsider the set S(r) of points (x,y) with integer coordinates satisfying
+  |x| + |y| ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  r.   \n\rLet O be the point (0,0) and C the point (r/4,r/4).   \n\rLet N(r) be the
+  number of points B in S(r), so that the triangle OBC has an obtuse angle, i.e. the
+  largest angle α satisfies 90°\rSo, for example, N(4)=24 and N(8)=100.\r\n\nWhat
+  is N(1,000,000,000)?\n\n"

data/data/problems/211.yml

@@ -2,10 +2,10 @@
 :id: 211
 :name: Divisor Square Sum
 :url: http://projecteuler.net/problem=211
-:content: "\r\n<p>For a positive integer <var>n</var>, let σ<sub>2</sub>(<var>n</var>)
-  be the sum of the squares of its divisors. For example,</p>\r\n<div style=\"text-align:center;\">σ<sub>2</sub>(10)
-  = 1 + 4 + 25 + 100 = 130.</div>\r\n<p>Find the sum of all <var>n</var>, 0 <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_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> 64,000,000 such that σ<sub>2</sub>(<var>n</var>)
-  is a perfect square.</p>\r\n"
+:content: |+
+  For a positive integer <var>n</var>, let σ<sub>2</sub>(<var>n</var>) be the sum of the squares of its divisors. For example,
+
+  σ<sub>2</sub>(10) = 1 + 4 + 25 + 100 = 130.
+
+  Find the sum of all <var>n</var>, 0 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) <var>n</var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 64,000,000 such that σ<sub>2</sub>(<var>n</var>) is a perfect square.
+

data/data/problems/212.yml

@@ -2,40 +2,30 @@
 :id: 212
 :name: Combined Volume of Cuboids
 :url: http://projecteuler.net/problem=212
-:content: "\r\n<p>An <span style=\"font-style: italic\">axis-aligned cuboid</span>,
-  specified by parameters { (x<sub>0</sub>,y<sub>0</sub>,z<sub>0</sub>), (dx,dy,dz)
-  }, consists of all points (X,Y,Z) such that x<sub>0</sub><img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  X <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> x<sub>0</sub>+dx, y<sub>0</sub><img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  Y <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> y<sub>0</sub>+dy and z<sub>0</sub><img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  Z <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> z<sub>0</sub>+dz.  The volume of the cuboid is
-  the product, dx <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\"
-  border=\"0\" style=\"vertical-align:middle;\"> dy <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  dz.  The <span style=\"font-style: italic\">combined volume</span> of a collection
-  of cuboids is the volume of their union and will be less than the sum of the individual
-  volumes if any cuboids overlap.</p>\r\n\r\n<p>Let C<sub>1</sub>,...,C<sub>50000</sub>
-  be a collection of 50000 axis-aligned cuboids such that C<sub><var>n</var></sub>
-  has parameters</p>\r\n\r\n<p style=\"margin-left:40px;\">x<sub>0</sub> = S<sub>6<var>n</var>-5</sub>
-  modulo 10000<br>y<sub>0</sub> = S<sub>6<var>n</var>-4</sub> modulo 10000<br>z<sub>0</sub>
-  = S<sub>6<var>n</var>-3</sub> modulo 10000<br>dx = 1 + (S<sub>6<var>n</var>-2</sub>
-  modulo 399)<br>dy = 1 + (S<sub>6<var>n</var>-1</sub> modulo 399)<br>dz = 1 + (S<sub>6<var>n</var></sub>
-  modulo 399)</p>\r\n\r\n<p>where S<sub>1</sub>,...,S<sub>300000</sub> come from the
-  \"Lagged Fibonacci Generator\":</p>\r\n\r\n<p style=\"margin-left:40px;\">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;\">
+:content: "An axis-aligned cuboid, specified by parameters { (x<sub>0</sub>,y<sub>0</sub>,z<sub>0</sub>),
+  (dx,dy,dz) }, consists of all points (X,Y,Z) such that x<sub>0</sub> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  X ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) x<sub>0</sub>+dx,
+  y<sub>0</sub> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  Y ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) y<sub>0</sub>+dy
+  and z<sub>0</sub> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  Z ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) z<sub>0</sub>+dz.
+  The volume of the cuboid is the product, dx ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  dy ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) dz.
+  The combined volume of a collection of cuboids is the volume of their union and
+  will be less than the sum of the individual volumes if any cuboids overlap.\n\nLet
+  C<sub>1</sub>,...,C<sub>50000</sub> be a collection of 50000 axis-aligned cuboids
+  such that C<sub><var>n</var></sub> has parameters\n\nx<sub>0</sub> = S<sub>6<var>n</var>-5</sub>
+  modulo 10000  \ny<sub>0</sub> = S<sub>6<var>n</var>-4</sub> modulo 10000  \nz<sub>0</sub>
+  = S<sub>6<var>n</var>-3</sub> modulo 10000  \ndx = 1 + (S<sub>6<var>n</var>-2</sub>
+  modulo 399)  \ndy = 1 + (S<sub>6<var>n</var>-1</sub> modulo 399)  \ndz = 1 + (S<sub>6<var>n</var></sub>
+  modulo 399)\n\nwhere S<sub>1</sub>,...,S<sub>300000</sub> come from the \"Lagged
+  Fibonacci Generator\":\n\nFor 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)
   55, S<sub><var>k</var></sub> = [100003 - 200003<var>k</var> + 300007<var>k</var><sup>3</sup>]
-    (modulo 1000000)<br>For 56 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>k</var>, S<sub><var>k</var></sub>
-  = [S<sub><var>k</var>-24</sub> + S<sub><var>k</var>-55</sub>]   (modulo 1000000)</p>\r\n\r\n<p>Thus,
-  C<sub>1</sub> has parameters {(7,53,183),(94,369,56)}, C<sub>2</sub> has parameters
-  {(2383,3563,5079),(42,212,344)}, and so on.</p>\r\n\r\n<p>The combined volume of
-  the first 100 cuboids, C<sub>1</sub>,...,C<sub>100</sub>, is 723581599.</p>\r\n\r\n<p>What
-  is the combined volume of all 50000 cuboids, C<sub>1</sub>,...,C<sub>50000</sub>
-  ?</p>\r\n"
+    (modulo 1000000)  \nFor 56 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>k</var>, S<sub><var>k</var></sub> = [S<sub><var>k</var>-24</sub> + S<sub><var>k</var>-55</sub>]
+    (modulo 1000000)\n\nThus, C<sub>1</sub> has parameters {(7,53,183),(94,369,56)},
+  C<sub>2</sub> has parameters {(2383,3563,5079),(42,212,344)}, and so on.\n\nThe
+  combined volume of the first 100 cuboids, C<sub>1</sub>,...,C<sub>100</sub>, is
+  723581599.\n\nWhat is the combined volume of all 50000 cuboids, C<sub>1</sub>,...,C<sub>50000</sub>
+  ?\n\n"

data/data/problems/213.yml

@@ -2,10 +2,9 @@
 :id: 213
 :name: Flea Circus
 :url: http://projecteuler.net/problem=213
-:content: "\r\n<p>A 30<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">30 grid of squares contains
-  900 fleas, initially one flea per square.<br>\r\nWhen a bell is rung, each flea
-  jumps to an adjacent square at random (usually 4 possibilities, except for fleas
-  on the edge of the grid or at the corners).</p>\r\n\r\n<p>What is the expected number
-  of unoccupied squares after 50 rings of the bell? Give your answer rounded to six
-  decimal places.</p>\r\n"
+:content: "A 30 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)30
+  grid of squares contains 900 fleas, initially one flea per square.  \n\rWhen a bell
+  is rung, each flea jumps to an adjacent square at random (usually 4 possibilities,
+  except for fleas on the edge of the grid or at the corners).\n\nWhat is the expected
+  number of unoccupied squares after 50 rings of the bell? Give your answer rounded
+  to six decimal places.\n\n"

data/data/problems/214.yml

@@ -2,14 +2,13 @@
 :id: 214
 :name: Totient Chains
 :url: http://projecteuler.net/problem=214
-:content: "\r\n<p>Let φ be Euler's totient function, i.e. for a natural number <var>n</var>,\r\nφ(<var>n</var>)
-  is the number of <var>k</var>, 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;\"><var>n</var>, for which gcd(<var>k</var>,<var>n</var>)
-  = 1.</p>\r\n\r\n<p>By iterating φ, each positive integer generates a decreasing
-  chain of numbers ending in 1.<br>\r\nE.g. if we start with 5 the sequence 5,4,2,1
-  is generated.<br>\r\nHere is a listing of all chains with length 4:</p>\r\n\r\n<div
-  style=\"text-align:right; margin-right:350px;\">\r\n5,4,2,1<br>\r\n7,6,2,1<br>\r\n8,4,2,1<br>\r\n9,6,2,1<br>\r\n10,4,2,1<br>\r\n12,4,2,1<br>\r\n14,6,2,1<br>\r\n18,6,2,1</div>\r\n\r\n<p>Only
-  two of these chains start with a prime, their sum is 12.</p>\r\n\r\n<p>What is the
-  sum of all primes less than 40000000 which generate a chain of length 25?</p>\r\n\r\n\r\n\r\n"
+:content: "Let φ be Euler's totient function, i.e. for a natural number <var>n</var>,\rφ(<var>n</var>)
+  is the number of <var>k</var>, 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)
+  <var>n</var>, for which gcd(<var>k</var>,<var>n</var>) = 1.\n\nBy iterating φ, each
+  positive integer generates a decreasing chain of numbers ending in 1.  \n\rE.g.
+  if we start with 5 the sequence 5,4,2,1 is generated.  \n\rHere is a listing of
+  all chains with length 4:\n\n\r5,4,2,1  \n\r7,6,2,1  \n\r8,4,2,1  \n\r9,6,2,1  \n\r10,4,2,1
+  \ \n\r12,4,2,1  \n\r14,6,2,1  \n\r18,6,2,1\n\nOnly two of these chains start with
+  a prime, their sum is 12.\n\nWhat is the sum of all primes less than 40000000 which
+  generate a chain of length 25?\n\n"

data/data/problems/215.yml

@@ -2,17 +2,14 @@
 :id: 215
 :name: Crack-free Walls
 :url: http://projecteuler.net/problem=215
-:content: "\r\n<p>Consider the problem of building a wall out of 2<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">1
-  and 3<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">1 bricks (horizontal<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">vertical
-  dimensions) such that, for extra strength, the gaps between horizontally-adjacent
-  bricks never line up in consecutive layers, i.e. never form a \"running crack\".</p>\r\n\r\n<p>For
-  example, the following 9<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">3 wall is not acceptable
-  due to the running crack shown in red:</p>\r\n\r\n<div style=\"text-align:center;\">\r\n<img
-  src=\"http://projecteuler.net/project/images/p_215_crackfree.gif\" alt=\"\">\n</div>\r\n\r\n<p>There
-  are eight ways of forming a crack-free 9<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">3 wall, written
-  W(9,3) = 8.</p>\r\n\r\n<p>Calculate W(32,10).</p>\r\n\r\n\r\n\r\n\r\n"
+:content: |+
+  Consider the problem of building a wall out of 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)1 and 3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)1 bricks (horizontal ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)vertical dimensions) such that, for extra strength, the gaps between horizontally-adjacent bricks never line up in consecutive layers, i.e. never form a "running crack".
+
+  For example, the following 9 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)3 wall is not acceptable due to the running crack shown in red:
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_215_crackfree.gif)
+
+  There are eight ways of forming a crack-free 9 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)3 wall, written W(9,3) = 8.
+
+  Calculate W(32,10).
+

data/data/problems/216.yml

@@ -2,13 +2,10 @@
 :id: 216
 :name: Investigating the primality of numbers of the form 2<var>n</var><sup>2</sup>-1
 :url: http://projecteuler.net/problem=216
-:content: "\r\n<p>Consider numbers <var>t</var>(<var>n</var>) of the form <var>t</var>(<var>n</var>)
-  = 2<var>n</var><sup>2</sup>-1 with <var>n</var> <img src=\"images/symbol_gt.gif\"
-  width=\"10\" height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\">
-  1.<br>\r\nThe first such numbers are 7, 17, 31, 49, 71, 97, 127 and 161.<br>\r\nIt
-  turns out that only 49 = 7*7 and 161 = 7*23 are not prime.<br>\r\nFor <var>n</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 10000 there are 2202 numbers <var>t</var>(<var>n</var>)
-  \ that are prime.</p>\r\n\r\n<p>How many numbers <var>t</var>(<var>n</var>) are
-  prime for <var>n</var> <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 50,000,000 ?</p>\r\n\r\n\r\n"
+:content: "Consider numbers <var>t</var>(<var>n</var>) of the form <var>t</var>(<var>n</var>)
+  = 2<var>n</var><sup>2</sup>-1 with <var>n</var> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)
+  1.  \n\rThe first such numbers are 7, 17, 31, 49, 71, 97, 127 and 161.  \n\rIt turns
+  out that only 49 = 7\\*7 and 161 = 7\\*23 are not prime.  \n\rFor <var>n</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  10000 there are 2202 numbers <var>t</var>(<var>n</var>) that are prime.\n\nHow many
+  numbers <var>t</var>(<var>n</var>) are prime for <var>n</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  50,000,000 ?\n\n"

data/data/problems/217.yml

@@ -2,26 +2,17 @@
 :id: 217
 :name: Balanced Numbers
 :url: http://projecteuler.net/problem=217
-:content: "\r\n<p>\r\nA positive integer with <var>k</var> (decimal) digits is called
-  balanced if its first <img src=\"images/symbol_lceil.gif\" width=\"6\" height=\"16\"
-  alt=\"⌈\" border=\"0\" style=\"vertical-align:middle;\"><sup><var>k</var></sup>/<sub>2</sub><img
-  src=\"images/symbol_rceil.gif\" width=\"6\" height=\"16\" alt=\"⌉\" border=\"0\"
-  style=\"vertical-align:middle;\"> digits sum to the same value as its last <img
-  src=\"images/symbol_lceil.gif\" width=\"6\" height=\"16\" alt=\"⌈\" border=\"0\"
-  style=\"vertical-align:middle;\"><sup><var>k</var></sup>/<sub>2</sub><img src=\"images/symbol_rceil.gif\"
-  width=\"6\" height=\"16\" alt=\"⌉\" border=\"0\" style=\"vertical-align:middle;\">
-  digits, where <img src=\"images/symbol_lceil.gif\" width=\"6\" height=\"16\" alt=\"⌈\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>x</var><img src=\"images/symbol_rceil.gif\"
-  width=\"6\" height=\"16\" alt=\"⌉\" border=\"0\" style=\"vertical-align:middle;\">,
-  pronounced <span style=\"font-style: italic\">ceiling</span> of <var>x</var>, is
-  the smallest integer <img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\"
-  alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\"><var>x</var>, thus <img
-  src=\"images/symbol_lceil.gif\" width=\"6\" height=\"16\" alt=\"⌈\" border=\"0\"
-  style=\"vertical-align:middle;\">π<img src=\"images/symbol_rceil.gif\" width=\"6\"
-  height=\"16\" alt=\"⌉\" border=\"0\" style=\"vertical-align:middle;\"> = 4 and <img
-  src=\"images/symbol_lceil.gif\" width=\"6\" height=\"16\" alt=\"⌈\" border=\"0\"
-  style=\"vertical-align:middle;\">5<img src=\"images/symbol_rceil.gif\" width=\"6\"
-  height=\"16\" alt=\"⌉\" border=\"0\" style=\"vertical-align:middle;\"> = 5.</p>\r\n<p>So,
-  for example, all palindromes are balanced, as is 13722.</p>\r\n<p>Let T(<var>n</var>)
-  be the sum of all balanced numbers less than 10<sup><var>n</var></sup>. <br>\r\nThus:
-  T(1) = 45, T(2) = 540 and T(5) = 334795890. </p>\r\n<p>Find T(47) mod 3<sup>15</sup></p>\r\n"
+:content: "A positive integer with <var>k</var> (decimal) digits is called balanced
+  if its first ![⌈](/home/will/src/euler-manager/config/../data/images/symbol_lceil.gif)<sup><var>k</var></sup>/<sub>2</sub>
+  ![⌉](/home/will/src/euler-manager/config/../data/images/symbol_rceil.gif) digits
+  sum to the same value as its last ![⌈](/home/will/src/euler-manager/config/../data/images/symbol_lceil.gif)<sup><var>k</var></sup>/<sub>2</sub>
+  ![⌉](/home/will/src/euler-manager/config/../data/images/symbol_rceil.gif) digits,
+  where ![⌈](/home/will/src/euler-manager/config/../data/images/symbol_lceil.gif)<var>x</var>
+  ![⌉](/home/will/src/euler-manager/config/../data/images/symbol_rceil.gif), pronounced
+  ceiling of <var>x</var>, is the smallest integer ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  <var>x</var>, thus ![⌈](/home/will/src/euler-manager/config/../data/images/symbol_lceil.gif)π
+  ![⌉](/home/will/src/euler-manager/config/../data/images/symbol_rceil.gif) = 4 and
+  ![⌈](/home/will/src/euler-manager/config/../data/images/symbol_lceil.gif)5 ![⌉](/home/will/src/euler-manager/config/../data/images/symbol_rceil.gif)
+  = 5.\n\nSo, for example, all palindromes are balanced, as is 13722.\n\nLet T(<var>n</var>)
+  be the sum of all balanced numbers less than 10<sup><var>n</var></sup>.   \n\rThus:
+  T(1) = 45, T(2) = 540 and T(5) = 334795890.\n\nFind T(47) mod 3<sup>15</sup>\n\n"

data/data/problems/218.yml

@@ -2,13 +2,12 @@
 :id: 218
 :name: Perfect right-angled triangles
 :url: http://projecteuler.net/problem=218
-:content: "\r\n<p>Consider the right angled triangle with sides a=7, b=24 and c=25.\r\nThe
-  area of this triangle is 84, which is divisible by the perfect numbers 6 and 28.<br>\r\nMoreover
-  it is a primitive right angled triangle as gcd(a,b)=1 and gcd(b,c)=1.<br>\r\nAlso
-  c is a perfect square.</p>\r\n\r\n<p>We will call a right angled triangle perfect
-  if<br>\r\n-it is a primitive right angled triangle<br>\r\n-its hypotenuse is a perfect
-  square</p>\r\n\r\n<p>We will call a right angled triangle super-perfect if<br>\r\n-it
-  is a perfect right angled triangle and<br>\r\n-its area is a multiple of the perfect
-  numbers 6 and 28.\r\n</p>\r\n\r\n<p>How many perfect right-angled triangles with
-  c<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\">10<sup>16</sup> exist that are not super-perfect?</p>\r\n\r\n"
+:content: "Consider the right angled triangle with sides a=7, b=24 and c=25.\rThe
+  area of this triangle is 84, which is divisible by the perfect numbers 6 and 28.
+  \ \n\rMoreover it is a primitive right angled triangle as gcd(a,b)=1 and gcd(b,c)=1.
+  \ \n\rAlso c is a perfect square.\n\nWe will call a right angled triangle perfect
+  if  \n\r-it is a primitive right angled triangle  \n\r-its hypotenuse is a perfect
+  square\n\nWe will call a right angled triangle super-perfect if  \n\r-it is a perfect
+  right angled triangle and  \n\r-its area is a multiple of the perfect numbers 6
+  and 28.\n\nHow many perfect right-angled triangles with c ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)10<sup>16</sup>
+  exist that are not super-perfect?\n\n"

data/data/problems/219.yml

@@ -2,18 +2,13 @@
 :id: 219
 :name: Skew-cost coding
 :url: http://projecteuler.net/problem=219
-:content: "\r\n<p>Let <span style=\"font-weight:bold\">A</span> and <span style=\"font-weight:bold\">B</span>
-  be bit strings (sequences of 0's and 1's).<br>\r\nIf <span style=\"font-weight:bold\">A</span>
-  is equal to the <span style=\"text-decoration:underline;\">left</span>most length(<span
-  style=\"font-weight:bold\">A</span>) bits of <span style=\"font-weight:bold\">B</span>,
-  then <span style=\"font-weight:bold\">A</span> is said to be a <span style=\"font-style:italic\">prefix</span>
-  of <span style=\"font-weight:bold\">B</span>.<br>\r\nFor example, 00110 is a prefix
-  of <span style=\"text-decoration:underline;\">00110</span>1001, but not of 00111
-  or 100110.</p>\r\n\r\n<p>A <span style=\"font-style:italic\">prefix-free code of
-  size</span> <var>n</var> is a collection of <var>n</var> distinct bit strings such
-  that no string is a prefix of any other.  For example, this is a prefix-free code
-  of size 6:</p>\r\n\r\n<p style=\"text-align:center;\">0000, 0001, 001, 01, 10, 11</p>\r\n\r\n<p>Now
-  suppose that it costs one penny to transmit a '0' bit, but four pence to transmit
-  a '1'.<br>\r\nThen the total cost of the prefix-free code shown above is 35 pence,
-  which happens to be the cheapest possible for the skewed pricing scheme in question.<br>\r\nIn
-  short, we write Cost(6) = 35.</p>\r\n\r\n<p>What is Cost(10<sup>9</sup>) ?</p>\r\n"
+:content: "Let A and B be bit strings (sequences of 0's and 1's).  \n\rIf A is equal
+  to the leftmost length(A) bits of B, then A is said to be a prefix of B.  \n\rFor
+  example, 00110 is a prefix of 001101001, but not of 00111 or 100110.\n\nA prefix-free
+  code of size <var>n</var> is a collection of <var>n</var> distinct bit strings such
+  that no string is a prefix of any other. For example, this is a prefix-free code
+  of size 6:\n\n0000, 0001, 001, 01, 10, 11\n\nNow suppose that it costs one penny
+  to transmit a '0' bit, but four pence to transmit a '1'.  \n\rThen the total cost
+  of the prefix-free code shown above is 35 pence, which happens to be the cheapest
+  possible for the skewed pricing scheme in question.  \n\rIn short, we write Cost(6)
+  = 35.\n\nWhat is Cost(10<sup>9</sup>) ?\n\n"