euler-manager 0.0.5 → 0.0.6

data/data/problems/316.yml

@@ -2,24 +2,24 @@
 :id: 316
 :name: Numbers in decimal expansions
 :url: http://projecteuler.net/problem=316
-:content: "\r\n<p>Let <var>p</var> = <var>p<sub><font size=\"-2\">1</font></sub> p<sub><font
+:content: "Let <var>p</var> = <var>p<sub><font size=\"-2\">1</font></sub> p<sub><font
   size=\"-2\">2</font></sub> p<sub><font size=\"-2\">3</font></sub></var> ... be an
   infinite sequence of random digits, selected from {0,1,2,3,4,5,6,7,8,9} with equal
-  probability.<br>\r\nIt can be seen that <var>p</var> corresponds to the real number
+  probability.  \n\rIt can be seen that <var>p</var> corresponds to the real number
   0.<var>p<sub><font size=\"-2\">1</font></sub> p<sub><font size=\"-2\">2</font></sub>
-  p<sub><font size=\"-2\">3</font></sub></var> .... <br>\r\nIt can also be seen that
+  p<sub><font size=\"-2\">3</font></sub></var> ....   \n\rIt can also be seen that
   choosing a random real number from the interval [0,1) is equivalent to choosing
   an infinite sequence of random digits selected from {0,1,2,3,4,5,6,7,8,9} with equal
-  probability.</p>\r\n\r\n<p>For any positive integer <var>n</var> with <var>d</var>
-  decimal digits, let <var>k</var> be the smallest index such that <br><var>p<sub><small>k</small>,
+  probability.\n\nFor any positive integer <var>n</var> with <var>d</var> decimal
+  digits, let <var>k</var> be the smallest index such that   \n <var>p<sub><small>k</small>,
   </sub></var><var>p<sub><small>k+1</small></sub></var>, ...<var>p<sub><small>k+d-1</small></sub></var>
-  are the decimal digits of <var>n</var>, in the same order.<br>\r\nAlso, let <var>g</var>(<var>n</var>)
+  are the decimal digits of <var>n</var>, in the same order.  \n\rAlso, let <var>g</var>(<var>n</var>)
   be the expected value of <var>k</var>; it can be proven that <var>g</var>(<var>n</var>)
-  is always finite and, interestingly, always an integer number.</p>\r\n\r\n<p>For
-  example, if <var>n</var> = 535, then<br>\r\nfor <var>p</var> = 31415926<b>535</b>897....,
-  we get <var>k</var> = 9<br>\r\nfor <var>p</var> = 35528714365004956000049084876408468<b>535</b>4...,
-  we get <var>k</var> = 36<br>\r\netc and we find that <var>g</var>(535) = 1008.</p>\r\n\r\n<p>Given
-  that <img style=\"vertical-align:middle\" src=\"project/images/p_316_decexp1.gif\">,
-  find <img style=\"vertical-align:middle\" src=\"project/images/p_316_decexp2.gif\"></p>\r\n\r\n<u><i>Note</i></u>:
-  <img style=\"vertical-align:middle\" src=\"project/images/p_316_decexp3.gif\"> represents
+  is always finite and, interestingly, always an integer number.\n\nFor example, if
+  <var>n</var> = 535, then  \n\rfor <var>p</var> = 31415926 **535** 897...., we get
+  <var>k</var> = 9  \n\rfor <var>p</var> = 35528714365004956000049084876408468 **535**
+  4..., we get <var>k</var> = 36  \n\retc and we find that <var>g</var>(535) = 1008.\n\nGiven
+  that ![](/home/will/src/euler-manager/config/../data/images/p_316_decexp1.gif),
+  find ![](/home/will/src/euler-manager/config/../data/images/p_316_decexp2.gif)\n\n<u><i>Note</i></u>:
+  ![](/home/will/src/euler-manager/config/../data/images/p_316_decexp3.gif) represents
   the floor function.\r\n"

data/data/problems/317.yml

@@ -2,10 +2,9 @@
 :id: 317
 :name: Firecracker
 :url: http://projecteuler.net/problem=317
-:content: "\r\n<p>\r\nA firecracker explodes at a height of 100 m above level ground.
-  It breaks into a large number of very small fragments, which move in every direction;
-  all of them have the same initial velocity of 20 m/s.\r\n</p>\r\n<p>\r\nWe assume
-  that the fragments move without air resistance, in a uniform gravitational field
-  with g=9.81 m/s<sup>2</sup>.\r\n</p>\r\n<p>\r\nFind the volume (in m<sup>3</sup>)
-  of the region through which the fragments move before reaching the ground. \r\nGive
-  your answer rounded to four decimal places.\r\n</p>\r\n\r\n\r\n\r\n"
+:content: "A firecracker explodes at a height of 100 m above level ground. It breaks
+  into a large number of very small fragments, which move in every direction; all
+  of them have the same initial velocity of 20 m/s.\n\nWe assume that the fragments
+  move without air resistance, in a uniform gravitational field with g=9.81 m/s<sup>2</sup>.\n\nFind
+  the volume (in m<sup>3</sup>) of the region through which the fragments move before
+  reaching the ground. \rGive your answer rounded to four decimal places.\n\n"

data/data/problems/318.yml

@@ -2,60 +2,38 @@
 :id: 318
 :name: 2011 nines
 :url: http://projecteuler.net/problem=318
-:content: "\r\n<p>\r\nConsider the real number <img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">2+<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">3.<br>\r\nWhen we calculate the even powers of
-  <img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">2+<img src=\"images/symbol_radic.gif\" width=\"14\"
-  height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">3\r\nwe get:<br>\r\n(<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">2+<img src=\"images/symbol_radic.gif\" width=\"14\"
-  height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">3)<sup>2</sup>
-  = 9.898979485566356...<br>\r\n(<img src=\"images/symbol_radic.gif\" width=\"14\"
-  height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">2+<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">3)<sup>4</sup>
-  = 97.98979485566356...<br>\r\n(<img src=\"images/symbol_radic.gif\" width=\"14\"
-  height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">2+<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">3)<sup>6</sup>
-  = 969.998969071069263...<br>\r\n(<img src=\"images/symbol_radic.gif\" width=\"14\"
-  height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">2+<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">3)<sup>8</sup>
-  = 9601.99989585502907...<br>\r\n(<img src=\"images/symbol_radic.gif\" width=\"14\"
-  height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">2+<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">3)<sup>10</sup>
-  = 95049.999989479221...<br>\r\n(<img src=\"images/symbol_radic.gif\" width=\"14\"
-  height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">2+<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">3)<sup>12</sup>
-  = 940897.9999989371855...<br>\r\n(<img src=\"images/symbol_radic.gif\" width=\"14\"
-  height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">2+<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">3)<sup>14</sup>
-  = 9313929.99999989263...<br>\r\n(<img src=\"images/symbol_radic.gif\" width=\"14\"
-  height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">2+<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">3)<sup>16</sup>
-  = 92198401.99999998915...<br></p>\r\n<p>\r\nIt looks like that the number of consecutive
-  nines at the beginning of the fractional part of these powers is non-decreasing.<br>\r\nIn
-  fact it can be proven that the fractional part of (<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">2+<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">3)<sup>2n</sup> approaches 1 for large n.\r\n</p>\r\n<p>\r\nConsider
-  all real numbers of the form <img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\"
-  alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">p+<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">q
-  with p and q positive integers and p<img src=\"images/symbol_lt.gif\" width=\"10\"
-  height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">q, such
-  that the fractional part \r\nof (<img src=\"images/symbol_radic.gif\" width=\"14\"
-  height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">p+<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">q)<sup>2n</sup>
-  approaches 1 for large n.\r\n</p>\r\n<p>\r\nLet C(p,q,n) be the number of consecutive
-  nines at the beginning of the fractional part of <br> (<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">p+<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">q)<sup>2n</sup>.\r\n</p>\r\n<p>\r\nLet N(p,q) be
-  the minimal value of n such that C(p,q,n) <img src=\"images/symbol_ge.gif\" width=\"10\"
-  height=\"12\" alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\"> 2011.\r\n</p>\r\n<p>\r\nFind
-  <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\">N(p,q) for p+q <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  2011.\r\n</p>\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n
-  \r\n\r\n\r\n"
+:content: "Consider the real number ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2+
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)3.  \n\rWhen
+  we calculate the even powers of ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2+
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)3\rwe get:
+  \ \n\r( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2+
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)3)<sup>2</sup>
+  = 9.898979485566356...  \n\r( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2+
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)3)<sup>4</sup>
+  = 97.98979485566356...  \n\r( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2+
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)3)<sup>6</sup>
+  = 969.998969071069263...  \n\r( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2+
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)3)<sup>8</sup>
+  = 9601.99989585502907...  \n\r( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2+
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)3)<sup>10</sup>
+  = 95049.999989479221...  \n\r( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2+
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)3)<sup>12</sup>
+  = 940897.9999989371855...  \n\r( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2+
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)3)<sup>14</sup>
+  = 9313929.99999989263...  \n\r( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2+
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)3)<sup>16</sup>
+  = 92198401.99999998915...\n\nIt looks like that the number of consecutive nines
+  at the beginning of the fractional part of these powers is non-decreasing.  \n\rIn
+  fact it can be proven that the fractional part of ( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2+
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)3)<sup>2n</sup>
+  approaches 1 for large n.\n\nConsider all real numbers of the form ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)p+
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)q with
+  p and q positive integers and p ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)q,
+  such that the fractional part \rof ( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)p+
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)q)<sup>2n</sup>
+  approaches 1 for large n.\n\nLet C(p,q,n) be the number of consecutive nines at
+  the beginning of the fractional part of   \n ( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)p+
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)q)<sup>2n</sup>.\n\nLet
+  N(p,q) be the minimal value of n such that C(p,q,n) ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  2011.\n\nFind ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)N(p,q)
+  for p+q ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 2011.\n\n"

data/data/problems/319.yml

@@ -2,22 +2,18 @@
 :id: 319
 :name: Bounded Sequences
 :url: http://projecteuler.net/problem=319
-:content: "\r\n<p>\r\nLet <var>x</var><sub>1</sub>, <var>x</var><sub>2</sub>,...,
-  <var>x<sub>n</sub></var> be a sequence of length <var>n</var> such that:\r\n</p>\n<ul>\n<li>\n<var>x</var><sub>1</sub>
-  = 2</li>\r\n<li>for all 1 <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\"
-  alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>i</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>
-  : <var>x</var><sub><var>i</var>-<i>1</i></sub><img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>x<sub>i</sub></var>\n</li>\r\n<li>for
-  all <var>i</var> and <var>j</var> with 1 <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i</var>,
-  <var>j</var> <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>n</var> : (<var>x<sub>i</sub></var>)<var><sup>
-  j</sup></var> <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  border=\"0\" style=\"vertical-align:middle;\"> (<var>x<sub>j</sub></var> + 1)<var><sup>i</sup></var>\n</li>\r\n</ul>\n<p>\r\nThere
-  are only five such sequences of length 2, namely:\r\n{2,4}, {2,5}, {2,6}, {2,7}
-  and {2,8}.<br>\r\nThere are 293 such sequences of length 5; three examples are given
-  below:<br>\r\n{2,5,11,25,55}, {2,6,14,36,88}, {2,8,22,64,181}.\r\n</p>\r\n<p>\r\nLet
-  <var>t</var>(<var>n</var>) denote the number of such sequences of length <var>n</var>.<br>\r\nYou
-  are given that <var>t</var>(10) = 86195 and <var>t</var>(20) = 5227991891.\r\n</p>\r\n<p>\r\nFind
-  <var>t</var>(10<sup>10</sup>) and give your answer modulo 10<sup>9</sup>.\r\n</p>\r\n\r\n\r\n"
+:content: "Let <var>x</var><sub>1</sub>, <var>x</var><sub>2</sub>,..., <var>x<sub>n</sub></var>
+  be a sequence of length <var>n</var> such that:\n\n- <var>x</var><sub>1</sub> =
+  2\n- for all 1 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>i</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>n</var> : <var>x</var><sub><var>i</var>-<i>1</i></sub> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>x<sub>i</sub></var>\n- for all <var>i</var> and <var>j</var> with 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>i</var>, <var>j</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>n</var> : (<var>x<sub>i</sub></var>)<var><sup> j</sup></var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  (<var>x<sub>j</sub></var> + 1)<var><sup>i</sup></var>\n\nThere are only five such
+  sequences of length 2, namely:\r{2,4}, {2,5}, {2,6}, {2,7} and {2,8}.  \n\rThere
+  are 293 such sequences of length 5; three examples are given below:  \n\r{2,5,11,25,55},
+  {2,6,14,36,88}, {2,8,22,64,181}.\n\nLet <var>t</var>(<var>n</var>) denote the number
+  of such sequences of length <var>n</var>.  \n\rYou are given that <var>t</var>(10)
+  = 86195 and <var>t</var>(20) = 5227991891.\n\nFind <var>t</var>(10<sup>10</sup>)
+  and give your answer modulo 10<sup>9</sup>.\n\n"

data/data/problems/32.yml

@@ -2,13 +2,12 @@
 :id: 32
 :name: Pandigital products
 :url: http://projecteuler.net/problem=32
-:content: "\r\n<p>We shall say that an <var>n</var>-digit number is pandigital if
-  it makes use of all the digits 1 to <var>n</var> exactly once; for example, the
-  5-digit number, 15234, is 1 through 5 pandigital.</p>\r\n\r\n<p>The product 7254
-  is unusual, as the identity, 39 <img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 186 = 7254,
-  containing multiplicand, multiplier, and product is 1 through 9 pandigital.</p>\r\n\r\n<p>Find
-  the sum of all products whose multiplicand/multiplier/product identity can be written
-  as a 1 through 9 pandigital.</p>\r\n\r\n<div class=\"note\">HINT: Some products
-  can be obtained in more than one way so be sure to only include it once in your
-  sum.</div>\r\n\r\n"
+:content: |+
+  We shall say that an <var>n</var>-digit number is pandigital if it makes use of all the digits 1 to <var>n</var> exactly once; for example, the 5-digit number, 15234, is 1 through 5 pandigital.
+
+  The product 7254 is unusual, as the identity, 39 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital.
+
+  Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through 9 pandigital.
+
+  HINT: Some products can be obtained in more than one way so be sure to only include it once in your sum.
+

data/data/problems/320.yml

@@ -2,11 +2,12 @@
 :id: 320
 :name: Factorials divisible by a huge integer
 :url: http://projecteuler.net/problem=320
-:content: "\r\n<p>\r\nLet N(<var>i</var>) be the smallest integer <var>n</var> such
-  that <var>n</var>! is divisible by (<var>i</var>!)<sup>1234567890</sup></p>\r\n<p>\r\nLet
-  S(<var>u</var>)=<img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\"
-  border=\"0\" style=\"vertical-align:middle;\">N(<var>i</var>) for 10 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>u</var>.\r\n</p>\r\n<p>\r\nS(1000)=614538266565663.\r\n</p>\r\n<p>\r\nFind
-  S(1 000 000) mod 10<sup>18</sup>.\r\n</p>\r\n\r\n\r\n"
+:content: |+
+  Let N(<var>i</var>) be the smallest integer <var>n</var> such that <var>n</var>! is divisible by (<var>i</var>!)<sup>1234567890</sup>
+
+  Let S(<var>u</var>)= ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)N(<var>i</var>) for 10 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>i</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>u</var>.
+
+  S(1000)=614538266565663.
+
+  Find S(1 000 000) mod 10<sup>18</sup>.
+

data/data/problems/321.yml

@@ -2,17 +2,16 @@
 :id: 321
 :name: Swapping Counters
 :url: http://projecteuler.net/problem=321
-:content: "\r\n<p>A horizontal row comprising of 2<var>n</var> + 1 squares has <var>n</var>
+:content: "A horizontal row comprising of 2<var>n</var> + 1 squares has <var>n</var>
   red counters placed at one end and <var>n</var> blue counters at the other end,
   being separated by a single empty square in the centre. For example, when <var>n</var>
-  = 3.</p>\r\n\r\n<p></p>\n<div align=\"center\"><img src=\"project/images/p_321_swapping_counters_1.gif\"></div>\r\n\r\n<p>A
+  = 3.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_321_swapping_counters_1.gif)\n\nA
   counter can move from one square to the next (slide) or can jump over another counter
-  (hop) as long as the square next to that counter is unoccupied.</p>\r\n\r\n<p></p>\n<div
-  align=\"center\"><img src=\"project/images/p_321_swapping_counters_2.gif\"></div>\r\n\r\n<p>Let
+  (hop) as long as the square next to that counter is unoccupied.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_321_swapping_counters_2.gif)\n\nLet
   M(<var>n</var>) represent the minimum number of moves/actions to completely reverse
   the positions of the coloured counters; that is, move all the red counters to the
-  right and all the blue counters to the left.</p>\r\n<p>It can be verified M(3) =
-  15, which also happens to be a triangle number.</p>\r\n\r\n<p>If we create a sequence
-  based on the values of <var>n</var> for which M(<var>n</var>) is a triangle number
-  then the first five terms would be:\r\n<br>1, 3, 10, 22, and 63, and their sum would
-  be 99.</p>\r\n\r\n<p>Find the sum of the first forty terms of this sequence.</p>\r\n"
+  right and all the blue counters to the left.\n\nIt can be verified M(3) = 15, which
+  also happens to be a triangle number.\n\nIf we create a sequence based on the values
+  of <var>n</var> for which M(<var>n</var>) is a triangle number then the first five
+  terms would be:\r  \n1, 3, 10, 22, and 63, and their sum would be 99.\n\nFind the
+  sum of the first forty terms of this sequence.\n\n"

data/data/problems/322.yml

@@ -2,11 +2,9 @@
 :id: 322
 :name: Binomial coefficients divisible by 10
 :url: http://projecteuler.net/problem=322
-:content: "\r\n<p>\r\nLet T(<var>m</var>, <var>n</var>) be the number of the binomial
-  coefficients <sup><var>i</var></sup>C<sub><var>n</var></sub> that are divisible
-  by 10 for <var>n</var> <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i</var> <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>m</var>(<var>i</var>,
-  <var>m</var> and <var>n</var> are positive integers).<br>\r\nYou are given that
-  T(10<sup>9</sup>, 10<sup>7</sup>-10) = 989697000.\r\n</p>\r\n<p>\r\nFind T(10<sup>18</sup>,
-  10<sup>12</sup>-10).\r\n</p>\r\n"
+:content: "Let T(<var>m</var>, <var>n</var>) be the number of the binomial coefficients
+  <sup><var>i</var></sup>C<sub><var>n</var></sub> that are divisible by 10 for <var>n</var>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>i</var>
+  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) <var>m</var>(<var>i</var>,
+  <var>m</var> and <var>n</var> are positive integers).  \n\rYou are given that T(10<sup>9</sup>,
+  10<sup>7</sup>-10) = 989697000.\n\nFind T(10<sup>18</sup>, 10<sup>12</sup>-10).\n\n"

data/data/problems/323.yml

@@ -2,18 +2,15 @@
 :id: 323
 :name: Bitwise-OR operations on random integers
 :url: http://projecteuler.net/problem=323
-:content: "\r\n<p>Let <var>y</var><sub>0</sub>, <var>y</var><sub>1</sub>, <var>y</var><sub>2</sub>,...
-  be a sequence of random unsigned 32 bit integers<br>\r\n(i.e. 0 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>y<sub>i</sub></var>
-  <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> 2<sup>32</sup>, every value equally likely).</p>\r\n<p>For
-  the sequence <var>x<sub>i</sub></var> the following recursion is given:<br></p>\n<ul>\n<li>\n<var>x</var><sub>0</sub>
-  = 0 and</li>\r\n<li>\n<var>x<sub>i</sub></var> = <var>x</var><sub><var>i</var>-<i>1</i></sub><b>|</b>
-  <var>y</var><sub><var>i</var>-<i>1</i></sub>, for <var>i</var> <img src=\"images/symbol_gt.gif\"
-  width=\"10\" height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\">
-  0. ( <b>|</b> is the bitwise-OR operator)</li>\r\n</ul>\n<p>It can be seen that
-  eventually there will be an index N such that <var>x<sub>i</sub></var> = 2<sup>32</sup>
-  -1 (a bit-pattern of all ones) for all <var>i</var> <img src=\"images/symbol_ge.gif\"
-  width=\"10\" height=\"12\" alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\">
-  N.</p>\r\n\r\n<p>Find the expected value of N. <br>\r\nGive your answer rounded
-  to 10 digits after the decimal point.</p>\r\n"
+:content: "Let <var>y</var><sub>0</sub>, <var>y</var><sub>1</sub>, <var>y</var><sub>2</sub>,...
+  be a sequence of random unsigned 32 bit integers  \n\r(i.e. 0 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>y<sub>i</sub></var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  2<sup>32</sup>, every value equally likely).\n\nFor the sequence <var>x<sub>i</sub></var>
+  the following recursion is given:\n\n- <var>x</var><sub>0</sub> = 0 and\n- <var>x<sub>i</sub></var>
+  = <var>x</var><sub><var>i</var>-<i>1</i></sub> **|** <var>y</var><sub><var>i</var>-<i>1</i></sub>,
+  for <var>i</var> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)
+  0. ( **|** is the bitwise-OR operator)\n\nIt can be seen that eventually there will
+  be an index N such that <var>x<sub>i</sub></var> = 2<sup>32</sup> -1 (a bit-pattern
+  of all ones) for all <var>i</var> ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  N.\n\nFind the expected value of N.   \n\rGive your answer rounded to 10 digits
+  after the decimal point.\n\n"

data/data/problems/324.yml

@@ -2,16 +2,13 @@
 :id: 324
 :name: Building a tower
 :url: http://projecteuler.net/problem=324
-:content: "\r\n<p>Let <var>f</var>(<var>n</var>) represent the number of ways one
-  can fill a 3<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\"
-  border=\"0\" style=\"vertical-align:middle;\">3<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>
-  tower with blocks of 2<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">1<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">1.
-  <br>You're allowed to rotate the blocks in any way you like; however, rotations,
-  reflections etc of the tower itself are counted as distinct.</p>\r\n<p>For example
-  (with <var>q</var> = 100000007) :<br><var>f</var>(2) = 229,<br><var>f</var>(4) =
-  117805,<br><var>f</var>(10) mod <var>q</var> = 96149360,<br><var>f</var>(10<sup>3</sup>)
-  mod <var>q</var> = 24806056,<br><var>f</var>(10<sup>6</sup>) mod <var>q</var> =
-  30808124.</p>\r\n\r\n<p>Find <var>f</var>(10<sup>10000</sup>) mod 100000007.</p>\r\n"
+:content: "Let <var>f</var>(<var>n</var>) represent the number of ways one can fill
+  a 3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)<var>n</var>
+  tower with blocks of 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)1
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)1.   \nYou're
+  allowed to rotate the blocks in any way you like; however, rotations, reflections
+  etc of the tower itself are counted as distinct.\n\nFor example (with <var>q</var>
+  = 100000007) :  \n<var>f</var>(2) = 229,  \n<var>f</var>(4) = 117805,  \n<var>f</var>(10)
+  mod <var>q</var> = 96149360,  \n<var>f</var>(10<sup>3</sup>) mod <var>q</var> =
+  24806056,  \n<var>f</var>(10<sup>6</sup>) mod <var>q</var> = 30808124.\n\nFind <var>f</var>(10<sup>10000</sup>)
+  mod 100000007.\n\n"

data/data/problems/325.yml

@@ -2,24 +2,18 @@
 :id: 325
 :name: Stone Game II
 :url: http://projecteuler.net/problem=325
-:content: "\r\n<p>\r\nA game is played with two piles of stones and two players. At
-  her turn, a player removes a number of stones from the larger pile. The number of
-  stones she removes must be a positive multiple of the number of stones in the smaller
-  pile.\r\n</p>\r\n\r\n<p>\r\nE.g., let the ordered pair(6,14) describe a configuration
-  with 6 stones in the smaller pile and 14 stones in the larger pile, then the first
-  player can remove 6 or 12 stones from the larger pile.\r\n</p>\r\n\r\n<p>\r\nThe
-  player taking all the stones from a pile wins the game.\r\n</p>\r\n\r\n<p>\r\nA
-  <i>winning configuration</i> is one where the first player can force a win. For
-  example, (1,5), (2,6) and (3,12) are winning configurations because the first player
-  can immediately remove all stones in the second pile.\r\n</p>\r\n\r\n<p>\r\nA <i>losing
-  configuration</i> is one where the second player can force a win, no matter what
-  the first player does. For example, (2,3) and (3,4) are losing configurations: any
-  legal move leaves a winning configuration for the second player.\r\n</p>\r\n\r\n<p>\r\nDefine
-  S(<var>N</var>) as the sum of (<var>x</var><sub><var>i</var></sub>+<var>y</var><sub><var>i</var></sub>)
-  for all losing configurations (<var>x</var><sub><var>i</var></sub>,<var>y</var><sub><var>i</var></sub>),
-  0 <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>x</var><sub><var>i</var></sub><img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>y</var><sub><var>i</var></sub><img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>N</var>.
-  We can verify that S(10) = 211 and S(10<sup>4</sup>) = 230312207313.\r\n</p>\r\n\r\n<p>\r\nFind
-  S(10<sup>16</sup>) mod 7<sup>10</sup>.\r\n</p>\r\n"
+:content: |+
+  A game is played with two piles of stones and two players. At her turn, a player removes a number of stones from the larger pile. The number of stones she removes must be a positive multiple of the number of stones in the smaller pile.
+
+  E.g., let the ordered pair(6,14) describe a configuration with 6 stones in the smaller pile and 14 stones in the larger pile, then the first player can remove 6 or 12 stones from the larger pile.
+
+  The player taking all the stones from a pile wins the game.
+
+  A _winning configuration_ is one where the first player can force a win. For example, (1,5), (2,6) and (3,12) are winning configurations because the first player can immediately remove all stones in the second pile.
+
+  A _losing configuration_ is one where the second player can force a win, no matter what the first player does. For example, (2,3) and (3,4) are losing configurations: any legal move leaves a winning configuration for the second player.
+
+  Define S(<var>N</var>) as the sum of (<var>x</var><sub><var>i</var></sub>+<var>y</var><sub><var>i</var></sub>) for all losing configurations (<var>x</var><sub><var>i</var></sub>,<var>y</var><sub><var>i</var></sub>), 0 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) <var>x</var><sub><var>i</var></sub> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) <var>y</var><sub><var>i</var></sub> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>N</var>. We can verify that S(10) = 211 and S(10<sup>4</sup>) = 230312207313.
+
+  Find S(10<sup>16</sup>) mod 7<sup>10</sup>.
+

data/data/problems/326.yml

@@ -2,11 +2,18 @@
 :id: 326
 :name: Modulo Summations
 :url: http://projecteuler.net/problem=326
-:content: "\r\n<p>\r\nLet <var>a<sub>n</sub></var> be a sequence recursively defined
-  by: <img src=\"project/images/p_326_formula1.gif\" style=\"vertical-align:\r\nmiddle;\">.
-  \r\n</p>\r\n<p>\r\nSo the first 10 elements of <var>a<sub>n</sub></var> are: 1,1,0,3,0,3,5,4,1,9.\r\n</p>\r\n<p>Let
-  <var>f</var>(<var>N,M</var>) represent the number of pairs (<var>p,q</var>) such
-  that: </p>\n<div align=\"center\"><img src=\"project/images/p_326_formula2.gif\"></div>\r\n\r\n<p>\r\nIt
-  can be seen that <var>f</var>(10,10)=4 with the pairs (3,3), (5,5), (7,9) and (9,10).\r\n</p>\r\n<p>\r\nYou
-  are also given that <var>f</var>(10<sup>4</sup>,10<sup>3</sup>)=97158.</p>\r\n<p>\r\nFind
-  <var>f</var>(10<sup>12</sup>,10<sup>6</sup>).\r\n</p>\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n"
+:content: |+
+  Let <var>a<sub>n</sub></var> be a sequence recursively defined by: ![](/home/will/src/euler-manager/config/../data/images/p_326_formula1.gif).
+
+  So the first 10 elements of <var>a<sub>n</sub></var> are: 1,1,0,3,0,3,5,4,1,9.
+
+  Let <var>f</var>(<var>N,M</var>) represent the number of pairs (<var>p,q</var>) such that:
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_326_formula2.gif)
+
+  It can be seen that <var>f</var>(10,10)=4 with the pairs (3,3), (5,5), (7,9) and (9,10).
+
+  You are also given that <var>f</var>(10<sup>4</sup>,10<sup>3</sup>)=97158.
+
+  Find <var>f</var>(10<sup>12</sup>,10<sup>6</sup>).
+

data/data/problems/327.yml

@@ -2,38 +2,34 @@
 :id: 327
 :name: Rooms of Doom
 :url: http://projecteuler.net/problem=327
-:content: "\r\n<p>A series of three rooms are connected to each other by automatic
-  doors.</p>\r\n\r\n<div align=\"center\"><img src=\"http://projecteuler.net/project/images/p_327_rooms_of_doom.gif\"></div>\r\n\r\n<p>Each
+:content: "A series of three rooms are connected to each other by automatic doors.\n\n
+  ![](/home/will/src/euler-manager/config/../data/images/p_327_rooms_of_doom.gif)\n\nEach
   door is operated by a security card. Once you enter a room the door automatically
   closes and that security card cannot be used again. A machine at the start will
   dispense an unlimited number of cards, but each room (including the starting room)
   contains scanners and if they detect that you are holding more than three security
   cards or if they detect an unattended security card on the floor, then all the doors
   will become permanently locked. However, each room contains a box where you may
-  safely store any number of security cards for use at a later stage.</p>\r\n\r\n<p>If
-  you simply tried to travel through the rooms one at a time then as you entered room
-  3 you would have used all three cards and would be trapped in that room forever!</p>\r\n\r\n<p>However,
+  safely store any number of security cards for use at a later stage.\n\nIf you simply
+  tried to travel through the rooms one at a time then as you entered room 3 you would
+  have used all three cards and would be trapped in that room forever!\n\nHowever,
   if you make use of the storage boxes, then escape is possible. For example, you
   could enter room 1 using your first card, place one card in the storage box, and
   use your third card to exit the room back to the start. Then after collecting three
   more cards from the dispensing machine you could use one to enter room 1 and collect
   the card you placed in the box a moment ago. You now have three cards again and
   will be able to travel through the remaining three doors. This method allows you
-  to travel through all three rooms using six security cards in total.</p>\r\n\r\n<p>It
-  is possible to travel through six rooms using a total of 123 security cards while
-  carrying a maximum of 3 cards.</p>\r\n\r\n<p>Let <var>C</var> be the maximum number
-  of cards which can be carried at any time.</p>\r\n<p>Let <var>R</var> be the number
-  of rooms to travel through.</p>\r\n<p>Let M(<var>C</var>,<var>R</var>) be the minimum
-  number of cards required from the dispensing machine to travel through <var>R</var>
-  rooms carrying up to a maximum of <var>C</var> cards at any time.</p>\r\n\r\n<p>For
-  example, M(3,6)=123 and M(4,6)=23.<br>And, ΣM(<var>C</var>,6)=146 for 3 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>C</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 4.</p>\r\n\r\n\r\n<p>You are given that ΣM(<var>C</var>,10)=10382
-  for 3 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>C</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  10.</p>\r\n\r\n<p>Find ΣM(<var>C</var>,30) for 3 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>C</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 40.</p>\r\n\r\n\r\n"
+  to travel through all three rooms using six security cards in total.\n\nIt is possible
+  to travel through six rooms using a total of 123 security cards while carrying a
+  maximum of 3 cards.\n\nLet <var>C</var> be the maximum number of cards which can
+  be carried at any time.\n\nLet <var>R</var> be the number of rooms to travel through.\n\nLet
+  M(<var>C</var>,<var>R</var>) be the minimum number of cards required from the dispensing
+  machine to travel through <var>R</var> rooms carrying up to a maximum of <var>C</var>
+  cards at any time.\n\nFor example, M(3,6)=123 and M(4,6)=23.  \nAnd, ΣM(<var>C</var>,6)=146
+  for 3 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>C</var>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 4.\n\nYou
+  are given that ΣM(<var>C</var>,10)=10382 for 3 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>C</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  10.\n\nFind ΣM(<var>C</var>,30) for 3 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>C</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  40.\n\n"