euler-manager 0.1.1 → 0.2.0

data/data/problems/285.yml

@@ -1,15 +1,15 @@
 ---
 :id: 285
 :name: Pythagorean odds
-:url: http://projecteuler.net/problem=285
+:url: https://projecteuler.net/problem=285
 :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>
+  \ \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>
   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.\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
+  \ \nThe square root of 42.05 is 6.484... and when rounded to the nearest integer,
+  it becomes 6.  \nThis 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,

data/data/problems/286.yml

@@ -1,9 +1,9 @@
 ---
 :id: 286
 :name: Scoring probabilities
-:url: http://projecteuler.net/problem=286
+:url: https://projecteuler.net/problem=286
 :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.
+  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 -&nbsp;<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.
 

data/data/problems/287.yml

@@ -1,27 +1,22 @@
 ---
 :id: 287
 :name: Quadtree encoding (a simple compression algorithm)
-:url: http://projecteuler.net/problem=287
-:content: "The quadtree encoding allows us to describe a 2<sup><var>N</var></sup>
-  ![×]({{ images_dir }}/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>
-  ![×]({{ images_dir }}/symbol_times.gif)2<sup><var>N</var></sup> region;\n- \"0\"
-  denotes a split:\r  \nthe current 2<sup><var>n</var></sup> ![×]({{ images_dir }}/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> ![×]({{
-  images_dir }}/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 ![×]({{ images_dir }}/symbol_times.gif)4 image (colored marks denote
-  places where a split can occur):\n\n ![]({{ images_dir }}/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>
-  ![×]({{ images_dir }}/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> 
-  ![≤]({{ images_dir }}/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"
+:url: https://projecteuler.net/problem=287
+:content: "The quadtree encoding allows us to describe a 2<sup><var>N</var></sup>×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>×2<sup><var>N</var></sup>
+  region;\n- \"0\" denotes a split:  \nthe current 2<sup><var>n</var></sup>×2<sup><var>n</var></sup>
+  region is divided into 4 sub-regions of dimension 2<sup><var>n</var>-1</sup>×2<sup><var>n</var>-1</sup>,
+  \ \nthe 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×4 image (colored marks denote places
+  where a split can occur):\n\n ![p287_quadtree.gif]({{ images_dir }}/p287_quadtree.gif)\n\nThis
+  image can be described by several sequences, for example : \" **0**** 0 **10101010**
+  0 **1011111011** 0**10101010\", of length 30, or  \n\" **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>×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> ≤ 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

@@ -1,14 +1,13 @@
 ---
 :id: 288
 :name: An enormous factorial
-:url: http://projecteuler.net/problem=288
+:url: https://projecteuler.net/problem=288
 :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>) = ![∑]({{ images_dir }}/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>
+  by N(<var>p</var>,<var>q</var>) = ∑<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
+  = 290797  \nS<sub><var>n</var>+1</sub> = S<sub><var>n</var></sub><sup>2</sup> mod
+  50515093  \nT<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"
+  \ \nLet 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

@@ -1,18 +1,18 @@
 ---
 :id: 289
 :name: Eulerian Cycles
-:url: http://projecteuler.net/problem=289
+:url: https://projecteuler.net/problem=289
 :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 ![]({{ images_dir }}/p_289_euler.gif)\n\nLet
+  be a configuration which consists of the <var>m</var>·<var>n</var> circles:  \n{
+  C(<var>x</var>,<var>y</var>): 0 ≤ <var>x</var> \\< <var>m</var>, 0 ≤ <var>y</var> \\< <var>n</var>,
+  <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.  \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: A 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 ![p289_euler.gif]({{ images_dir }}/p289_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"
+  \ \nFor 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"

data/data/problems/29.yml

@@ -1,16 +1,13 @@
 ---
 :id: 29
 :name: Distinct powers
-:url: http://projecteuler.net/problem=29
-:content: "Consider all integer combinations of _a_<sup><i>b</i></sup> for 2 ![≤]({{
-  images_dir }}/symbol_le.gif) _a_ ![≤]({{ images_dir }}/symbol_le.gif) 5 and 2 ![≤]({{
-  images_dir }}/symbol_le.gif) _b_ ![≤]({{ images_dir }}/symbol_le.gif) 5:\n\n> 2<sup>2</sup>=4,
-  2<sup>3</sup>=8, 2<sup>4</sup>=16, 2<sup>5</sup>=32  \n> 3<sup>2</sup>=9, 3<sup>3</sup>=27,
-  3<sup>4</sup>=81, 3<sup>5</sup>=243  \n> 4<sup>2</sup>=16, 4<sup>3</sup>=64, 4<sup>4</sup>=256,
-  4<sup>5</sup>=1024  \n> 5<sup>2</sup>=25, 5<sup>3</sup>=125, 5<sup>4</sup>=625,
-  5<sup>5</sup>=3125\n\nIf they are then placed in numerical order, with any repeats
-  removed, we get the following sequence of 15 distinct terms:\n\n4, 8, 9, 16, 25,
-  27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125\n\nHow many distinct terms are in
-  the sequence generated by _a_<sup><i>b</i></sup> for 2 ![≤]({{ images_dir }}/symbol_le.gif)
-  _a_ ![≤]({{ images_dir }}/symbol_le.gif) 100 and 2 ![≤]({{ images_dir }}/symbol_le.gif)
-  _b_ ![≤]({{ images_dir }}/symbol_le.gif) 100?\n\n"
+:url: https://projecteuler.net/problem=29
+:content: "Consider all integer combinations of _a_<sup><i>b</i></sup> for 2 ≤ _a_
+  ≤ 5 and 2 ≤ _b_ ≤ 5:\n\n> 2<sup>2</sup>=4, 2<sup>3</sup>=8, 2<sup>4</sup>=16, 2<sup>5</sup>=32
+  \ \n> 3<sup>2</sup>=9, 3<sup>3</sup>=27, 3<sup>4</sup>=81, 3<sup>5</sup>=243  \n>
+  4<sup>2</sup>=16, 4<sup>3</sup>=64, 4<sup>4</sup>=256, 4<sup>5</sup>=1024  \n> 5<sup>2</sup>=25,
+  5<sup>3</sup>=125, 5<sup>4</sup>=625, 5<sup>5</sup>=3125\n\nIf they are then placed
+  in numerical order, with any repeats removed, we get the following sequence of 15
+  distinct terms:\n\n4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125\n\nHow
+  many distinct terms are in the sequence generated by _a_<sup><i>b</i></sup> for
+  2 ≤ _a_ ≤ 100 and 2 ≤ _b_ ≤ 100?\n\n"

data/data/problems/290.yml

@@ -1,7 +1,6 @@
 ---
 :id: 290
 :name: Digital Signature
-:url: http://projecteuler.net/problem=290
-:content: |+
-  How many integers 0 ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var> &lt 10<sup>18</sup> have the property that the sum of the digits of <var>n</var> equals the sum of digits of 137<var>n</var>?
-
+:url: https://projecteuler.net/problem=290
+:content: "How many integers 0 ≤ <var>n</var> \\< 10<sup>18</sup> have the property
+  that the sum of the digits of <var>n</var> equals the sum of digits of 137<var>n</var>?\n\n"

data/data/problems/291.yml

@@ -1,7 +1,7 @@
 ---
 :id: 291
 :name: Panaitopol Primes
-:url: http://projecteuler.net/problem=291
-:content: "A prime number <var>p</var> is called a Panaitopol prime if ![]({{ images_dir
-  }}/p_291_formula.gif) for some positive integers  \n <var>x</var> and <var>y</var>.\n\nFind
-  how many Panaitopol primes are less than 5 ![×]({{ images_dir }}/symbol_times.gif)10<sup>15</sup>.\n\n"
+:url: https://projecteuler.net/problem=291
+:content: "A prime number <var>p</var> is called a Panaitopol prime if ![p291_formula.gif]({{
+  images_dir }}/p291_formula.gif) for some positive integers  \n<var>x</var> and <var>y</var>.\n\nFind
+  how many Panaitopol primes are less than 5×10<sup>15</sup>.\n\n"

data/data/problems/292.yml

@@ -1,12 +1,11 @@
 ---
 :id: 292
 :name: Pythagorean Polygons
-:url: http://projecteuler.net/problem=292
+:url: https://projecteuler.net/problem=292
 :content: "We shall define a _pythagorean polygon_ to be a **convex polygon** with
   the following properties:\n\n- there are at least three vertices,\n- no three vertices
   are aligned,\n- each vertex has **integer coordinates** ,\n- each edge has **integer
-  length** .\n\nFor a given integer <var>n</var>, define P(<var>n</var>) as the number
-  of distinct pythagorean polygons for which the perimeter is ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var>.
-  \ \n\rPythagorean polygons should be considered distinct as long as none is a translation
-  of another.\n\nYou are given that P(4) = 1, P(30) = 3655 and P(60) = 891045.  \n\rFind
-  P(120).\n\n"
+  length**.\n\nFor a given integer <var>n</var>, define P(<var>n</var>) as the number
+  of distinct pythagorean polygons for which the perimeter is ≤ <var>n</var>.  \nPythagorean
+  polygons should be considered distinct as long as none is a translation of another.\n\nYou
+  are given that P(4) = 1, P(30) = 3655 and P(60) = 891045.  \nFind P(120).\n\n"

data/data/problems/293.yml

@@ -1,14 +1,13 @@
 ---
 :id: 293
 :name: Pseudo-Fortunate Numbers
-:url: http://projecteuler.net/problem=293
+:url: https://projecteuler.net/problem=293
 :content: "An even positive integer N will be called admissible, if it is a power
-  of 2 or its distinct prime factors are consecutive primes.  \n\rThe first twelve
-  admissible numbers are 2,4,6,8,12,16,18,24,30,32,36,48.\n\nIf N is admissible, the
-  smallest integer M ![>]({{ images_dir }}/symbol_gt.gif) 1 such that N+M is prime,
-  will be called the pseudo-Fortunate number for N.\n\nFor example, N=630 is admissible
-  since it is even and its distinct prime factors are the consecutive primes 2,3,5
-  and 7.  \n \rThe next prime number after 631 is 641; hence, the pseudo-Fortunate
-  number for 630 is M=11.  \n\rIt can also be seen that the pseudo-Fortunate number
-  for 16 is 3.\n\nFind the sum of all distinct pseudo-Fortunate numbers for admissible
-  numbers N less than 10<sup>9</sup>.\n\n"
+  of 2 or its distinct prime factors are consecutive primes.  \nThe first twelve admissible
+  numbers are 2,4,6,8,12,16,18,24,30,32,36,48.\n\nIf N is admissible, the smallest
+  integer M \\> 1 such that N+M is prime, will be called the pseudo-Fortunate number
+  for N.\n\nFor example, N=630 is admissible since it is even and its distinct prime
+  factors are the consecutive primes 2,3,5 and 7.  \n The next prime number after
+  631 is 641; hence, the pseudo-Fortunate number for 630 is M=11.  \nIt can also be
+  seen that the pseudo-Fortunate number for 16 is 3.\n\nFind the sum of all distinct
+  pseudo-Fortunate numbers for admissible numbers N less than 10<sup>9</sup>.\n\n"

data/data/problems/294.yml

@@ -1,10 +1,15 @@
 ---
 :id: 294
 :name: 'Sum of digits - experience #23'
-:url: http://projecteuler.net/problem=294
-:content: "For a positive integer k, define d(k) as the sum of the digits of k in
-  its usual decimal representation.\rThus d(42) = 4+2 = 6.\n\nFor a positive integer
-  n, define S(n) as the number of positive integers k n with the following properties
-  :\n\n- k is divisible by 23 and\r\n- d(k) = 23.\r\n\r\rYou are given that S(9) =
-  263626 and S(42) = 6377168878570056.\r\r\n\nFind S(11<sup>12</sup>) and give your
-  answer mod 10<sup>9</sup>.\n\n"
+:url: https://projecteuler.net/problem=294
+:content: |+
+  For a positive integer k, define d(k) as the sum of the digits of k in its usual decimal representation. Thus d(42) = 4+2 = 6.
+
+  For a positive integer n, define S(n) as the number of positive integers k \< 10<sup>n</sup> with the following properties :
+
+  - k is divisible by 23 and
+  - d(k) = 23.
+  You are given that S(9) = 263626 and S(42) = 6377168878570056.
+
+  Find S(11<sup>12</sup>) and give your answer mod 10<sup>9</sup>.
+

data/data/problems/295.yml

@@ -1,21 +1,19 @@
 ---
 :id: 295
 :name: Lenticular holes
-:url: http://projecteuler.net/problem=295
+:url: https://projecteuler.net/problem=295
 :content: "We call the convex area enclosed by two circles a _lenticular hole_ if:\n\n-
   The centres of both circles are on lattice points.\n- The two circles intersect
   at two distinct lattice points.\n- The interior of the convex area enclosed by both
-  circles does not contain any lattice points.\r\n\nConsider the circles:  \n\rC<sub>0</sub>:
-  <var>x</var><sup>2</sup>+<var>y</var><sup>2</sup>=25  \n\rC<sub>1</sub>: (<var>x</var>+4)<sup>2</sup>+(<var>y</var>-4)<sup>2</sup>=1
-  \ \n\rC<sub>2</sub>: (<var>x</var>-12)<sup>2</sup>+(<var>y</var>-4)<sup>2</sup>=65\n\nThe
+  circles does not contain any lattice points.\n\nConsider the circles:  \nC<sub>0</sub>:
+  <var>x</var><sup>2</sup>+<var>y</var><sup>2</sup>=25  \nC<sub>1</sub>: (<var>x</var>+4)<sup>2</sup>+(<var>y</var>-4)<sup>2</sup>=1
+  \ \nC<sub>2</sub>: (<var>x</var>-12)<sup>2</sup>+(<var>y</var>-4)<sup>2</sup>=65\n\nThe
   circles C<sub>0</sub>, C<sub>1</sub> and C<sub>2</sub> are drawn in the picture
-  below.\n\n ![]({{ images_dir }}/p295_lenticular.gif)\n\nC<sub>0</sub> and C<sub>1</sub>
-  form a lenticular hole, as well as C<sub>0</sub> and C<sub>2</sub>.\n\nWe call an
-  ordered pair of positive real numbers (r<sub>1</sub>, r<sub>2</sub>) a _lenticular
+  below.\n\n ![p295_lenticular.gif]({{ images_dir }}/p295_lenticular.gif)\n\nC<sub>0</sub>
+  and C<sub>1</sub> form a lenticular hole, as well as C<sub>0</sub> and C<sub>2</sub>.\n\nWe
+  call an ordered pair of positive real numbers (r<sub>1</sub>, r<sub>2</sub>) a _lenticular
   pair_ if there exist two circles with radii r<sub>1</sub> and r<sub>2</sub> that
-  form a lenticular hole.\rWe can verify that (1, 5) and (5, ![√]({{ images_dir }}/symbol_radic.gif)65)
-  are the lenticular pairs of the example above.\n\nLet L(N) be the number of **distinct**
-  lenticular pairs (r<sub>1</sub>, r<sub>2</sub>) for which 0 ![<]({{ images_dir }}/symbol_lt.gif)
-  r<sub>1</sub> ![≤]({{ images_dir }}/symbol_le.gif) r<sub>2</sub> ![≤]({{ images_dir
-  }}/symbol_le.gif) N.  \n\rWe can verify that L(10) = 30 and L(100) = 3442.\n\nFind
-  L(100 000).\n\n"
+  form a lenticular hole. We can verify that (1, 5) and (5, √65) are the lenticular
+  pairs of the example above.\n\nLet L(N) be the number of **distinct** lenticular
+  pairs (r<sub>1</sub>, r<sub>2</sub>) for which 0 \\< r<sub>1</sub> ≤ r<sub>2</sub>
+  ≤ N.  \nWe can verify that L(10) = 30 and L(100) = 3442.\n\nFind L(100 000).\n\n"

data/data/problems/296.yml

@@ -1,12 +1,12 @@
 ---
 :id: 296
 :name: Angular Bisector and Tangent
-:url: http://projecteuler.net/problem=296
-:content: "Given is an integer sided triangle <var>ABC</var> with <var>BC</var> ![≤]({{
-  images_dir }}/symbol_le.gif) <var>AC</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  <var>AB</var>.  \n<var>k</var> is the angular bisector of angle <var>ACB</var>.
-  \ \n <var>m</var> is the tangent at <var>C</var> to the circumscribed circle of
-  <var>ABC</var>.  \n <var>n</var> is a line parallel to <var>m</var> through <var>B</var>.
-  \ \n\rThe intersection of <var>n</var> and <var>k</var> is called <var>E</var>.\n\n
-  ![]({{ images_dir }}/p296_bisector.gif)\n\nHow many triangles <var>ABC</var> with
-  a perimeter not exceeding 100 000 exist such that <var>BE</var> has integral length?\n\n"
+:url: https://projecteuler.net/problem=296
+:content: "Given is an integer sided triangle <var>ABC</var> with <var>BC</var> ≤
+  <var>AC</var> ≤ <var>AB</var>.  \n<var>k</var> is the angular bisector of angle
+  <var>ACB</var>.  \n<var>m</var> is the tangent at <var>C</var> to the circumscribed
+  circle of <var>ABC</var>.  \n<var>n</var> is a line parallel to <var>m</var> through
+  <var>B</var>.  \nThe intersection of <var>n</var> and <var>k</var> is called <var>E</var>.\n\n
+  ![p296_bisector.gif]({{ images_dir }}/p296_bisector.gif)\n\nHow many triangles <var>ABC</var>
+  with a perimeter not exceeding 100 000 exist such that <var>BE</var> has integral
+  length?\n\n"

data/data/problems/297.yml

@@ -1,15 +1,13 @@
 ---
 :id: 297
 :name: Zeckendorf Representation
-:url: http://projecteuler.net/problem=297
+:url: https://projecteuler.net/problem=297
 :content: "Each new term in the Fibonacci sequence is generated by adding the previous
-  two terms.  \n\rStarting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8,
+  two terms.  \nStarting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8,
   13, 21, 34, 55, 89.\n\nEvery positive integer can be uniquely written as a sum of
-  nonconsecutive terms of the Fibonacci sequence. For example, 100 = 3 + 8 + 89.  \n\rSuch
+  nonconsecutive terms of the Fibonacci sequence. For example, 100 = 3 + 8 + 89.  \nSuch
   a sum is called the **Zeckendorf representation** of the number.\n\nFor any integer
-  <var>n</var>>0, let <var>z</var>(<var>n</var>) be the number of terms in the Zeckendorf
-  representation of <var>n</var>.  \n\rThus, <var>z</var>(5) = 1, <var>z</var>(14) = 2,
-  <var>z</var>(100) = 3 etc.  \n\rAlso, for 0 ![<]({{ images_dir }}/symbol_lt.gif)<var>n</var>
-  ![<]({{ images_dir }}/symbol_lt.gif)10<sup>6</sup>, ∑ <var>z</var>(<var>n</var>) = 7894453.\n\nFind
-  ∑ <var>z</var>(<var>n</var>) for 0 ![<]({{ images_dir }}/symbol_lt.gif)<var>n</var>
-  ![<]({{ images_dir }}/symbol_lt.gif)10<sup>17</sup>.\n\n"
+  <var>n</var>\\>0, let <var>z</var>(<var>n</var>) be the number of terms in the Zeckendorf
+  representation of <var>n</var>.  \nThus, <var>z</var>(5) = 1, <var>z</var>(14) = 2,
+  <var>z</var>(100) = 3 etc.  \nAlso, for 0\\<<var>n</var>\\<10<sup>6</sup>, ∑ <var>z</var>(<var>n</var>) = 7894453.\n\nFind
+  ∑ <var>z</var>(<var>n</var>) for 0\\<<var>n</var>\\<10<sup>17</sup>.\n\n"

data/data/problems/298.yml

@@ -1,46 +1,38 @@
 ---
 :id: 298
 :name: Selective Amnesia
-:url: http://projecteuler.net/problem=298
-:content: "<style type=\"text/css\"><![CDATA[\r\ntable.p298, table.p298 th, table.p298
-  td {\r\n  border-width: 1px 1px 1px 1px;\r\n  border-style: solid solid solid solid;\r\n
-  \ border-color: black black black black;\r\n  text-align:center;\r\n  -moz-border-radius:
-  0px 0px 0px 0px;\r\n}\r\ntable.p298 {\r\n  border-spacing: 1px;\r\n  border-collapse:
-  separate;\r\n  background-color: rgb(255,255,255);\r\n}\r\ntable.p298 th, table.p298
-  td {\r\n  padding: 1px 6px 1px 6px;\r\n}\r\ntable.p298 th { background-color: rgb(200,220,250);
-  }\r\ntable.p298 td { background-color: rgb(255,255,255); }\r\n]]></style>\n\nLarry
-  and Robin play a memory game involving of a sequence of random numbers between 1
-  and 10, inclusive, that are called out one at a time. Each player can remember up
-  to 5 previous numbers. When the called number is in a player's memory, that player
-  is awarded a point. If it's not, the player adds the called number to his memory,
-  removing another number if his memory is full.\n\nBoth players start with empty
-  memories. Both players always add new missed numbers to their memory but use a different
-  strategy in deciding which number to remove:  \n\rLarry's strategy is to remove
-  the number that hasn't been called in the longest time.  \n\rRobin's strategy is
-  to remove the number that's been in the memory the longest time.\n\nExample game:\n\n<center><table
-  class=\"p298\">\r\n<tr>\r\n  <th>Turn</th>\r\n  <th>Called<br>number</th>\r\n  <th
-  style=\"text-align:right\">Larry's<br>memory</th>\r\n  <th>Larry's<br>score</th>\r\n
-  \ <th style=\"text-align:right\">Robin's<br>memory</th>\r\n  <th>Robin's<br>score</th>\r\n</tr>\r\n<tr>\r\n
-  \ <td>1</td>\r\n  <td>1</td>\r\n  <td style=\"text-align:right\">1</td>\r\n  <td>0</td>\r\n
-  \ <td style=\"text-align:right\">1</td>\r\n  <td>0</td>\r\n</tr>\r\n<tr>\r\n  <td>2</td>\r\n
-  \ <td>2</td>\r\n  <td style=\"text-align:right\">1,2</td>\r\n  <td>0</td>\r\n  <td
-  style=\"text-align:right\">1,2</td>\r\n  <td>0</td>\r\n</tr>\r\n<tr>\r\n  <td>3</td>\r\n
-  \ <td>4</td>\r\n  <td style=\"text-align:right\">1,2,4</td>\r\n  <td>0</td>\r\n
-  \ <td style=\"text-align:right\">1,2,4</td>\r\n  <td>0</td>\r\n</tr>\r\n<tr>\r\n
-  \ <td>4</td>\r\n  <td>6</td>\r\n  <td style=\"text-align:right\">1,2,4,6</td>\r\n
-  \ <td>0</td>\r\n  <td style=\"text-align:right\">1,2,4,6</td>\r\n  <td>0</td>\r\n</tr>\r\n<tr>\r\n
-  \ <td>5</td>\r\n  <td>1</td>\r\n  <td style=\"text-align:right\">1,2,4,6</td>\r\n
-  \ <td>1</td>\r\n  <td style=\"text-align:right\">1,2,4,6</td>\r\n  <td>1</td>\r\n</tr>\r\n<tr>\r\n
-  \ <td>6</td>\r\n  <td>8</td>\r\n  <td style=\"text-align:right\">1,2,4,6,8</td>\r\n
-  \ <td>1</td>\r\n  <td style=\"text-align:right\">1,2,4,6,8</td>\r\n  <td>1</td>\r\n</tr>\r\n<tr>\r\n
-  \ <td>7</td>\r\n  <td>10</td>\r\n  <td style=\"text-align:right\">1,4,6,8,10</td>\r\n
-  \ <td>1</td>\r\n  <td style=\"text-align:right\">2,4,6,8,10</td>\r\n  <td>1</td>\r\n</tr>\r\n<tr>\r\n
-  \ <td>8</td>\r\n  <td>2</td>\r\n  <td style=\"text-align:right\">1,2,6,8,10</td>\r\n
-  \ <td>1</td>\r\n  <td style=\"text-align:right\">2,4,6,8,10</td>\r\n  <td>2</td>\r\n</tr>\r\n<tr>\r\n
-  \ <td>9</td>\r\n  <td>4</td>\r\n  <td style=\"text-align:right\">1,2,4,8,10</td>\r\n
-  \ <td>1</td>\r\n  <td style=\"text-align:right\">2,4,6,8,10</td>\r\n  <td>3</td>\r\n</tr>\r\n<tr>\r\n
-  \ <td>10</td>\r\n  <td>1</td>\r\n  <td style=\"text-align:right\">1,2,4,8,10</td>\r\n
-  \ <td>2</td>\r\n  <td style=\"text-align:right\">1,4,6,8,10</td>\r\n  <td>3</td>\r\n</tr>\n</table></center>\n\nDenoting
+:url: https://projecteuler.net/problem=298
+:content: "Larry and Robin play a memory game involving of a sequence of random numbers
+  between 1 and 10, inclusive, that are called out one at a time. Each player can
+  remember up to 5 previous numbers. When the called number is in a player's memory,
+  that player is awarded a point. If it's not, the player adds the called number to
+  his memory, removing another number if his memory is full.\n\nBoth players start
+  with empty memories. Both players always add new missed numbers to their memory
+  but use a different strategy in deciding which number to remove:  \nLarry's strategy
+  is to remove the number that hasn't been called in the longest time.  \nRobin's
+  strategy is to remove the number that's been in the memory the longest time.\n\nExample
+  game:\n\n<center><table class=\"p298\">\n<tr>\n<th>Turn</th>\n  <th>Called<br>number</th>\n
+  \ <th style=\"text-align:right;\">Larry's<br>memory</th>\n  <th>Larry's<br>score</th>\n
+  \ <th style=\"text-align:right;\">Robin's<br>memory</th>\n  <th>Robin's<br>score</th>\n</tr>\n<tr>\n<td>1</td>\n
+  \ <td>1</td>\n  <td style=\"text-align:right;\">1</td>\n  <td>0</td>\n  <td style=\"text-align:right;\">1</td>\n
+  \ <td>0</td>\n</tr>\n<tr>\n<td>2</td>\n  <td>2</td>\n  <td style=\"text-align:right;\">1,2</td>\n
+  \ <td>0</td>\n  <td style=\"text-align:right;\">1,2</td>\n  <td>0</td>\n</tr>\n<tr>\n<td>3</td>\n
+  \ <td>4</td>\n  <td style=\"text-align:right;\">1,2,4</td>\n  <td>0</td>\n  <td
+  style=\"text-align:right;\">1,2,4</td>\n  <td>0</td>\n</tr>\n<tr>\n<td>4</td>\n
+  \ <td>6</td>\n  <td style=\"text-align:right;\">1,2,4,6</td>\n  <td>0</td>\n  <td
+  style=\"text-align:right;\">1,2,4,6</td>\n  <td>0</td>\n</tr>\n<tr>\n<td>5</td>\n
+  \ <td>1</td>\n  <td style=\"text-align:right;\">1,2,4,6</td>\n  <td>1</td>\n  <td
+  style=\"text-align:right;\">1,2,4,6</td>\n  <td>1</td>\n</tr>\n<tr>\n<td>6</td>\n
+  \ <td>8</td>\n  <td style=\"text-align:right;\">1,2,4,6,8</td>\n  <td>1</td>\n  <td
+  style=\"text-align:right;\">1,2,4,6,8</td>\n  <td>1</td>\n</tr>\n<tr>\n<td>7</td>\n
+  \ <td>10</td>\n  <td style=\"text-align:right;\">1,4,6,8,10</td>\n  <td>1</td>\n
+  \ <td style=\"text-align:right;\">2,4,6,8,10</td>\n  <td>1</td>\n</tr>\n<tr>\n<td>8</td>\n
+  \ <td>2</td>\n  <td style=\"text-align:right;\">1,2,6,8,10</td>\n  <td>1</td>\n
+  \ <td style=\"text-align:right;\">2,4,6,8,10</td>\n  <td>2</td>\n</tr>\n<tr>\n<td>9</td>\n
+  \ <td>4</td>\n  <td style=\"text-align:right;\">1,2,4,8,10</td>\n  <td>1</td>\n
+  \ <td style=\"text-align:right;\">2,4,6,8,10</td>\n  <td>3</td>\n</tr>\n<tr>\n<td>10</td>\n
+  \ <td>1</td>\n  <td style=\"text-align:right;\">1,2,4,8,10</td>\n  <td>2</td>\n
+  \ <td style=\"text-align:right;\">1,4,6,8,10</td>\n  <td>3</td>\n</tr>\n</table></center>\n\nDenoting
   Larry's score by <var>L</var> and Robin's score by <var>R</var>, what is the expected
   value of |<var>L</var>-<var>R</var>| after 50 turns? Give your answer rounded to
   eight decimal places using the format x.xxxxxxxx .\n\n"

data/data/problems/299.yml

@@ -1,24 +1,22 @@
 ---
 :id: 299
 :name: Three similar triangles
-:url: http://projecteuler.net/problem=299
-:content: "Four points with integer coordinates are selected:  \nA(<var>a</var>, 0),
-  B(<var>b</var>, 0), C(0, <var>c</var>) and D(0, <var>d</var>), \rwith 0  ![<]({{
-  images_dir }}/symbol_lt.gif) <var>a</var>  ![<]({{ images_dir }}/symbol_lt.gif) <var>b</var>
-  and 0  ![<]({{ images_dir }}/symbol_lt.gif) <var>c</var>  ![<]({{ images_dir }}/symbol_lt.gif) <var>d</var>.
-  \ \n\rPoint P, also with integer coordinates, is chosen on the line AC so that the
+:url: https://projecteuler.net/problem=299
+:content: "Four points with integer coordinates are selected:  \nA(<var>a</var>,&nbsp;0),
+  B(<var>b</var>,&nbsp;0), C(0,&nbsp;<var>c</var>) and D(0,&nbsp;<var>d</var>), with
+  0&nbsp;\\<&nbsp;<var>a</var>&nbsp;\\<&nbsp;<var>b</var> and 0&nbsp;\\<&nbsp;<var>c</var>&nbsp;\\<&nbsp;<var>d</var>.
+  \ \nPoint P, also with integer coordinates, is chosen on the line AC so that the
   three triangles ABP, CDP and BDP are all <dfn title=\"Have equal angles\">similar</dfn>.\n\n
-  ![]({{ images_dir }}/p_299_ThreeSimTri.gif)\n\nIt is easy to prove that the three
-  triangles can be similar, only if <var>a</var>=<var>c</var>.\n\nSo, given that <var>a</var>=<var>c</var>,
-  we are looking for triplets (<var>a</var>,<var>b</var>,<var>d</var>) such that at
-  least one point P (with integer coordinates) exists on AC, making the three triangles
-  ABP, CDP and BDP all similar.\n\nFor example, if (<var>a</var>,<var>b</var>,<var>d</var>)=(2,3,4),
-  it can be easily verified that point P(1,1) satisfies the above condition. \rNote
+  ![p299_ThreeSimTri.gif]({{ images_dir }}/p299_ThreeSimTri.gif)\n\nIt is easy to
+  prove that the three triangles can be similar, only if <var>a</var>=<var>c</var>.\n\nSo,
+  given that <var>a</var>=<var>c</var>, we are looking for triplets (<var>a</var>,<var>b</var>,<var>d</var>)
+  such that at least one point P (with integer coordinates) exists on AC, making the
+  three triangles ABP, CDP and BDP all similar.\n\nFor example, if (<var>a</var>,<var>b</var>,<var>d</var>)=(2,3,4),
+  it can be easily verified that point P(1,1) satisfies the above condition. Note
   that the triplets (2,3,4) and (2,4,3) are considered as distinct, although point
-  P(1,1) is common for both.\n\nIf <var>b</var>+<var>d</var>  ![<]({{ images_dir }}/symbol_lt.gif) 100,
-  there are 92 distinct triplets (<var>a</var>,<var>b</var>,<var>d</var>) such that
-  point P exists.  \n\rIf <var>b</var>+<var>d</var>  ![<]({{ images_dir }}/symbol_lt.gif) 100
-  000, there are 320471 distinct triplets (<var>a</var>,<var>b</var>,<var>d</var>)
-  such that point P exists.\n\nIf <var>b</var>+<var>d</var>  ![<]({{ images_dir }}/symbol_lt.gif) 100
-  000 000, how many distinct triplets (<var>a</var>,<var>b</var>,<var>d</var>) are
-  there such that point P exists?\n\n"
+  P(1,1) is common for both.\n\nIf <var>b</var>+<var>d</var>&nbsp;\\<&nbsp;100, there
+  are 92 distinct triplets (<var>a</var>,<var>b</var>,<var>d</var>) such that point
+  P exists.  \nIf <var>b</var>+<var>d</var>&nbsp;\\<&nbsp;100 000, there are 320471
+  distinct triplets (<var>a</var>,<var>b</var>,<var>d</var>) such that point P exists.\n\nIf
+  <var>b</var>+<var>d</var>&nbsp;\\<&nbsp;100 000 000, how many distinct triplets
+  (<var>a</var>,<var>b</var>,<var>d</var>) are there such that point P exists?\n\n"