euler-manager 0.0.5 → 0.0.6

data/data/problems/250.yml

@@ -2,6 +2,6 @@
 :id: 250
 :name: '250250'
 :url: http://projecteuler.net/problem=250
-:content: "\r\n<p>Find the number of non-empty subsets of {1<sup>1</sup>, 2<sup>2</sup>,
-  3<sup>3</sup>,..., 250250<sup>250250</sup>}, the sum of whose elements is divisible
-  by 250. Enter the rightmost 16 digits as your answer.</p>\r\n"
+:content: |+
+  Find the number of non-empty subsets of {1<sup>1</sup>, 2<sup>2</sup>, 3<sup>3</sup>,..., 250250<sup>250250</sup>}, the sum of whose elements is divisible by 250. Enter the rightmost 16 digits as your answer.
+

data/data/problems/251.yml

@@ -2,12 +2,14 @@
 :id: 251
 :name: Cardano Triplets
 :url: http://projecteuler.net/problem=251
-:content: "\r\n<p>\r\nA triplet of positive integers (<var>a</var>,<var>b</var>,<var>c</var>)
-  is called a Cardano Triplet if it satisfies the condition:</p>\r\n<div style=\"text-align:center;\">\r\n<img
-  src=\"project/images/p_251_cardano.gif\" alt=\"\">\n</div>\r\n<p>\r\nFor example,
-  (2,1,5) is a Cardano Triplet.\r\n</p>\r\n<p>\r\nThere exist 149 Cardano Triplets
-  for which <var>a</var>+<var>b</var>+<var>c</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  1000.\r\n</p>\r\n<p>\r\nFind how many Cardano Triplets exist such that <var>a</var>+<var>b</var>+<var>c</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 110,000,000.\r\n \r\n\r\n</p>"
+:content: |+
+  A triplet of positive integers (<var>a</var>,<var>b</var>,<var>c</var>) is called a Cardano Triplet if it satisfies the condition:
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_251_cardano.gif)
+
+  For example, (2,1,5) is a Cardano Triplet.
+
+  There exist 149 Cardano Triplets for which <var>a</var>+<var>b</var>+<var>c</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 1000.
+
+  Find how many Cardano Triplets exist such that <var>a</var>+<var>b</var>+<var>c</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 110,000,000.
+

data/data/problems/252.yml

@@ -2,30 +2,29 @@
 :id: 252
 :name: Convex Holes
 :url: http://projecteuler.net/problem=252
-:content: "\r\n<p>\r\nGiven a set of points on a plane, we define a convex hole to
-  be a convex polygon having as vertices any of the given points and not containing
-  any of the given points in its interior (in addition to the vertices, other given
-  points may lie on the perimeter of the polygon). \r\n</p>\r\n<p>\r\nAs an example,
-  the image below shows a set of twenty points and a few such convex holes. \r\nThe
-  convex hole shown as a red heptagon has an area equal to 1049694.5 square units,
-  which is the highest possible area for a convex hole on the given set of points.\r\n</p>\r\n<div
-  style=\"text-align:center;\">\r\n<img src=\"project/images/p_252_convexhole.gif\"
-  alt=\"\">\n</div>\r\n<p>\r\n<style type=\"text/css\">\r\ntable.p252 td {\r\n  padding:
-  0px 3px 0px 3px;\r\n  vertical-align: bottom;\r\n  text-align: left;\r\n}\r\n</style></p>\n<p>For
-  our example, we used the first 20 points (<var>T</var><sub>2<var>k</var><img src=\"images/symbol_minus.gif\"
+:content: "Given a set of points on a plane, we define a convex hole to be a convex
+  polygon having as vertices any of the given points and not containing any of the
+  given points in its interior (in addition to the vertices, other given points may
+  lie on the perimeter of the polygon).\n\nAs an example, the image below shows a
+  set of twenty points and a few such convex holes. \rThe convex hole shown as a red
+  heptagon has an area equal to 1049694.5 square units, which is the highest possible
+  area for a convex hole on the given set of points.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_252_convexhole.gif)\n\n<style
+  type=\"text/css\"><![CDATA[\r\ntable.p252 td {\r\n  padding: 0px 3px 0px 3px;\r\n
+  \ vertical-align: bottom;\r\n  text-align: left;\r\n}\r\n]]></style>\n\nFor our
+  example, we used the first 20 points (<var>T</var><sub>2<var>k</var><img src=\"%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif\"
   width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">1</sub>, <var>T</var><sub>2<var>k</var></sub>),
-  for <var>k</var> = 1,2,…,20, produced with the pseudo-random number generator:</p>\r\n\r\n<center><table
-  class=\"p252\">\n<tr>\n<td style=\"text-align:right\">\n<var>S</var><sub>0</sub>\n</td>\r\n
-  \   <td>=<sub> </sub>\n</td>\r\n    <td>290797<sub> </sub>\n</td>\r\n  </tr>\n<tr>\n<td>\n<var>S</var><sub><var>n</var>+1</sub>\n</td>\r\n
-  \   <td>=<sub> </sub>\n</td>\r\n    <td>\n<var>S</var><sub><var>n</var></sub><sup>2</sup>
-  mod 50515093</td>\r\n  </tr>\n<tr>\n<td style=\"text-align:right\">\n<var>T</var><sub><var>n</var></sub>\n</td>\r\n
+  for <var>k</var> = 1,2,…,20, produced with the pseudo-random number generator:\n\n<center><table
+  class=\"p252\">\r\n  <tr>\r\n    <td style=\"text-align:right\">\n<var>S</var><sub>0</sub>\n</td>\r\n
+  \   <td>=<sub> </sub>\n</td>\r\n    <td>290797<sub> </sub>\n</td>\r\n  </tr>\n<tr>\r\n
+  \   <td>\n<var>S</var><sub><var>n</var>+1</sub>\n</td>\r\n    <td>=<sub> </sub>\n</td>\r\n
+  \   <td>\n<var>S</var><sub><var>n</var></sub><sup>2</sup> mod 50515093</td>\r\n
+  \ </tr>\n<tr>\r\n    <td style=\"text-align:right\">\n<var>T</var><sub><var>n</var></sub>\n</td>\r\n
   \   <td>=<sub> </sub>\n</td>\r\n    <td>( <var>S</var><sub><var>n</var></sub> mod
-  2000 ) <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"> 1000<sup> </sup>\n</td>\r\n  </tr>\n</table></center>\r\n\r\n<p>\r\n<i>i.e.</i>
-  (527, 144), (<img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\"
-  border=\"0\" style=\"vertical-align:middle;\">488, 732), (<img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">454, <img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\">947), …\r\n</p>\r\n<p>\r\nWhat is the maximum area
-  for a convex hole on the set containing the first 500 points in the pseudo-random
-  sequence?<br> Specify your answer including one digit after the decimal point.\r\n</p>\r\n\r\n\r\n\r\n\r\n\r\n"
+  2000 ) <img src=\"%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif\" width=\"9\" height=\"3\"
+  alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"> 1000<sup> </sup>\n</td>\r\n
+  \ </tr>\r\n</table></center>\n\n_i.e._ (527, 144), ( ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)488, 732),
+  ( ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)454, 
+  ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)947), …\n\nWhat
+  is the maximum area for a convex hole on the set containing the first 500 points
+  in the pseudo-random sequence?  \n Specify your answer including one digit after
+  the decimal point.\n\n"

data/data/problems/253.yml

@@ -2,35 +2,22 @@
 :id: 253
 :name: Tidying up
 :url: http://projecteuler.net/problem=253
-:content: "\r\n<p>A small child has a “number caterpillar” consisting of forty jigsaw
-  pieces, each with one number on it, which, when connected together in a line, reveal
-  the numbers 1 to 40 in order.</p>\r\n\r\n<p>Every night, the child's father has
-  to pick up the pieces of the caterpillar that have been scattered across the play
-  room. He picks up the pieces at random and places them in the correct order.<br>
-  As the caterpillar is built up in this way, it forms distinct segments that gradually
-  merge together.<br> The number of segments starts at zero (no pieces placed), generally
-  increases up to about eleven or twelve, then tends to drop again before finishing
-  at a single segment (all pieces placed).</p>\n<p>\r\n\r\n</p>\n<p>For example:</p>\r\n<div
-  align=\"center\">\r\n<table cellspacing=\"0\" cellpadding=\"2\" border=\"1\" align=\"center\">\n<tr
-  style=\"background-color:#c1daf9;\">\n<td width=\"80\" align=\"center\"><b>Piece
-  Placed</b></td>\r\n<td width=\"80\" align=\"center\"><b>Segments So Far</b></td>\n</tr>\n<tr>\n<td
-  align=\"center\">12</td>\n<td align=\"center\">1</td>\n</tr>\n<tr>\n<td align=\"center\">4</td>\n<td
-  align=\"center\">2</td>\n</tr>\n<tr>\n<td align=\"center\">29</td>\n<td align=\"center\">3</td>\n</tr>\n<tr>\n<td
-  align=\"center\">6</td>\n<td align=\"center\">4</td>\n</tr>\n<tr>\n<td align=\"center\">34</td>\n<td
-  align=\"center\">5</td>\n</tr>\n<tr>\n<td align=\"center\">5</td>\n<td align=\"center\">4</td>\n</tr>\n<tr>\n<td
-  align=\"center\">35</td>\n<td align=\"center\">4</td>\n</tr>\n<tr>\n<td align=\"center\">…</td>\n<td
-  align=\"center\">…</td>\n</tr>\n</table>\n</div>\r\n\r\n<p>Let <var>M</var> be the
-  maximum number of segments encountered during a random tidy-up of the caterpillar.<br>\r\nFor
-  a caterpillar of ten pieces, the number of possibilities for each <var>M</var> is</p>\r\n<div
-  align=\"center\">\r\n<table cellspacing=\"0\" cellpadding=\"2\" border=\"1\" align=\"center\">\n<tr
-  style=\"background-color:#c1daf9;\">\n<td width=\"50\" align=\"center\"><b><var>M</var></b></td>\r\n<td
-  width=\"90\" align=\"center\"><b>Possibilities</b></td>\n</tr>\n<tr>\n<td align=\"center\">1</td>\n<td
-  align=\"right\">512      </td>\n</tr>\n<tr>\n<td align=\"center\">2</td>\n<td align=\"right\">250912 
-      </td>\n</tr>\n<tr>\n<td align=\"center\">3</td>\n<td align=\"right\">1815264 
-      </td>\n</tr>\n<tr>\n<td align=\"center\">4</td>\n<td align=\"right\">1418112 
-      </td>\n</tr>\n<tr>\n<td align=\"center\">5</td>\n<td align=\"right\">144000 
-      </td>\n</tr>\n</table>\n</div>\r\n\r\n<p>so the most likely value of <var>M</var>
-  is 3 and the average value is <sup>385643</sup>⁄<sub>113400</sub> = 3.400732, rounded
-  to six decimal places.</p>\r\n\r\n<p>The most likely value of <var>M</var> for a
-  forty-piece caterpillar is 11; but what is the average value of <var>M</var>?</p>\r\n<p>Give
-  your answer rounded to six decimal places.</p>\r\n\r\n"
+:content: "A small child has a “number caterpillar” consisting of forty jigsaw pieces,
+  each with one number on it, which, when connected together in a line, reveal the
+  numbers 1 to 40 in order.\n\nEvery night, the child's father has to pick up the
+  pieces of the caterpillar that have been scattered across the play room. He picks
+  up the pieces at random and places them in the correct order.  \n As the caterpillar
+  is built up in this way, it forms distinct segments that gradually merge together.
+  \ \n The number of segments starts at zero (no pieces placed), generally increases
+  up to about eleven or twelve, then tends to drop again before finishing at a single
+  segment (all pieces placed).\n\nFor example:\n\n| **Piece Placed** | **Segments
+  So Far** |\n| 12 | 1 |\n| 4 | 2 |\n| 29 | 3 |\n| 6 | 4 |\n| 34 | 5 |\n| 5 | 4 |\n|
+  35 | 4 |\n| … | … |\n\nLet <var>M</var> be the maximum number of segments encountered
+  during a random tidy-up of the caterpillar.  \n\rFor a caterpillar of ten pieces,
+  the number of possibilities for each <var>M</var> is\n\n| **<var>M</var>** | **Possibilities**
+  |\n| 1 | 512       |\n| 2 | 250912       |\n| 3 | 1815264       |\n| 4 | 1418112 
+       |\n| 5 | 144000       |\n\nso the most likely value of <var>M</var> is 3 and
+  the average value is <sup>385643</sup>⁄<sub>113400</sub> = 3.400732, rounded to
+  six decimal places.\n\nThe most likely value of <var>M</var> for a forty-piece caterpillar
+  is 11; but what is the average value of <var>M</var>?\n\nGive your answer rounded
+  to six decimal places.\n\n"

data/data/problems/254.yml

@@ -2,20 +2,16 @@
 :id: 254
 :name: Sums of Digit Factorials
 :url: http://projecteuler.net/problem=254
-:content: "\r\n<p>Define f(<var>n</var>) as the sum of the factorials of the digits
-  of <var>n</var>. For example, f(342) = 3! + 4! + 2! = 32.</p>\r\n\r\n<p>Define sf(<var>n</var>)
-  as the sum of the digits of f(<var>n</var>). So sf(342) = 3 + 2 = 5.</p>\r\n\r\n<p>Define
-  g(<var>i</var>) to be the smallest positive integer <var>n</var> such that sf(<var>n</var>)
-  = <var>i</var>. Though sf(342) is 5, sf(25) is also 5, and it can be verified that
-  g(5) is 25.</p>\r\n\r\n<p>Define sg(<var>i</var>) as the sum of the digits of g(<var>i</var>).
-  So sg(5) = 2 + 5 = 7.</p>\r\n\r\n<p>Further, it can be verified that g(20) is 267
-  and <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\"> sg(<var>i</var>) for 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;\"> 20 is 156.</p>\r\n\r\n<p>What is <img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\"> sg(<var>i</var>)
-  for 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;\">
-  150?</p>\r\n"
+:content: |+
+  Define f(<var>n</var>) as the sum of the factorials of the digits of <var>n</var>. For example, f(342) = 3! + 4! + 2! = 32.
+
+  Define sf(<var>n</var>) as the sum of the digits of f(<var>n</var>). So sf(342) = 3 + 2 = 5.
+
+  Define g(<var>i</var>) to be the smallest positive integer <var>n</var> such that sf(<var>n</var>) = <var>i</var>. Though sf(342) is 5, sf(25) is also 5, and it can be verified that g(5) is 25.
+
+  Define sg(<var>i</var>) as the sum of the digits of g(<var>i</var>). So sg(5) = 2 + 5 = 7.
+
+  Further, it can be verified that g(20) is 267 and ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif) sg(<var>i</var>) for 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) 20 is 156.
+
+  What is ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif) sg(<var>i</var>) for 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) 150?
+

data/data/problems/255.yml

@@ -2,58 +2,48 @@
 :id: 255
 :name: Rounded Square Roots
 :url: http://projecteuler.net/problem=255
-:content: "\r\n<p>We define the <i>rounded-square-root</i> of a positive integer <var>n</var>
-  as the square root of <var>n</var> rounded to the nearest integer.</p>\r\n\r\n<p>The
-  following procedure (essentially Heron's method adapted to integer arithmetic) finds
-  the rounded-square-root of <var>n</var>:</p>\r\n<p>Let <var>d</var> be the number
-  of digits of the number <var>n</var>.<br>\r\nIf <var>d</var> is odd, set <var>x</var><sub>0</sub>
-  = 2<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">10<sup>(<var>d</var>-1)⁄2</sup>.<br>\r\nIf <var>d</var>
-  is even, set <var>x</var><sub>0</sub> = 7<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">10<sup>(<var>d</var>-2)⁄2</sup>.<br>\r\nRepeat:</p>\r\n<p
-  align=\"center\">\r\n<img src=\"project/images/p_255_Heron.gif\"></p>\r\n<!--\r\n<table
+:content: "We define the _rounded-square-root_ of a positive integer <var>n</var>
+  as the square root of <var>n</var> rounded to the nearest integer.\n\nThe following
+  procedure (essentially Heron's method adapted to integer arithmetic) finds the rounded-square-root
+  of <var>n</var>:\n\nLet <var>d</var> be the number of digits of the number <var>n</var>.
+  \ \n\rIf <var>d</var> is odd, set <var>x</var><sub>0</sub> = 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)10<sup>(<var>d</var>-1)⁄2</sup>.
+  \ \n\rIf <var>d</var> is even, set <var>x</var><sub>0</sub> = 7 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)10<sup>(<var>d</var>-2)⁄2</sup>.
+  \ \n\rRepeat:\n\n![](/home/will/src/euler-manager/config/../data/images/p_255_Heron.gif)\n\n<!--\r\n<table
   align='center'>\r\n<tr><td><var>x</var><sub><var>k</var>+1</sub> =</td>\r\n<td style='font-size:220%'>&#8970;</td>\r\n<td
   style='text-align:center;'><var>x</var><sub><var>k</var></sub> + <img src='images/symbol_lceil.gif'
   width='6' height='16' alt='&lceil;' border='0' style='vertical-align:middle;' /><var>n</var>&frasl;<var>x</var><sub><var>k</var></sub><img
   src='images/symbol_rceil.gif' width='6' height='16' alt='&rceil;' border='0' style='vertical-align:middle;'
   /><br />\r\n<img src='images/blackdot.gif' width='75' height='1' alt='' /><br />\r\n2</td><td><td
-  style='font-size:220%'>&#8971;</td></tr>\r\n</table> -->\r\n\r\n<p>until <var>x</var><sub><var>k</var>+1</sub>
-  = <var>x</var><sub><var>k</var></sub>.\r\n</p>\r\n<p>As an example, let us find
-  the rounded-square-root of <var>n</var> = 4321.<br><var>n</var> has 4 digits, so
-  <var>x</var><sub>0</sub> = 7<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">10<sup>(4-2)⁄2</sup> = 70.<br><img
-  src=\"project/images/p_255_Example.gif\"><!--<var>x</var><sub>1</sub> = <img src='images/symbol_lfloor.gif'
-  width='6' height='16' alt='&lfloor;' border='0' style='vertical-align:middle;' />(70
-  + <img src='images/symbol_lceil.gif' width='6' height='16' alt='&lceil;' border='0'
-  style='vertical-align:middle;' />4321&frasl;70<img src='images/symbol_rceil.gif'
-  width='6' height='16' alt='&rceil;' border='0' style='vertical-align:middle;' />)&frasl;2<img
-  src='images/symbol_rfloor.gif' width='6' height='16' alt='&rfloor;' border='0' style='vertical-align:middle;'
-  /> = 66.<br />\r\n<var>x</var><sub>2</sub> = <img src='images/symbol_lfloor.gif'
-  width='6' height='16' alt='&lfloor;' border='0' style='vertical-align:middle;' />(66
-  + <img src='images/symbol_lceil.gif' width='6' height='16' alt='&lceil;' border='0'
-  style='vertical-align:middle;' />4321&frasl;66<img src='images/symbol_rceil.gif'
-  width='6' height='16' alt='&rceil;' border='0' style='vertical-align:middle;' />)&frasl;2<img
-  src='images/symbol_rfloor.gif' width='6' height='16' alt='&rfloor;' border='0' style='vertical-align:middle;'
-  /> = 66.--><br>\r\nSince <var>x</var><sub>2</sub> = <var>x</var><sub>1</sub>, we
-  stop here.<br>\r\nSo, after just two iterations, we have found that the rounded-square-root
-  of 4321 is 66 (the actual square root is 65.7343137…).\r\n</p>\r\n<p>The number
-  of iterations required when using this method is surprisingly low.<br>\r\nFor example,
-  we can find the rounded-square-root of a 5-digit integer (10,000 <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;\"> 99,999) with an average of 3.2102888889 iterations
-  (the average value was rounded to 10 decimal places).\r\n</p>\r\n<p>Using the procedure
-  described above, what is the average number of iterations required to find the rounded-square-root
-  of a 14-digit number (10<sup>13</sup><img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" 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;\"> 10<sup>14</sup>)?<br>\r\nGive your answer rounded
-  to 10 decimal places.\r\n</p>\r\n<p>Note: The symbols <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;\"> and <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;\"> represent the <dfn title=\"the largest integer
-  not greater than x\">floor function</dfn> and <dfn title=\"the smallest integer
-  not less than x\">ceiling function</dfn> respectively.\r\n</p>\r\n"
+  style='font-size:220%'>&#8971;</td></tr>\r\n</table> -->\n\nuntil <var>x</var><sub><var>k</var>+1</sub>
+  = <var>x</var><sub><var>k</var></sub>.\n\nAs an example, let us find the rounded-square-root
+  of <var>n</var> = 4321.  \n<var>n</var> has 4 digits, so <var>x</var><sub>0</sub>
+  = 7 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)10<sup>(4-2)⁄2</sup>
+  = 70.  \n ![](/home/will/src/euler-manager/config/../data/images/p_255_Example.gif)<!--<var>x</var><sub>1</sub>
+  = <img src='images/symbol_lfloor.gif' width='6' height='16' alt='&lfloor;' border='0'
+  style='vertical-align:middle;' />(70 + <img src='images/symbol_lceil.gif' width='6'
+  height='16' alt='&lceil;' border='0' style='vertical-align:middle;' />4321&frasl;70<img
+  src='images/symbol_rceil.gif' width='6' height='16' alt='&rceil;' border='0' style='vertical-align:middle;'
+  />)&frasl;2<img src='images/symbol_rfloor.gif' width='6' height='16' alt='&rfloor;'
+  border='0' style='vertical-align:middle;' /> = 66.<br />\r\n<var>x</var><sub>2</sub>
+  = <img src='images/symbol_lfloor.gif' width='6' height='16' alt='&lfloor;' border='0'
+  style='vertical-align:middle;' />(66 + <img src='images/symbol_lceil.gif' width='6'
+  height='16' alt='&lceil;' border='0' style='vertical-align:middle;' />4321&frasl;66<img
+  src='images/symbol_rceil.gif' width='6' height='16' alt='&rceil;' border='0' style='vertical-align:middle;'
+  />)&frasl;2<img src='images/symbol_rfloor.gif' width='6' height='16' alt='&rfloor;'
+  border='0' style='vertical-align:middle;' /> = 66.-->  \n\rSince <var>x</var><sub>2</sub>
+  = <var>x</var><sub>1</sub>, we stop here.  \n\rSo, after just two iterations, we
+  have found that the rounded-square-root of 4321 is 66 (the actual square root is
+  65.7343137…).\n\nThe number of iterations required when using this method is surprisingly
+  low.  \n\rFor example, we can find the rounded-square-root of a 5-digit integer
+  (10,000 ![≤](/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) 99,999) with
+  an average of 3.2102888889 iterations (the average value was rounded to 10 decimal
+  places).\n\nUsing the procedure described above, what is the average number of iterations
+  required to find the rounded-square-root of a 14-digit number (10<sup>13</sup> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>n</var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  10<sup>14</sup>)?  \n\rGive your answer rounded to 10 decimal places.\n\nNote: The
+  symbols ![⌊](/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) and ![⌈](/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) represent
+  the <dfn title=\"the largest integer not greater than x\">floor function</dfn> and
+  <dfn title=\"the smallest integer not less than x\">ceiling function</dfn> respectively.\n\n"

data/data/problems/256.yml

@@ -2,42 +2,34 @@
 :id: 256
 :name: Tatami-Free Rooms
 :url: http://projecteuler.net/problem=256
-:content: "\r\n<span style=\"font-size:10pt;\">\r\n<p>Tatami are rectangular mats,
-  used to completely cover the floor of a room, without overlap.</p>\r\n\r\n<p>Assuming
-  that the only type of available tatami has dimensions 1<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">2,
-  there are obviously some limitations for the shape and size of the rooms that can
-  be covered.</p>\r\n\r\n<p>For this problem, we consider only rectangular rooms with
-  integer dimensions <var>a</var>, <var>b</var> and even size <var>s</var> = <var>a</var>·<var>b</var>.<br>\r\nWe
-  use the term 'size' to denote the floor surface area of the room, and — without
-  loss of generality — we add the condition <var>a</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>b</var>.</p>\r\n\r\n<p>There
-  is one rule to follow when laying out tatami: there must be no points where corners
-  of four different mats meet.<br>\r\nFor example, consider the two arrangements below
-  for a 4<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">4 room:</p>\r\n<div align=\"center\">\r\n<img src=\"project/images/p_256_tatami3.gif\"><br>\n</div>\r\n\r\n<p>The
-  arrangement on the left is acceptable, whereas the one on the right is not: a red
-  \"<span style=\"color:red\"><b>X</b></span>\" in the middle, marks the point where
-  four tatami meet.</p>\r\n\r\n<p>Because of this rule, certain even-sized rooms cannot
-  be covered with tatami: we call them tatami-free rooms.<br>\r\nFurther, we define
-  <var>T</var>(<var>s</var>) as the number of tatami-free rooms of size <var>s</var>.</p>\r\n\r\n<p>The
-  smallest tatami-free room has size <var>s</var> = 70 and dimensions 7<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">10.<br>\r\nAll
-  the other rooms of size <var>s</var> = 70 can be covered with tatami; they are:
-  1<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">70, 2<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">35 and 5<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">14.<br>\r\nHence, <var>T</var>(70) = 1.</p>\r\n\r\n<p>Similarly,
-  we can verify that <var>T</var>(1320) = 5 because there are exactly 5 tatami-free
-  rooms of size <var>s</var> = 1320:<br>\r\n20<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">66,
-  22<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">60, 24<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">55, 30<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">44 and 33<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">40.<br>\r\nIn
-  fact, <var>s</var> = 1320 is the smallest room-size <var>s</var> for which <var>T</var>(<var>s</var>)
-  = 5.</p>\r\n\r\n<p>Find the smallest room-size <var>s</var> for which <var>T</var>(<var>s</var>)
-  = 200.</p>\r\n</span>\r\n\r\n"
+:content: "Tatami are rectangular mats, used to completely cover the floor of a room,
+  without overlap.\n\nAssuming that the only type of available tatami has dimensions
+  1 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)2, there
+  are obviously some limitations for the shape and size of the rooms that can be covered.\n\nFor
+  this problem, we consider only rectangular rooms with integer dimensions <var>a</var>,
+  <var>b</var> and even size <var>s</var> = <var>a</var>·<var>b</var>.  \n\rWe use
+  the term 'size' to denote the floor surface area of the room, and — without loss
+  of generality — we add the condition <var>a</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>b</var>.\n\nThere is one rule to follow when laying out tatami: there must
+  be no points where corners of four different mats meet.  \n\rFor example, consider
+  the two arrangements below for a 4 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)4
+  room:\n\n ![](/home/will/src/euler-manager/config/../data/images/p_256_tatami3.gif)
+  \ \n\nThe arrangement on the left is acceptable, whereas the one on the right is
+  not: a red \" **X** \" in the middle, marks the point where four tatami meet.\n\nBecause
+  of this rule, certain even-sized rooms cannot be covered with tatami: we call them
+  tatami-free rooms.  \n\rFurther, we define <var>T</var>(<var>s</var>) as the number
+  of tatami-free rooms of size <var>s</var>.\n\nThe smallest tatami-free room has
+  size <var>s</var> = 70 and dimensions 7 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)10.
+  \ \n\rAll the other rooms of size <var>s</var> = 70 can be covered with tatami;
+  they are: 1 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)70,
+  2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)35 and
+  5 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)14.  \n\rHence,
+  <var>T</var>(70) = 1.\n\nSimilarly, we can verify that <var>T</var>(1320) = 5 because
+  there are exactly 5 tatami-free rooms of size <var>s</var> = 1320:  \n\r20 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)66,
+  22 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)60,
+  24 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)55,
+  30 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)44 and
+  33 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)40.
+  \ \n\rIn fact, <var>s</var> = 1320 is the smallest room-size <var>s</var> for which
+  <var>T</var>(<var>s</var>) = 5.\n\nFind the smallest room-size <var>s</var> for
+  which <var>T</var>(<var>s</var>) = 200.\n\n"

data/data/problems/257.yml

@@ -2,17 +2,13 @@
 :id: 257
 :name: Angular Bisectors
 :url: http://projecteuler.net/problem=257
-:content: "\r\n<span style=\"font-size:11pt;\">\r\n<p>Given is an integer sided triangle
-  ABC with sides a <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"> b <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  c. \r\n(AB = c, BC = a and AC = b).<br>\r\nThe angular bisectors of the triangle
-  intersect the sides at points E, F and G (see picture below).\r\n</p>\r\n<div align=\"center\">\r\n<img
-  src=\"project/images/p_257_bisector.gif\"><br>\n</div>\r\n<p>\r\nThe segments EF,
-  EG and FG partition the triangle ABC into four smaller triangles: AEG, BFE, CGF
-  and EFG.<br>\r\nIt can be proven that for each of these four triangles the ratio
-  area(ABC)/area(subtriangle) is rational.<br>\r\nHowever, there exist triangles for
-  which some or all of these ratios are integral.\r\n</p>\r\n<p>\r\nHow many triangles
-  ABC with perimeter<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\">100,000,000 exist so that the ratio
-  area(ABC)/area(AEG) is integral?\r\n</p>\r\n</span>\r\n\r\n\r\n\r\n\r\n"
+:content: "Given is an integer sided triangle ABC with sides a ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  b ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) c. \r(AB
+  = c, BC = a and AC = b).  \n\rThe angular bisectors of the triangle intersect the
+  sides at points E, F and G (see picture below).\n\n ![](/home/will/src/euler-manager/config/../data/images/p_257_bisector.gif)
+  \ \n\nThe segments EF, EG and FG partition the triangle ABC into four smaller triangles:
+  AEG, BFE, CGF and EFG.  \n\rIt can be proven that for each of these four triangles
+  the ratio area(ABC)/area(subtriangle) is rational.  \n\rHowever, there exist triangles
+  for which some or all of these ratios are integral.\n\nHow many triangles ABC with
+  perimeter ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)100,000,000
+  exist so that the ratio area(ABC)/area(AEG) is integral?\n\n"

data/data/problems/258.yml

@@ -2,12 +2,10 @@
 :id: 258
 :name: A lagged Fibonacci sequence
 :url: http://projecteuler.net/problem=258
-:content: "\r\n<p>A sequence is defined as:</p>\r\n<p>\r\n</p>\n<ul>\n<li>\n<var>g</var><sub><var>k</var></sub>
-  = 1, for 0 <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;\">
-  1999</li>\r\n<li>\n<var>g</var><sub><var>k</var></sub> = <var>g</var><sub><var>k</var>-2000</sub>
-  + <var>g</var><sub><var>k</var>-1999</sub>, for <var>k</var> <img src=\"images/symbol_ge.gif\"
-  width=\"10\" height=\"12\" alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\">
-  2000.\r\n</li>\n</ul>\n<p>Find <var>g</var><sub><var>k</var></sub> mod 20092010
-  for <var>k</var> = 10<sup>18</sup>.\r\n</p>"
+:content: "A sequence is defined as:\n\n- <var>g</var><sub><var>k</var></sub> = 1,
+  for 0 ![≤](/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) 1999\n- <var>g</var><sub><var>k</var></sub>
+  = <var>g</var><sub><var>k</var>-2000</sub> + <var>g</var><sub><var>k</var>-1999</sub>,
+  for <var>k</var> ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  2000.\r\n\nFind <var>g</var><sub><var>k</var></sub> mod 20092010 for <var>k</var>
+  = 10<sup>18</sup>.\n\n"

data/data/problems/259.yml

@@ -2,15 +2,17 @@
 :id: 259
 :name: Reachable Numbers
 :url: http://projecteuler.net/problem=259
-:content: "\r\n<p>A positive integer will be called <i>reachable</i> if it can result
-  from an arithmetic expression obeying the following rules:</p>\r\n\r\n<ul>\n<li>Uses
-  the digits 1 through 9, in that order and exactly once each.</li>\r\n<li>Any successive
-  digits can be concatenated (for example, using the digits 2, 3 and 4 we obtain the
-  number 234).</li>\r\n<li>Only the four usual binary arithmetic operations (addition,
-  subtraction, multiplication and division) are allowed.</li>\r\n<li>Each operation
-  can be used any number of times, or not at all.</li>\r\n<li>\n<dfn title=\"A minus
-  sign applied to a single operand (as opposed to a subtraction operator between two
-  operands)\">Unary minus</dfn> is not allowed.</li>\r\n<li>Any number of (possibly
-  nested) parentheses may be used to define the order of operations.</li>\r\n</ul>\n<p>For
-  example, 42 is reachable, since (1/23) * ((4*5)-6) * (78-9) = 42.</p>\r\n\r\n<p>What
-  is the sum of all positive reachable integers?</p>\r\n"
+:content: |+
+  A positive integer will be called _reachable_ if it can result from an arithmetic expression obeying the following rules:
+
+  - Uses the digits 1 through 9, in that order and exactly once each.
+  - Any successive digits can be concatenated (for example, using the digits 2, 3 and 4 we obtain the number 234).
+  - Only the four usual binary arithmetic operations (addition, subtraction, multiplication and division) are allowed.
+  - Each operation can be used any number of times, or not at all.
+  - <dfn title="A minus sign applied to a single operand (as opposed to a subtraction operator between two operands)">Unary minus</dfn> is not allowed.
+  - Any number of (possibly nested) parentheses may be used to define the order of operations.
+
+  For example, 42 is reachable, since (1/23) \* ((4\*5)-6) \* (78-9) = 42.
+
+  What is the sum of all positive reachable integers?
+

data/data/problems/26.yml

@@ -2,10 +2,20 @@
 :id: 26
 :name: Reciprocal cycles
 :url: http://projecteuler.net/problem=26
-:content: "\r\n\n<p>A unit fraction contains 1 in the numerator. The decimal representation
-  of the unit fractions with denominators 2 to 10 are given:</p>\n<blockquote>\n<table>\n<tr>\n<td>\n<sup>1</sup>/<sub>2</sub>\n</td>\n<td>= </td>\n<td>0.5</td>\n</tr>\n<tr>\n<td>\n<sup>1</sup>/<sub>3</sub>\n</td>\n<td>= </td>\n<td>0.(3)</td>\n</tr>\n<tr>\n<td>\n<sup>1</sup>/<sub>4</sub>\n</td>\n<td>= </td>\n<td>0.25</td>\n</tr>\n<tr>\n<td>\n<sup>1</sup>/<sub>5</sub>\n</td>\n<td>= </td>\n<td>0.2</td>\n</tr>\n<tr>\n<td>\n<sup>1</sup>/<sub>6</sub>\n</td>\n<td>= </td>\n<td>0.1(6)</td>\n</tr>\n<tr>\n<td>\n<sup>1</sup>/<sub>7</sub>\n</td>\n<td>= </td>\n<td>0.(142857)</td>\n</tr>\n<tr>\n<td>\n<sup>1</sup>/<sub>8</sub>\n</td>\n<td>= </td>\n<td>0.125</td>\n</tr>\n<tr>\n<td>\n<sup>1</sup>/<sub>9</sub>\n</td>\n<td>= </td>\n<td>0.(1)</td>\n</tr>\n<tr>\n<td>\n<sup>1</sup>/<sub>10</sub>\n</td>\n<td>= </td>\n<td>0.1</td>\n</tr>\n</table>\n</blockquote>\n<p>Where
-  0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that
-  <sup>1</sup>/<sub>7</sub> has a 6-digit recurring cycle.</p>\n<p>Find the value
-  of <i>d</i> <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  border=\"0\" style=\"vertical-align:middle;\"> 1000 for which <sup>1</sup>/<sub><i>d</i></sub>
-  contains the longest recurring cycle in its decimal fraction part.</p>\n\r\n"
+:content: |+
+  A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:
+
+  > | <sup>1</sup>/<sub>2</sub> | =  | 0.5 |
+  > | <sup>1</sup>/<sub>3</sub> | =  | 0.(3) |
+  > | <sup>1</sup>/<sub>4</sub> | =  | 0.25 |
+  > | <sup>1</sup>/<sub>5</sub> | =  | 0.2 |
+  > | <sup>1</sup>/<sub>6</sub> | =  | 0.1(6) |
+  > | <sup>1</sup>/<sub>7</sub> | =  | 0.(142857) |
+  > | <sup>1</sup>/<sub>8</sub> | =  | 0.125 |
+  > | <sup>1</sup>/<sub>9</sub> | =  | 0.(1) |
+  > | <sup>1</sup>/<sub>10</sub> | =  | 0.1 |
+
+  Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that <sup>1</sup>/<sub>7</sub> has a 6-digit recurring cycle.
+
+  Find the value of _d_ ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 1000 for which <sup>1</sup>/<sub><i>d</i></sub> contains the longest recurring cycle in its decimal fraction part.
+