euler-manager 0.0.5 → 0.0.6

data/data/problems/260.yml

@@ -2,29 +2,25 @@
 :id: 260
 :name: Stone Game
 :url: http://projecteuler.net/problem=260
-:content: "\r\n<p>A game is played with three piles of stones and two players.<br>\r\nAt
-  her turn, a player removes one or more stones from the piles. However, if she takes
+:content: "A game is played with three piles of stones and two players.  \n\rAt her
+  turn, a player removes one or more stones from the piles. However, if she takes
   stones from more than one pile, she must remove the same number of stones from each
-  of the selected piles.</p>\r\n\r\n<p>In other words, the player chooses some N&gt;0
-  and removes:\r\n</p>\n<ul>\n<li>N stones from any single pile; or</li>\r\n<li>N
-  stones from each of any two piles (2N total); or</li>\r\n<li>N stones from each
-  of the three piles (3N total).</li>\n</ul>\r\nThe player taking the last stone(s)
-  wins the game.\r\n\r\n<p>A <i>winning configuration</i> is one where the first player
-  can force a win.<br>\r\nFor example, (0,0,13), (0,11,11) and (5,5,5) are winning
-  configurations because the first player can immediately remove all stones.</p>\r\n\r\n<p>A
-  <i>losing configuration</i> is one where the second player can force a win, no matter
-  what the first player does.<br> \r\nFor example, (0,1,2) and (1,3,3) are losing
-  configurations: any legal move leaves a winning configuration for the second player.</p>\r\n\r\n<p>Consider
-  all  losing configurations (x<sub>i</sub>,y<sub>i</sub>,z<sub>i</sub>) where x<sub>i</sub><img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  y<sub>i</sub><img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"> z<sub>i</sub><img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  100.<br>\r\nWe can verify that Σ(x<sub>i</sub>+y<sub>i</sub>+z<sub>i</sub>) = 173895
-  for these.</p>\r\n\r\n<p>Find Σ(x<sub>i</sub>+y<sub>i</sub>+z<sub>i</sub>) where
-  (x<sub>i</sub>,y<sub>i</sub>,z<sub>i</sub>) ranges over the losing configurations<br>\r\nwith
-  x<sub>i</sub><img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"> y<sub>i</sub><img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  z<sub>i</sub><img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"> 1000.</p>\r\n"
+  of the selected piles.\n\nIn other words, the player chooses some N>0 and removes:\n\n-
+  N stones from any single pile; or\n- N stones from each of any two piles (2N total);
+  or\n- N stones from each of the three piles (3N total).\n\rThe player taking the
+  last stone(s) wins the game.\r\r\n\nA _winning configuration_ is one where the first
+  player can force a win.  \n\rFor example, (0,0,13), (0,11,11) and (5,5,5) are winning
+  configurations because the first player can immediately remove all stones.\n\nA
+  _losing configuration_ is one where the second player can force a win, no matter
+  what the first player does.  \n \rFor example, (0,1,2) and (1,3,3) are losing configurations:
+  any legal move leaves a winning configuration for the second player.\n\nConsider
+  all losing configurations (x<sub>i</sub>,y<sub>i</sub>,z<sub>i</sub>) where x<sub>i</sub>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) y<sub>i</sub>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) z<sub>i</sub>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 100.  \n\rWe
+  can verify that Σ(x<sub>i</sub>+y<sub>i</sub>+z<sub>i</sub>) = 173895 for these.\n\nFind
+  Σ(x<sub>i</sub>+y<sub>i</sub>+z<sub>i</sub>) where (x<sub>i</sub>,y<sub>i</sub>,z<sub>i</sub>)
+  ranges over the losing configurations  \n\rwith x<sub>i</sub> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  y<sub>i</sub> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  z<sub>i</sub> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  1000.\n\n"

data/data/problems/261.yml

@@ -2,18 +2,16 @@
 :id: 261
 :name: Pivotal Square Sums
 :url: http://projecteuler.net/problem=261
-:content: "\r\n<p>Let us call a positive integer <var>k</var> a <var>square-pivot</var>,
-  if there is a pair of integers <var>m</var> <img src=\"images/symbol_gt.gif\" width=\"10\"
-  height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\"> 0 and
-  <var>n</var> <img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>k</var>, such that the sum of
-  the (<var>m</var>+1) consecutive squares up to <var>k</var> equals the sum of the
-  <var>m</var> consecutive squares from (<var>n</var>+1) on:</p>\r\n<div align=\"center\">\r\n(<var>k</var>-<var>m</var>)<sup>2</sup>
-  + ... + <var>k</var><sup>2</sup> = (<var>n</var>+1)<sup>2</sup> + ... + (<var>n</var>+<var>m</var>)<sup>2</sup>.</div>\r\n\r\n<p>Some
-  small square-pivots are\r\n</p>\n<ul>\n<li>\n<b>4</b>: 3<sup>2</sup> + <b>4</b><sup>2</sup>\r\n
-  = 5<sup>2</sup>\n</li>\r\n<li>\n<b>21</b>: 20<sup>2</sup> + <b>21</b><sup>2</sup>
-  = 29<sup>2</sup>\n</li>\r\n<li>\n<b>24</b>: 21<sup>2</sup> + 22<sup>2</sup> + 23<sup>2</sup>
-  + <b>24</b><sup>2</sup> = 25<sup>2</sup> + 26<sup>2</sup> + 27<sup>2</sup>\n</li>\r\n<li>\n<b>110</b>:
-  108<sup>2</sup> + 109<sup>2</sup> + <b>110</b><sup>2</sup> = 133<sup>2</sup> + 134<sup>2</sup>\n</li>\n</ul>\n<p>Find
-  the sum of all <b>distinct</b> square-pivots <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 10<sup>10</sup>.</p>\r\n"
+:content: "Let us call a positive integer <var>k</var> a <var>square-pivot</var>,
+  if there is a pair of integers <var>m</var> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)
+  0 and <var>n</var> ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  <var>k</var>, such that the sum of the (<var>m</var>+1) consecutive squares up to
+  <var>k</var> equals the sum of the <var>m</var> consecutive squares from (<var>n</var>+1)
+  on:\n\n\r(<var>k</var>-<var>m</var>)<sup>2</sup> + ... + <var>k</var><sup>2</sup>
+  = (<var>n</var>+1)<sup>2</sup> + ... + (<var>n</var>+<var>m</var>)<sup>2</sup>.\n\nSome
+  small square-pivots are\n\n- **4** : 3<sup>2</sup> + **4** <sup>2</sup>\r = 5<sup>2</sup>\n-
+  **21** : 20<sup>2</sup> + **21** <sup>2</sup> = 29<sup>2</sup>\n- **24** : 21<sup>2</sup>
+  + 22<sup>2</sup> + 23<sup>2</sup> + **24** <sup>2</sup> = 25<sup>2</sup> + 26<sup>2</sup>
+  + 27<sup>2</sup>\n- **110** : 108<sup>2</sup> + 109<sup>2</sup> + **110** <sup>2</sup>
+  = 133<sup>2</sup> + 134<sup>2</sup>\n\nFind the sum of all **distinct** square-pivots
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 10<sup>10</sup>.\n\n"

data/data/problems/262.yml

@@ -2,19 +2,18 @@
 :id: 262
 :name: Mountain Range
 :url: http://projecteuler.net/problem=262
-:content: "\r\n<p>The following equation represents the <i>continuous</i> topography
-  of a mountainous region, giving the <dfn title=\"height above sea level\">elevation</dfn>
-  <var>h</var> at any point (<var>x</var>,<var>y</var>):</p>\r\n\r\n<div align=\"center\">\r\n<img
-  src=\"project/images/p_262_formula1.gif\"><br>\n</div>\r\n\r\n<p>A mosquito intends
-  to fly from A(200,200) to B(1400,1400), without leaving the area given by 0 ≤ <var>x</var>, <var>y</var> ≤ 1600.</p>\r\n\r\n<p>Because
-  of the intervening mountains, it first rises straight up to a point A', having elevation
-  <var>f</var>. Then, while remaining at the same elevation <var>f</var>, it flies
-  around any obstacles until it arrives at a point B' directly above B.</p>\r\n\r\n<p>First,
-  determine <var>f<sub>min</sub></var> which is the minimum constant elevation allowing
-  such a trip from A to B, while remaining in the specified area.<br>\r\nThen, find
-  the length of the shortest path between A' and B', while flying at that constant
-  elevation <var>f<sub>min</sub></var>.</p>\r\n\r\n<p>Give that length as your answer,
-  rounded to three decimal places.</p>\r\n\r\n<p><font><u>Note</u>: For convenience,
-  the elevation function shown above is repeated below, in a form suitable for most
-  programming languages:<br>\r\nh=( 5000-0.005*(x*x+y*y+x*y)+12.5*(x+y) ) * exp( -abs(0.000001*(x*x+y*y)-0.0015*(x+y)+0.7)
-  )</font></p>\r\n\r\n"
+:content: "The following equation represents the _continuous_ topography of a mountainous
+  region, giving the <dfn title=\"height above sea level\">elevation</dfn> <var>h</var>
+  at any point (<var>x</var>,<var>y</var>):\n\n ![](/home/will/src/euler-manager/config/../data/images/p_262_formula1.gif)
+  \ \n\nA mosquito intends to fly from A(200,200) to B(1400,1400), without leaving
+  the area given by 0 ≤ <var>x</var>, <var>y</var> ≤ 1600.\n\nBecause of the intervening
+  mountains, it first rises straight up to a point A', having elevation <var>f</var>.
+  Then, while remaining at the same elevation <var>f</var>, it flies around any obstacles
+  until it arrives at a point B' directly above B.\n\nFirst, determine <var>f<sub>min</sub></var>
+  which is the minimum constant elevation allowing such a trip from A to B, while
+  remaining in the specified area.  \n\rThen, find the length of the shortest path
+  between A' and B', while flying at that constant elevation <var>f<sub>min</sub></var>.\n\nGive
+  that length as your answer, rounded to three decimal places.\n\n<font><u>Note</u>:
+  For convenience, the elevation function shown above is repeated below, in a form
+  suitable for most programming languages:<br>\r\nh=( 5000-0.005*(x*x+y*y+x*y)+12.5*(x+y)
+  ) * exp( -abs(0.000001*(x*x+y*y)-0.0015*(x+y)+0.7) )</font>\n\n"

data/data/problems/263.yml

@@ -2,18 +2,16 @@
 :id: 263
 :name: An engineers' dream come true
 :url: http://projecteuler.net/problem=263
-:content: "\r\n<p>\r\nConsider the number 6. The divisors of 6 are: 1,2,3 and 6.<br>\r\nEvery
-  number from 1 up to and including 6 can be written as a sum of distinct divisors
-  of 6:<br>\r\n1=1, 2=2, 3=1+2, 4=1+3, 5=2+3, 6=6.<br>\r\nA number <var>n</var> is
-  called a practical number if every number from 1 up to and including <var>n</var>
-  can be expressed as a sum of distinct divisors of <var>n</var>.\r\n</p>\r\n<p>\r\nA
-  pair of consecutive prime numbers with a difference of six is called a sexy pair
-  (since \"sex\" is the Latin word for \"six\"). The first sexy pair is (23, 29).\r\n</p>\r\n<p>\r\nWe
-  may occasionally find a triple-pair, which means three consecutive sexy prime pairs,
-  such that the second member of each pair is the first member of the next pair.\r\n</p>\r\n<p>\r\nWe
-  shall call a number <var>n</var> such that :\r\n</p>\n<ul>\n<li>(<var>n</var>-9,
-  <var>n</var>-3), (<var>n</var>-3,<var>n</var>+3), (<var>n</var>+3, <var>n</var>+9)
-  form a triple-pair, and \r\n</li>\n<li>the numbers <var>n</var>-8, <var>n</var>-4,
-  <var>n</var>, <var>n</var>+4 and <var>n</var>+8 are all practical,\r\n</li>\n</ul>
-  \r\nan engineers’ paradise.\r\n\r\n<p>\r\nFind the sum of the first four engineers’
-  paradises.\r\n</p>\r\n\r\n\r\n"
+:content: "Consider the number 6. The divisors of 6 are: 1,2,3 and 6.  \n\rEvery number
+  from 1 up to and including 6 can be written as a sum of distinct divisors of 6:
+  \ \n\r1=1, 2=2, 3=1+2, 4=1+3, 5=2+3, 6=6.  \n\rA number <var>n</var> is called a
+  practical number if every number from 1 up to and including <var>n</var> can be
+  expressed as a sum of distinct divisors of <var>n</var>.\n\nA pair of consecutive
+  prime numbers with a difference of six is called a sexy pair (since \"sex\" is the
+  Latin word for \"six\"). The first sexy pair is (23, 29).\n\nWe may occasionally
+  find a triple-pair, which means three consecutive sexy prime pairs, such that the
+  second member of each pair is the first member of the next pair.\n\nWe shall call
+  a number <var>n</var> such that :\n\n- (<var>n</var>-9, <var>n</var>-3), (<var>n</var>-3,<var>n</var>+3),
+  (<var>n</var>+3, <var>n</var>+9) form a triple-pair, and \r\n- the numbers <var>n</var>-8,
+  <var>n</var>-4, <var>n</var>, <var>n</var>+4 and <var>n</var>+8 are all practical,\r\n
+  \ran engineers’ paradise.\r\r\n\nFind the sum of the first four engineers’ paradises.\n\n"

data/data/problems/264.yml

@@ -2,19 +2,18 @@
 :id: 264
 :name: Triangle Centres
 :url: http://projecteuler.net/problem=264
-:content: "\r\n<p>Consider all the triangles having:\r\n</p>\n<ul>\n<li>All their
-  vertices on <dfn title=\"Integer coordinates\">lattice points</dfn>.</li>\r\n<li>\n<dfn
-  title=\"Centre of the circumscribed circle\">Circumcentre</dfn> at the origin O.</li>\r\n<li>\n<dfn
-  title=\"Point where the three altitudes meet\">Orthocentre</dfn> at the point H(5,
-  0).</li>\r\n</ul>\n<p>There are nine such triangles having a perimeter <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  50.<br>\r\nListed and shown in ascending order of their perimeter, they are:</p>\r\n\r\n<p></p>\n<table><tr>\n<td>A(-4,
-  3), B(5, 0), C(4, -3)<br>\r\nA(4, 3), B(5, 0), C(-4, -3)<br>\r\nA(-3, 4), B(5, 0),
-  C(3, -4)<br><br><br>\r\nA(3, 4), B(5, 0), C(-3, -4)<br>\r\nA(0, 5), B(5, 0), C(0,
-  -5)<br>\r\nA(1, 8), B(8, -1), C(-4, -7)<br><br><br>\r\nA(8, 1), B(1, -8), C(-4,
-  7)<br>\r\nA(2, 9), B(9, -2), C(-6, -7)<br>\r\nA(9, 2), B(2, -9), C(-6, 7)<br>\n</td>\r\n<td><img
-  src=\"project/images/p_264_TriangleCentres.gif\"></td>\r\n</tr></table>\n<p>The
-  sum of their perimeters, rounded to four decimal places, is 291.0089.</p>\r\n\r\n<p>Find
-  all such triangles with a perimeter <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 10<sup>5</sup>.<br>\r\nEnter
-  as your answer the sum of their perimeters rounded to four decimal places.</p>\r\n\r\n"
+:content: "Consider all the triangles having:\n\n- All their vertices on <dfn title=\"Integer
+  coordinates\">lattice points</dfn>.\n- <dfn title=\"Centre of the circumscribed
+  circle\">Circumcentre</dfn> at the origin O.\n- <dfn title=\"Point where the three
+  altitudes meet\">Orthocentre</dfn> at the point H(5, 0).\n\nThere are nine such
+  triangles having a perimeter ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  50.  \n\rListed and shown in ascending order of their perimeter, they are:\n\n|
+  A(-4, 3), B(5, 0), C(4, -3)  \n\rA(4, 3), B(5, 0), C(-4, -3)  \n\rA(-3, 4), B(5,
+  0), C(3, -4)  \n  \n  \n  \n  \n\rA(3, 4), B(5, 0), C(-3, -4)  \n\rA(0, 5), B(5,
+  0), C(0, -5)  \n\rA(1, 8), B(8, -1), C(-4, -7)  \n  \n  \n  \n  \n\rA(8, 1), B(1,
+  -8), C(-4, 7)  \n\rA(2, 9), B(9, -2), C(-6, -7)  \n\rA(9, 2), B(2, -9), C(-6, 7)
+  \ \n | ![](/home/will/src/euler-manager/config/../data/images/p_264_TriangleCentres.gif)
+  |\n\nThe sum of their perimeters, rounded to four decimal places, is 291.0089.\n\nFind
+  all such triangles with a perimeter ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  10<sup>5</sup>.  \n\rEnter as your answer the sum of their perimeters rounded to
+  four decimal places.\n\n"

data/data/problems/265.yml

@@ -2,15 +2,13 @@
 :id: 265
 :name: Binary Circles
 :url: http://projecteuler.net/problem=265
-:content: "\r\n<p>2<sup>N</sup> binary digits can be placed in a circle so that all
-  the N-digit clockwise subsequences are distinct.</p>\r\n\r\n<p>For N=3, two such
-  circular arrangements are possible, ignoring rotations:</p>\r\n<div align=\"center\"><img
-  src=\"project/images/p_265_BinaryCircles.gif\"></div>\r\n\r\n<p>For the first arrangement,
-  the 3-digit subsequences, in clockwise order, are:<br> 000, 001, 010, 101, 011,
-  111, 110 and 100.</p>\r\n\r\n<p>Each circular arrangement can be encoded as a number
-  by concatenating the binary digits starting with the subsequence of all zeros as
-  the most significant bits and proceeding clockwise. The two arrangements for N=3
-  are thus represented as 23 and 29:\r\n</p>\n<div align=\"center\">00010111 <sub>2</sub>
-  = 23</div>\r\n<div align=\"center\">00011101 <sub>2</sub> = 29</div>\r\n\r\n<p>Calling
-  S(N) the sum of the unique numeric representations, we can see that S(3) = 23 +
-  29 = 52.</p>\r\n\r\n<p>Find S(5).</p>\r\n\r\n"
+:content: "2<sup>N</sup> binary digits can be placed in a circle so that all the N-digit
+  clockwise subsequences are distinct.\n\nFor N=3, two such circular arrangements
+  are possible, ignoring rotations:\n\n ![](/home/will/src/euler-manager/config/../data/images/p_265_BinaryCircles.gif)\n\nFor
+  the first arrangement, the 3-digit subsequences, in clockwise order, are:  \n 000,
+  001, 010, 101, 011, 111, 110 and 100.\n\nEach circular arrangement can be encoded
+  as a number by concatenating the binary digits starting with the subsequence of
+  all zeros as the most significant bits and proceeding clockwise. The two arrangements
+  for N=3 are thus represented as 23 and 29:\n\n00010111 <sub>2</sub> = 23\n\n00011101 <sub>2</sub>
+  = 29\n\nCalling S(N) the sum of the unique numeric representations, we can see that
+  S(3) = 23 + 29 = 52.\n\nFind S(5).\n\n"

data/data/problems/266.yml

@@ -2,9 +2,9 @@
 :id: 266
 :name: Pseudo Square Root
 :url: http://projecteuler.net/problem=266
-:content: "\r\n<p>\r\nThe divisors of 12 are: 1,2,3,4,6 and 12.<br>\r\nThe largest
-  divisor of 12 that does not exceed the square root of 12 is 3.<br>\r\nWe shall call
-  the largest divisor of an integer <var>n</var> that does not exceed the square root
-  of <var>n</var> the pseudo square root (PSR) of <var>n</var>.<br>\r\nIt can be seen
-  that PSR(3102)=47.\r\n</p>\r\n<p>\r\nLet <var>p</var> be the product of the primes
-  below 190.<br>\r\nFind PSR(<var>p</var>) mod 10<sup>16</sup>.\r\n</p>\r\n\r\n\r\n\r\n\r\n"
+:content: "The divisors of 12 are: 1,2,3,4,6 and 12.  \n\rThe largest divisor of 12
+  that does not exceed the square root of 12 is 3.  \n\rWe shall call the largest
+  divisor of an integer <var>n</var> that does not exceed the square root of <var>n</var>
+  the pseudo square root (PSR) of <var>n</var>.  \n\rIt can be seen that PSR(3102)=47.\n\nLet
+  <var>p</var> be the product of the primes below 190.  \n\rFind PSR(<var>p</var>)
+  mod 10<sup>16</sup>.\n\n"

data/data/problems/267.yml

@@ -2,13 +2,16 @@
 :id: 267
 :name: Billionaire
 :url: http://projecteuler.net/problem=267
-:content: "\r\n<p>You are given a unique investment opportunity.</p>\r\n<p>Starting
-  with £1 of capital, you can choose a fixed proportion, <var>f</var>, of your capital
-  to bet on a fair coin toss repeatedly for 1000 tosses.</p>\r\n<p>Your return is
-  double your bet for heads and you lose your bet for tails.</p>\r\n<p>For example,
-  if <var>f</var> = 1/4,  for the first toss you bet £0.25, and if heads comes up
-  you win £0.5 and so then have £1.5. You then bet £0.375 and if the second toss is
-  tails, you have £1.125.</p>\r\n<p>Choosing <var>f</var> to maximize your chances
-  of having at least £1,000,000,000 after 1,000 flips, what is the chance that you
-  become a billionaire?</p>\r\n<p>All computations are assumed to be exact (no rounding),
-  but give your answer rounded to 12 digits behind the decimal point in the form 0.abcdefghijkl.</p>\r\n\r\n"
+:content: |+
+  You are given a unique investment opportunity.
+
+  Starting with £1 of capital, you can choose a fixed proportion, <var>f</var>, of your capital to bet on a fair coin toss repeatedly for 1000 tosses.
+
+  Your return is double your bet for heads and you lose your bet for tails.
+
+  For example, if <var>f</var> = 1/4, for the first toss you bet £0.25, and if heads comes up you win £0.5 and so then have £1.5. You then bet £0.375 and if the second toss is tails, you have £1.125.
+
+  Choosing <var>f</var> to maximize your chances of having at least £1,000,000,000 after 1,000 flips, what is the chance that you become a billionaire?
+
+  All computations are assumed to be exact (no rounding), but give your answer rounded to 12 digits behind the decimal point in the form 0.abcdefghijkl.
+

data/data/problems/268.yml

@@ -2,7 +2,8 @@
 :id: 268
 :name: Counting numbers with at least four distinct prime factors less than 100
 :url: http://projecteuler.net/problem=268
-:content: "\r\n<p>It can be verified that there are 23 positive integers less than
-  1000 that are divisible by at least four distinct primes less than 100.</p>\r\n\r\n<p>Find
-  how many positive integers less than 10<sup>16</sup> are divisible by at least four
-  distinct primes less than 100.</p>\r\n\r\n\r\n"
+:content: |+
+  It can be verified that there are 23 positive integers less than 1000 that are divisible by at least four distinct primes less than 100.
+
+  Find how many positive integers less than 10<sup>16</sup> are divisible by at least four distinct primes less than 100.
+

data/data/problems/269.yml

@@ -2,14 +2,13 @@
 :id: 269
 :name: Polynomials with at least one integer root
 :url: http://projecteuler.net/problem=269
-:content: "\r\n<p>A root or zero of a polynomial P(<var>x</var>) is a solution to
-  the equation P(<var>x</var>) = 0. <br>\r\nDefine P<sub><var>n</var></sub> as the
-  polynomial whose coefficients are the digits of <var>n</var>.<br>\r\nFor example,
-  P<sub>5703</sub>(<var>x</var>) = 5<var>x</var><sup>3</sup> + 7<var>x</var><sup>2</sup>
-  + 3.</p>\r\n\r\n<p>We can see that:</p>\n<ul>\n<li>P<sub><var>n</var></sub>(0) is
-  the last digit of <var>n</var>,</li>\r\n<li>P<sub><var>n</var></sub>(1) is the sum
-  of the digits of <var>n</var>,</li>\r\n<li>P<sub><var>n</var></sub>(10) is <var>n</var>
-  itself.</li>\n</ul>\n<p>Define Z(<var>k</var>) as the number of positive integers,
-  <var>n</var>, not exceeding <var>k</var> for which the polynomial P<sub><var>n</var></sub>
-  has at least one integer root.</p>\r\n\r\n<p>It can be verified that Z(100 000)
-  is 14696.</p>\r\n\r\n<p>What is Z(10<sup>16</sup>)?</p>\r\n\r\n"
+:content: "A root or zero of a polynomial P(<var>x</var>) is a solution to the equation
+  P(<var>x</var>) = 0.   \n\rDefine P<sub><var>n</var></sub> as the polynomial whose
+  coefficients are the digits of <var>n</var>.  \n\rFor example, P<sub>5703</sub>(<var>x</var>)
+  = 5<var>x</var><sup>3</sup> + 7<var>x</var><sup>2</sup> + 3.\n\nWe can see that:\n\n-
+  P<sub><var>n</var></sub>(0) is the last digit of <var>n</var>,\n- P<sub><var>n</var></sub>(1)
+  is the sum of the digits of <var>n</var>,\n- P<sub><var>n</var></sub>(10) is <var>n</var>
+  itself.\n\nDefine Z(<var>k</var>) as the number of positive integers, <var>n</var>,
+  not exceeding <var>k</var> for which the polynomial P<sub><var>n</var></sub> has
+  at least one integer root.\n\nIt can be verified that Z(100 000) is 14696.\n\nWhat
+  is Z(10<sup>16</sup>)?\n\n"

data/data/problems/27.yml

@@ -2,24 +2,18 @@
 :id: 27
 :name: Quadratic primes
 :url: http://projecteuler.net/problem=27
-:content: "\r\n<p>Euler discovered the remarkable quadratic formula:</p>\r\n<p style=\"text-align:center;\"><i>n</i>²
-  + <i>n</i> + 41</p>\r\n<p>It turns out that the formula will produce 40 primes for
-  the consecutive values <i>n</i> = 0 to 39. However, when <i>n</i> = 40, 40<sup>2</sup>
-  + 40 + 41 = 40(40 + 1) + 41 is divisible by 41, and certainly when <i>n</i> = 41,
-  41² + 41 + 41 is clearly divisible by 41.</p>\r\n<p>The incredible formula  <i>n</i>²
-  <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\"> 79<i>n</i> + 1601 was discovered, which produces
-  80 primes for the consecutive values <i>n</i> = 0 to 79. The product of the coefficients,
-  <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\">79 and 1601, is <img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">126479.</p>\r\n<p>Considering
-  quadratics of the form:</p>\r\n<blockquote>\r\n<i>n</i>² + <i>an</i> + <i>b</i>,
-  where |<i>a</i>| <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  border=\"0\" style=\"vertical-align:middle;\"> 1000 and |<i>b</i>| <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">
-  1000<br><br><div class=\"info\" style=\"text-align:left;\">where |<i>n</i>| is the
-  modulus/absolute value of <i>n</i><br>e.g. |11| = 11 and |<img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">4|
-  = 4</div>\r\n</blockquote>\r\n<p>Find the product of the coefficients, <i>a</i>
-  and <i>b</i>, for the quadratic expression that produces the maximum number of primes
-  for consecutive values of <i>n</i>, starting with <i>n</i> = 0.</p>\r\n\r\n"
+:content: "Euler discovered the remarkable quadratic formula:\n\n_n_² + _n_ + 41\n\nIt
+  turns out that the formula will produce 40 primes for the consecutive values _n_
+  = 0 to 39. However, when _n_ = 40, 40<sup>2</sup> + 40 + 41 = 40(40 + 1) + 41 is
+  divisible by 41, and certainly when _n_ = 41, 41² + 41 + 41 is clearly divisible
+  by 41.\n\nThe incredible formula  _n_² ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)
+  79_n_ + 1601 was discovered, which produces 80 primes for the consecutive values
+  _n_ = 0 to 79. The product of the coefficients, ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)79
+  and 1601, is ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)126479.\n\nConsidering
+  quadratics of the form:\n\n> _n_² + _an_ + _b_, where |_a_| ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  1000 and |_b_| ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  1000  \n>   \n> \n> where |_n_| is the modulus/absolute value of _n_  \n> e.g. |11|
+  = 11 and | ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)4|
+  = 4\n\nFind the product of the coefficients, _a_ and _b_, for the quadratic expression
+  that produces the maximum number of primes for consecutive values of _n_, starting
+  with _n_ = 0.\n\n"

data/data/problems/270.yml

@@ -2,16 +2,16 @@
 :id: 270
 :name: Cutting Squares
 :url: http://projecteuler.net/problem=270
-:content: "\r\n<p>A square piece of paper with integer dimensions N<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">N
-  is placed with a corner at the origin and two of its sides along the <var>x</var>-
-  and <var>y</var>-axes. Then, we cut it up respecting the following rules:\r\n</p>\n<ul>\n<li>We
-  only make straight cuts between two points lying on different sides of the square,
-  and having integer coordinates.</li>\r\n<li>Two cuts cannot cross, but several cuts
-  can meet at the same border point.</li>\r\n<li>Proceed until no more legal cuts
-  can be made.</li>\r\n</ul>\n<p>Counting any reflections or rotations as distinct,
-  we call C(N) the number of ways to cut an N<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">N
-  square. For example, C(1) = 2 and C(2) = 30 (shown below).</p>\r\n<div align=\"center\"><img
-  src=\"project/images/p_270_CutSquare.gif\"></div>\r\n\r\n<p>What is C(30) mod 10<sup>8</sup>
-  ?</p>\r\n"
+:content: |+
+  A square piece of paper with integer dimensions N ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)N is placed with a corner at the origin and two of its sides along the <var>x</var>- and <var>y</var>-axes. Then, we cut it up respecting the following rules:
+
+  - We only make straight cuts between two points lying on different sides of the square, and having integer coordinates.
+  - Two cuts cannot cross, but several cuts can meet at the same border point.
+  - Proceed until no more legal cuts can be made.
+
+  Counting any reflections or rotations as distinct, we call C(N) the number of ways to cut an N ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)N square. For example, C(1) = 2 and C(2) = 30 (shown below).
+
+   ![](/home/will/src/euler-manager/config/../data/images/p_270_CutSquare.gif)
+
+  What is C(30) mod 10<sup>8</sup> ?
+

data/data/problems/271.yml

@@ -2,12 +2,10 @@
 :id: 271
 :name: Modular Cubes, part 1
 :url: http://projecteuler.net/problem=271
-:content: "\r\n<p>\r\nFor a positive number <var>n</var>, define S(<var>n</var>) as
-  the sum of the integers <var>x,</var> for which 1<img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>x</var><img
-  src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>n</var> and<br><var>x</var><sup>3</sup><img
-  src=\"images/symbol_cong.gif\" width=\"9\" height=\"11\" alt=\"≡\" border=\"0\"
-  style=\"vertical-align:middle;\">1 mod <var>n</var>.\r\n</p>\r\n<p>\r\nWhen <var>n</var>=91,
-  there are 8 possible values for <var>x</var>, namely : 9, 16, 22, 29, 53, 74, 79,
-  81.<br>\r\nThus, S(91)=9+16+22+29+53+74+79+81=363.</p>\r\n<p>\r\nFind S(13082761331670030).\r\n</p>\r\n\r\n"
+:content: "For a positive number <var>n</var>, define S(<var>n</var>) as the sum of
+  the integers <var>x,</var> for which 1 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)<var>x</var>
+  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)<var>n</var>
+  and  \n <var>x</var><sup>3</sup> ![≡](/home/will/src/euler-manager/config/../data/images/symbol_cong.gif)1
+  mod <var>n</var>.\n\nWhen <var>n</var>=91, there are 8 possible values for <var>x</var>,
+  namely : 9, 16, 22, 29, 53, 74, 79, 81.  \n\rThus, S(91)=9+16+22+29+53+74+79+81=363.\n\nFind
+  S(13082761331670030).\n\n"

data/data/problems/272.yml

@@ -2,14 +2,11 @@
 :id: 272
 :name: Modular Cubes, part 2
 :url: http://projecteuler.net/problem=272
-:content: "\r\n<p>\r\nFor a positive number <var>n</var>, define C(<var>n</var>) as
-  the number of the integers <var>x,</var> for which 1<img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"><var>x</var><img
-  src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>n</var> and<br><var>x</var><sup>3</sup><img
-  src=\"images/symbol_cong.gif\" width=\"9\" height=\"11\" alt=\"≡\" border=\"0\"
-  style=\"vertical-align:middle;\">1 mod <var>n</var>.\r\n</p>\r\n<p>\r\nWhen <var>n</var>=91,
-  there are 8 possible values for <var>x</var>, namely : 9, 16, 22, 29, 53, 74, 79,
-  81.<br>\r\nThus, C(91)=8.</p>\r\n<p>\r\nFind the sum of the positive numbers <var>n</var><img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">10<sup>11</sup>
-  for which C(<var>n</var>)=242.\r\n</p>"
+:content: "For a positive number <var>n</var>, define C(<var>n</var>) as the number
+  of the integers <var>x,</var> for which 1 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)<var>x</var>
+  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)<var>n</var>
+  and  \n <var>x</var><sup>3</sup> ![≡](/home/will/src/euler-manager/config/../data/images/symbol_cong.gif)1
+  mod <var>n</var>.\n\nWhen <var>n</var>=91, there are 8 possible values for <var>x</var>,
+  namely : 9, 16, 22, 29, 53, 74, 79, 81.  \n\rThus, C(91)=8.\n\nFind the sum of the
+  positive numbers <var>n</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)10<sup>11</sup>
+  for which C(<var>n</var>)=242.\n\n"

data/data/problems/273.yml

@@ -2,20 +2,16 @@
 :id: 273
 :name: Sum of Squares
 :url: http://projecteuler.net/problem=273
-:content: "\r\n<p>Consider equations of the form: <var>a</var><sup>2</sup> + <var>b</var><sup>2</sup>
-  = <var>N</var>, 0 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>a</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>b</var>,
-  <var>a</var>, <var>b</var> and <var>N</var> integer.</p>\r\n\r\n<p>For <var>N</var>=65
-  there are two solutions:</p>\r\n<p><var>a</var>=1, <var>b</var>=8 and <var>a</var>=4,
-  <var>b</var>=7.</p>\r\n<p>We call S(<var>N</var>) the sum of the values of <var>a</var>
-  of all solutions of <var>a</var><sup>2</sup> + <var>b</var><sup>2</sup> = <var>N</var>,
-  0 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>a</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>b</var>,
-  <var>a</var>, <var>b</var> and <var>N</var> integer.</p>\r\n<p>Thus S(65) = 1 +
-  4 = 5.</p>\r\n<p>Find <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\"
-  alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">S(<var>N</var>), for all
-  squarefree <var>N</var> only divisible by primes of the form 4<var>k</var>+1 with
-  4<var>k</var>+1 <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  border=\"0\" style=\"vertical-align:middle;\"> 150.</p>\r\n\r\n"
+:content: |+
+  Consider equations of the form: <var>a</var><sup>2</sup> + <var>b</var><sup>2</sup> = <var>N</var>, 0 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>a</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>b</var>, <var>a</var>, <var>b</var> and <var>N</var> integer.
+
+  For <var>N</var>=65 there are two solutions:
+
+  <var>a</var>=1, <var>b</var>=8 and <var>a</var>=4, <var>b</var>=7.
+
+  We call S(<var>N</var>) the sum of the values of <var>a</var> of all solutions of <var>a</var><sup>2</sup> + <var>b</var><sup>2</sup> = <var>N</var>, 0 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>a</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>b</var>, <var>a</var>, <var>b</var> and <var>N</var> integer.
+
+  Thus S(65) = 1 + 4 = 5.
+
+  Find ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)S(<var>N</var>), for all squarefree <var>N</var> only divisible by primes of the form 4<var>k</var>+1 with 4<var>k</var>+1 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 150.
+

data/data/problems/274.yml

@@ -2,22 +2,19 @@
 :id: 274
 :name: Divisibility Multipliers
 :url: http://projecteuler.net/problem=274
-:content: "\r\n<p>For each integer <var>p</var> <img src=\"images/symbol_gt.gif\"
-  width=\"10\" height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\">
-  1 coprime to 10 there is a positive <em>divisibility multiplier</em> <var>m</var>
-  <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>p</var> which preserves divisibility by <var>p</var>
-  for the following function on any positive integer, <var>n</var>:</p>\r\n\r\n<p><var>f</var>(<var>n</var>)
-  = (all but the last digit of <var>n</var>) + (the last digit of <var>n</var>) *
-  <var>m</var></p>\r\n\r\n<p>That is, if <var>m</var> is the divisibility multiplier
-  for <var>p</var>, then <var>f</var>(<var>n</var>) is divisible by <var>p</var> if
-  and only if <var>n</var> is divisible by <var>p</var>.</p>\r\n\r\n<p>(When <var>n</var>
-  is much larger than <var>p</var>, <var>f</var>(<var>n</var>) will be less than <var>n</var>
-  and repeated application of <var>f</var> provides a multiplicative divisibility
-  test for <var>p</var>.)</p>\r\n\r\n<p>For example, the divisibility multiplier for
-  113 is 34.</p>\r\n\r\n<p><var>f</var>(76275) = 7627 + 5 * 34 = 7797 : 76275 and
-  7797 are both divisible by 113<br><var>f</var>(12345) = 1234 + 5 * 34 = 1404 : 12345
-  and 1404 are both not divisible by 113</p>\r\n\r\n<p>The sum of the divisibility
-  multipliers for the primes that are coprime to 10 and less than 1000 is 39517. What
-  is the sum of the divisibility multipliers for the primes that are coprime to 10
-  and less than 10<sup>7</sup>?</p>\r\n\r\n"
+:content: "For each integer <var>p</var> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)
+  1 coprime to 10 there is a positive _divisibility multiplier_ <var>m</var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>p</var> which preserves divisibility by <var>p</var> for the following function
+  on any positive integer, <var>n</var>:\n\n<var>f</var>(<var>n</var>) = (all but
+  the last digit of <var>n</var>) + (the last digit of <var>n</var>) \\* <var>m</var>\n\nThat
+  is, if <var>m</var> is the divisibility multiplier for <var>p</var>, then <var>f</var>(<var>n</var>)
+  is divisible by <var>p</var> if and only if <var>n</var> is divisible by <var>p</var>.\n\n(When
+  <var>n</var> is much larger than <var>p</var>, <var>f</var>(<var>n</var>) will be
+  less than <var>n</var> and repeated application of <var>f</var> provides a multiplicative
+  divisibility test for <var>p</var>.)\n\nFor example, the divisibility multiplier
+  for 113 is 34.\n\n<var>f</var>(76275) = 7627 + 5 \\* 34 = 7797 : 76275 and 7797
+  are both divisible by 113  \n<var>f</var>(12345) = 1234 + 5 \\* 34 = 1404 : 12345
+  and 1404 are both not divisible by 113\n\nThe sum of the divisibility multipliers
+  for the primes that are coprime to 10 and less than 1000 is 39517. What is the sum
+  of the divisibility multipliers for the primes that are coprime to 10 and less than
+  10<sup>7</sup>?\n\n"