euler-manager 0.1.1 → 0.2.0

data/data/problems/250.yml

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

data/data/problems/251.yml

@@ -1,15 +1,15 @@
 ---
 :id: 251
 :name: Cardano Triplets
-:url: http://projecteuler.net/problem=251
+:url: https://projecteuler.net/problem=251
 :content: |+
   A triplet of positive integers (<var>a</var>,<var>b</var>,<var>c</var>) is called a Cardano Triplet if it satisfies the condition:
 
-   ![]({{ images_dir }}/p_251_cardano.gif)
+   ![]({{ images_dir }}/p251_cardano.gif)
 
   For example, (2,1,5) is a Cardano Triplet.
 
-  There exist 149 Cardano Triplets for which <var>a</var>+<var>b</var>+<var>c</var> ![≤]({{ images_dir }}/symbol_le.gif) 1000.
+  There exist 149 Cardano Triplets for which <var>a</var>+<var>b</var>+<var>c</var> ≤ 1000.
 
-  Find how many Cardano Triplets exist such that <var>a</var>+<var>b</var>+<var>c</var> ![≤]({{ images_dir }}/symbol_le.gif) 110,000,000.
+  Find how many Cardano Triplets exist such that <var>a</var>+<var>b</var>+<var>c</var> ≤ 110,000,000.
 

data/data/problems/252.yml

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

data/data/problems/253.yml

@@ -1,7 +1,7 @@
 ---
 :id: 253
 :name: Tidying up
-:url: http://projecteuler.net/problem=253
+:url: https://projecteuler.net/problem=253
 :content: "A small child has a “number caterpillar” consisting of forty jigsaw pieces,
   each with one number on it, which, when connected together in a line, reveal the
   numbers 1 to 40 in order.\n\nEvery night, the child's father has to pick up the
@@ -13,11 +13,12 @@
   segment (all pieces placed).\n\nFor example:\n\n| **Piece Placed** | **Segments
   So Far** |\n| 12 | 1 |\n| 4 | 2 |\n| 29 | 3 |\n| 6 | 4 |\n| 34 | 5 |\n| 5 | 4 |\n|
   35 | 4 |\n| … | … |\n\nLet <var>M</var> be the maximum number of segments encountered
-  during a random tidy-up of the caterpillar.  \n\rFor a caterpillar of ten pieces,
+  during a random tidy-up of the caterpillar.  \nFor a caterpillar of ten pieces,
   the number of possibilities for each <var>M</var> is\n\n| **<var>M</var>** | **Possibilities**
-  |\n| 1 | 512       |\n| 2 | 250912       |\n| 3 | 1815264       |\n| 4 | 1418112 
-       |\n| 5 | 144000       |\n\nso the most likely value of <var>M</var> is 3 and
-  the average value is <sup>385643</sup>⁄<sub>113400</sub> = 3.400732, rounded to
-  six decimal places.\n\nThe most likely value of <var>M</var> for a forty-piece caterpillar
-  is 11; but what is the average value of <var>M</var>?\n\nGive your answer rounded
-  to six decimal places.\n\n"
+  |\n| 1 | 512&nbsp; &nbsp;&nbsp; &nbsp; |\n| 2 | 250912&nbsp; &nbsp;&nbsp; &nbsp;
+  |\n| 3 | 1815264&nbsp; &nbsp;&nbsp; &nbsp; |\n| 4 | 1418112&nbsp; &nbsp;&nbsp; &nbsp;
+  |\n| 5 | 144000&nbsp; &nbsp;&nbsp; &nbsp; |\n\nso the most likely value of <var>M</var>
+  is 3 and the average value is <sup>385643</sup>⁄<sub>113400</sub> = 3.400732, rounded
+  to six decimal places.\n\nThe most likely value of <var>M</var> for a forty-piece
+  caterpillar is 11; but what is the average value of <var>M</var>?\n\nGive your answer
+  rounded to six decimal places.\n\n"

data/data/problems/254.yml

@@ -1,7 +1,7 @@
 ---
 :id: 254
 :name: Sums of Digit Factorials
-:url: http://projecteuler.net/problem=254
+:url: https://projecteuler.net/problem=254
 :content: |+
   Define f(<var>n</var>) as the sum of the factorials of the digits of <var>n</var>. For example, f(342) = 3! + 4! + 2! = 32.
 
@@ -11,7 +11,7 @@
 
   Define sg(<var>i</var>) as the sum of the digits of g(<var>i</var>). So sg(5) = 2 + 5 = 7.
 
-  Further, it can be verified that g(20) is 267 and ![∑]({{ images_dir }}/symbol_sum.gif) sg(<var>i</var>) for 1 ![≤]({{ images_dir }}/symbol_le.gif) <var>i</var> ![≤]({{ images_dir }}/symbol_le.gif) 20 is 156.
+  Further, it can be verified that g(20) is 267 and ∑ sg(<var>i</var>) for 1 ≤ <var>i</var> ≤ 20 is 156.
 
-  What is ![∑]({{ images_dir }}/symbol_sum.gif) sg(<var>i</var>) for 1 ![≤]({{ images_dir }}/symbol_le.gif) <var>i</var> ![≤]({{ images_dir }}/symbol_le.gif) 150?
+  What is ∑ sg(<var>i</var>) for 1 ≤ <var>i</var> ≤ 150?
 

data/data/problems/255.yml

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

data/data/problems/256.yml

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

data/data/problems/257.yml

@@ -1,14 +1,12 @@
 ---
 :id: 257
 :name: Angular Bisectors
-:url: http://projecteuler.net/problem=257
-:content: "Given is an integer sided triangle ABC with sides a ![≤]({{ images_dir
-  }}/symbol_le.gif) b ![≤]({{ images_dir }}/symbol_le.gif) c. \r(AB = c, BC = a and
-  AC = b).  \n\rThe angular bisectors of the triangle intersect the sides at points
-  E, F and G (see picture below).\n\n ![]({{ images_dir }}/p_257_bisector.gif)  \n\nThe
-  segments EF, EG and FG partition the triangle ABC into four smaller triangles: AEG,
-  BFE, CGF and EFG.  \n\rIt can be proven that for each of these four triangles the
-  ratio area(ABC)/area(subtriangle) is rational.  \n\rHowever, there exist triangles
+:url: https://projecteuler.net/problem=257
+:content: "Given is an integer sided triangle ABC with sides a ≤ b ≤ c. (AB = c, BC
+  = a and AC = b).  \nThe angular bisectors of the triangle intersect the sides at
+  points E, F and G (see picture below).\n\n ![p257_bisector.gif]({{ images_dir }}/p257_bisector.gif)
+  \ \n\nThe segments EF, EG and FG partition the triangle ABC into four smaller triangles:
+  AEG, BFE, CGF and EFG.  \nIt can be proven that for each of these four triangles
+  the ratio area(ABC)/area(subtriangle) is rational.  \nHowever, there exist triangles
   for which some or all of these ratios are integral.\n\nHow many triangles ABC with
-  perimeter ![≤]({{ images_dir }}/symbol_le.gif)100,000,000 exist so that the ratio
-  area(ABC)/area(AEG) is integral?\n\n"
+  perimeter≤100,000,000 exist so that the ratio area(ABC)/area(AEG) is integral?\n\n"

data/data/problems/258.yml

@@ -1,10 +1,12 @@
 ---
 :id: 258
 :name: A lagged Fibonacci sequence
-:url: http://projecteuler.net/problem=258
-:content: "A sequence is defined as:\n\n- <var>g</var><sub><var>k</var></sub> = 1,
-  for 0 ![≤]({{ images_dir }}/symbol_le.gif) <var>k</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  1999\n- <var>g</var><sub><var>k</var></sub> = <var>g</var><sub><var>k</var>-2000</sub>
-  + <var>g</var><sub><var>k</var>-1999</sub>, for <var>k</var> ![≥]({{ images_dir
-  }}/symbol_ge.gif) 2000.\r\n\nFind <var>g</var><sub><var>k</var></sub> mod 20092010
-  for <var>k</var> = 10<sup>18</sup>.\n\n"
+:url: https://projecteuler.net/problem=258
+:content: |+
+  A sequence is defined as:
+
+  - <var>g</var><sub><var>k</var></sub> = 1, for 0 ≤ <var>k</var> ≤ 1999
+  - <var>g</var><sub><var>k</var></sub> = <var>g</var><sub><var>k</var>-2000</sub> + <var>g</var><sub><var>k</var>-1999</sub>, for <var>k</var> ≥ 2000.
+
+  Find <var>g</var><sub><var>k</var></sub> mod 20092010 for <var>k</var> = 10<sup>18</sup>.
+

data/data/problems/259.yml

@@ -1,7 +1,7 @@
 ---
 :id: 259
 :name: Reachable Numbers
-:url: http://projecteuler.net/problem=259
+:url: https://projecteuler.net/problem=259
 :content: |+
   A positive integer will be called _reachable_ if it can result from an arithmetic expression obeying the following rules:
 

data/data/problems/26.yml

@@ -1,21 +1,21 @@
 ---
 :id: 26
 :name: Reciprocal cycles
-:url: http://projecteuler.net/problem=26
+:url: https://projecteuler.net/problem=26
 :content: |+
   A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:
 
-  > | <sup>1</sup>/<sub>2</sub> | =  | 0.5 |
-  > | <sup>1</sup>/<sub>3</sub> | =  | 0.(3) |
-  > | <sup>1</sup>/<sub>4</sub> | =  | 0.25 |
-  > | <sup>1</sup>/<sub>5</sub> | =  | 0.2 |
-  > | <sup>1</sup>/<sub>6</sub> | =  | 0.1(6) |
-  > | <sup>1</sup>/<sub>7</sub> | =  | 0.(142857) |
-  > | <sup>1</sup>/<sub>8</sub> | =  | 0.125 |
-  > | <sup>1</sup>/<sub>9</sub> | =  | 0.(1) |
-  > | <sup>1</sup>/<sub>10</sub> | =  | 0.1 |
+  > | <sup>1</sup>/<sub>2</sub> | =&nbsp; | 0.5 |
+  > | <sup>1</sup>/<sub>3</sub> | =&nbsp; | 0.(3) |
+  > | <sup>1</sup>/<sub>4</sub> | =&nbsp; | 0.25 |
+  > | <sup>1</sup>/<sub>5</sub> | =&nbsp; | 0.2 |
+  > | <sup>1</sup>/<sub>6</sub> | =&nbsp; | 0.1(6) |
+  > | <sup>1</sup>/<sub>7</sub> | =&nbsp; | 0.(142857) |
+  > | <sup>1</sup>/<sub>8</sub> | =&nbsp; | 0.125 |
+  > | <sup>1</sup>/<sub>9</sub> | =&nbsp; | 0.(1) |
+  > | <sup>1</sup>/<sub>10</sub> | =&nbsp; | 0.1 |
 
   Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that <sup>1</sup>/<sub>7</sub> has a 6-digit recurring cycle.
 
-  Find the value of _d_ ![<]({{ images_dir }}/symbol_lt.gif) 1000 for which <sup>1</sup>/<sub><i>d</i></sub> contains the longest recurring cycle in its decimal fraction part.
+  Find the value of _d_ \< 1000 for which <sup>1</sup>/<sub><i>d</i></sub> contains the longest recurring cycle in its decimal fraction part.
 

data/data/problems/260.yml

@@ -1,24 +1,21 @@
 ---
 :id: 260
 :name: Stone Game
-:url: http://projecteuler.net/problem=260
-:content: "A game is played with three piles of stones and two players.  \n\rAt her
+:url: https://projecteuler.net/problem=260
+:content: "A game is played with three piles of stones and two players.  \nAt 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.\n\nIn other words, the player chooses some N>0 and removes:\n\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>
-  ![≤]({{ images_dir }}/symbol_le.gif) y<sub>i</sub> ![≤]({{ images_dir }}/symbol_le.gif)
-  z<sub>i</sub> ![≤]({{ images_dir }}/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> ![≤]({{ images_dir }}/symbol_le.gif) y<sub>i</sub> ![≤]({{
-  images_dir }}/symbol_le.gif) z<sub>i</sub> ![≤]({{ images_dir }}/symbol_le.gif)
-  1000.\n\n"
+  or\n- N stones from each of the three piles (3N total).\nThe player taking the last
+  stone(s) wins the game.\n\nA _winning configuration_ is one where the first player
+  can force a win.  \nFor 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 For 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> ≤
+  y<sub>i</sub> ≤ z<sub>i</sub> ≤ 100.  \nWe 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  \nwith x<sub>i</sub> ≤ y<sub>i</sub> ≤ z<sub>i</sub>
+  ≤ 1000.\n\n"

data/data/problems/261.yml

@@ -1,16 +1,18 @@
 ---
 :id: 261
 :name: Pivotal Square Sums
-:url: http://projecteuler.net/problem=261
-: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> ![>]({{ images_dir }}/symbol_gt.gif)
-  0 and <var>n</var> ![≥]({{ images_dir }}/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
-  ![≤]({{ images_dir }}/symbol_le.gif) 10<sup>10</sup>.\n\n"
+:url: https://projecteuler.net/problem=261
+: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> \> 0 and <var>n</var> ≥ <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:
+
+  (<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>.
+
+  Some small square-pivots are
+
+  - **4** : 3<sup>2</sup> + **4** <sup>2</sup> = 5<sup>2</sup>
+  - **21** : 20<sup>2</sup> + **21** <sup>2</sup> = 29<sup>2</sup>
+  - **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>
+  - **110** : 108<sup>2</sup> + 109<sup>2</sup> + **110** <sup>2</sup> = 133<sup>2</sup> + 134<sup>2</sup>
+
+  Find the sum of all **distinct** square-pivots ≤ 10<sup>10</sup>.
+

data/data/problems/262.yml

@@ -1,19 +1,20 @@
 ---
 :id: 262
 :name: Mountain Range
-:url: http://projecteuler.net/problem=262
+:url: https://projecteuler.net/problem=262
 :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 ![]({{ images_dir }}/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"
+  at any point (<var>x</var>,<var>y</var>):\n\n ![p262_formula1.gif]({{ images_dir
+  }}/p262_formula1.gif)  \n\nA mosquito intends to fly from A(200,200) to B(1400,1400),
+  without leaving the area given by 0&nbsp;≤&nbsp;<var>x</var>,&nbsp;<var>y</var>&nbsp;≤&nbsp;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.  \nThen, 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>\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

@@ -1,17 +1,17 @@
 ---
 :id: 263
 :name: An engineers' dream come true
-:url: http://projecteuler.net/problem=263
-:content: "Consider the number 6. The divisors of 6 are: 1,2,3 and 6.  \n\rEvery number
+:url: https://projecteuler.net/problem=263
+:content: "Consider the number 6. The divisors of 6 are: 1,2,3 and 6.  \nEvery 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"
+  \ \n1=1, 2=2, 3=1+2, 4=1+3, 5=2+3, 6=6.  \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>.\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 \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,\n
+  an engineers’ paradise.\n\nFind the sum of the first four engineers’ paradises.\n\n"