euler-manager 0.0.5 → 0.0.6

data/data/problems/304.yml

@@ -2,18 +2,13 @@
 :id: 304
 :name: Primonacci
 :url: http://projecteuler.net/problem=304
-:content: "\r\n<p>\r\nFor any positive integer <var>n</var> the function next_prime(<var>n</var>)
-  returns the smallest prime p <br> such that p<img src=\"images/symbol_gt.gif\" width=\"10\"
-  height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>.\r\n</p>\r\n<p>\r\nThe
-  sequence a(<var>n</var>) is defined by:<br>\r\na(1)=next_prime(10<sup>14</sup>)
-  and a(<var>n</var>)=next_prime(a(<var>n</var>-1)) for n<img src=\"images/symbol_gt.gif\"
-  width=\"10\" height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\">1.\r\n</p>\n<p></p>\r\n<p>\r\nThe
-  fibonacci sequence f(<var>n</var>) is defined by:\r\nf(0)=0, f(1)=1 and f(<var>n</var>)=f(<var>n</var>-1)+f(<var>n</var>-2)
-  for <var>n</var><img src=\"images/symbol_gt.gif\" width=\"10\" height=\"10\" alt=\"&gt;\"
-  border=\"0\" style=\"vertical-align:middle;\">1.\r\n</p>\r\n<p>\r\nThe sequence
-  b(<var>n</var>) is defined as f(a(<var>n</var>)).\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;\">b(<var>n</var>)
-  for 1<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>n</var><img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">100 000. \r\nGive
-  your answer mod 1234567891011. \r\n\r\n\r\n\r\n\r\n\r\n</p>"
+:content: "For any positive integer <var>n</var> the function next\\_prime(<var>n</var>)
+  returns the smallest prime p   \n such that p ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)<var>n</var>.\n\nThe
+  sequence a(<var>n</var>) is defined by:  \n\ra(1)=next\\_prime(10<sup>14</sup>)
+  and a(<var>n</var>)=next\\_prime(a(<var>n</var>-1)) for n ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)1.\n\nThe
+  fibonacci sequence f(<var>n</var>) is defined by:\rf(0)=0, f(1)=1 and f(<var>n</var>)=f(<var>n</var>-1)+f(<var>n</var>-2)
+  for <var>n</var> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)1.\n\nThe
+  sequence b(<var>n</var>) is defined as f(a(<var>n</var>)).\n\nFind ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)b(<var>n</var>)
+  for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)<var>n</var>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)100 000. \rGive
+  your answer mod 1234567891011.\n\n"

data/data/problems/305.yml

@@ -2,13 +2,9 @@
 :id: 305
 :name: Reflexive Position
 :url: http://projecteuler.net/problem=305
-:content: "\r\n<p>\r\nLet's call S the (infinite) string that is made by concatenating
-  the consecutive positive integers (starting from 1)  written down in base 10.<br>
-  \r\nThus, S = 1234567891011121314151617181920212223242...\r\n</p>\r\n<p>\r\nIt's
-  easy to see that any number will show up an infinite number of times in S.\r\n</p>\r\n<p>\r\nLet's
-  call f(n) the starting position of the n<sup>th</sup> occurrence of n in S.<br>
-  \r\nFor example, f(1)=1, f(5)=81, f(12)=271 and f(7780)=111111365.\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;\">f(3<sup>k</sup>) for 1<img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">k<img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">13.\r\n</p>\r\n\r\n"
+:content: "Let's call S the (infinite) string that is made by concatenating the consecutive
+  positive integers (starting from 1) written down in base 10.  \n \rThus, S = 1234567891011121314151617181920212223242...\n\nIt's
+  easy to see that any number will show up an infinite number of times in S.\n\nLet's
+  call f(n) the starting position of the n<sup>th</sup> occurrence of n in S.  \n
+  \rFor example, f(1)=1, f(5)=81, f(12)=271 and f(7780)=111111365.\n\nFind ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)f(3<sup>k</sup>)
+  for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)k ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)13.\n\n"

data/data/problems/306.yml

@@ -2,28 +2,24 @@
 :id: 306
 :name: Paper-strip Game
 :url: http://projecteuler.net/problem=306
-:content: "\r\n<p>The following game is a classic example of Combinatorial Game Theory:</p>\r\n\r\n<p>Two
+:content: "The following game is a classic example of Combinatorial Game Theory:\n\nTwo
   players start with a strip of <var>n</var> white squares and they take alternate
-  turns.<br>\r\nOn each turn, a player picks two contiguous white squares and paints
-  them black.<br>\r\nThe first player who cannot make a move loses.</p>\r\n\r\n<p></p>\n<ul>\n<li>If
-  <var>n</var> = 1, there are no valid moves, so the first player loses automatically.</li>\r\n<li>If
-  <var>n</var> = 2, there is only one valid move, after which the second player loses.</li>\r\n<li>If
-  <var>n</var> = 3, there are two valid moves, but both leave a situation where the
-  second player loses.</li>\r\n<li>If <var>n</var> = 4, there are three valid moves
-  for the first player; she can win the game by painting the two middle squares.</li>\r\n<li>If
-  <var>n</var> = 5, there are four valid moves for the first player (shown below in
-  red); but no matter what she does, the second player (blue) wins.</li>\r\n</ul>\n<div
-  align=\"center\"><img src=\"project/images/p_306_pstrip.gif\"></div>\r\n\r\n\r\n<p>So,
-  for 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>n</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  5, there are 3 values of <var>n</var> for which the first player can force a win.<br>\r\nSimilarly,
-  for 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>n</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  50, there are 40 values of <var>n</var> for which the first player can force a win.</p>\r\n\r\n<p>For
-  1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>n</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  1 000 000, how many values of <var>n</var> are there for which the first player
-  can force a win?</p>\r\n"
+  turns.  \n\rOn each turn, a player picks two contiguous white squares and paints
+  them black.  \n\rThe first player who cannot make a move loses.\n\n- If <var>n</var>
+  = 1, there are no valid moves, so the first player loses automatically.\n- If <var>n</var>
+  = 2, there is only one valid move, after which the second player loses.\n- If <var>n</var>
+  = 3, there are two valid moves, but both leave a situation where the second player
+  loses.\n- If <var>n</var> = 4, there are three valid moves for the first player;
+  she can win the game by painting the two middle squares.\n- If <var>n</var> = 5,
+  there are four valid moves for the first player (shown below in red); but no matter
+  what she does, the second player (blue) wins.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_306_pstrip.gif)\n\nSo,
+  for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>n</var>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 5, there
+  are 3 values of <var>n</var> for which the first player can force a win.  \n\rSimilarly,
+  for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>n</var>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 50, there
+  are 40 values of <var>n</var> for which the first player can force a win.\n\nFor
+  1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>n</var>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 1 000 000,
+  how many values of <var>n</var> are there for which the first player can force a
+  win?\n\n"

data/data/problems/307.yml

@@ -2,11 +2,10 @@
 :id: 307
 :name: Chip Defects
 :url: http://projecteuler.net/problem=307
-:content: "\r\n<p>\r\n<var>k</var> defects are randomly distributed amongst <var>n</var>
-  integrated-circuit chips produced by a factory (any number of defects may be found
-  on a chip and each defect is independent of the other defects).\r\n</p>\r\n<p>\r\nLet
-  p(<var>k,n</var>) represent the probability that there is a chip with at least 3
-  defects.<br>\r\nFor instance p(3,7) <img src=\"images/symbol_asymp.gif\" width=\"11\"
-  height=\"9\" alt=\"≈\" border=\"0\" style=\"vertical-align:middle;\"> 0.0204081633.\r\n</p>\r\n<p>\r\nFind
-  p(20 000, 1 000 000) and give your answer rounded to 10 decimal places in the form
-  0.abcdefghij\r\n</p>\r\n"
+:content: "<var>k</var> defects are randomly distributed amongst <var>n</var> integrated-circuit
+  chips produced by a factory (any number of defects may be found on a chip and each
+  defect is independent of the other defects).\n\nLet p(<var>k,n</var>) represent
+  the probability that there is a chip with at least 3 defects.  \n\rFor instance
+  p(3,7) ![≈](/home/will/src/euler-manager/config/../data/images/symbol_asymp.gif)
+  0.0204081633.\n\nFind p(20 000, 1 000 000) and give your answer rounded to 10 decimal
+  places in the form 0.abcdefghij\n\n"

data/data/problems/308.yml

@@ -2,33 +2,22 @@
 :id: 308
 :name: An amazing Prime-generating Automaton
 :url: http://projecteuler.net/problem=308
-:content: "\r\n<p>A program written in the programming language Fractran consists
-  of a list of fractions.</p>\r\n\r\n<p>The internal state of the Fractran Virtual
-  Machine is a positive integer, which is initially set to a seed value. Each iteration
-  of a Fractran program multiplies the state integer by the first fraction in the
-  list which will leave it an integer.</p>\r\n\r\n<p>For example, one of the Fractran
-  programs that John Horton Conway wrote for prime-generation consists of the following
-  14 fractions:<br></p>\n<table class=\"formula\"><tr>\n<td><table class=\"frac\">\n<tr><td>17</td></tr>\n<tr><td
-  class=\"overline\">91</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table class=\"frac\">\n<tr><td>78</td></tr>\n<tr><td
-  class=\"overline\">85</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table class=\"frac\">\n<tr><td>19</td></tr>\n<tr><td
-  class=\"overline\">51</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table class=\"frac\">\n<tr><td>23</td></tr>\n<tr><td
-  class=\"overline\">38</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table class=\"frac\">\n<tr><td>29</td></tr>\n<tr><td
-  class=\"overline\">33</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table class=\"frac\">\n<tr><td>77</td></tr>\n<tr><td
-  class=\"overline\">29</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table class=\"frac\">\n<tr><td>95</td></tr>\n<tr><td
-  class=\"overline\">23</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table class=\"frac\">\n<tr><td>77</td></tr>\n<tr><td
-  class=\"overline\">19</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\">17</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table class=\"frac\">\n<tr><td>11</td></tr>\n<tr><td
-  class=\"overline\">13</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table class=\"frac\">\n<tr><td>13</td></tr>\n<tr><td
-  class=\"overline\">11</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table class=\"frac\">\n<tr><td>15</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\">7</td></tr>\n</table></td>\r\n<td>,</td>\r\n<td><table class=\"frac\">\n<tr><td>55</td></tr>\n<tr><td
-  class=\"overline\">1</td></tr>\n</table></td>\r\n<td>.</td>\r\n</tr></table>\n<p>Starting
-  with the seed integer 2, successive iterations of the program produce the sequence:<br>\r\n15,
-  825, 725, 1925, 2275, 425, ..., 68, <b>4</b>, 30, ..., 136, <b>8</b>, 60, ..., 544,
-  <b>32</b>, 240, ...</p>\r\n\r\n<p>The powers of 2 that appear in this sequence are
-  2<sup>2</sup>, 2<sup>3</sup>, 2<sup>5</sup>, ...<br>\r\nIt can be shown that <i>all</i>
-  the powers of 2 in this sequence have prime exponents and that <i>all</i> the primes
-  appear as exponents of powers of 2, in proper order!</p>\r\n\r\n<p>If someone uses
-  the above Fractran program to solve Project Euler Problem 7 (find the 10001<sup>st</sup>
-  prime), how many iterations would be needed until the program produces 2<sup>10001st
-  prime</sup> ?\r\n</p>"
+:content: "A program written in the programming language Fractran consists of a list
+  of fractions.\n\nThe internal state of the Fractran Virtual Machine is a positive
+  integer, which is initially set to a seed value. Each iteration of a Fractran program
+  multiplies the state integer by the first fraction in the list which will leave
+  it an integer.\n\nFor example, one of the Fractran programs that John Horton Conway
+  wrote for prime-generation consists of the following 14 fractions:\n\n| \n\n| 17
+  |\n| 91 |\n\n | , | \n\n| 78 |\n| 85 |\n\n | , | \n\n| 19 |\n| 51 |\n\n | , | \n\n|
+  23 |\n| 38 |\n\n | , | \n\n| 29 |\n| 33 |\n\n | , | \n\n| 77 |\n| 29 |\n\n | , |
+  \n\n| 95 |\n| 23 |\n\n | , | \n\n| 77 |\n| 19 |\n\n | , | \n\n| 1 |\n| 17 |\n\n
+  | , | \n\n| 11 |\n| 13 |\n\n | , | \n\n| 13 |\n| 11 |\n\n | , | \n\n| 15 |\n| 2
+  |\n\n | , | \n\n| 1 |\n| 7 |\n\n | , | \n\n| 55 |\n| 1 |\n\n | . |\n\nStarting with
+  the seed integer 2, successive iterations of the program produce the sequence:  \n\r15,
+  825, 725, 1925, 2275, 425, ..., 68, **4** , 30, ..., 136, **8** , 60, ..., 544,
+  **32** , 240, ...\n\nThe powers of 2 that appear in this sequence are 2<sup>2</sup>,
+  2<sup>3</sup>, 2<sup>5</sup>, ...  \n\rIt can be shown that _all_ the powers of
+  2 in this sequence have prime exponents and that _all_ the primes appear as exponents
+  of powers of 2, in proper order!\n\nIf someone uses the above Fractran program to
+  solve Project Euler Problem 7 (find the 10001<sup>st</sup> prime), how many iterations
+  would be needed until the program produces 2<sup>10001st prime</sup> ?\n\n"

data/data/problems/309.yml

@@ -2,16 +2,15 @@
 :id: 309
 :name: Integer Ladders
 :url: http://projecteuler.net/problem=309
-:content: "\r\n<p>In the classic \"Crossing Ladders\" problem, we are given the lengths
-  <var>x</var> and <var>y</var> of two ladders resting on the opposite walls of a
-  narrow, level street. We are also given the height <var>h</var> above the street
-  where the two ladders cross and we are asked to find the width of the street (<var>w</var>).</p>\r\n\r\n<div
-  align=\"center\"><img src=\"project/images/p_309_ladders.gif\"></div>\r\n\r\n<p>Here,
-  we are only concerned with instances where all four variables are positive integers.<br>\r\nFor
-  example, if <var>x</var> = 70, <var>y</var> = 119 and <var>h</var> = 30, we can
-  calculate that <var>w</var> = 56.</p>\r\n\r\n<p>In fact, for integer values <var>x</var>,
+:content: "In the classic \"Crossing Ladders\" problem, we are given the lengths <var>x</var>
+  and <var>y</var> of two ladders resting on the opposite walls of a narrow, level
+  street. We are also given the height <var>h</var> above the street where the two
+  ladders cross and we are asked to find the width of the street (<var>w</var>).\n\n
+  ![](/home/will/src/euler-manager/config/../data/images/p_309_ladders.gif)\n\nHere,
+  we are only concerned with instances where all four variables are positive integers.
+  \ \n\rFor example, if <var>x</var> = 70, <var>y</var> = 119 and <var>h</var> = 30,
+  we can calculate that <var>w</var> = 56.\n\nIn fact, for integer values <var>x</var>,
   <var>y</var>, <var>h</var> and 0 x y x,<var>y</var>,<var>h</var>) producing integer
-  solutions for <var>w</var>:<br>\r\n(70, 119, 30), (74, 182, 21), (87, 105, 35),
-  (100, 116, 35) and (119, 175, 40).</p>\r\n\r\n<p>For integer values <var>x</var>,
-  <var>y</var>, <var>h</var> and 0 x y x,<var>y</var>,<var>h</var>) produce integer
-  solutions for <var>w</var>?</p>\r\n\r\n"
+  solutions for <var>w</var>:  \n\r(70, 119, 30), (74, 182, 21), (87, 105, 35), (100,
+  116, 35) and (119, 175, 40).\n\nFor integer values <var>x</var>, <var>y</var>, <var>h</var>
+  and 0 x y x,<var>y</var>,<var>h</var>) produce integer solutions for <var>w</var>?\n\n"

data/data/problems/31.yml

@@ -2,17 +2,14 @@
 :id: 31
 :name: Coin sums
 :url: http://projecteuler.net/problem=31
-:content: "\r\n\n<p>In England the currency is made up of pound, £, and pence, p,
-  and there are eight coins in general circulation:</p>\n<blockquote>1p, 2p, 5p, 10p,
-  20p, 50p, £1 (100p) and £2 (200p).</blockquote>\n<p>It is possible to make £2 in
-  the following way:</p>\n<blockquote>1<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">£1 + 1<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">50p + 2<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">20p + 1<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">5p + 1<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">2p + 3<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">1p</blockquote>\n<p>How many different ways can
-  £2 be made using any number of coins?</p>\n\r\n"
+:content: |+
+  In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation:
+
+  > 1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).
+
+  It is possible to make £2 in the following way:
+
+  > 1 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)£1 + 1 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)50p + 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)20p + 1 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)5p + 1 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)2p + 3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)1p
+
+  How many different ways can £2 be made using any number of coins?
+

data/data/problems/310.yml

@@ -2,18 +2,13 @@
 :id: 310
 :name: Nim Square
 :url: http://projecteuler.net/problem=310
-:content: "\r\n<p>\r\nAlice and Bob play the game Nim Square.<br>\r\nNim Square is
-  just like ordinary three-heap normal play Nim, but the players may only remove a
-  square number of stones from a heap.<br>\r\nThe number of stones in the three heaps
-  is represented by the ordered triple (a,b,c).<br>\r\nIf 0<img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">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<img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">29
-  then the number of losing positions for the next player is 1160.\r\n</p>\r\n<p>\r\nFind
-  the number of losing positions for the next player if 0<img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">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<img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">100
-  000.\r\n</p>\r\n\r\n\r\n"
+:content: "Alice and Bob play the game Nim Square.  \n\rNim Square is just like ordinary
+  three-heap normal play Nim, but the players may only remove a square number of stones
+  from a heap.  \n\rThe number of stones in the three heaps is represented by the
+  ordered triple (a,b,c).  \n\rIf 0 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)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
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)29 then the
+  number of losing positions for the next player is 1160.\n\nFind the number of losing
+  positions for the next player if 0 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)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
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)100 000.\n\n"

data/data/problems/311.yml

@@ -2,20 +2,14 @@
 :id: 311
 :name: Biclinic Integral Quadrilaterals
 :url: http://projecteuler.net/problem=311
-:content: "\r\n<p>ABCD is a convex, integer sided quadrilateral with 1 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  AB <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> BC <img src=\"images/symbol_lt.gif\" width=\"10\"
-  height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"> CD <img
-  src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> AD.<br>\r\nBD has integer length. O is the midpoint
-  of BD. AO has integer length.<br>\r\nWe'll call ABCD a <i>biclinic integral quadrilateral</i>
-  if AO = CO <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"> BO = DO.<br></p>\r\n\r\n<p>For example,
-  the following quadrilateral is a biclinic integral quadrilateral:<br>\r\nAB = 19,
-  BC = 29, CD = 37, AD = 43, BD = 48 and AO = CO = 23.\r\n</p>\r\n\r\n<div align=\"center\"><img
-  src=\"project/images/p_311_biclinic.gif\"></div>\r\n\r\n<p>Let B(<var>N</var>) be
-  the number of distinct biclinic integral quadrilaterals ABCD that satisfy AB<sup>2</sup>+BC<sup>2</sup>+CD<sup>2</sup>+AD<sup>2</sup><img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>N</var>.<br>\r\nWe
-  can verify that B(10 000) = 49 and B(1 000 000) = 38239.\r\n</p>\r\n\r\n<p>Find
-  B(10 000 000 000).\r\n</p>\r\n\r\n"
+:content: "ABCD is a convex, integer sided quadrilateral with 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  AB ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) BC ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  CD ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) AD.  \n\rBD
+  has integer length. O is the midpoint of BD. AO has integer length.  \n\rWe'll call
+  ABCD a _biclinic integral quadrilateral_ if AO = CO ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  BO = DO.\n\nFor example, the following quadrilateral is a biclinic integral quadrilateral:
+  \ \n\rAB = 19, BC = 29, CD = 37, AD = 43, BD = 48 and AO = CO = 23.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_311_biclinic.gif)\n\nLet
+  B(<var>N</var>) be the number of distinct biclinic integral quadrilaterals ABCD
+  that satisfy AB<sup>2</sup>+BC<sup>2</sup>+CD<sup>2</sup>+AD<sup>2</sup> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>N</var>.  \n\rWe can verify that B(10 000) = 49 and B(1 000 000) = 38239.\n\nFind
+  B(10 000 000 000).\n\n"

data/data/problems/312.yml

@@ -2,14 +2,13 @@
 :id: 312
 :name: Cyclic paths on Sierpiński graphs
 :url: http://projecteuler.net/problem=312
-:content: "\r\n<p>- A <b>Sierpiński graph</b> of order-1 (<var>S</var><sub>1</sub>)
-  is an equilateral triangle.<br>\r\n- <var>S</var><sub><var>n</var>+1</sub> is obtained
-  from <var>S</var><sub><var>n</var></sub> by positioning three copies of <var>S</var><sub><var>n</var></sub>
-  so that every pair of copies has one common corner.\r\n</p>\r\n\r\n<div align=\"center\"><img
-  src=\"project/images/p_312_sierpinskyAt.gif\"></div>\r\n\r\n<p>Let C(<var>n</var>)
-  be the number of cycles that pass exactly once through all the vertices of <var>S</var><sub><var>n</var></sub>.<br>\r\nFor
-  example, C(3) = 8 because eight such cycles can be drawn on <var>S</var><sub>3</sub>,
-  as shown below:\r\n</p>\r\n\r\n<div align=\"center\"><img src=\"project/images/p_312_sierpinsky8t.gif\"></div>\r\n\r\n<p>It
-  can also be verified that :<br>\r\nC(1) = C(2) = 1<br>\r\nC(5) = 71328803586048<br>\r\nC(10
-  000) mod 10<sup>8</sup> = 37652224<br>\r\nC(10 000) mod 13<sup>8</sup> = 617720485<br></p>\r\n\r\n<p>Find
-  C(C(C(10 000))) mod 13<sup>8</sup>.\r\n</p>\r\n\r\n\r\n"
+:content: "- A **Sierpiński graph** of order-1 (<var>S</var><sub>1</sub>) is an equilateral
+  triangle.  \n\r- <var>S</var><sub><var>n</var>+1</sub> is obtained from <var>S</var><sub><var>n</var></sub>
+  by positioning three copies of <var>S</var><sub><var>n</var></sub> so that every
+  pair of copies has one common corner.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_312_sierpinskyAt.gif)\n\nLet
+  C(<var>n</var>) be the number of cycles that pass exactly once through all the vertices
+  of <var>S</var><sub><var>n</var></sub>.  \n\rFor example, C(3) = 8 because eight
+  such cycles can be drawn on <var>S</var><sub>3</sub>, as shown below:\n\n ![](/home/will/src/euler-manager/config/../data/images/p_312_sierpinsky8t.gif)\n\nIt
+  can also be verified that :  \n\rC(1) = C(2) = 1  \n\rC(5) = 71328803586048  \n\rC(10
+  000) mod 10<sup>8</sup> = 37652224  \n\rC(10 000) mod 13<sup>8</sup> = 617720485\n\nFind
+  C(C(C(10 000))) mod 13<sup>8</sup>.\n\n"

data/data/problems/313.yml

@@ -2,16 +2,16 @@
 :id: 313
 :name: Sliding game
 :url: http://projecteuler.net/problem=313
-:content: "\r\n<p>In a sliding game a counter may slide horizontally or vertically
-  into an empty space. The objective of the game is to move the red counter from the
-  top left corner of a grid to the bottom right corner; the space always starts in
-  the bottom right corner. For example, the following sequence of pictures show how
-  the game can be completed in five moves on a 2 by 2 grid.</p>\r\n\r\n<div align=\"center\"><img
-  src=\"project/images/p_313_sliding_game_1.gif\"></div>\r\n\r\n<p>Let S(m,n) represent
-  the minimum number of moves to complete the game on an m by n grid. For example,
-  it can be verified that S(5,4) = 25.</p>\r\n\r\n<div align=\"center\"><img src=\"project/images/p_313_sliding_game_2.gif\"></div>\r\n\r\n<p>There
-  are exactly 5482 grids for which S(m,n) = p<sup>2</sup>, where p <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">
-  100 is prime.</p>\r\n\r\n<p>How many grids does S(m,n) = p<sup>2</sup>, where p
-  <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> 10<sup>6</sup> is prime?</p>\r\n"
+:content: |+
+  In a sliding game a counter may slide horizontally or vertically into an empty space. The objective of the game is to move the red counter from the top left corner of a grid to the bottom right corner; the space always starts in the bottom right corner. For example, the following sequence of pictures show how the game can be completed in five moves on a 2 by 2 grid.
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_313_sliding_game_1.gif)
+
+  Let S(m,n) represent the minimum number of moves to complete the game on an m by n grid. For example, it can be verified that S(5,4) = 25.
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_313_sliding_game_2.gif)
+
+  There are exactly 5482 grids for which S(m,n) = p<sup>2</sup>, where p ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 100 is prime.
+
+  How many grids does S(m,n) = p<sup>2</sup>, where p ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 10<sup>6</sup> is prime?
+

data/data/problems/314.yml

@@ -2,28 +2,26 @@
 :id: 314
 :name: The Mouse on the Moon
 :url: http://projecteuler.net/problem=314
-:content: "\r\n<p>\r\nThe moon has been opened up, and land can be obtained for free,
-  but there is a catch. You have to build a wall around the land that you stake out,
-  and building a wall on the moon is expensive. Every country has been allotted a
-  500 m by 500 m square area, but they will possess only that area which they wall
-  in. 251001 posts have been placed in a rectangular grid with 1 meter spacing. The
-  wall must be a closed series of straight lines, each line running from post to post.\r\n</p>\r\n<p>\r\nThe
-  bigger countries of course have built a 2000 m wall enclosing the entire 250 000
-  m<sup>2</sup> area. The <a href=\"http://en.wikipedia.org/wiki/Grand_Fenwick\">Duchy
-  of Grand Fenwick</a>, has a tighter budget, and has asked you (their Royal Programmer)
-  to compute what shape would get best maximum enclosed-area/wall-length ratio.\r\n</p>\r\n<p>\r\nYou
-  have done some preliminary calculations on a sheet of paper.\r\nFor a 2000 meter
-  wall enclosing the 250 000 m<sup>2</sup> area the\r\nenclosed-area/wall-length ratio
-  is 125.<br>\r\nAlthough not allowed , but to get an idea if this is anything better:
-  \ if you place a circle inside the square area touching the four sides the area
-  will be equal to π*250<sup>2</sup> m<sup>2</sup> and the perimeter will be π*500
-  m, so the enclosed-area/wall-length ratio will also be 125.\r\n</p>\r\n<p>\r\nHowever,
-  if you cut off from the square four triangles with sides 75 m, 75 m and 75<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">2
-  m the total area becomes 238750 m<sup>2</sup> and the perimeter becomes 1400+300<img
-  src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\" alt=\"√\" border=\"0\"
-  style=\"vertical-align:middle;\">2 m. So this gives an enclosed-area/wall-length
-  ratio of 130.87, which is significantly better.\r\n</p>\r\n<div align=\"center\"><img
-  src=\"project/images/p_314_landgrab.gif\"></div>\r\n<p>\r\nFind the maximum enclosed-area/wall-length
-  ratio.<br>\r\nGive your answer rounded to 8 places behind the decimal point in the
-  form abc.defghijk.\r\n</p>\r\n\r\n\r\n\r\n"
+:content: "The moon has been opened up, and land can be obtained for free, but there
+  is a catch. You have to build a wall around the land that you stake out, and building
+  a wall on the moon is expensive. Every country has been allotted a 500 m by 500
+  m square area, but they will possess only that area which they wall in. 251001 posts
+  have been placed in a rectangular grid with 1 meter spacing. The wall must be a
+  closed series of straight lines, each line running from post to post.\n\nThe bigger
+  countries of course have built a 2000 m wall enclosing the entire 250 000 m<sup>2</sup>
+  area. The [Duchy of Grand Fenwick](http://en.wikipedia.org/wiki/Grand_Fenwick),
+  has a tighter budget, and has asked you (their Royal Programmer) to compute what
+  shape would get best maximum enclosed-area/wall-length ratio.\n\nYou have done some
+  preliminary calculations on a sheet of paper.\rFor a 2000 meter wall enclosing the
+  250 000 m<sup>2</sup> area the\renclosed-area/wall-length ratio is 125.  \n\rAlthough
+  not allowed , but to get an idea if this is anything better: if you place a circle
+  inside the square area touching the four sides the area will be equal to π\\*250<sup>2</sup>
+  m<sup>2</sup> and the perimeter will be π\\*500 m, so the enclosed-area/wall-length
+  ratio will also be 125.\n\nHowever, if you cut off from the square four triangles
+  with sides 75 m, 75 m and 75 ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2
+  m the total area becomes 238750 m<sup>2</sup> and the perimeter becomes 1400+300
+  ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)2 m. So
+  this gives an enclosed-area/wall-length ratio of 130.87, which is significantly
+  better.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_314_landgrab.gif)\n\nFind
+  the maximum enclosed-area/wall-length ratio.  \n\rGive your answer rounded to 8
+  places behind the decimal point in the form abc.defghijk.\n\n"

data/data/problems/315.yml

@@ -2,48 +2,42 @@
 :id: 315
 :name: Digital root clocks
 :url: http://projecteuler.net/problem=315
-:content: "\r\n<p></p>\n<div align=\"center\"><img src=\"project/images/p_315_clocks.gif\"></div>\r\n\r\n<p>Sam
-  and Max are asked to transform two digital clocks into two \"digital root\" clocks.<br>\r\nA
-  digital root clock is a digital clock that calculates digital roots step by step.</p>\r\n\r\n<p>When
-  a clock is fed a number, it will show it and then it will start the calculation,
-  showing all the intermediate values until it gets to the result.<br>\r\nFor example,
-  if the clock is fed the number 137, it will show: \"<b>137</b>\" <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\">
-  \"<b>11</b>\" <img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\"
-  border=\"0\" style=\"vertical-align:middle;\"> \"<b>2</b>\" and then it will go
-  black, waiting for the next number.</p>\r\n\r\n<p>Every digital number consists
-  of some light segments: three horizontal (top, middle, bottom) and four vertical
-  (top-left, top-right, bottom-left, bottom-right).<br>\r\nNumber \"<b>1</b>\" is
-  made of vertical top-right and bottom-right, number \"<b>4</b>\" is made by middle
-  horizontal and vertical top-left, top-right and bottom-right. Number \"<b>8</b>\"
-  lights them all.</p>\r\n\r\n<p>The clocks consume energy only when segments are
-  turned on/off.<br>\r\nTo turn on a \"<b>2</b>\" will cost 5 transitions, while a
-  \"<b>7</b>\" will cost only 4 transitions.</p>\r\n\r\n<p>Sam and Max built two different
-  clocks.</p>\r\n\r\n<p>Sam's clock is fed e.g. number 137: the clock shows \"<b>137</b>\",
-  then the panel is turned off, then the next number (\"<b>11</b>\") is turned on,
-  then the panel is turned off again and finally the last number (\"<b>2</b>\") is
-  turned on and, after some time, off.<br>\r\nFor the example, with number 137, Sam's
-  clock requires:<br></p>\n<table>\n<tr>\n<td>\"<b>137</b>\"</td>\r\n<td>:</td>\r\n<td>(2
-  + 5 + 4) <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\"
-  border=\"0\" style=\"vertical-align:middle;\"> 2 = 22 transitions (\"<b>137</b>\"
-  on/off).</td>\r\n</tr>\n<tr>\n<td>\"<b>11</b>\"</td>\r\n<td>:</td>\r\n<td>(2 + 2)
-  <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 2 = 8 transitions (\"<b>11</b>\" on/off).</td>\r\n</tr>\n<tr>\n<td>\"<b>2</b>\"</td>\r\n<td>:</td>\r\n<td>(5)
-  <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 2 = 10 transitions (\"<b>2</b>\" on/off).</td>\r\n</tr>\n</table>\r\nFor
-  a grand total of 40 transitions.\r\n\r\n<p>Max's clock works differently. Instead
-  of turning off the whole panel, it is smart enough to turn off only those segments
-  that won't be needed for the next number.<br>\r\nFor number 137, Max's clock requires:<br></p>\n<table>\n<tr>\n<td>\"<b>137</b>\"<br><br>\n</td>\r\n<td>:<br><br>\n</td>\r\n<td>2
-  + 5 + 4 = 11 transitions (\"<b>137</b>\" on)<br>\r\n7 transitions (to turn off the
-  segments that are not needed for number \"<b>11</b>\").</td>\r\n</tr>\n<tr>\n<td>\"<b>11</b>\"<br><br><br>\n</td>\r\n<td>:<br><br><br>\n</td>\r\n<td>0
-  transitions (number \"<b>11</b>\" is already turned on correctly)<br>\r\n3 transitions
-  (to turn off the first \"<b>1</b>\" and the bottom part of the second \"<b>1</b>\";
-  <br>\r\nthe top part is common with number \"<b>2</b>\").</td>\r\n</tr>\n<tr>\n<td>\"<b>2</b>\"<br><br>\n</td>\r\n<td>:<br><br>\n</td>\r\n<td>4
-  tansitions (to turn on the remaining segments in order to get a \"<b>2</b>\")<br>\r\n5
-  transitions (to turn off number \"<b>2</b>\").</td>\r\n</tr>\n</table>\r\nFor a
-  grand total of 30 transitions.\r\n\r\n<p>Of course, Max's clock consumes less power
-  than Sam's one.<br>\r\nThe two clocks are fed all the prime numbers between A =
-  10<sup>7</sup> and B = 2<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">10<sup>7</sup>. <br>\r\nFind
-  the difference between the total number of transitions needed by Sam's clock and
-  that needed by Max's one.</p>\r\n\r\n"
+:content: " ![](/home/will/src/euler-manager/config/../data/images/p_315_clocks.gif)\n\nSam
+  and Max are asked to transform two digital clocks into two \"digital root\" clocks.
+  \ \n\rA digital root clock is a digital clock that calculates digital roots step
+  by step.\n\nWhen a clock is fed a number, it will show it and then it will start
+  the calculation, showing all the intermediate values until it gets to the result.
+  \ \n\rFor example, if the clock is fed the number 137, it will show: \" **137**
+  \" ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) \" **11**
+  \" ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) \" **2**
+  \" and then it will go black, waiting for the next number.\n\nEvery digital number
+  consists of some light segments: three horizontal (top, middle, bottom) and four
+  vertical (top-left, top-right, bottom-left, bottom-right).  \n\rNumber \" **1**
+  \" is made of vertical top-right and bottom-right, number \" **4** \" is made by
+  middle horizontal and vertical top-left, top-right and bottom-right. Number \" **8**
+  \" lights them all.\n\nThe clocks consume energy only when segments are turned on/off.
+  \ \n\rTo turn on a \" **2** \" will cost 5 transitions, while a \" **7** \" will
+  cost only 4 transitions.\n\nSam and Max built two different clocks.\n\nSam's clock
+  is fed e.g. number 137: the clock shows \" **137** \", then the panel is turned
+  off, then the next number (\" **11** \") is turned on, then the panel is turned
+  off again and finally the last number (\" **2** \") is turned on and, after some
+  time, off.  \n\rFor the example, with number 137, Sam's clock requires:\n\n| \"
+  **137** \" | : | (2 + 5 + 4) ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  2 = 22 transitions (\" **137** \" on/off). |\n| \" **11** \" | : | (2 + 2) ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  2 = 8 transitions (\" **11** \" on/off). |\n| \" **2** \" | : | (5) ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  2 = 10 transitions (\" **2** \" on/off). |\n\n\rFor a grand total of 40 transitions.\r\r\n\nMax's
+  clock works differently. Instead of turning off the whole panel, it is smart enough
+  to turn off only those segments that won't be needed for the next number.  \n\rFor
+  number 137, Max's clock requires:\n\n| \" **137** \"  \n  \n  \n | :  \n  \n  \n
+  | 2 + 5 + 4 = 11 transitions (\" **137** \" on)  \n\r7 transitions (to turn off
+  the segments that are not needed for number \" **11** \"). |\n| \" **11** \"  \n
+  \ \n  \n  \n  \n | :  \n  \n  \n  \n  \n | 0 transitions (number \" **11** \" is
+  already turned on correctly)  \n\r3 transitions (to turn off the first \" **1**
+  \" and the bottom part of the second \" **1** \";   \n\rthe top part is common with
+  number \" **2** \"). |\n| \" **2** \"  \n  \n  \n | :  \n  \n  \n | 4 tansitions
+  (to turn on the remaining segments in order to get a \" **2** \")  \n\r5 transitions
+  (to turn off number \" **2** \"). |\n\n\rFor a grand total of 30 transitions.\r\r\n\nOf
+  course, Max's clock consumes less power than Sam's one.  \n\rThe two clocks are
+  fed all the prime numbers between A = 10<sup>7</sup> and B = 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)10<sup>7</sup>.
+  \  \n\rFind the difference between the total number of transitions needed by Sam's
+  clock and that needed by Max's one.\n\n"