euler-manager 0.0.5 → 0.0.6

data/data/problems/328.yml

@@ -2,35 +2,32 @@
 :id: 328
 :name: Lowest-cost Search
 :url: http://projecteuler.net/problem=328
-:content: "\r\n<p>We are trying to find a hidden number selected from the set of integers
-  {1, 2, ..., <var>n</var>} by asking questions. \r\nEach number (question) we ask,
-  has a <u>cost equal to the number asked</u> and we get one of three possible answers:<br></p>\n<ul>\n<li>
-  \"Your guess is lower than the hidden number\", or</li>\r\n<li> \"Yes, that's it!\",
-  or</li>\r\n<li> \"Your guess is higher than the hidden number\".</li>\r\n</ul>\n<p>Given
-  the value of <var>n</var>, an <i>optimal strategy</i> minimizes the total cost (i.e.
-  the sum of all the questions asked) <u>for the worst possible case</u>. E.g.</p>\r\n\r\n<p>If
-  <var>n</var>=3, the best we can do is obviously to ask the number \"<b>2</b>\".
-  The answer will immediately lead us to find the hidden number (at a total cost =
-  2).</p>\r\n\r\n<p>If <var>n</var>=8, we might decide to use a \"binary search\"
-  type of strategy: Our first question would be \"<b>4</b>\" and if the hidden number
-  is higher than 4 we will need one or two additional questions.<br>\r\nLet our second
-  question be \"<b>6</b>\". If the hidden number is still higher than 6, we will need
-  a third question in order to discriminate between 7 and 8.<br>\r\nThus, our third
-  question will be \"<b>7</b>\" and the total cost for this worst-case scenario will
-  be 4+6+7=<span style=\"color:red;\"><b>17</b></span>.</p>\r\n\r\n<p>We can improve
-  considerably the worst-case cost for <var>n</var>=8, by asking \"<b>5</b>\" as our
-  first question.<br>\r\nIf we are told that the hidden number is higher than 5, our
-  second question will be \"<b>7</b>\", then we'll know for certain what the hidden
-  number is (for a total cost of 5+7=<span style=\"color:blue;\"><b>12</b></span>).<br>\r\nIf
-  we are told that the hidden number is lower than 5, our second question will be
-  \"<b>3</b>\" and if the hidden number is lower than 3 our third question will be
-  \"<b>1</b>\", giving a total cost of 5+3+1=<span style=\"color:blue;\"><b>9</b></span>.<br>\r\nSince
-  <span style=\"color:blue;\"><b>12</b></span>&gt;<span style=\"color:blue;\"><b>9</b></span>,
-  the worst-case cost for this strategy is <span style=\"color:red;\"><b>12</b></span>.
+:content: "We are trying to find a hidden number selected from the set of integers
+  {1, 2, ..., <var>n</var>} by asking questions. \rEach number (question) we ask,
+  has a <u>cost equal to the number asked</u> and we get one of three possible answers:\n\n-
+  \"Your guess is lower than the hidden number\", or\n- \"Yes, that's it!\", or\n-
+  \"Your guess is higher than the hidden number\".\n\nGiven the value of <var>n</var>,
+  an _optimal strategy_ minimizes the total cost (i.e. the sum of all the questions
+  asked) <u>for the worst possible case</u>. E.g.\n\nIf <var>n</var>=3, the best we
+  can do is obviously to ask the number \" **2** \". The answer will immediately lead
+  us to find the hidden number (at a total cost = 2).\n\nIf <var>n</var>=8, we might
+  decide to use a \"binary search\" type of strategy: Our first question would be
+  \" **4** \" and if the hidden number is higher than 4 we will need one or two additional
+  questions.  \n\rLet our second question be \" **6** \". If the hidden number is
+  still higher than 6, we will need a third question in order to discriminate between
+  7 and 8.  \n\rThus, our third question will be \" **7** \" and the total cost for
+  this worst-case scenario will be 4+6+7= **17** .\n\nWe can improve considerably
+  the worst-case cost for <var>n</var>=8, by asking \" **5** \" as our first question.
+  \ \n\rIf we are told that the hidden number is higher than 5, our second question
+  will be \" **7** \", then we'll know for certain what the hidden number is (for
+  a total cost of 5+7= **12** ).  \n\rIf we are told that the hidden number is lower
+  than 5, our second question will be \" **3** \" and if the hidden number is lower
+  than 3 our third question will be \" **1** \", giving a total cost of 5+3+1= **9**
+  .  \n\rSince **12** > **9** , the worst-case cost for this strategy is **12** .
   That's better than what we achieved previously with the \"binary search\" strategy;
-  it is also better than or equal to any other strategy.<br>\r\nSo, in fact, we have
-  just described an optimal strategy for <var>n</var>=8.</p>\r\n\r\n<p>Let C(<var>n</var>)
-  be the worst-case cost achieved by an optimal strategy for <var>n</var>, as described
-  above.<br>\r\nThus C(1) = 0, C(2) = 1, C(3) = 2 and C(8) = 12.<br>\r\nSimilarly,
-  C(100) = 400 and <img style=\"vertical-align:middle\" src=\"project/images/p_328_sum1.gif\">C(<var>n</var>)
-  = 17575.</p>\r\n\r\n<p>Find <img style=\"vertical-align:middle\" src=\"project/images/p_328_sum2.gif\">C(<var>n</var>).</p>\r\n"
+  it is also better than or equal to any other strategy.  \n\rSo, in fact, we have
+  just described an optimal strategy for <var>n</var>=8.\n\nLet C(<var>n</var>) be
+  the worst-case cost achieved by an optimal strategy for <var>n</var>, as described
+  above.  \n\rThus C(1) = 0, C(2) = 1, C(3) = 2 and C(8) = 12.  \n\rSimilarly, C(100)
+  = 400 and ![](/home/will/src/euler-manager/config/../data/images/p_328_sum1.gif)C(<var>n</var>)
+  = 17575.\n\nFind ![](/home/will/src/euler-manager/config/../data/images/p_328_sum2.gif)C(<var>n</var>).\n\n"

data/data/problems/329.yml

@@ -2,16 +2,15 @@
 :id: 329
 :name: Prime Frog
 :url: http://projecteuler.net/problem=329
-:content: "\r\n<p>Susan has a prime frog.<br>\r\nHer frog is jumping around over 500
-  squares numbered 1 to 500.\r\nHe can only jump one square to the left or to the
-  right, with equal probability, and he cannot jump outside the range [1;500].<br>(if
-  it lands at either end, it automatically jumps to the only available square on the
-  next move.)\r\n</p>\r\n<p>\r\nWhen he is on a square with a prime number on it,
-  he croaks 'P' (PRIME) with probability 2/3 or 'N' (NOT PRIME) with probability 1/3
-  just before jumping to the next square.<br>\r\nWhen he is on a square with a number
-  on it that is not a prime he croaks 'P' with probability 1/3 or 'N' with probability
-  2/3 just before jumping to the next square.\r\n</p>\r\n<p>\r\nGiven that the frog's
-  starting position is random with the same probability for every square, and given
-  that she listens to his first 15 croaks, what is the probability that she hears
-  the sequence PPPPNNPPPNPPNPN?\r\n</p>\r\nGive your answer as a fraction p/q in reduced
-  form.\r\n\r\n"
+:content: "Susan has a prime frog.  \n\rHer frog is jumping around over 500 squares
+  numbered 1 to 500.\rHe can only jump one square to the left or to the right, with
+  equal probability, and he cannot jump outside the range [1;500].  \n(if it lands
+  at either end, it automatically jumps to the only available square on the next move.)\n\nWhen
+  he is on a square with a prime number on it, he croaks 'P' (PRIME) with probability
+  2/3 or 'N' (NOT PRIME) with probability 1/3 just before jumping to the next square.
+  \ \n\rWhen he is on a square with a number on it that is not a prime he croaks 'P'
+  with probability 1/3 or 'N' with probability 2/3 just before jumping to the next
+  square.\n\nGiven that the frog's starting position is random with the same probability
+  for every square, and given that she listens to his first 15 croaks, what is the
+  probability that she hears the sequence PPPPNNPPPNPPNPN?\n\n\rGive your answer as
+  a fraction p/q in reduced form.\r\r\n"

data/data/problems/33.yml

@@ -2,12 +2,12 @@
 :id: 33
 :name: Digit canceling fractions
 :url: http://projecteuler.net/problem=33
-:content: "\r\n<p>The fraction <sup>49</sup>/<sub>98</sub> is a curious fraction,
-  as an inexperienced mathematician in attempting to simplify it may incorrectly believe
-  that <sup>49</sup>/<sub>98</sub> = <sup>4</sup>/<sub>8</sub>, which is correct,
-  is obtained by cancelling the 9s.</p>\r\n<p>We shall consider fractions like, <sup>30</sup>/<sub>50</sub>
-  = <sup>3</sup>/<sub>5</sub>, to be trivial examples.</p>\r\n<p>There are exactly
-  four non-trivial examples of this type of fraction, less than one in value, and
-  containing two digits in the numerator and denominator.</p>\r\n<p>If the product
-  of these four fractions is given in its lowest common terms, find the value of the
-  denominator.</p>\r\n\r\n"
+:content: |+
+  The fraction <sup>49</sup>/<sub>98</sub> is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that <sup>49</sup>/<sub>98</sub> = <sup>4</sup>/<sub>8</sub>, which is correct, is obtained by cancelling the 9s.
+
+  We shall consider fractions like, <sup>30</sup>/<sub>50</sub> = <sup>3</sup>/<sub>5</sub>, to be trivial examples.
+
+  There are exactly four non-trivial examples of this type of fraction, less than one in value, and containing two digits in the numerator and denominator.
+
+  If the product of these four fractions is given in its lowest common terms, find the value of the denominator.
+

data/data/problems/330.yml

@@ -2,39 +2,20 @@
 :id: 330
 :name: Euler's Number
 :url: http://projecteuler.net/problem=330
-:content: "\r\nAn infinite sequence of real numbers <var>a</var>(<var>n</var>) is
-  defined for all integers <var>n</var> as follows:\r\n<div align=\"center\"><img
-  src=\"project/images/p_330_formula.gif\"></div>\r\n\r\n<p>For example,<br></p>\n<table
-  class=\"formula\"><tr>\n<td>\n<var>a</var>(0) = </td>\r\n    <td><table class=\"frac\">\n<tr><td>1</td></tr>\n<tr><td
-  class=\"overline\">1!</td></tr>\n</table></td>\r\n    <td>+</td>\r\n    <td><table
-  class=\"frac\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">2!</td></tr>\n</table></td>\r\n
-  \   <td>+</td>\r\n    <td><table class=\"frac\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">3!</td></tr>\n</table></td>\r\n
-  \   <td>+ ... = e <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\"
-  alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"> 1 </td>\r\n</tr></table>\n<table
-  class=\"formula\"><tr>\n<td>\n<var>a</var>(1) = </td>\r\n    <td><table class=\"frac\">\n<tr><td>e
-  <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"> 1</td></tr>\n<tr><td class=\"overline\">1!</td></tr>\n</table></td>\r\n
-  \   <td>+</td>\r\n    <td><table class=\"frac\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">2!</td></tr>\n</table></td>\r\n
-  \   <td>+</td>\r\n    <td><table class=\"frac\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">3!</td></tr>\n</table></td>\r\n
-  \   <td>+ ... = 2e <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\"
-  alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"> 3 </td>\r\n</tr></table>\n<table
-  class=\"formula\"><tr>\n<td>\n<var>a</var>(2) = </td>\r\n    <td><table class=\"frac\">\n<tr><td>2e
-  <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"> 3</td></tr>\n<tr><td class=\"overline\">1!</td></tr>\n</table></td>\r\n
-  \   <td>+</td>\r\n    <td><table class=\"frac\">\n<tr><td>e <img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">
-  1</td></tr>\n<tr><td class=\"overline\">2!</td></tr>\n</table></td>\r\n    <td>+</td>\r\n
-  \   <td><table class=\"frac\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\">3!</td></tr>\n</table></td>\r\n
-  \   <td>+ ... =</td>\r\n    <td><table class=\"frac\">\n<tr><td>7</td></tr>\n<tr><td
-  class=\"overline\">2</td></tr>\n</table></td>\r\n    <td>e <img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">
-  6 </td>\r\n</tr></table>\r\nwith e = 2.7182818... being Euler's constant.\r\n\r\n<p>\r\n</p>\n<table
-  class=\"formula\"><tr>\n<td>It can be shown that <var>a</var>(<var>n</var>) is of
-  the form \r\n    </td>\r\n    <td><table class=\"frac\">\n<tr><td>A(<var>n</var>)
-  e + B(<var>n</var>)</td></tr>\n<tr><td class=\"overline\">\n<var>n</var>!</td></tr>\n</table></td>\r\n
-  \   <td>for integers A(<var>n</var>) and B(<var>n</var>). \r\n    </td>\r\n</tr></table>\n<table
-  class=\"formula\"><tr>\n<td>For example <var>a</var>(10) = \r\n    </td>\r\n    <td><table
-  class=\"frac\">\n<tr><td>328161643 e <img src=\"images/symbol_minus.gif\" width=\"9\"
-  height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"> 652694486</td></tr>\n<tr><td
-  class=\"overline\">10!</td></tr>\n</table></td>\r\n    <td>.</td>\r\n</tr></table>\n<p>\r\nFind
-  A(10<sup>9</sup>) + B(10<sup>9</sup>) and give your answer mod 77 777 777.\r\n</p>\r\n\r\n\r\n\r\n"
+:content: "\rAn infinite sequence of real numbers <var>a</var>(<var>n</var>) is defined
+  for all integers <var>n</var> as follows:\r\n ![](/home/will/src/euler-manager/config/../data/images/p_330_formula.gif)\n\nFor
+  example,\n\n| <var>a</var>(0) = | \n\n| 1 |\n| 1! |\n\n | + | \n\n| 1 |\n| 2! |\n\n
+  | + | \n\n| 1 |\n| 3! |\n\n | + ... = e ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  1 |\n\n| <var>a</var>(1) = | \n\n| e ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  1 |\n| 1! |\n\n | + | \n\n| 1 |\n| 2! |\n\n | + | \n\n| 1 |\n| 3! |\n\n | + ...
+  = 2e ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) 3
+  |\n\n| <var>a</var>(2) = | \n\n| 2e ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  3 |\n| 1! |\n\n | + | \n\n| e ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  1 |\n| 2! |\n\n | + | \n\n| 1 |\n| 3! |\n\n | + ... = | \n\n| 7 |\n| 2 |\n\n | e
+  ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) 6 |\n\n\rwith
+  e = 2.7182818... being Euler's constant.\r\r\n\n| It can be shown that <var>a</var>(<var>n</var>)
+  is of the form \r | \n\n| A(<var>n</var>) e + B(<var>n</var>) |\n| <var>n</var>!
+  |\n\n | for integers A(<var>n</var>) and B(<var>n</var>). \r |\n\n| For example
+  <var>a</var>(10) = \r | \n\n| 328161643 e ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  652694486 |\n| 10! |\n\n | . |\n\nFind A(10<sup>9</sup>) + B(10<sup>9</sup>) and
+  give your answer mod 77 777 777.\n\n"

data/data/problems/331.yml

@@ -2,27 +2,21 @@
 :id: 331
 :name: Cross flips
 :url: http://projecteuler.net/problem=331
-:content: "\r\n<p><var>N</var><img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><var>N</var> disks are placed
-  on a square game board. Each disk has a black side and white side.</p>\r\n\r\n<p>At
+:content: "<var>N</var> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)<var>N</var>
+  disks are placed on a square game board. Each disk has a black side and white side.\n\nAt
   each turn, you may choose a disk and flip all the disks in the same row and the
-  same column as this disk: thus 2<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><var>N</var>-1
+  same column as this disk: thus 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)<var>N</var>-1
   disks are flipped. The game ends when all disks show their white side. The following
-  example shows a game on a 5<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">5 board.</p>\r\n\r\n<div
-  align=\"center\"><img src=\"project/images/p_331_crossflips3.gif\"></div>\r\n\r\n<p>It
-  can be proven that 3 is the minimal number of turns to finish this game.</p>\r\n\r\n<p>The
-  bottom left disk on the <var>N</var><img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><var>N</var>
-  board has coordinates (0,0);<br>\r\nthe bottom right disk has coordinates (<var>N</var>-1,0)
-  and the top left disk has coordinates (0,<var>N</var>-1). </p>\r\n\r\n<p>Let C<sub><var>N</var></sub>
-  be the following configuration of a board with <var>N</var><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><var>N</var>
-  disks:<br>\r\nA disk at (<var>x</var>,<var>y</var>) satisfying <img style=\"vertical-align:middle\"
-  src=\"project/images/p_331_crossflips1.gif\">, shows its black side; otherwise,
-  it shows its white side. C<sub>5</sub> is shown above.</p>\r\n\r\n<p>Let T(<var>N</var>)
-  be the minimal number of turns to finish a game starting from configuration C<sub><var>N</var></sub>
-  or 0 if configuration C<sub><var>N</var></sub> is unsolvable.<br>\r\nWe have shown
-  that T(5)=3. You are also given that T(10)=29 and T(1 000)=395253.</p>\r\n\r\n<p>Find
-  <img style=\"vertical-align:middle\" src=\"project/images/p_331_crossflips2.gif\">.</p>\r\n\r\n"
+  example shows a game on a 5 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)5
+  board.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_331_crossflips3.gif)\n\nIt
+  can be proven that 3 is the minimal number of turns to finish this game.\n\nThe
+  bottom left disk on the <var>N</var> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)<var>N</var>
+  board has coordinates (0,0);  \n\rthe bottom right disk has coordinates (<var>N</var>-1,0)
+  and the top left disk has coordinates (0,<var>N</var>-1).\n\nLet C<sub><var>N</var></sub>
+  be the following configuration of a board with <var>N</var> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)<var>N</var>
+  disks:  \n\rA disk at (<var>x</var>,<var>y</var>) satisfying ![](/home/will/src/euler-manager/config/../data/images/p_331_crossflips1.gif),
+  shows its black side; otherwise, it shows its white side. C<sub>5</sub> is shown
+  above.\n\nLet T(<var>N</var>) be the minimal number of turns to finish a game starting
+  from configuration C<sub><var>N</var></sub> or 0 if configuration C<sub><var>N</var></sub>
+  is unsolvable.  \n\rWe have shown that T(5)=3. You are also given that T(10)=29
+  and T(1 000)=395253.\n\nFind ![](/home/will/src/euler-manager/config/../data/images/p_331_crossflips2.gif).\n\n"

data/data/problems/332.yml

@@ -2,15 +2,13 @@
 :id: 332
 :name: Spherical triangles
 :url: http://projecteuler.net/problem=332
-:content: "\r\n<p>A <b>spherical triangle</b> is a figure formed on the surface of
-  a sphere by three <b>great circular arcs</b> intersecting pairwise in three vertices.</p>\r\n\r\n<div
-  align=\"center\"><img src=\"project/images/p_332_spherical.jpg\"></div>\r\n\r\n\r\n<p>Let
-  C(<var>r</var>) be the sphere with the centre (0,0,0) and radius <var>r</var>.<br>\r\nLet
+:content: "A **spherical triangle** is a figure formed on the surface of a sphere
+  by three **great circular arcs** intersecting pairwise in three vertices.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_332_spherical.jpg)\n\nLet
+  C(<var>r</var>) be the sphere with the centre (0,0,0) and radius <var>r</var>.  \n\rLet
   Z(<var>r</var>) be the set of points on the surface of C(<var>r</var>) with integer
-  coordinates.<br>\r\nLet T(<var>r</var>) be the set of spherical triangles with vertices
-  in Z(<var>r</var>).\r\nDegenerate spherical triangles, formed by three points on
-  the same great arc, are <u>not</u> included in T(<var>r</var>).<br>\r\nLet A(<var>r</var>)
-  be the area of the smallest spherical triangle in T(<var>r</var>).</p>\r\n\r\n<p>For
-  example A(14) is 3.294040 rounded to six decimal places.</p>\r\n\r\n<p>Find <img
-  style=\"vertical-align:middle\" src=\"project/images/p_332_sum.gif\"> A(<var>r</var>).
-  Give your answer rounded to six decimal places.</p>\r\n\r\n"
+  coordinates.  \n\rLet T(<var>r</var>) be the set of spherical triangles with vertices
+  in Z(<var>r</var>).\rDegenerate spherical triangles, formed by three points on the
+  same great arc, are <u>not</u> included in T(<var>r</var>).  \n\rLet A(<var>r</var>)
+  be the area of the smallest spherical triangle in T(<var>r</var>).\n\nFor example
+  A(14) is 3.294040 rounded to six decimal places.\n\nFind ![](/home/will/src/euler-manager/config/../data/images/p_332_sum.gif)
+  A(<var>r</var>). Give your answer rounded to six decimal places.\n\n"

data/data/problems/333.yml

@@ -2,24 +2,21 @@
 :id: 333
 :name: Special partitions
 :url: http://projecteuler.net/problem=333
-:content: "\r\n<p>All positive integers can be partitioned in such a way that each
-  and every term of the partition can be expressed as 2<sup>i</sup>x3<sup>j</sup>,
-  where i,j <img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\"
-  border=\"0\" style=\"vertical-align:middle;\"> 0.</p>\r\n\r\n<p>Let's consider only
-  those such partitions where none of the terms can divide any of the other terms.\r\n<br>For
-  example, the partition of 17 = 2 + 6 + 9 = (2<sup>1</sup>x3<sup>0</sup> + 2<sup>1</sup>x3<sup>1</sup>
-  + 2<sup>0</sup>x3<sup>2</sup>) would not be valid since 2 can divide 6. Neither
-  would the partition 17 = 16 + 1 = (2<sup>4</sup>x3<sup>0</sup> + 2<sup>0</sup>x3<sup>0</sup>)
-  since 1 can divide 16. The only valid partition of 17 would be 8 + 9 = (2<sup>3</sup>x3<sup>0</sup>
-  + 2<sup>0</sup>x3<sup>2</sup>).</p>\r\n\r\n<p>Many integers have more than one valid
-  partition, the first being 11 having the following two partitions.\r\n<br>11 = 2
-  + 9 = (2<sup>1</sup>x3<sup>0</sup> + 2<sup>0</sup>x3<sup>2</sup>)\r\n<br>11 = 8
-  + 3 = (2<sup>3</sup>x3<sup>0</sup> + 2<sup>0</sup>x3<sup>1</sup>)</p>\r\n\r\n<p>Let's
+:content: "All positive integers can be partitioned in such a way that each and every
+  term of the partition can be expressed as 2<sup>i</sup>x3<sup>j</sup>, where i,j
+  ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif) 0.\n\nLet's
+  consider only those such partitions where none of the terms can divide any of the
+  other terms.\r  \nFor example, the partition of 17 = 2 + 6 + 9 = (2<sup>1</sup>x3<sup>0</sup>
+  + 2<sup>1</sup>x3<sup>1</sup> + 2<sup>0</sup>x3<sup>2</sup>) would not be valid
+  since 2 can divide 6. Neither would the partition 17 = 16 + 1 = (2<sup>4</sup>x3<sup>0</sup>
+  + 2<sup>0</sup>x3<sup>0</sup>) since 1 can divide 16. The only valid partition of
+  17 would be 8 + 9 = (2<sup>3</sup>x3<sup>0</sup> + 2<sup>0</sup>x3<sup>2</sup>).\n\nMany
+  integers have more than one valid partition, the first being 11 having the following
+  two partitions.\r  \n11 = 2 + 9 = (2<sup>1</sup>x3<sup>0</sup> + 2<sup>0</sup>x3<sup>2</sup>)\r
+  \ \n11 = 8 + 3 = (2<sup>3</sup>x3<sup>0</sup> + 2<sup>0</sup>x3<sup>1</sup>)\n\nLet's
   define P(<var>n</var>) as the number of valid partitions of <var>n</var>. For example,
-  P(11) = 2.</p>\r\n\r\n<p>Let's consider only the prime integers <var>q</var> which
-  would have a single valid partition such as P(17).</p>\r\n\r\n<p>The sum of the
-  primes <var>q</var> <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\"
-  alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">100 such that P(<var>q</var>)=1
-  equals 233.</p>\r\n\r\n<p>Find the sum of the primes <var>q</var> <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">1000000
-  such that P(<var>q</var>)=1.</p>\r\n"
+  P(11) = 2.\n\nLet's consider only the prime integers <var>q</var> which would have
+  a single valid partition such as P(17).\n\nThe sum of the primes <var>q</var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)100
+  such that P(<var>q</var>)=1 equals 233.\n\nFind the sum of the primes <var>q</var>
+  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)1000000 such
+  that P(<var>q</var>)=1.\n\n"

data/data/problems/334.yml

@@ -2,38 +2,26 @@
 :id: 334
 :name: Spilling the beans
 :url: http://projecteuler.net/problem=334
-:content: "\r\n<p>In Plato's heaven, there exist an infinite number of bowls in a
-  straight line.<br>\r\nEach bowl either contains some or none of a finite number
-  of beans.<br>\r\nA child plays a game, which allows only one kind of move: removing
-  two beans from any bowl, and putting one in each of the two adjacent bowls.<br>
-  The game ends when each bowl contains either one or no beans.</p>\r\n\r\n<p>For
-  example, consider two adjacent bowls containing 2 and 3 beans respectively, all
-  other bowls being empty. The following eight moves will finish the game:</p>\r\n\r\n<div
-  align=\"center\"><img src=\"project/images/p_334_beans.gif\"></div>\r\n\r\n<p>You
-  are given the following sequences:<br></p>\n<table class=\"formula\" style=\"margin-left:50px;\"><tr>\n<td>\r\n
-  \     <var>t</var><sub><i>0</i></sub> = 123456.\r\n   </td>\r\n</tr></table>\n<table
-  class=\"formula\" style=\"margin-left:50px;\">\n<tr>\n<td>\r\n      <var>t</var><sub><i>i</i></sub>
-  = \r\n   </td>\r\n   <td><img src=\"project/images/p_334_cases.gif\"></td>\r\n   <td>\r\n
-  \  <table class=\"formula\">\n<tr>\n<td></td>\r\n      <td>\r\n         <table class=\"frac\">\n<tr><td>\n<var>t</var><sub><i>i-1</i></sub>\n</td></tr>\n<tr><td
-  class=\"overline\">2</td></tr>\n</table>\n</td>\r\n      <td>\r\n         ,\r\n
-  \     </td>\r\n      <td></td>\r\n      <td>\r\n         if <var>t</var><sub><i>i-1</i></sub>
-  is even\r\n      </td>\r\n      </tr>\n<tr>\n<td><img src=\"project/images/p_334_lfloor.gif\"></td>\r\n
-  \     <td>\r\n         <table class=\"frac\">\n<tr><td>\n<var>t</var><sub><i>i-1</i></sub>\n</td></tr>\n<tr><td
-  class=\"overline\">2</td></tr>\n</table>\n</td>\r\n      <td>\r\n         <img src=\"project/images/p_334_rfloor.gif\">\n</td>\r\n
-  \     <td>\r\n         926252, \r\n      </td>\r\n      <td>\r\n         if <var>t</var><sub><i>i-1</i></sub>
-  is odd\r\n      </td>\r\n      </tr>\n</table>\n</td>\n<td>\r\n</td>\n</tr>\n<tr>\n<td></td>\r\n
-  \  <td></td>\r\n   <td>\r\n      where <img src=\"images/symbol_lfloor.gif\" width=\"6\"
-  height=\"16\" alt=\"⌊\" border=\"0\" style=\"vertical-align:middle;\"><var>x</var><img
-  src=\"images/symbol_rfloor.gif\" width=\"6\" height=\"16\" alt=\"⌋\" border=\"0\"
-  style=\"vertical-align:middle;\"> is the floor function\r\n   </td>\r\n</tr>\n<tr>\n<td></td>\r\n
-  \  <td></td>\r\n   <td>\r\n      and <img src=\"project/images/p_334_oplus.gif\">
-  is the bitwise XOR operator.\r\n   </td>\r\n</tr>\n</table>\n<table class=\"formula\"
-  style=\"margin-left:50px;\"><tr>\n<td>\r\n      <var>b</var><sub><i>i</i></sub>
-  = ( <var>t</var><sub><i>i</i></sub> mod 2<sup>11</sup>) + 1.\r\n   </td>\r\n</tr></table>\n<p>The
-  first two terms of the last sequence are <var>b</var><sub><i>1</i></sub> = 289 and
-  <var>b</var><sub><i>2</i></sub> = 145.<br>\r\nIf we start with <var>b</var><sub><i>1</i></sub>
+:content: "In Plato's heaven, there exist an infinite number of bowls in a straight
+  line.  \n\rEach bowl either contains some or none of a finite number of beans.  \n\rA
+  child plays a game, which allows only one kind of move: removing two beans from
+  any bowl, and putting one in each of the two adjacent bowls.  \n The game ends when
+  each bowl contains either one or no beans.\n\nFor example, consider two adjacent
+  bowls containing 2 and 3 beans respectively, all other bowls being empty. The following
+  eight moves will finish the game:\n\n ![](/home/will/src/euler-manager/config/../data/images/p_334_beans.gif)\n\nYou
+  are given the following sequences:\n\n| <var>t</var><sub><i>0</i></sub> = 123456.\r
+  |\n\n| <var>t</var><sub><i>i</i></sub> = \r | ![](/home/will/src/euler-manager/config/../data/images/p_334_cases.gif)
+  | \n\n| | \n\n| <var>t</var><sub><i>i-1</i></sub> |\n| 2 |\n\n | \r ,\r | | \r if
+  <var>t</var><sub><i>i-1</i></sub> is even\r |\n| ![](/home/will/src/euler-manager/config/../data/images/p_334_lfloor.gif)
+  | \n\n| <var>t</var><sub><i>i-1</i></sub> |\n| 2 |\n\n | ![](/home/will/src/euler-manager/config/../data/images/p_334_rfloor.gif)
+  | \r 926252, \r | \r if <var>t</var><sub><i>i-1</i></sub> is odd\r |\n\n | |\n|
+  | | \r where ![⌊](/home/will/src/euler-manager/config/../data/images/symbol_lfloor.gif)<var>x</var>
+  ![⌋](/home/will/src/euler-manager/config/../data/images/symbol_rfloor.gif) is the
+  floor function\r |\n| | | \r and ![](/home/will/src/euler-manager/config/../data/images/p_334_oplus.gif)
+  is the bitwise XOR operator.\r |\n\n| <var>b</var><sub><i>i</i></sub> = ( <var>t</var><sub><i>i</i></sub>
+  mod 2<sup>11</sup>) + 1.\r |\n\nThe first two terms of the last sequence are <var>b</var><sub><i>1</i></sub>
+  = 289 and <var>b</var><sub><i>2</i></sub> = 145.  \n\rIf we start with <var>b</var><sub><i>1</i></sub>
   and <var>b</var><sub><i>2</i></sub> beans in two adjacent bowls, 3419100 moves would
-  be required to finish the game.</p>\r\n\r\n<p>Consider now 1500 adjacent bowls containing
-  <var>b</var><sub><i>1</i></sub>, <var>b</var><sub><i>2</i></sub>,..., <var>b</var><sub><i>1500</i></sub>
-  beans respectively, all other bowls being empty. Find how many moves it takes before
-  the game ends.</p>\r\n\r\n\r\n"
+  be required to finish the game.\n\nConsider now 1500 adjacent bowls containing <var>b</var><sub><i>1</i></sub>,
+  <var>b</var><sub><i>2</i></sub>,..., <var>b</var><sub><i>1500</i></sub> beans respectively,
+  all other bowls being empty. Find how many moves it takes before the game ends.\n\n"

data/data/problems/335.yml

@@ -2,15 +2,14 @@
 :id: 335
 :name: Gathering the beans
 :url: http://projecteuler.net/problem=335
-:content: "\r\n<p>Whenever Peter feels bored, he places some bowls, containing one
-  bean each, in a circle. After this, he takes all the beans out of a certain bowl
-  and drops them one by one in the bowls going clockwise. He repeats this, starting
-  from the bowl he dropped the last bean in, until the initial situation appears again.
-  For example with 5 bowls he acts as follows:</p>\r\n\r\n<div align=\"center\"><img
-  src=\"project/images/p_335_mancala.gif\"></div>\r\n\r\n<p>So with 5 bowls it takes
-  Peter 15 moves to return to the initial situation.</p>\r\n\r\n<p>Let <var>M</var>(<var>x</var>)
-  represent the number of moves required to return to the initial situation, starting
-  with <var>x</var> bowls. Thus, <var>M</var>(5) = 15. It can also be verified that
-  <var>M</var>(100) = 10920.</p>\r\n\r\n<p>Find <img style=\"vertical-align:middle\"
-  src=\"project/images/p_335_sum.gif\"><var>M</var>(2<sup><var>k</var></sup>+1). Give
-  your answer modulo 7<sup>9</sup>.</p>\r\n\r\n\r\n"
+:content: |+
+  Whenever Peter feels bored, he places some bowls, containing one bean each, in a circle. After this, he takes all the beans out of a certain bowl and drops them one by one in the bowls going clockwise. He repeats this, starting from the bowl he dropped the last bean in, until the initial situation appears again. For example with 5 bowls he acts as follows:
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_335_mancala.gif)
+
+  So with 5 bowls it takes Peter 15 moves to return to the initial situation.
+
+  Let <var>M</var>(<var>x</var>) represent the number of moves required to return to the initial situation, starting with <var>x</var> bowls. Thus, <var>M</var>(5) = 15. It can also be verified that <var>M</var>(100) = 10920.
+
+  Find ![](/home/will/src/euler-manager/config/../data/images/p_335_sum.gif)<var>M</var>(2<sup><var>k</var></sup>+1). Give your answer modulo 7<sup>9</sup>.
+

data/data/problems/336.yml

@@ -2,23 +2,21 @@
 :id: 336
 :name: Maximix Arrangements
 :url: http://projecteuler.net/problem=336
-:content: "\r\n<p>A train is used to transport four carriages in the order: ABCD.
-  However, sometimes when the train arrives to collect the carriages they are not
-  in the correct order. <br>\r\nTo rearrange the carriages they are all shunted on
-  to a large rotating turntable. After the carriages are uncoupled at a specific point
-  the train moves off the turntable pulling the carriages still attached with it.
-  The remaining carriages are rotated 180 degrees. All of the carriages are then rejoined
-  and this process is repeated as often as necessary in order to obtain the least
-  number of uses of the turntable.<br>\r\nSome arrangements, such as ADCB, can be
-  solved easily: the carriages are separated between A and D, and after DCB are rotated
-  the correct order has been achieved.</p>\r\n\r\n<p>However, Simple Simon, the train
-  driver, is not known for his efficiency, so he always solves the problem by initially
-  getting carriage A in the correct place, then carriage B, and so on.</p>\r\n\r\n<p>Using
-  four carriages, the worst possible arrangements for Simon, which we shall call <i>maximix
-  arrangements</i>, are DACB and DBAC; each requiring him five rotations (although,
-  using the most efficient approach, they could be solved using just three rotations).
-  The process he uses for DACB is shown below.</p>\r\n\r\n<div align=\"center\"><img
-  src=\"project/images/p_336_maximix.gif\"></div>\r\n\r\n\r\n<p>It can be verified
-  that there are 24 maximix arrangements for six carriages, of which the tenth lexicographic
-  maximix arrangement is DFAECB.</p>\r\n\r\n<p>Find the 2011<sup>th</sup> lexicographic
-  maximix arrangement for eleven carriages.</p>\r\n\r\n"
+:content: "A train is used to transport four carriages in the order: ABCD. However,
+  sometimes when the train arrives to collect the carriages they are not in the correct
+  order.   \n\rTo rearrange the carriages they are all shunted on to a large rotating
+  turntable. After the carriages are uncoupled at a specific point the train moves
+  off the turntable pulling the carriages still attached with it. The remaining carriages
+  are rotated 180 degrees. All of the carriages are then rejoined and this process
+  is repeated as often as necessary in order to obtain the least number of uses of
+  the turntable.  \n\rSome arrangements, such as ADCB, can be solved easily: the carriages
+  are separated between A and D, and after DCB are rotated the correct order has been
+  achieved.\n\nHowever, Simple Simon, the train driver, is not known for his efficiency,
+  so he always solves the problem by initially getting carriage A in the correct place,
+  then carriage B, and so on.\n\nUsing four carriages, the worst possible arrangements
+  for Simon, which we shall call _maximix arrangements_, are DACB and DBAC; each requiring
+  him five rotations (although, using the most efficient approach, they could be solved
+  using just three rotations). The process he uses for DACB is shown below.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_336_maximix.gif)\n\nIt
+  can be verified that there are 24 maximix arrangements for six carriages, of which
+  the tenth lexicographic maximix arrangement is DFAECB.\n\nFind the 2011<sup>th</sup>
+  lexicographic maximix arrangement for eleven carriages.\n\n"

data/data/problems/337.yml

@@ -2,14 +2,12 @@
 :id: 337
 :name: Totient Stairstep Sequences
 :url: http://projecteuler.net/problem=337
-:content: "\r\n<p>Let {a<sub>1</sub>, a<sub>2</sub>,..., a<sub><var>n</var></sub>}
-  be an integer sequence of length <var>n</var> such that:</p>\r\n<ul>\n<li>a<sub>1</sub>
-  = 6</li>\r\n<li>for all 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i</var> n : φ(a<sub><var>i</var></sub>)
-  <var>i</var>+1) <var>i</var> <var>i</var>+1 <sup>1</sup>\n</li>\r\n</ul>\n<p>Let
-  S(<var>N</var>) be the number of such sequences with a<sub><var>n</var></sub><img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>N</var>.<br>\r\nFor
-  example, S(10) = 4: {6}, {6, 8}, {6, 8, 9} and {6, 10}.<br>\r\nWe can verify that
-  S(100) = 482073668 and S(10 000) mod 10<sup>8</sup> = 73808307.</p>\r\n\r\n<p>Find
-  S(20 000 000) mod 10<sup>8</sup>.</p>\r\n\r\n<p><sup>1</sup> φ denotes <b>Euler's
-  totient function</b>.</p>\r\n\r\n"
+:content: "Let {a<sub>1</sub>, a<sub>2</sub>,..., a<sub><var>n</var></sub>} be an
+  integer sequence of length <var>n</var> such that:\n\n- a<sub>1</sub> = 6\n- for
+  all 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>i</var>
+  n : φ(a<sub><var>i</var></sub>) <var>i</var>+1) <var>i</var> <var>i</var>+1 <sup>1</sup>\n\nLet
+  S(<var>N</var>) be the number of such sequences with a<sub><var>n</var></sub> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>N</var>.  \n\rFor example, S(10) = 4: {6}, {6, 8}, {6, 8, 9} and {6, 10}.  \n\rWe
+  can verify that S(100) = 482073668 and S(10 000) mod 10<sup>8</sup> = 73808307.\n\nFind
+  S(20 000 000) mod 10<sup>8</sup>.\n\n<sup>1</sup> φ denotes **Euler's totient function**
+  .\n\n"