euler-manager 0.1.1 → 0.2.0

data/data/problems/345.yml

@@ -1,21 +1,22 @@
 ---
 :id: 345
 :name: Matrix Sum
-:url: http://projecteuler.net/problem=345
+:url: https://projecteuler.net/problem=345
 :content: "We define the Matrix Sum of a matrix as the maximum sum of matrix elements
   with each element being the only one in his row and column. For example, the Matrix
-  Sum of the matrix below equals 3315 ( = 863 + 383 + 343 + 959 + 767):\n\n  7  53
-  183 439 **863**  \n\r497 **383** 563  79 973  \n\r287  63 **343** 169 583  \n\r627
-  343 773 **959** 943  \n**767** 473 103 699 303\n\nFind the Matrix Sum of:\n\n  7
-   53 183 439 863 497 383 563  79 973 287  63 343 169 583  \n\r627 343 773 959 943
-  767 473 103 699 303 957 703 583 639 913  \n\r447 283 463  29  23 487 463 993 119
-  883 327 493 423 159 743  \n\r217 623   3 399 853 407 103 983  89 463 290 516 212
-  462 350  \n\r960 376 682 962 300 780 486 502 912 800 250 346 172 812 350  \n\r870
-  456 192 162 593 473 915  45 989 873 823 965 425 329 803  \n\r973 965 905 919 133
-  673 665 235 509 613 673 815 165 992 326  \n\r322 148 972 962 286 255 941 541 265
-  323 925 281 601  95 973  \n\r445 721  11 525 473  65 511 164 138 672  18 428 154
-  448 848  \n\r414 456 310 312 798 104 566 520 302 248 694 976 430 392 198  \n\r184
-  829 373 181 631 101 969 613 840 740 778 458 284 760 390  \n\r821 461 843 513  17
-  901 711 993 293 157 274  94 192 156 574  \n\r 34 124   4 878 450 476 712 914 838
-  669 875 299 823 329 699  \n\r815 559 813 459 522 788 168 586 966 232 308 833 251
-  631 107  \n\r813 883 451 509 615  77 281 613 459 205 380 274 302  35 805\n\n"
+  Sum of the matrix below equals 3315 ( = 863 + 383 + 343 + 959 + 767):\n\n  7
+   53 183 439 **863**  \n497 **383** 563  79 973  \n287  63 **343**
+  169 583  \n627 343 773 **959** 943  \n**767** 473 103 699 303\n\nFind the Matrix
+  Sum of:\n\n  7  53 183 439 863 497 383 563  79 973 287  63
+  343 169 583  \n627 343 773 959 943 767 473 103 699 303 957 703 583 639 913  \n447
+  283 463  29  23 487 463 993 119 883 327 493 423 159 743  \n217 623   3
+  399 853 407 103 983  89 463 290 516 212 462 350  \n960 376 682 962 300 780
+  486 502 912 800 250 346 172 812 350  \n870 456 192 162 593 473 915  45 989
+  873 823 965 425 329 803  \n973 965 905 919 133 673 665 235 509 613 673 815 165 992
+  326  \n322 148 972 962 286 255 941 541 265 323 925 281 601  95 973  \n445 721
+   11 525 473  65 511 164 138 672  18 428 154 448 848  \n414 456 310
+  312 798 104 566 520 302 248 694 976 430 392 198  \n184 829 373 181 631 101 969 613
+  840 740 778 458 284 760 390  \n821 461 843 513  17 901 711 993 293 157 274
+   94 192 156 574  \n 34 124   4 878 450 476 712 914 838 669 875
+  299 823 329 699  \n815 559 813 459 522 788 168 586 966 232 308 833 251 631 107  \n813
+  883 451 509 615  77 281 613 459 205 380 274 302  35 805\n\n"

data/data/problems/346.yml

@@ -1,11 +1,11 @@
 ---
 :id: 346
 :name: Strong Repunits
-:url: http://projecteuler.net/problem=346
+:url: https://projecteuler.net/problem=346
 :content: "The number 7 is special, because 7 is 111 written in base 2, and 11 written
   in base 6   \n(i.e. 7<sub>10</sub> = 11<sub>6</sub> = 111<sub>2</sub>). In other
-  words, 7 is a repunit in at least two bases b > 1.\n\nWe shall call a positive integer
-  with this property a strong repunit. It can be verified that there are 8 strong
-  repunits below 50: {1,7,13,15,21,31,40,43}.   \nFurthermore, the sum of all strong
-  repunits below 1000 equals 15864.\n\n\rFind the sum of all strong repunits below
-  10<sup>12</sup>.\r\r\r\r\n"
+  words, 7 is a repunit in at least two bases b \\> 1.\n\nWe shall call a positive
+  integer with this property a strong repunit. It can be verified that there are 8
+  strong repunits below 50: {1,7,13,15,21,31,40,43}.   \nFurthermore, the sum of all
+  strong repunits below 1000 equals 15864.\n\nFind the sum of all strong repunits
+  below 10<sup>12</sup>.\n"

data/data/problems/347.yml

@@ -1,13 +1,11 @@
 ---
 :id: 347
 :name: Largest integer divisible by two primes
-:url: http://projecteuler.net/problem=347
-:content: "The largest integer ![≤]({{ images_dir }}/symbol_le.gif) 100 that is only
-  divisible by both the primes 2 and 3 is 96, as 96=32\\*3=2<sup>5</sup>\\*3.\rFor
-  two _distinct_ primes p and q let M(p,q,N) be the largest positive integer ![≤]({{
-  images_dir }}/symbol_le.gif)N only divisible\rby both p and q and M(p,q,N)=0 if
-  such a positive integer does not exist.\n\nE.g. M(2,3,100)=96.  \n \rM(3,5,100)=75
-  and not 90 because 90 is divisible by 2 ,3 and 5.  \n\rAlso M(2,73,100)=0 because
-  there does not exist a positive integer ![≤]({{ images_dir }}/symbol_le.gif) 100
-  that is divisible by both 2 and 73.\n\nLet S(N) be the sum of all distinct M(p,q,N).\rS(100)=2262.\n\nFind
-  S(10 000 000).\n\n"
+:url: https://projecteuler.net/problem=347
+:content: "The largest integer ≤ 100 that is only divisible by both the primes 2 and
+  3 is 96, as 96=32\\*3=2<sup>5</sup>\\*3. For two _distinct_ primes p and q let M(p,q,N)
+  be the largest positive integer ≤N only divisible by both p and q and M(p,q,N)=0
+  if such a positive integer does not exist.\n\nE.g. M(2,3,100)=96.  \n M(3,5,100)=75
+  and not 90 because 90 is divisible by 2 ,3 and 5.  \nAlso M(2,73,100)=0 because
+  there does not exist a positive integer ≤ 100 that is divisible by both 2 and 73.\n\nLet
+  S(N) be the sum of all distinct M(p,q,N). S(100)=2262.\n\nFind S(10 000 000).\n\n"

data/data/problems/348.yml

@@ -1,11 +1,11 @@
 ---
 :id: 348
 :name: Sum of a square and a cube
-:url: http://projecteuler.net/problem=348
+:url: https://projecteuler.net/problem=348
 :content: "Many numbers can be expressed as the sum of a square and a cube. Some of
   them in more than one way.\n\nConsider the palindromic numbers that can be expressed
   as the sum of a square and a cube, both greater than 1, in **exactly** 4 different
-  ways.  \n\rFor example, 5229225 is a palindromic number and it can be expressed
-  in exactly 4 different ways:\n\n2285<sup>2</sup> + 20<sup>3</sup>  \n\r2223<sup>2</sup>
-  + 66<sup>3</sup>  \n\r1810<sup>2</sup> + 125<sup>3</sup>  \n\r1197<sup>2</sup> +
-  156<sup>3</sup>\n\nFind the sum of the five smallest such palindromic numbers.\n\n"
+  ways.  \nFor example, 5229225 is a palindromic number and it can be expressed in
+  exactly 4 different ways:\n\n2285<sup>2</sup> + 20<sup>3</sup>  \n2223<sup>2</sup>
+  + 66<sup>3</sup>  \n1810<sup>2</sup> + 125<sup>3</sup>  \n1197<sup>2</sup> + 156<sup>3</sup>\n\nFind
+  the sum of the five smallest such palindromic numbers.\n\n"

data/data/problems/349.yml

@@ -1,12 +1,12 @@
 ---
 :id: 349
 :name: Langton's ant
-:url: http://projecteuler.net/problem=349
+:url: https://projecteuler.net/problem=349
 :content: "An ant moves on a regular grid of squares that are coloured either black
-  or white.  \n \rThe ant is always oriented in one of the cardinal directions (left,
+  or white.  \n The ant is always oriented in one of the cardinal directions (left,
   right, up or down) and moves from square to adjacent square according to the following
-  rules:  \n\r- if it is on a black square, it flips the color of the square to white,
-  rotates 90 degrees counterclockwise and moves forward one square.  \n\r- if it is
+  rules:  \n- if it is on a black square, it flips the color of the square to white,
+  rotates 90 degrees counterclockwise and moves forward one square.  \n- if it is
   on a white square, it flips the color of the square to black, rotates 90 degrees
   clockwise and moves forward one square.\n\nStarting with a grid that is entirely
   white, how many squares are black after 10<sup>18</sup> moves of the ant?\n\n"

data/data/problems/35.yml

@@ -1,7 +1,7 @@
 ---
 :id: 35
 :name: Circular primes
-:url: http://projecteuler.net/problem=35
+:url: https://projecteuler.net/problem=35
 :content: |+
   The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.
 

data/data/problems/350.yml

@@ -1,7 +1,7 @@
 ---
 :id: 350
 :name: Constraining the least greatest and the greatest least
-:url: http://projecteuler.net/problem=350
+:url: https://projecteuler.net/problem=350
 :content: "A _list of size n_ is a sequence of <var>n</var> natural numbers.  \n Examples
   are (2,4,6), (2,6,4), (10,6,15,6), and (11).\n\nThe **greatest common divisor**
   , or gcd, of a list is the largest natural number that divides all entries of the
@@ -9,8 +9,7 @@
   **least common multiple** , or lcm, of a list is the smallest natural number divisible
   by each entry of the list.   \nExamples: lcm(2,6,4) = 12, lcm(10,6,15,6) = 30 and
   lcm(11) = 11.\n\nLet f(<var>G</var>, <var>L</var>, <var>N</var>) be the number of
-  lists of size <var>N</var> with gcd ![≥]({{ images_dir }}/symbol_ge.gif) <var>G</var>
-  and lcm ![≤]({{ images_dir }}/symbol_le.gif) <var>L</var>. For example:\n\nf(10,
-  100, 1) = 91.  \n\rf(10, 100, 2) = 327.  \n\rf(10, 100, 3) = 1135.  \n\rf(10, 100,
-  1000) mod 101<sup>4</sup> = 3286053.\n\nFind f(10<sup>6</sup>, 10<sup>12</sup>,
-  10<sup>18</sup>) mod 101<sup>4</sup>.\n\n"
+  lists of size <var>N</var> with gcd ≥ <var>G</var> and lcm ≤ <var>L</var>. For example:\n\nf(10,
+  100, 1) = 91.  \nf(10, 100, 2) = 327.  \nf(10, 100, 3) = 1135.  \nf(10, 100, 1000)
+  mod 101<sup>4</sup> = 3286053.\n\nFind f(10<sup>6</sup>, 10<sup>12</sup>, 10<sup>18</sup>)
+  mod 101<sup>4</sup>.\n\n"

data/data/problems/351.yml

@@ -1,12 +1,12 @@
 ---
 :id: 351
 :name: Hexagonal orchards
-:url: http://projecteuler.net/problem=351
+:url: https://projecteuler.net/problem=351
 :content: "A _hexagonal orchard_ of order <var>n</var> is a triangular lattice made
   up of points within a regular hexagon with side <var>n</var>. The following is an
-  example of a hexagonal orchard of order 5:\n\n ![]({{ images_dir }}/p_351_hexorchard.png)
-  \ \n\nHighlighted in green are the points which are hidden from the center by a
-  point closer to it. It can be seen that for a hexagonal orchard of order 5, 30 points
-  are hidden from the center.\n\nLet H(<var>n</var>) be the number of points hidden
-  from the center in a hexagonal orchard of order <var>n</var>.\n\nH(5) = 30. H(10)
-  = 138. H(1 000) = 1177848.\n\nFind H(100 000 000).\n\n"
+  example of a hexagonal orchard of order 5:\n\n ![p351_hexorchard.png]({{ images_dir
+  }}/p351_hexorchard.png)  \n\nHighlighted in green are the points which are hidden
+  from the center by a point closer to it. It can be seen that for a hexagonal orchard
+  of order 5, 30 points are hidden from the center.\n\nLet H(<var>n</var>) be the
+  number of points hidden from the center in a hexagonal orchard of order <var>n</var>.\n\nH(5)
+  = 30. H(10) = 138. H(1 000) = 1177848.\n\nFind H(100 000 000).\n\n"

data/data/problems/352.yml

@@ -1,14 +1,14 @@
 ---
 :id: 352
 :name: Blood tests
-:url: http://projecteuler.net/problem=352
+:url: https://projecteuler.net/problem=352
 :content: "Each one of the 25 sheep in a flock must be tested for a rare virus, known
-  to affect 2% of the sheep population.\rAn accurate and extremely sensitive PCR test
+  to affect 2% of the sheep population. An accurate and extremely sensitive PCR test
   exists for blood samples, producing a clear positive / negative result, but it is
   very time-consuming and expensive.\n\nBecause of the high cost, the vet-in-charge
   suggests that instead of performing 25 separate tests, the following procedure can
-  be used instead:  \n  \n  \n\rThe sheep are split into 5 groups of 5 sheep in each
-  group. \rFor each group, the 5 samples are mixed together and a single test is performed.
+  be used instead:  \n  \nThe sheep are split into 5 groups of 5 sheep in each group.
+  For each group, the 5 samples are mixed together and a single test is performed.
   Then,\n\n- If the result is negative, all the sheep in that group are deemed to
   be virus-free.\n- If the result is positive, 5 additional tests will be performed
   (a separate test for each animal) to determine the affected individual(s).\n\nSince
@@ -16,11 +16,10 @@
   (on the pooled samples) for each group will be:\n\n- Negative (and no more tests
   needed) with probability 0.98<sup>5</sup> = 0.9039207968.\n- Positive (5 additional
   tests needed) with probability 1 - 0.9039207968 = 0.0960792032.\n\nThus, the expected
-  number of tests for each group is 1 + 0.0960792032 ![×]({{ images_dir }}/symbol_times.gif)
-  5 = 1.480396016.  \n\rConsequently, all 5 groups can be screened using an average
-  of only 1.480396016 ![×]({{ images_dir }}/symbol_times.gif) 5 = **7.40198008** tests,
-  which represents a huge saving of more than 70% !\n\nAlthough the scheme we have
-  just described seems to be very efficient, it can still be improved considerably
+  number of tests for each group is 1 + 0.0960792032 × 5 = 1.480396016.  \nConsequently,
+  all 5 groups can be screened using an average of only 1.480396016 × 5 = **7.40198008**
+  tests, which represents a huge saving of more than 70% !\n\nAlthough the scheme
+  we have just described seems to be very efficient, it can still be improved considerably
   (always assuming that the test is sufficiently sensitive and that there are no adverse
   effects caused by mixing different samples). E.g.:\n\n- We may start by running
   a test on a mixture of all the 25 samples. It can be verified that in about 60.35%
@@ -34,11 +33,11 @@
   of possibilities, there is one restriction we place when devising the most cost-efficient
   testing scheme: whenever we start with a mixed sample, all the sheep contributing
   to that sample must be fully screened (i.e. a verdict of infected / virus-free must
-  be reached for all of them) before we start examining any other animals.\n\n\rFor
+  be reached for all of them) before we start examining any other animals.\n\nFor
   the current example, it turns out that the most cost-efficient testing scheme (we'll
-  call it the _optimal strategy_) requires an average of just **4.155452** tests!\r\r\r\n\nUsing
+  call it the _optimal strategy_) requires an average of just **4.155452** tests!\n\nUsing
   the optimal strategy, let T(<var>s</var>,<var>p</var>) represent the average number
   of tests needed to screen a flock of <var>s</var> sheep for a virus having probability
-  <var>p</var> to be present in any individual.  \n\rThus, rounded to six decimal
-  places, T(25, 0.02) = 4.155452 and T(25, 0.10) = 12.702124.\n\nFind ΣT(10000, p)
-  for p=0.01, 0.02, 0.03, ... 0.50.  \n\rGive your answer rounded to six decimal places.\n\n"
+  <var>p</var> to be present in any individual.  \nThus, rounded to six decimal places,
+  T(25, 0.02) = 4.155452 and T(25, 0.10) = 12.702124.\n\nFind ΣT(10000, p) for p=0.01,
+  0.02, 0.03, ... 0.50.  \nGive your answer rounded to six decimal places.\n\n"

data/data/problems/353.yml

@@ -1,7 +1,7 @@
 ---
 :id: 353
 :name: Risky moon
-:url: http://projecteuler.net/problem=353
+:url: https://projecteuler.net/problem=353
 :content: |+
   A moon could be described by the sphere C(<var>r</var>) with centre (0,0,0) and radius <var>r</var>.
 
@@ -15,7 +15,7 @@
 
   You are given that M(7)=0.1784943998 rounded to 10 digits behind the decimal point.
 
-  Find ![∑]({{ images_dir }}/symbol_sum.gif)M(2<sup>n</sup>-1) for 1 ![≤]({{ images_dir }}/symbol_le.gif)n ![≤]({{ images_dir }}/symbol_le.gif)15.
+  Find ∑M(2<sup>n</sup>-1) for 1≤n≤15.
 
   Give your answer rounded to 10 digits behind the decimal point in the form a.bcdefghijk.
 

data/data/problems/354.yml

@@ -1,14 +1,12 @@
 ---
 :id: 354
 :name: Distances in a bee's honeycomb
-:url: http://projecteuler.net/problem=354
+:url: https://projecteuler.net/problem=354
 :content: "Consider a honey bee's honeycomb where each cell is a perfect regular hexagon
-  with side length 1.\n\n ![]({{ images_dir }}/p_354_bee_honeycomb.png)\n\nOne particular
-  cell is occupied by the queen bee.  \n\rFor a positive real number <var>L</var>,
+  with side length 1.\n\n ![p354_bee_honeycomb.png]({{ images_dir }}/p354_bee_honeycomb.png)\n\nOne
+  particular cell is occupied by the queen bee.  \nFor a positive real number <var>L</var>,
   let B(<var>L</var>) count the cells with distance <var>L</var> from the queen bee
   cell (all distances are measured from centre to centre); you may assume that the
-  honeycomb is large enough to accommodate for any distance we wish to consider.   \n\rFor
-  example, B( ![√]({{ images_dir }}/symbol_radic.gif)3) = 6, B( ![√]({{ images_dir
-  }}/symbol_radic.gif)21) = 12 and B(111 111 111) = 54.\n\nFind the number of <var>L</var>
-  ![≤]({{ images_dir }}/symbol_le.gif) 5·10<sup>11</sup> such that B(<var>L</var>)
-  = 450.\n\n"
+  honeycomb is large enough to accommodate for any distance we wish to consider.   \nFor
+  example, B(√3) = 6, B(√21) = 12 and B(111 111 111) = 54.\n\nFind the number of <var>L</var>
+  ≤ 5·10<sup>11</sup> such that B(<var>L</var>) = 450.\n\n"

data/data/problems/355.yml

@@ -1,8 +1,8 @@
 ---
 :id: 355
 :name: Maximal coprime subset
-:url: http://projecteuler.net/problem=355
+:url: https://projecteuler.net/problem=355
 :content: "Define Co(<var>n</var>) to be the maximal possible sum of a set of mutually
-  co-prime elements from {1, 2, ..., <var>n</var>}.  \n For example Co(10) is 30 and
-  hits that maximum on the subset {1, 5, 7, 8, 9}.\n\nYou are given that Co(30) =
-  193 and Co(100) = 1356.\n\nFind Co(200000).\n\n"
+  co-prime elements from {1,&nbsp;2,&nbsp;...,&nbsp;<var>n</var>}.  \n For example
+  Co(10) is 30 and hits that maximum on the subset {1,&nbsp;5,&nbsp;7,&nbsp;8,&nbsp;9}.\n\nYou
+  are given that Co(30) = 193 and Co(100) = 1356.\n\nFind Co(200000).\n\n"

data/data/problems/356.yml

@@ -1,9 +1,10 @@
 ---
 :id: 356
 :name: Largest roots of cubic polynomials
-:url: http://projecteuler.net/problem=356
+:url: https://projecteuler.net/problem=356
 :content: "Let <var>a</var><sub><var>n</var></sub> be the largest real root of a polynomial
   <var>g</var>(x) = x<sup>3</sup> - 2<sup><var>n</var></sup>·x<sup>2</sup> + <var>n</var>.
-  \ \n\rFor example, <var>a</var><sub>2</sub> = 3.86619826...\n\nFind the last eight
-  digits of ![]({{ images_dir }}/p_356_cubicpoly1.gif).\n\n<u><i>Note</i></u>: ![]({{
-  images_dir }}/p_356_cubicpoly2.gif) represents the floor function.\n\n"
+  \ \nFor example, <var>a</var><sub>2</sub> = 3.86619826...\n\nFind the last eight
+  digits of ![p356_cubicpoly1.gif]({{ images_dir }}/p356_cubicpoly1.gif).\n\n<u><i>Note</i></u>:
+  ![p356_cubicpoly2.gif]({{ images_dir }}/p356_cubicpoly2.gif) represents the floor
+  function.\n\n"

data/data/problems/357.yml

@@ -1,9 +1,9 @@
 ---
 :id: 357
 :name: Prime generating integers
-:url: http://projecteuler.net/problem=357
-:content: "Consider the divisors of 30: 1,2,3,5,6,10,15,30.  \n\rIt can be seen that
+:url: https://projecteuler.net/problem=357
+:content: "Consider the divisors of 30: 1,2,3,5,6,10,15,30.  \nIt can be seen that
   for every divisor <var>d</var> of 30, <var>d</var>+30/<var>d</var> is prime.\n\nFind
   the sum of all positive integers <var>n</var> not exceeding 100 000 000  \nsuch
-  that\rfor every divisor <var>d</var> of <var>n</var>, <var>d</var>+<var>n</var>/<var>d</var>
+  that for every divisor <var>d</var> of <var>n</var>, <var>d</var>+<var>n</var>/<var>d</var>
   is prime.\n\n"

data/data/problems/358.yml

@@ -1,21 +1,16 @@
 ---
 :id: 358
 :name: Cyclic numbers
-:url: http://projecteuler.net/problem=358
+:url: https://projecteuler.net/problem=358
 :content: "A **cyclic number** with <var>n</var> digits has a very interesting property:
-  \ \n\rWhen it is multiplied by 1, 2, 3, 4, ... <var>n</var>, all the products have
+  \ \nWhen it is multiplied by 1, 2, 3, 4, ... <var>n</var>, all the products have
   exactly the same digits, in the same order, but rotated in a circular fashion!\n\nThe
-  smallest cyclic number is the 6-digit number 142857 :  \n\r142857 ![×]({{ images_dir
-  }}/symbol_times.gif) 1 = 142857  \n\r142857 ![×]({{ images_dir }}/symbol_times.gif)
-  2 = 285714  \n\r142857 ![×]({{ images_dir }}/symbol_times.gif) 3 = 428571  \n\r142857
-  ![×]({{ images_dir }}/symbol_times.gif) 4 = 571428  \n\r142857 ![×]({{ images_dir
-  }}/symbol_times.gif) 5 = 714285  \n\r142857 ![×]({{ images_dir }}/symbol_times.gif)
-  6 = 857142\n\nThe next cyclic number is 0588235294117647 with 16 digits :  \n\r0588235294117647
-  ![×]({{ images_dir }}/symbol_times.gif) 1 = 0588235294117647  \n\r0588235294117647
-  ![×]({{ images_dir }}/symbol_times.gif) 2 = 1176470588235294  \n\r0588235294117647
-  ![×]({{ images_dir }}/symbol_times.gif) 3 = 1764705882352941  \n\r...  \n\r0588235294117647
-  ![×]({{ images_dir }}/symbol_times.gif) 16 = 9411764705882352\n\nNote that for cyclic
-  numbers, leading zeros are important.\n\nThere is only one cyclic number for which,
-  the eleven leftmost digits are 00000000137 and the five rightmost digits are 56789
-  (i.e., it has the form 00000000137...56789 with an unknown number of digits in the
-  middle). Find the sum of all its digits.\n\n"
+  smallest cyclic number is the 6-digit number 142857 :  \n142857 × 1 = 142857  \n142857
+  × 2 = 285714  \n142857 × 3 = 428571  \n142857 × 4 = 571428  \n142857 × 5 = 714285
+  \ \n142857 × 6 = 857142\n\nThe next cyclic number is 0588235294117647 with 16 digits
+  :  \n0588235294117647 × 1 = 0588235294117647  \n0588235294117647 × 2 = 1176470588235294
+  \ \n0588235294117647 × 3 = 1764705882352941  \n...  \n0588235294117647 × 16 = 9411764705882352\n\nNote
+  that for cyclic numbers, leading zeros are important.\n\nThere is only one cyclic
+  number for which, the eleven leftmost digits are 00000000137 and the five rightmost
+  digits are 56789 (i.e., it has the form 00000000137...56789 with an unknown number
+  of digits in the middle). Find the sum of all its digits.\n\n"

data/data/problems/359.yml

@@ -1,7 +1,7 @@
 ---
 :id: 359
 :name: Hilbert's New Hotel
-:url: http://projecteuler.net/problem=359
+:url: https://projecteuler.net/problem=359
 :content: "An infinite number of people (numbered 1, 2, 3, etc.) are lined up to get
   a room at Hilbert's newest infinite hotel. The hotel contains an infinite number
   of floors (numbered 1, 2, 3, etc.), and each floor contains an infinite number of
@@ -10,14 +10,14 @@
   gets the first vacant room in the lowest numbered floor satisfying either of the
   following:\n\n- the floor is empty\n- the floor is not empty, and if the latest
   person taking a room in that floor is person <var>m</var>, then <var>m</var> + <var>n</var>
-  is a perfect square\n\nPerson 1 gets room 1 in floor 1 since floor 1 is empty.\r
-  \ \nPerson 2 does not get room 2 in floor 1 since 1 + 2 = 3 is not a perfect square.\r
-  \ \nPerson 2 instead gets room 1 in floor 2 since floor 2 is empty.\r  \nPerson
-  3 gets room 2 in floor 1 since 1 + 3 = 4 is a perfect square.\n\nEventually, every
-  person in the line gets a room in the hotel.\n\nDefine P(<var>f</var>, <var>r</var>)
-  to be <var>n</var> if person <var>n</var> occupies room <var>r</var> in floor <var>f</var>,
-  and 0 if no person occupies the room. Here are a few examples:\r  \nP(1, 1) = 1\r
-  \ \nP(1, 2) = 3\r  \nP(2, 1) = 2\r  \nP(10, 20) = 440\r  \nP(25, 75) = 4863\r  \nP(99,
-  100) = 19454\n\nFind the sum of all P(<var>f</var>, <var>r</var>) for all positive
-  <var>f</var> and <var>r</var> such that <var>f</var> ![×]({{ images_dir }}/symbol_times.gif)
-  <var>r</var> = 71328803586048 and give the last 8 digits as your answer.\n\n"
+  is a perfect square\n\nPerson 1 gets room 1 in floor 1 since floor 1 is empty.  \nPerson
+  2 does not get room 2 in floor 1 since 1 + 2 = 3 is not a perfect square.  \nPerson
+  2 instead gets room 1 in floor 2 since floor 2 is empty.  \nPerson 3 gets room 2
+  in floor 1 since 1 + 3 = 4 is a perfect square.\n\nEventually, every person in the
+  line gets a room in the hotel.\n\nDefine P(<var>f</var>, <var>r</var>) to be <var>n</var>
+  if person <var>n</var> occupies room <var>r</var> in floor <var>f</var>, and 0 if
+  no person occupies the room. Here are a few examples:  \nP(1, 1) = 1  \nP(1, 2)
+  = 3  \nP(2, 1) = 2  \nP(10, 20) = 440  \nP(25, 75) = 4863  \nP(99, 100) = 19454\n\nFind
+  the sum of all P(<var>f</var>, <var>r</var>) for all positive <var>f</var> and <var>r</var>
+  such that <var>f</var> × <var>r</var> = 71328803586048 and give the last 8 digits
+  as your answer.\n\n"

data/data/problems/36.yml

@@ -1,7 +1,7 @@
 ---
 :id: 36
 :name: Double-base palindromes
-:url: http://projecteuler.net/problem=36
+:url: https://projecteuler.net/problem=36
 :content: |+
   The decimal number, 585 = 1001001001<sub>2</sub> (binary), is palindromic in both bases.
 

data/data/problems/360.yml

@@ -1,12 +1,12 @@
 ---
 :id: 360
 :name: Scary Sphere
-:url: http://projecteuler.net/problem=360
+:url: https://projecteuler.net/problem=360
 :content: "Given two points (x<sub>1</sub>,y<sub>1</sub>,z<sub>1</sub>) and (x<sub>2</sub>,y<sub>2</sub>,z<sub>2</sub>)
   in three dimensional space, the **Manhattan distance** between those points is defined
   as   \n |x<sub>1</sub>-x<sub>2</sub>|+|y<sub>1</sub>-y<sub>2</sub>|+|z<sub>1</sub>-z<sub>2</sub>|.\n\nLet
   C(<var>r</var>) be a sphere with radius <var>r</var> and center in the origin O(0,0,0).
-  \ \n\rLet I(<var>r</var>) be the set of all points with integer coordinates on the
-  surface of C(<var>r</var>).  \n\rLet S(<var>r</var>) be the sum of the Manhattan
-  distances of all elements of I(<var>r</var>) to the origin O.\n\nE.g. S(45)=34518.\n\nFind
+  \ \nLet I(<var>r</var>) be the set of all points with integer coordinates on the
+  surface of C(<var>r</var>).  \nLet S(<var>r</var>) be the sum of the Manhattan distances
+  of all elements of I(<var>r</var>) to the origin O.\n\nE.g. S(45)=34518.\n\nFind
   S(10<sup>10</sup>).\n\n"

data/data/problems/361.yml

@@ -1,20 +1,20 @@
 ---
 :id: 361
 :name: Subsequence of Thue-Morse sequence
-:url: http://projecteuler.net/problem=361
+:url: https://projecteuler.net/problem=361
 :content: "The **Thue-Morse sequence** {T<sub><var>n</var></sub>} is a binary sequence
   satisfying:\n\n- T<sub>0</sub> = 0\n- T<sub>2<var>n</var></sub> = T<sub><var>n</var></sub>\n-
   T<sub>2<var>n</var>+1</sub> = 1 - T<sub><var>n</var></sub>\n\nThe first several
-  terms of {T<sub><var>n</var></sub>} are given as follows:  \n\r01101001100101101001011001101001....\n\nWe
+  terms of {T<sub><var>n</var></sub>} are given as follows:  \n01101001100101101001011001101001....\n\nWe
   define {A<sub><var>n</var></sub>} as the sorted sequence of integers such that the
   binary expression of each element appears as a subsequence in {T<sub><var>n</var></sub>}.
-  \ \n\rFor example, the decimal number 18 is expressed as 10010 in binary. 10010
-  appears in {T<sub><var>n</var></sub>} (T<sub>8</sub> to T<sub>12</sub>), so 18 is
-  an element of {A<sub><var>n</var></sub>}.  \n\rThe decimal number 14 is expressed
-  as 1110 in binary. 1110 never appears in {T<sub><var>n</var></sub>}, so 14 is not
-  an element of {A<sub><var>n</var></sub>}.\n\nThe first several terms of A<sub><var>n</var></sub>
+  \ \nFor example, the decimal number 18 is expressed as 10010 in binary. 10010 appears
+  in {T<sub><var>n</var></sub>} (T<sub>8</sub> to T<sub>12</sub>), so 18 is an element
+  of {A<sub><var>n</var></sub>}.  \nThe decimal number 14 is expressed as 1110 in
+  binary. 1110 never appears in {T<sub><var>n</var></sub>}, so 14 is not an element
+  of {A<sub><var>n</var></sub>}.\n\nThe first several terms of A<sub><var>n</var></sub>
   are given as follows:\n\n| <var>n</var> | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
   | 10 | 11 | 12 | … |\n| A<sub><var>n</var></sub> | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 9
   | 10 | 11 | 12 | 13 | 18 | … |\n\nWe can also verify that A<sub>100</sub> = 3251
-  and A<sub>1000</sub> = 80852364498.\n\nFind the last 9 digits of ![]({{ images_dir
-  }}/p_361_Thue-Morse1.gif).\n\n"
+  and A<sub>1000</sub> = 80852364498.\n\nFind the last 9 digits of ![p361_Thue-Morse1.gif]({{
+  images_dir }}/p361_Thue-Morse1.gif).\n\n"

data/data/problems/362.yml

@@ -1,18 +1,11 @@
 ---
 :id: 362
 :name: Squarefree factors
-:url: http://projecteuler.net/problem=362
-:content: "Consider the number 54.  \n\r54 can be factored in 7 distinct ways into
-  one or more factors larger than 1:  \n\r54, 2 ![×]({{ images_dir }}/symbol_times.gif)27,
-  3 ![×]({{ images_dir }}/symbol_times.gif)18, 6 ![×]({{ images_dir }}/symbol_times.gif)9,
-  3 ![×]({{ images_dir }}/symbol_times.gif)3 ![×]({{ images_dir }}/symbol_times.gif)6,
-  2 ![×]({{ images_dir }}/symbol_times.gif)3 ![×]({{ images_dir }}/symbol_times.gif)9
-  and 2 ![×]({{ images_dir }}/symbol_times.gif)3 ![×]({{ images_dir }}/symbol_times.gif)3
-  ![×]({{ images_dir }}/symbol_times.gif)3.  \n\rIf we require that the factors are
-  all squarefree only two ways remain: 3 ![×]({{ images_dir }}/symbol_times.gif)3
-  ![×]({{ images_dir }}/symbol_times.gif)6 and 2 ![×]({{ images_dir }}/symbol_times.gif)3
-  ![×]({{ images_dir }}/symbol_times.gif)3 ![×]({{ images_dir }}/symbol_times.gif)3.\n\nLet's
-  call Fsf(<var>n</var>) the number of ways <var>n</var> can be factored into one
-  or more squarefree factors larger than 1, so\rFsf(54)=2.\n\nLet S(<var>n</var>)
-  be ![∑]({{ images_dir }}/symbol_sum.gif)Fsf(<var>k</var>) for <var>k</var>=2 to
-  <var>n</var>.\n\nS(100)=193.\n\nFind S(10 000 000 000).\n\n"
+:url: https://projecteuler.net/problem=362
+:content: "Consider the number 54.  \n54 can be factored in 7 distinct ways into one
+  or more factors larger than 1:  \n54, 2×27, 3×18, 6×9, 3×3×6, 2×3×9 and 2×3×3×3.
+  \ \nIf we require that the factors are all squarefree only two ways remain: 3×3×6
+  and 2×3×3×3.\n\nLet's call Fsf(<var>n</var>) the number of ways <var>n</var> can
+  be factored into one or more squarefree factors larger than 1, so Fsf(54)=2.\n\nLet
+  S(<var>n</var>) be ∑Fsf(<var>k</var>) for <var>k</var>=2 to <var>n</var>.\n\nS(100)=193.\n\nFind
+  S(10 000 000 000).\n\n"