euler-manager 0.0.5 → 0.0.6

data/data/problems/275.yml

@@ -2,18 +2,16 @@
 :id: 275
 :name: Balanced Sculptures
 :url: http://projecteuler.net/problem=275
-:content: "\r\n<p>Let us define a <i>balanced sculpture</i> of order <var>n</var>
-  as follows:\r\n</p>\n<ul>\n<li>A <dfn title=\"An arrangement of identical squares
-  connected through shared edges; holes are allowed.\">polyomino</dfn> made up of
-  <var>n</var>+1 tiles known as the <i>blocks</i> (<var>n</var> tiles)<br> and the
-  <i>plinth</i> (remaining tile);</li>\r\n<li>the plinth has its centre at position
-  (<var>x</var> = 0, <var>y</var> = 0);</li>\r\n<li>the blocks have <var>y</var>-coordinates
-  greater than zero (so the plinth is the unique lowest tile);</li>\r\n<li>the centre
-  of mass of all the blocks, combined, has <var>x</var>-coordinate equal to zero.</li>\r\n</ul>\n<p>When
-  counting the sculptures, any arrangements which are simply reflections about the
-  <var>y</var>-axis, are <u>not</u> counted as distinct. For example, the 18 balanced
-  sculptures of order 6 are shown below; note that each pair of mirror images (about
-  the <var>y</var>-axis) is counted as one sculpture:</p>\r\n<div align=\"center\"><img
-  src=\"project/images/p_275_sculptures2.gif\"></div>\r\n\r\n<p>There are 964 balanced
-  sculptures of order 10 and 360505 of order 15.<br>How many balanced sculptures are
-  there of order 18?</p>\r\n\r\n"
+:content: "Let us define a _balanced sculpture_ of order <var>n</var> as follows:\n\n-
+  A <dfn title=\"An arrangement of identical squares connected through shared edges;
+  holes are allowed.\">polyomino</dfn> made up of <var>n</var>+1 tiles known as the
+  _blocks_ (<var>n</var> tiles)  \n and the _plinth_ (remaining tile);\n- the plinth
+  has its centre at position (<var>x</var> = 0, <var>y</var> = 0);\n- the blocks have
+  <var>y</var>-coordinates greater than zero (so the plinth is the unique lowest tile);\n-
+  the centre of mass of all the blocks, combined, has <var>x</var>-coordinate equal
+  to zero.\n\nWhen counting the sculptures, any arrangements which are simply reflections
+  about the <var>y</var>-axis, are <u>not</u> counted as distinct. For example, the
+  18 balanced sculptures of order 6 are shown below; note that each pair of mirror
+  images (about the <var>y</var>-axis) is counted as one sculpture:\n\n ![](/home/will/src/euler-manager/config/../data/images/p_275_sculptures2.gif)\n\nThere
+  are 964 balanced sculptures of order 10 and 360505 of order 15.  \nHow many balanced
+  sculptures are there of order 18?\n\n"

data/data/problems/276.yml

@@ -2,10 +2,8 @@
 :id: 276
 :name: Primitive Triangles
 :url: http://projecteuler.net/problem=276
-:content: "\r\n<p>Consider the triangles with integer sides a, b and c with 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.<br>\r\nAn integer sided triangle (a,b,c) is
-  called primitive if <dfn title=\" gcd(a,b,c)=gcd(a,gcd(b,c))\"> gcd(a,b,c)</dfn>=1.
-  <br>\r\nHow many primitive integer sided triangles exist with a perimeter not exceeding
-  10 000 000?\r\n</p>\r\n\r\n\r\n\r\n\r\n\r\n"
+:content: "Consider the triangles with integer sides a, b and c with 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.  \n\rAn
+  integer sided triangle (a,b,c) is called primitive if <dfn title=\" gcd(a,b,c)=gcd(a,gcd(b,c))\">
+  gcd(a,b,c)</dfn>=1.   \n\rHow many primitive integer sided triangles exist with
+  a perimeter not exceeding 10 000 000?\n\n"

data/data/problems/277.yml

@@ -2,23 +2,20 @@
 :id: 277
 :name: A Modified Collatz sequence
 :url: http://projecteuler.net/problem=277
-:content: "\r\n<p>\r\nA modified Collatz sequence of integers is obtained from a starting
-  value a<sub>1</sub> in the following way:</p>\r\n<p>\r\n<var>a<sub>n+1</sub></var>
-  = <var>a<sub>n</sub></var>/3 if <var>a<sub>n</sub></var> is divisible by 3. We shall
-  denote this as a large downward step, \"D\".</p>\r\n<p>\r\n<var>a<sub>n+1</sub></var>
-  = (4<var>a<sub>n</sub></var> + 2)/3 if <var>a<sub>n</sub></var> divided by 3 gives
-  a remainder of 1. We shall denote this as an upward step, \"U\".\r\n</p>\r\n<p>\r\n<var>a<sub>n+1</sub></var>
-  = (2<var>a<sub>n</sub></var> - 1)/3 if <var>a<sub>n</sub></var> divided by 3 gives
-  a remainder of 2. We shall denote this as a small downward step, \"d\".\r\n</p>\r\n\r\n\r\n<p>\r\nThe
-  sequence terminates when some <var>a<sub>n</sub></var> = 1.\r\n</p>\r\n<p>\r\nGiven
-  any integer, we can list out the sequence of steps.<br>\r\nFor instance if <var>a</var><sub>1</sub>=231,
-  then the sequence {<var>a<sub>n</sub></var>}={231,77,51,17,11,7,10,14,9,3,1} corresponds
-  to the steps \"DdDddUUdDD\".\r\n</p>\r\n<p>\r\nOf course, there are other sequences
-  that begin with that same sequence \"DdDddUUdDD....\".<br>\r\nFor instance, if <var>a</var><sub>1</sub>=1004064,
-  then the sequence is DdDddUUdDDDdUDUUUdDdUUDDDUdDD.<br>\r\nIn fact, 1004064 is the
-  smallest possible <var>a</var><sub>1</sub><img src=\"images/symbol_gt.gif\" width=\"10\"
-  height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\"> 10<sup>6</sup>
-  that begins with the sequence DdDddUUdDD.\r\n</p>\r\n<p>\r\nWhat is the smallest
-  <var>a</var><sub>1</sub><img src=\"images/symbol_gt.gif\" width=\"10\" height=\"10\"
-  alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\"> 10<sup>15</sup> that
-  begins with the sequence \"UDDDUdddDDUDDddDdDddDDUDDdUUDd\"?\r\n</p>\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n"
+:content: "A modified Collatz sequence of integers is obtained from a starting value
+  a<sub>1</sub> in the following way:\n\n<var>a<sub>n+1</sub></var> = <var>a<sub>n</sub></var>/3
+  if <var>a<sub>n</sub></var> is divisible by 3. We shall denote this as a large downward
+  step, \"D\".\n\n<var>a<sub>n+1</sub></var> = (4<var>a<sub>n</sub></var> + 2)/3 if
+  <var>a<sub>n</sub></var> divided by 3 gives a remainder of 1. We shall denote this
+  as an upward step, \"U\".\n\n<var>a<sub>n+1</sub></var> = (2<var>a<sub>n</sub></var>
+  - 1)/3 if <var>a<sub>n</sub></var> divided by 3 gives a remainder of 2. We shall
+  denote this as a small downward step, \"d\".\n\nThe sequence terminates when some
+  <var>a<sub>n</sub></var> = 1.\n\nGiven any integer, we can list out the sequence
+  of steps.  \n\rFor instance if <var>a</var><sub>1</sub>=231, then the sequence {<var>a<sub>n</sub></var>}={231,77,51,17,11,7,10,14,9,3,1}
+  corresponds to the steps \"DdDddUUdDD\".\n\nOf course, there are other sequences
+  that begin with that same sequence \"DdDddUUdDD....\".  \n\rFor instance, if <var>a</var><sub>1</sub>=1004064,
+  then the sequence is DdDddUUdDDDdUDUUUdDdUUDDDUdDD.  \n\rIn fact, 1004064 is the
+  smallest possible <var>a</var><sub>1</sub> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)
+  10<sup>6</sup> that begins with the sequence DdDddUUdDD.\n\nWhat is the smallest
+  <var>a</var><sub>1</sub> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)
+  10<sup>15</sup> that begins with the sequence \"UDDDUdddDDUDDddDdDddDDUDDdUUDd\"?\n\n"

data/data/problems/278.yml

@@ -2,31 +2,23 @@
 :id: 278
 :name: Linear Combinations of Semiprimes
 :url: http://projecteuler.net/problem=278
-:content: "\r\n<p>\r\nGiven the values of integers 1 <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>a</var><sub>1</sub><img
-  src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>a</var><sub>2</sub><img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">...
-  <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>a</var><sub><var>n</var></sub>, consider the
-  linear combination<br><var>q</var><sub>1</sub><var>a</var><sub>1</sub> + <var>q</var><sub>2</sub><var>a</var><sub>2</sub>
-  + ... + <var>q</var><sub><var>n</var></sub><var>a</var><sub><var>n</var></sub> =
-  <var>b</var>, using only integer values <var>q</var><sub><var>k</var></sub><img
-  src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\">
-  0. \r\n</p>\r\n<p>\r\nNote that for a given set of <var>a</var><sub><var>k</var></sub>,
-  it may be that not all values of <var>b</var> are possible.<br>\r\nFor instance,
-  if <var>a</var><sub>1</sub> = 5 and <var>a</var><sub>2</sub> = 7, there are no <var>q</var><sub>1</sub><img
-  src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\">
-  0 and <var>q</var><sub>2</sub><img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\"
-  alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\"> 0 such that <var>b</var>
-  could be<br> \r\n1, 2, 3, 4, 6, 8, 9, 11, 13, 16, 18 or 23.\r\n<br>\r\nIn fact,
-  23 is the largest impossible value of <var>b</var> for <var>a</var><sub>1</sub>
-  = 5 and <var>a</var><sub>2</sub> = 7.<br> We therefore call <var>f</var>(5, 7) =
-  23.<br> Similarly, it can be shown that <var>f</var>(6, 10, 15)=29 and <var>f</var>(14,
-  22, 77) = 195.\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;\"><var>f</var>(<var>p*q,p*r,q*r</var>),
-  where <var>p</var>, <var>q</var> and <var>r</var> are prime numbers and <var>p</var>
-  &amp;lt <var>q</var> <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\"
-  alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>r</var> <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">
-  5000.\r\n\r\n</p>"
+:content: "Given the values of integers 1 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>a</var><sub>1</sub> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>a</var><sub>2</sub> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)...
+  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) <var>a</var><sub><var>n</var></sub>,
+  consider the linear combination  \n <var>q</var><sub>1</sub><var>a</var><sub>1</sub>
+  + <var>q</var><sub>2</sub><var>a</var><sub>2</sub> + ... + <var>q</var><sub><var>n</var></sub><var>a</var><sub><var>n</var></sub>
+  = <var>b</var>, using only integer values <var>q</var><sub><var>k</var></sub> ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  0.\n\nNote that for a given set of <var>a</var><sub><var>k</var></sub>, it may be
+  that not all values of <var>b</var> are possible.  \n\rFor instance, if <var>a</var><sub>1</sub>
+  = 5 and <var>a</var><sub>2</sub> = 7, there are no <var>q</var><sub>1</sub> ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  0 and <var>q</var><sub>2</sub> ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  0 such that <var>b</var> could be  \n \r1, 2, 3, 4, 6, 8, 9, 11, 13, 16, 18 or 23.\r
+  \ \n\rIn fact, 23 is the largest impossible value of <var>b</var> for <var>a</var><sub>1</sub>
+  = 5 and <var>a</var><sub>2</sub> = 7.  \n We therefore call <var>f</var>(5, 7) =
+  23.  \n Similarly, it can be shown that <var>f</var>(6, 10, 15)=29 and <var>f</var>(14,
+  22, 77) = 195.\n\nFind ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)
+  <var>f</var>(<var>p*q,p*r,q*r</var>), where <var>p</var>, <var>q</var> and <var>r</var>
+  are prime numbers and <var>p</var> &lt <var>q</var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>r</var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  5000.\n\n"

data/data/problems/279.yml

@@ -1,6 +1,7 @@
 ---
 :id: 279
-:name: 'Triangles with integral sides and an integral angle '
+:name: Triangles with integral sides and an integral angle
 :url: http://projecteuler.net/problem=279
-:content: "\r\n<p>\r\nHow many triangles are there with integral sides, at least one
-  integral angle (measured in degrees), and a perimeter that does not exceed 10<sup>8</sup>?\r\n</p>\r\n\r\n\r\n"
+:content: |+
+  How many triangles are there with integral sides, at least one integral angle (measured in degrees), and a perimeter that does not exceed 10<sup>8</sup>?
+

data/data/problems/28.yml

@@ -2,16 +2,9 @@
 :id: 28
 :name: Number spiral diagonals
 :url: http://projecteuler.net/problem=28
-:content: "\r\n<p>Starting with the number 1 and moving to the right in a clockwise
-  direction a 5 by 5 spiral is formed as follows:</p>\r\n<p style=\"text-align:center;font-family:courier
-  new;\"><span style=\"color:#ff0000;font-family:courier new;\"><b>21</b></span> 22
-  23 24 <span style=\"color:#ff0000;font-family:courier new;\"><b>25</b></span><br>\r\n20
-   <span style=\"color:#ff0000;font-family:courier new;\"><b>7</b></span>  8  <span
-  style=\"color:#ff0000;font-family:courier new;\"><b>9</b></span> 10<br>\r\n19  6
-   <span style=\"color:#ff0000;font-family:courier new;\"><b>1</b></span>  2 11<br>\r\n18
-   <span style=\"color:#ff0000;font-family:courier new;\"><b>5</b></span>  4  <span
-  style=\"color:#ff0000;font-family:courier new;\"><b>3</b></span> 12<br><span style=\"color:#ff0000;font-family:courier
-  new;\"><b>17</b></span> 16 15 14 <span style=\"color:#ff0000;font-family:courier
-  new;\"><b>13</b></span></p>\r\n<p>It can be verified that the sum of the numbers
-  on the diagonals is 101.</p>\r\n<p>What is the sum of the numbers on the diagonals
-  in a 1001 by 1001 spiral formed in the same way?</p>\r\n\r\n"
+:content: "Starting with the number 1 and moving to the right in a clockwise direction
+  a 5 by 5 spiral is formed as follows:\n\n**21** 22 23 24 **25**  \n\r20   **7**
+   8   **9** 10  \n\r19  6   **1**  2 11  \n\r18   **5**  4   **3** 12  \n**17** 16
+  15 14 **13**\n\nIt can be verified that the sum of the numbers on the diagonals
+  is 101.\n\nWhat is the sum of the numbers on the diagonals in a 1001 by 1001 spiral
+  formed in the same way?\n\n"

data/data/problems/280.yml

@@ -2,12 +2,12 @@
 :id: 280
 :name: Ant and seeds
 :url: http://projecteuler.net/problem=280
-:content: "\r\n<p>A laborious ant walks randomly on a 5x5 grid. The walk starts from
-  the central square. At each step, the ant moves to an adjacent square at random,
-  without leaving the grid; thus there are 2, 3 or 4 possible moves at each step depending
-  on the ant's position.</p>\r\n\r\n<p>At the start of the walk, a seed is placed
-  on each square of the lower row. When the ant isn't carrying a seed and reaches
-  a square of the lower row containing a seed, it will start to carry the seed. The
-  ant will drop the seed on the first empty square of the upper row it eventually
-  reaches.</p>\r\n\r\n<p>What's the expected number of steps until all seeds have
-  been dropped in the top row? <br>\r\nGive your answer rounded to 6 decimal places.</p>\r\n"
+:content: "A laborious ant walks randomly on a 5x5 grid. The walk starts from the
+  central square. At each step, the ant moves to an adjacent square at random, without
+  leaving the grid; thus there are 2, 3 or 4 possible moves at each step depending
+  on the ant's position.\n\nAt the start of the walk, a seed is placed on each square
+  of the lower row. When the ant isn't carrying a seed and reaches a square of the
+  lower row containing a seed, it will start to carry the seed. The ant will drop
+  the seed on the first empty square of the upper row it eventually reaches.\n\nWhat's
+  the expected number of steps until all seeds have been dropped in the top row?   \n\rGive
+  your answer rounded to 6 decimal places.\n\n"

data/data/problems/281.yml

@@ -2,16 +2,13 @@
 :id: 281
 :name: Pizza Toppings
 :url: http://projecteuler.net/problem=281
-:content: "\r\n<p>You are given a pizza (perfect circle) that has been cut into <var>m</var>·<var>n</var>
-  equal pieces and you want to have exactly one topping on each slice.</p>\r\n\r\n<p>Let
-  <var>f</var>(<var>m</var>,<var>n</var>) denote the number of ways you can have toppings
-  on the pizza with <var>m</var> different toppings (<var>m</var> <img src=\"images/symbol_ge.gif\"
-  width=\"10\" height=\"12\" alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\"> 2),
-  using each topping on exactly <var>n</var> slices (<var>n</var> <img src=\"images/symbol_ge.gif\"
-  width=\"10\" height=\"12\" alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\"> 1).
-  <br>Reflections are considered distinct, rotations are not. </p>\r\n\r\n<p>Thus,
-  for instance, <var>f</var>(2,1) = 1, <var>f</var>(2,2) = <var>f</var>(3,1) = 2 and
-  <var>f</var>(3,2) = 16. <br><var>f</var>(3,2) is shown below:</p>\r\n\r\n<div align=\"center\"><img
-  src=\"project/images/p_281_pizza.gif\"></div>\r\n\r\n<p>Find the sum of all <var>f</var>(<var>m</var>,<var>n</var>)
-  such that <var>f</var>(<var>m</var>,<var>n</var>) <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 10<sup>15</sup>.</p>\r\n"
+:content: "You are given a pizza (perfect circle) that has been cut into <var>m</var>·<var>n</var>
+  equal pieces and you want to have exactly one topping on each slice.\n\nLet <var>f</var>(<var>m</var>,<var>n</var>)
+  denote the number of ways you can have toppings on the pizza with <var>m</var> different
+  toppings (<var>m</var>  ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif) 2),
+  using each topping on exactly <var>n</var> slices (<var>n</var>  ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif) 1).
+  \  \nReflections are considered distinct, rotations are not.\n\nThus, for instance,
+  <var>f</var>(2,1) = 1, <var>f</var>(2,2) = <var>f</var>(3,1) = 2 and <var>f</var>(3,2) = 16.
+  \  \n<var>f</var>(3,2) is shown below:\n\n ![](/home/will/src/euler-manager/config/../data/images/p_281_pizza.gif)\n\nFind
+  the sum of all <var>f</var>(<var>m</var>,<var>n</var>) such that <var>f</var>(<var>m</var>,<var>n</var>) 
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 10<sup>15</sup>.\n\n"

data/data/problems/282.yml

@@ -2,9 +2,12 @@
 :id: 282
 :name: The Ackermann function
 :url: http://projecteuler.net/problem=282
-:content: "\r\n<p>\r\nFor non-negative integers <var>m</var>, <var>n</var>, the Ackermann
-  function <var>A</var>(<var>m</var>, <var>n</var>) is defined as follows:\r\n</p>\r\n<div
-  align=\"center\"><img src=\"project/images/p_282_formula.gif\"></div>\r\n<p>\r\nFor
-  example <var>A</var>(1, 0) = 2, <var>A</var>(2, 2) = 7 and <var>A</var>(3, 4) =
-  125.\r\n</p>\r\n<p>\r\nFind <img src=\"project/images/p_282formula3.gif\" style=\"vertical-align:middle\"><var>A</var>(<var>n</var>,
-  <var>n</var>) and give your answer mod 14<sup>8</sup>.</p>\r\n\r\n"
+:content: |+
+  For non-negative integers <var>m</var>, <var>n</var>, the Ackermann function <var>A</var>(<var>m</var>, <var>n</var>) is defined as follows:
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_282_formula.gif)
+
+  For example <var>A</var>(1, 0) = 2, <var>A</var>(2, 2) = 7 and <var>A</var>(3, 4) = 125.
+
+  Find ![](/home/will/src/euler-manager/config/../data/images/p_282formula3.gif)<var>A</var>(<var>n</var>, <var>n</var>) and give your answer mod 14<sup>8</sup>.
+

data/data/problems/283.yml

@@ -1,11 +1,11 @@
 ---
 :id: 283
-:name: Integer sided triangles for which the  area/perimeter ratio is integral
+:name: Integer sided triangles for which the area/perimeter ratio is integral
 :url: http://projecteuler.net/problem=283
-:content: "\r\n<p>\r\nConsider the triangle with sides 6, 8 and 10. It can be seen
-  that the perimeter and the area are both equal to 24. \r\nSo the area/perimeter
-  ratio is equal to 1.<br>\r\nConsider also the triangle with sides 13, 14 and 15.
-  The perimeter equals 42 while the area is equal to 84. \r\nSo for this triangle
-  the area/perimeter ratio is equal to 2.\r\n</p>\r\n<p>\r\nFind the sum of the perimeters
-  of all integer sided triangles for which the area/perimeter ratios are equal to
-  positive integers not exceeding 1000.\r\n</p>\r\n\r\n"
+:content: "Consider the triangle with sides 6, 8 and 10. It can be seen that the perimeter
+  and the area are both equal to 24. \rSo the area/perimeter ratio is equal to 1.
+  \ \n\rConsider also the triangle with sides 13, 14 and 15. The perimeter equals
+  42 while the area is equal to 84. \rSo for this triangle the area/perimeter ratio
+  is equal to 2.\n\nFind the sum of the perimeters of all integer sided triangles
+  for which the area/perimeter ratios are equal to positive integers not exceeding
+  1000.\n\n"

data/data/problems/284.yml

@@ -2,21 +2,18 @@
 :id: 284
 :name: Steady Squares
 :url: http://projecteuler.net/problem=284
-:content: "\r\n<p>The 3-digit number 376 in the decimal numbering system is an example
-  of numbers with the special property that its square ends with the same digits:
-  376<sup>2</sup> = 141376. Let's call a number with this property a steady square.</p>\r\n\r\n<p>Steady
-  squares can also be observed in other numbering systems. In the base 14 numbering
-  system, the 3-digit number c37 is also a steady square: c37<sup>2</sup> = aa0c37,
-  and the sum of its digits is c+3+7=18 in the same numbering system. The letters
-  a, b, c and d are used for the 10, 11, 12 and 13 digits respectively, in a manner
-  similar to the hexadecimal numbering system.</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;\">
-  n <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 9, the sum of the digits of all the n-digit steady
-  squares in the base 14 numbering system is 2d8 (582 decimal). Steady squares with
-  leading 0's are not allowed.</p>\r\n\r\n<p>Find the sum of the digits of all the
-  n-digit steady squares in the base 14 numbering system for<br>\r\n1 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  n <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 10000 (decimal) and give your answer in the base
-  14 system using lower case letters where necessary.</p>\r\n"
+:content: "The 3-digit number 376 in the decimal numbering system is an example of
+  numbers with the special property that its square ends with the same digits: 376<sup>2</sup>
+  = 141376. Let's call a number with this property a steady square.\n\nSteady squares
+  can also be observed in other numbering systems. In the base 14 numbering system,
+  the 3-digit number c37 is also a steady square: c37<sup>2</sup> = aa0c37, and the
+  sum of its digits is c+3+7=18 in the same numbering system. The letters a, b, c
+  and d are used for the 10, 11, 12 and 13 digits respectively, in a manner similar
+  to the hexadecimal numbering system.\n\nFor 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  n ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 9, the
+  sum of the digits of all the n-digit steady squares in the base 14 numbering system
+  is 2d8 (582 decimal). Steady squares with leading 0's are not allowed.\n\nFind the
+  sum of the digits of all the n-digit steady squares in the base 14 numbering system
+  for  \n\r1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  n ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 10000 (decimal)
+  and give your answer in the base 14 system using lower case letters where necessary.\n\n"

data/data/problems/285.yml

@@ -2,16 +2,16 @@
 :id: 285
 :name: Pythagorean odds
 :url: http://projecteuler.net/problem=285
-:content: "\r\n<p>Albert chooses a positive integer <var>k</var>, then two real numbers
-  <var>a</var>, <var>b</var> are randomly chosen in the interval [0,1] with uniform
-  distribution.<br>\r\nThe square root of the sum (<var>k</var>·<var>a</var>+1)<sup>2</sup> + (<var>k</var>·<var>b</var>+1)<sup>2</sup>
+:content: "Albert chooses a positive integer <var>k</var>, then two real numbers <var>a</var>,
+  <var>b</var> are randomly chosen in the interval [0,1] with uniform distribution.
+  \ \n\rThe square root of the sum (<var>k</var>·<var>a</var>+1)<sup>2</sup> + (<var>k</var>·<var>b</var>+1)<sup>2</sup>
   is then computed and rounded to the nearest integer. If the result is equal to <var>k</var>,
-  he scores <var>k</var> points; otherwise he scores nothing.</p>\r\n\r\n<p>For example,
-  if <var>k</var> = 6, <var>a</var> = 0.2 and <var>b</var> = 0.85, then (<var>k</var>·<var>a</var>+1)<sup>2</sup> + (<var>k</var>·<var>b</var>+1)<sup>2</sup> = 42.05.<br>\r\nThe
-  square root of 42.05 is 6.484... and when rounded to the nearest integer, it becomes
-  6.<br>\r\nThis is equal to <var>k</var>, so he scores 6 points.</p>\r\n\r\n<p>It
-  can be shown that if he plays 10 turns with <var>k</var> = 1, <var>k</var> = 2,
-  ..., <var>k</var> = 10, the expected value of his total score, rounded to five decimal
-  places, is 10.20914.</p>\r\n\r\n<p>If he plays 10<sup>5</sup> turns with <var>k</var> = 1,
+  he scores <var>k</var> points; otherwise he scores nothing.\n\nFor example, if <var>k</var> = 6,
+  <var>a</var> = 0.2 and <var>b</var> = 0.85, then (<var>k</var>·<var>a</var>+1)<sup>2</sup> + (<var>k</var>·<var>b</var>+1)<sup>2</sup> = 42.05.
+  \ \n\rThe square root of 42.05 is 6.484... and when rounded to the nearest integer,
+  it becomes 6.  \n\rThis is equal to <var>k</var>, so he scores 6 points.\n\nIt can
+  be shown that if he plays 10 turns with <var>k</var> = 1, <var>k</var> = 2, ...,
+  <var>k</var> = 10, the expected value of his total score, rounded to five decimal
+  places, is 10.20914.\n\nIf he plays 10<sup>5</sup> turns with <var>k</var> = 1,
   <var>k</var> = 2, <var>k</var> = 3, ..., <var>k</var> = 10<sup>5</sup>, what is
-  the expected value of his total score, rounded to five decimal places?</p>\r\n"
+  the expected value of his total score, rounded to five decimal places?\n\n"

data/data/problems/286.yml

@@ -2,11 +2,10 @@
 :id: 286
 :name: Scoring probabilities
 :url: http://projecteuler.net/problem=286
-:content: "\r\n<p>Barbara is a mathematician and a basketball player. She has found
-  that the probability of scoring a point when shooting from a distance <var>x</var>
-  is exactly (1 - <sup><var>x</var></sup>/<sub><var>q</var></sub>), where <var>q</var>
-  is a real constant greater than 50.</p>\r\n\r\n<p>During each practice run, she
-  takes shots from distances <var>x</var> = 1, <var>x</var> = 2, ..., <var>x</var> = 50
-  and, according to her records, she has precisely a 2 % chance to score a total of
-  exactly 20 points.</p>\r\n\r\n<p>Find <var>q</var> and give your answer rounded
-  to 10 decimal places.</p>\r\n"
+:content: |+
+  Barbara is a mathematician and a basketball player. She has found that the probability of scoring a point when shooting from a distance <var>x</var> is exactly (1 - <sup><var>x</var></sup>/<sub><var>q</var></sub>), where <var>q</var> is a real constant greater than 50.
+
+  During each practice run, she takes shots from distances <var>x</var> = 1, <var>x</var> = 2, ..., <var>x</var> = 50 and, according to her records, she has precisely a 2 % chance to score a total of exactly 20 points.
+
+  Find <var>q</var> and give your answer rounded to 10 decimal places.
+

data/data/problems/287.yml

@@ -2,35 +2,25 @@
 :id: 287
 :name: Quadtree encoding (a simple compression algorithm)
 :url: http://projecteuler.net/problem=287
-:content: "\r\n<p>The quadtree encoding allows us to describe a 2<sup><var>N</var></sup><img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">2<sup><var>N</var></sup>  black and white image
-  as a sequence of bits (0 and 1). Those sequences are to be read from left to right
-  like this:\r\n</p>\n<ul>\n<li>the first bit deals with the complete 2<sup><var>N</var></sup><img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">2<sup><var>N</var></sup> region;</li>\r\n<li>\"0\"
-  denotes a split:\r\n<br>the current 2<sup><var>n</var></sup><img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">2<sup><var>n</var></sup>
-  region is divided into 4 sub-regions of dimension 2<sup><var>n</var>-1</sup><img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">2<sup><var>n</var>-1</sup>,<br>\r\nthe next bits
-  contains the description of the top left, top right, bottom left and bottom right
-  sub-regions - in that order;</li>\r\n<li>\"10\" indicates that the current region
-  contains only black pixels;</li>\r\n<li>\"11\" indicates that the current region
-  contains only white pixels.</li>\n</ul>\n<p>Consider the following 4<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">4
-  image (colored marks denote places where a split can occur):</p>\r\n<div align=\"center\"><img
-  src=\"project/images/p_287_quadtree.gif\"></div>\r\n<p>This image can be described
-  by several sequences, for example :<bp></bp>\r\n\"<span style=\"color:red;\"><b>0</b></span><span
-  style=\"color:blue;\"><b>0</b></span>10101010<span style=\"color:green;\"><b>0</b></span>1011111011<span
-  style=\"color:orange;\"><b>0</b></span>10101010\", of length 30, or<br>\r\n\"<span
-  style=\"color:red;\"><b>0</b></span>10<span style=\"color:green;\"><b>0</b></span>101111101110\",
-  of length 16, which is the minimal sequence for this image.</p>\r\n\r\n<p>For a
-  positive integer <var>N</var>, define <var>D<sub>N</sub></var> as the 2<sup><var>N</var></sup><img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">2<sup><var>N</var></sup> image with the following
-  coloring scheme:\r\n</p>\n<ul>\n<li>the pixel with coordinates <var>x</var> = 0,
-  <var>y</var> = 0 corresponds to the bottom left pixel,</li>\r\n<li>if (<var>x</var> - 2<sup><var>N</var>-1</sup>)<sup>2</sup> + (<var>y</var> - 2<sup><var>N</var>-1</sup>)<sup>2</sup> <img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 2<sup>2<var>N</var>-2</sup>
-  then the pixel is black,</li>\r\n<li>otherwise the pixel is white.</li>\n</ul>\n<p>What
-  is the length of the minimal sequence describing <var>D</var><sub>24</sub> ?</p>\r\n"
+:content: "The quadtree encoding allows us to describe a 2<sup><var>N</var></sup>
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)2<sup><var>N</var></sup>
+  black and white image as a sequence of bits (0 and 1). Those sequences are to be
+  read from left to right like this:\n\n- the first bit deals with the complete 2<sup><var>N</var></sup>
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)2<sup><var>N</var></sup>
+  region;\n- \"0\" denotes a split:\r  \nthe current 2<sup><var>n</var></sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)2<sup><var>n</var></sup>
+  region is divided into 4 sub-regions of dimension 2<sup><var>n</var>-1</sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)2<sup><var>n</var>-1</sup>,
+  \ \n\rthe next bits contains the description of the top left, top right, bottom
+  left and bottom right sub-regions - in that order;\n- \"10\" indicates that the
+  current region contains only black pixels;\n- \"11\" indicates that the current
+  region contains only white pixels.\n\nConsider the following 4 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)4
+  image (colored marks denote places where a split can occur):\n\n ![](/home/will/src/euler-manager/config/../data/images/p_287_quadtree.gif)\n\nThis
+  image can be described by several sequences, for example :<bp></bp>\r\" **0****
+  0 **10101010** 0 **1011111011** 0**10101010\", of length 30, or  \n\r\" **0** 10
+  **0** 101111101110\", of length 16, which is the minimal sequence for this image.\n\nFor
+  a positive integer <var>N</var>, define <var>D<sub>N</sub></var> as the 2<sup><var>N</var></sup>
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)2<sup><var>N</var></sup>
+  image with the following coloring scheme:\n\n- the pixel with coordinates <var>x</var> = 0,
+  <var>y</var> = 0 corresponds to the bottom left pixel,\n- if (<var>x</var> - 2<sup><var>N</var>-1</sup>)<sup>2</sup> + (<var>y</var> - 2<sup><var>N</var>-1</sup>)<sup>2</sup> 
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 2<sup>2<var>N</var>-2</sup>
+  then the pixel is black,\n- otherwise the pixel is white.\n\nWhat is the length
+  of the minimal sequence describing <var>D</var><sub>24</sub> ?\n\n"

data/data/problems/288.yml

@@ -2,14 +2,13 @@
 :id: 288
 :name: An enormous factorial
 :url: http://projecteuler.net/problem=288
-:content: "\r\n<p>\r\nFor any prime <var>p</var> the number N(<var>p</var>,<var>q</var>)
-  is defined by\r\nN(<var>p</var>,<var>q</var>) = <img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\"><sub><var>n</var>=0
-  to <var>q</var></sub> T<sub><var>n</var></sub>*<var>p</var><sup><var>n</var></sup><br>
-  with T<sub><var>n</var></sub> generated by the following random number generator:</p>\r\n<p>\r\nS<sub>0</sub>
-  = 290797<br>\r\nS<sub><var>n</var>+1</sub> = S<sub><var>n</var></sub><sup>2</sup>
-  mod 50515093<br>\r\nT<sub><var>n</var></sub> = S<sub><var>n</var></sub> mod <var>p</var>\r\n</p>\r\n<p>\r\nLet
-  Nfac(<var>p</var>,<var>q</var>) be the factorial of N(<var>p</var>,<var>q</var>).<br>\r\nLet
-  NF(<var>p</var>,<var>q</var>) be the number of factors <var>p</var> in Nfac(<var>p</var>,<var>q</var>).\r\n</p>\r\n<p>\r\nYou
-  are given that NF(3,10000) mod 3<sup>20</sup>=624955285.\r\n</p>\r\n<p>\r\nFind
-  NF(61,10<sup>7</sup>) mod 61<sup>10</sup></p>\r\n\r\n    \r\n\r\n\r\n"
+:content: "For any prime <var>p</var> the number N(<var>p</var>,<var>q</var>) is defined
+  by\rN(<var>p</var>,<var>q</var>) = ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)<sub><var>n</var>=0
+  to <var>q</var></sub> T<sub><var>n</var></sub>\\*<var>p</var><sup><var>n</var></sup>
+  \ \n with T<sub><var>n</var></sub> generated by the following random number generator:\n\nS<sub>0</sub>
+  = 290797  \n\rS<sub><var>n</var>+1</sub> = S<sub><var>n</var></sub><sup>2</sup>
+  mod 50515093  \n\rT<sub><var>n</var></sub> = S<sub><var>n</var></sub> mod <var>p</var>\n\nLet
+  Nfac(<var>p</var>,<var>q</var>) be the factorial of N(<var>p</var>,<var>q</var>).
+  \ \n\rLet NF(<var>p</var>,<var>q</var>) be the number of factors <var>p</var> in
+  Nfac(<var>p</var>,<var>q</var>).\n\nYou are given that NF(3,10000) mod 3<sup>20</sup>=624955285.\n\nFind
+  NF(61,10<sup>7</sup>) mod 61<sup>10</sup>\n\n"

data/data/problems/289.yml

@@ -2,18 +2,17 @@
 :id: 289
 :name: Eulerian Cycles
 :url: http://projecteuler.net/problem=289
-:content: "\r\n<p>Let C(<var>x</var>,<var>y</var>) be a circle passing through the
-  points (<var>x</var>, <var>y</var>), (<var>x</var>, <var>y</var>+1), (<var>x</var>+1, <var>y</var>)
-  and (<var>x</var>+1, <var>y</var>+1).</p>\r\n\r\n<p>For positive integers m and
-  n, let E(<var>m</var>,<var>n</var>) be a configuration which consists of the <var>m</var>·<var>n</var>
-  circles:<br>\r\n{ C(<var>x</var>,<var>y</var>): 0 ≤ <var>x</var> m, 0 ≤ <var>y</var> n,
-  <var>x</var> and <var>y</var> are integers }</p>\r\n\r\n<p>An Eulerian cycle on
-  E(<var>m</var>,<var>n</var>) is a closed path that passes through each arc exactly
-  once.<br>\r\nMany such paths are possible on E(<var>m</var>,<var>n</var>), but we
-  are only interested in those which are not self-crossing: \r\nA non-crossing path
-  just touches itself at lattice points, but it never crosses itself.</p>\r\n\r\n<p>The
-  image below shows E(3,3) and an example of an Eulerian non-crossing path.<br></p>\n<div
-  align=\"center\"><img src=\"project/images/p_289_euler.gif\"></div>\r\n\r\n<p>Let
-  L(<var>m</var>,<var>n</var>) be the number of Eulerian non-crossing paths on E(<var>m</var>,<var>n</var>).<br>\r\nFor
-  example, L(1,2) = 2, L(2,2) = 37 and L(3,3) = 104290.</p>\r\n\r\n<p>Find L(6,10)
-  mod 10<sup>10</sup>.</p>\r\n"
+:content: "Let C(<var>x</var>,<var>y</var>) be a circle passing through the points
+  (<var>x</var>, <var>y</var>), (<var>x</var>, <var>y</var>+1), (<var>x</var>+1, <var>y</var>)
+  and (<var>x</var>+1, <var>y</var>+1).\n\nFor positive integers m and n, let E(<var>m</var>,<var>n</var>)
+  be a configuration which consists of the <var>m</var>·<var>n</var> circles:  \n\r{
+  C(<var>x</var>,<var>y</var>): 0 ≤ <var>x</var> m, 0 ≤ <var>y</var> n, <var>x</var>
+  and <var>y</var> are integers }\n\nAn Eulerian cycle on E(<var>m</var>,<var>n</var>)
+  is a closed path that passes through each arc exactly once.  \n\rMany such paths
+  are possible on E(<var>m</var>,<var>n</var>), but we are only interested in those
+  which are not self-crossing: \rA non-crossing path just touches itself at lattice
+  points, but it never crosses itself.\n\nThe image below shows E(3,3) and an example
+  of an Eulerian non-crossing path.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_289_euler.gif)\n\nLet
+  L(<var>m</var>,<var>n</var>) be the number of Eulerian non-crossing paths on E(<var>m</var>,<var>n</var>).
+  \ \n\rFor example, L(1,2) = 2, L(2,2) = 37 and L(3,3) = 104290.\n\nFind L(6,10)
+  mod 10<sup>10</sup>.\n\n"