euler-manager 0.1.1 → 0.2.0

data/data/problems/363.yml

@@ -1,32 +1,32 @@
 ---
 :id: 363
 :name: Bézier Curves
-:url: http://projecteuler.net/problem=363
-:content: "\rA cubic Bézier curve is defined by four points: P<sub>0</sub>, P<sub>1</sub>,
-  P<sub>2</sub> and P<sub>3</sub>.\r\n\nThe curve is constructed as follows:  \n\rOn
-  the segments P<sub>0</sub>P<sub>1</sub>, P<sub>1</sub>P<sub>2</sub> and P<sub>2</sub>P<sub>3</sub>
-  the points Q<sub>0</sub>,Q<sub>1</sub> and Q<sub>2</sub> are drawn such that P<sub>0</sub>Q<sub>0</sub>/P<sub>0</sub>P<sub>1</sub>=P<sub>1</sub>Q<sub>1</sub>/P<sub>1</sub>P<sub>2</sub>=P<sub>2</sub>Q<sub>2</sub>/P<sub>2</sub>P<sub>3</sub>=t
-  (t in [0,1]).  \n\rOn the segments Q<sub>0</sub>Q<sub>1</sub> and Q<sub>1</sub>Q<sub>2</sub>
-  the points R<sub>0</sub> and R<sub>1</sub> are drawn such that\rQ<sub>0</sub>R<sub>0</sub>/Q<sub>0</sub>Q<sub>1</sub>=Q<sub>1</sub>R<sub>1</sub>/Q<sub>1</sub>Q<sub>2</sub>=t
-  for the same value of t.  \n\rOn the segment R<sub>0</sub>R<sub>1</sub> the point
-  B is drawn such that R<sub>0</sub>B/R<sub>0</sub>R<sub>1</sub>=t for the same value
-  of t.\rThe Bézier curve defined by the points P<sub>0</sub>, P<sub>1</sub>, P<sub>2</sub>,
-  P<sub>3</sub> is the locus of B as Q<sub>0</sub> takes all possible positions on
-  the segment P<sub>0</sub>P<sub>1</sub>. (Please note that for all points the value
-  of t is the same.)\n\n<applet code=\"CabriJava.class\" width=\"390\" height=\"300\"
-  align=\"right\" hspace=\"20\" archive=\"project/images/bezier/CabriJava.jar\">\r\n
-  \  <param name=\"lang\" value=\"en\">\r\n   <param name=\"file\" value=\"project/images/bezier/bezier.fig\">\r\n
-  \  <param name=\"loop\" value=\"true\">\r\n</applet>\n\nIn the applet to the right
-  you can drag the points P<sub>0</sub>, P<sub>1</sub>, P<sub>2</sub> and P<sub>3</sub>
-  to see what the Bézier curve (green curve) defined by those points looks like. You
-  can also drag the point Q<sub>0</sub> along the segment P<sub>0</sub>P<sub>1</sub>.\n\nFrom
-  the construction it is clear that the Bézier curve will be tangent to the segments
-  P<sub>0</sub>P<sub>1</sub> in P<sub>0</sub> and P<sub>2</sub>P<sub>3</sub> in P<sub>3</sub>.\n\nA
-  cubic Bézier curve with P<sub>0</sub>=(1,0), P<sub>1</sub>=(1,<var>v</var>), P<sub>2</sub>=(<var>v</var>,1)
-  and P<sub>3</sub>=(0,1) is used to approximate a quarter circle.  \n\rThe value
-  <var>v</var> ![>]({{ images_dir }}/symbol_gt.gif)0 is chosen such that the area
-  enclosed by the lines OP<sub>0</sub>, OP<sub>3</sub> and the curve is equal to <sup>π</sup>/<sub>4</sub>
-  (the area of the quarter circle).\n\nBy how many percent does the length of the
-  curve differ from the length of the quarter circle?  \n\rThat is, if L is the length
-  of the curve, calculate 100\\*<sup>(L-π/2)</sup>/<sub>(π/2)</sub>.  \n\rGive your
-  answer rounded to 10 digits behind the decimal point.\n\n"
+:url: https://projecteuler.net/problem=363
+:content: "A cubic Bézier curve is defined by four points: P<sub>0</sub>, P<sub>1</sub>,
+  P<sub>2</sub> and P<sub>3</sub>.\n\n ![p363_bezier.png]({{ images_dir }}/p363_bezier.png)\n\nThe
+  curve is constructed as follows:  \nOn the segments P<sub>0</sub>P<sub>1</sub>,
+  P<sub>1</sub>P<sub>2</sub> and P<sub>2</sub>P<sub>3</sub> the points Q<sub>0</sub>,Q<sub>1</sub>
+  and Q<sub>2</sub> are drawn such that  \nP<sub>0</sub>Q<sub>0</sub> / P<sub>0</sub>P<sub>1</sub>
+  = P<sub>1</sub>Q<sub>1</sub> / P<sub>1</sub>P<sub>2</sub> = P<sub>2</sub>Q<sub>2</sub>
+  / P<sub>2</sub>P<sub>3</sub> = t (t in [0,1]).  \nOn the segments Q<sub>0</sub>Q<sub>1</sub>
+  and Q<sub>1</sub>Q<sub>2</sub> the points R<sub>0</sub> and R<sub>1</sub> are drawn
+  such that  \nQ<sub>0</sub>R<sub>0</sub> / Q<sub>0</sub>Q<sub>1</sub> = Q<sub>1</sub>R<sub>1</sub>
+  / Q<sub>1</sub>Q<sub>2</sub> = t for the same value of t.  \nOn the segment R<sub>0</sub>R<sub>1</sub>
+  the point B is drawn such that R<sub>0</sub>B / R<sub>0</sub>R<sub>1</sub> = t for
+  the same value of t.  \nThe Bézier curve defined by the points P<sub>0</sub>, P<sub>1</sub>,
+  P<sub>2</sub>, P<sub>3</sub> is the locus of B as Q<sub>0</sub> takes all possible
+  positions on the segment P<sub>0</sub>P<sub>1</sub>.  \n(Please note that for all
+  points the value of t is the same.)\n\nAt [this (external) web address](http://home.kpn.nl/hklein/bezier/bezier.html)
+  you will find an applet that allows you to drag the points P<sub>0</sub>, P<sub>1</sub>,
+  P<sub>2</sub> and P<sub>3</sub> to see what the Bézier curve (green curve) defined
+  by those points looks like. You can also drag the point Q<sub>0</sub> along the
+  segment P<sub>0</sub>P<sub>1</sub>.\n\nFrom the construction it is clear that the
+  Bézier curve will be tangent to the segments P<sub>0</sub>P<sub>1</sub> in P<sub>0</sub>
+  and P<sub>2</sub>P<sub>3</sub> in P<sub>3</sub>.\n\nA cubic Bézier curve with P<sub>0</sub>=(1,0),
+  P<sub>1</sub>=(1,<var>v</var>), P<sub>2</sub>=(<var>v</var>,1) and P<sub>3</sub>=(0,1)
+  is used to approximate a quarter circle.  \nThe value <var>v</var> \\> 0 is chosen
+  such that the area enclosed by the lines OP<sub>0</sub>, OP<sub>3</sub> and the
+  curve is equal to <sup>π</sup>/<sub>4</sub> (the area of the quarter circle).\n\nBy
+  how many percent does the length of the curve differ from the length of the quarter
+  circle?\n\n| That is, if L is the length of the curve, calculate 100 × | \n\nL −
+  π/2\nπ/2\n |\n\nGive your answer rounded to 10 digits behind the decimal point.\n\n"

data/data/problems/364.yml

@@ -1,13 +1,13 @@
 ---
 :id: 364
 :name: Comfortable distance
-:url: http://projecteuler.net/problem=364
+:url: https://projecteuler.net/problem=364
 :content: "There are <var>N</var> seats in a row. <var>N</var> people come after each
   other to fill the seats according to the following rules:\n\n1. If there is any
   seat whose adjacent seat(s) are not occupied take such a seat.\n2. If there is no
   such seat and there is any seat for which only one adjacent seat is occupied take
-  such a seat.\n3. Otherwise take one of the remaining available seats. \n\rLet T(<var>N</var>)
+  such a seat.\n3. Otherwise take one of the remaining available seats. \nLet T(<var>N</var>)
   be the number of possibilities that <var>N</var> seats are occupied by <var>N</var>
-  people with the given rules.  \n The following figure shows T(4)=8.\r\r\r\n ![]({{
-  images_dir }}/p_364_comf_dist.gif)\n\nWe can verify that T(10) = 61632 and T(1 000)
+  people with the given rules.  \n The following figure shows T(4)=8.\n ![p364_comf_dist.gif]({{
+  images_dir }}/p364_comf_dist.gif)\n\nWe can verify that T(10) = 61632 and T(1 000)
   mod 100 000 007 = 47255094.\n\nFind T(1 000 000) mod 100 000 007.\n\n"

data/data/problems/365.yml

@@ -1,11 +1,11 @@
 ---
 :id: 365
 :name: A huge binomial coefficient
-:url: http://projecteuler.net/problem=365
+:url: https://projecteuler.net/problem=365
 :content: |+
-  The binomial coeffient C(10<sup>18</sup>,10<sup>9</sup>) is a number with more than 9 billion (9 ![×]({{ images_dir }}/symbol_times.gif)10<sup>9</sup>) digits.
+  The binomial coefficient C(10<sup>18</sup>,10<sup>9</sup>) is a number with more than 9 billion (9×10<sup>9</sup>) digits.
 
   Let M(n,k,m) denote the binomial coefficient C(n,k) modulo m.
 
-  Calculate ![∑]({{ images_dir }}/symbol_sum.gif)M(10<sup>18</sup>,10<sup>9</sup>,p\*q\*r) for 1000 ![<]({{ images_dir }}/symbol_lt.gif)p ![<]({{ images_dir }}/symbol_lt.gif)q ![<]({{ images_dir }}/symbol_lt.gif)r ![<]({{ images_dir }}/symbol_lt.gif)5000 and p,q,r prime.
+  Calculate ∑M(10<sup>18</sup>,10<sup>9</sup>,p\*q\*r) for 1000\<p\<q\<r\<5000 and p,q,r prime.
 

data/data/problems/366.yml

@@ -1,22 +1,19 @@
 ---
 :id: 366
 :name: Stone Game III
-:url: http://projecteuler.net/problem=366
-:content: "Two players, Anton and Bernhard, are playing the following game.  \n\rThere
-  is one pile of n stones.  \n\rThe first player may remove any positive number of
-  stones, but not the whole pile.  \n\rThereafter, each player may remove at most
-  twice the number of stones his opponent took on the previous move.  \n\rThe player
-  who removes the last stone wins.\n\nE.g. n=5  \n\rIf the first player takes anything
-  more than one stone the next player will be able to take all remaining stones.  \n\rIf
-  the first player takes one stone, leaving four, his opponent will take also one
-  stone, leaving three stones.  \n\rThe first player cannot take all three because
-  he may take at most 2x1=2 stones. So let's say he takes also one stone, leaving
-  2. The second player can take the two remaining stones and wins.  \n\rSo 5 is a
-  losing position for the first player.  \n\rFor some winning positions there is more
-  than one possible move for the first player.  \n\rE.g. when n=17 the first player
-  can remove one or four stones.\n\nLet M(n) be the maximum number of stones the first
-  player can take from a winning position _at his first turn_ and M(n)=0 for any other
-  position.\n\n![∑]({{ images_dir }}/symbol_sum.gif)M(n) for n ![≤]({{ images_dir
-  }}/symbol_le.gif)100 is 728.\n\nFind ![∑]({{ images_dir }}/symbol_sum.gif)M(n) for
-  n ![≤]({{ images_dir }}/symbol_le.gif)10<sup>18</sup>.\rGive your answer modulo
-  10<sup>8</sup>.\n\n"
+:url: https://projecteuler.net/problem=366
+:content: "Two players, Anton and Bernhard, are playing the following game.  \nThere
+  is one pile of n stones.  \nThe first player may remove any positive number of stones,
+  but not the whole pile.  \nThereafter, each player may remove at most twice the
+  number of stones his opponent took on the previous move.  \nThe player who removes
+  the last stone wins.\n\nE.g. n=5  \nIf the first player takes anything more than
+  one stone the next player will be able to take all remaining stones.  \nIf the first
+  player takes one stone, leaving four, his opponent will take also one stone, leaving
+  three stones.  \nThe first player cannot take all three because he may take at most
+  2x1=2 stones. So let's say he takes also one stone, leaving 2. The second player
+  can take the two remaining stones and wins.  \nSo 5 is a losing position for the
+  first player.  \nFor some winning positions there is more than one possible move
+  for the first player.  \nE.g. when n=17 the first player can remove one or four
+  stones.\n\nLet M(n) be the maximum number of stones the first player can take from
+  a winning position _at his first turn_ and M(n)=0 for any other position.\n\n∑M(n)
+  for n≤100 is 728.\n\nFind ∑M(n) for n≤10<sup>18</sup>. Give your answer modulo 10<sup>8</sup>.\n\n"

data/data/problems/367.yml

@@ -1,19 +1,19 @@
 ---
 :id: 367
 :name: Bozo sort
-:url: http://projecteuler.net/problem=367
+:url: https://projecteuler.net/problem=367
 :content: " **Bozo sort** , not to be confused with the slightly less efficient **bogo
   sort** , consists out of checking if the input sequence is sorted and if not swapping
   randomly two elements. This is repeated until eventually the sequence is sorted.\n\nIf
   we consider all permutations of the first 4 natural numbers as input the expectation
-  value of the number of swaps, averaged over all 4! input sequences is 24.75.  \n\rThe
+  value of the number of swaps, averaged over all 4! input sequences is 24.75.  \nThe
   already sorted sequence takes 0 steps.\n\nIn this problem we consider the following
-  variant on bozo sort.  \n\rIf the sequence is not in order we pick three elements
-  at random and shuffle these three elements randomly.  \n\rAll 3!=6 permutations
-  of those three elements are equally likely.   \n\rThe already sorted sequence will
-  take 0 steps.  \n\rIf we consider all permutations of the first 4 natural numbers
-  as input the expectation value of the number of shuffles, averaged over all 4! input
-  sequences is 27.5.   \n\rConsider as input sequences the permutations of the first
-  11 natural numbers.  \n\rAveraged over all 11! input sequences, what is the expected
-  number of shuffles this sorting algorithm will perform?\n\nGive your answer rounded
-  to the nearest integer.\n\n"
+  variant on bozo sort.  \nIf the sequence is not in order we pick three elements
+  at random and shuffle these three elements randomly.  \nAll 3!=6 permutations of
+  those three elements are equally likely.   \nThe already sorted sequence will take
+  0 steps.  \nIf we consider all permutations of the first 4 natural numbers as input
+  the expectation value of the number of shuffles, averaged over all 4! input sequences
+  is 27.5.   \nConsider as input sequences the permutations of the first 11 natural
+  numbers.  \nAveraged over all 11! input sequences, what is the expected number of
+  shuffles this sorting algorithm will perform?\n\nGive your answer rounded to the
+  nearest integer.\n\n"

data/data/problems/368.yml

@@ -1,22 +1,18 @@
 ---
 :id: 368
 :name: A Kempner-like series
-:url: http://projecteuler.net/problem=368
-:content: "| The **harmonic series** 1 | + | \n\n| 1 |\n| 2 |\n\n | + | \n\n| 1 |\n|
-  3 |\n\n | + | \n\n| 1 |\n| 4 |\n\n | + ... is well known to be divergent. |\n\nIf
-  we however omit from this series every term where the denominator has a 9 in it,
-  the series remarkably enough converges to approximately 22.9206766193.  \n\rThis
-  modified harmonic series is called the **Kempner** series.\n\nLet us now consider
-  another modified harmonic series by omitting from the harmonic series every term
-  where the denominator has 3 or more equal consecutive digits.\rOne can verify that
-  out of the first 1200 terms of the harmonic series, only 20 terms will be omitted.
-  \ \n\rThese 20 omitted terms are:\n\n \n \n\n| 1 |\n| 111 |\n\n | , | \n\n| 1 |\n|
-  222 |\n\n | , | \n\n| 1 |\n| 333 |\n\n | , | \n\n| 1 |\n| 444 |\n\n | , | \n\n|
-  1 |\n| 555 |\n\n | , | \n\n| 1 |\n| 666 |\n\n | , | \n\n| 1 |\n| 777 |\n\n | , |
-  \n\n| 1 |\n| 888 |\n\n | , | \n\n| 1 |\n| 999 |\n\n | , | \n\n| 1 |\n| 1000 |\n\n
-  | , | \n\n| 1 |\n| 1110 |\n\n | , |\n\n \n \n\n| 1 |\n| 1111 |\n\n | , | \n\n| 1
-  |\n| 1112 |\n\n | , | \n\n| 1 |\n| 1113 |\n\n | , | \n\n| 1 |\n| 1114 |\n\n | ,
-  | \n\n| 1 |\n| 1115 |\n\n | , | \n\n| 1 |\n| 1116 |\n\n | , | \n\n| 1 |\n| 1117
-  |\n\n | , | \n\n| 1 |\n| 1118 |\n\n | and | \n\n| 1 |\n| 1119 |\n\n | . |\n\nThis
-  series converges as well.\n\nFind the value the series converges to.  \n\rGive your
+:url: https://projecteuler.net/problem=368
+:content: "The **harmonic series** $1 + \\dfrac{1}{2} + \\dfrac{1}{3} + \\dfrac{1}{4}
+  + ...$ is well known to be divergent.\n\nIf we however omit from this series every
+  term where the denominator has a 9 in it, the series remarkably enough converges
+  to approximately 22.9206766193.  \nThis modified harmonic series is called the **Kempner**
+  series.\n\nLet us now consider another modified harmonic series by omitting from
+  the harmonic series every term where the denominator has 3 or more equal consecutive
+  digits. One can verify that out of the first 1200 terms of the harmonic series,
+  only 20 terms will be omitted.  \nThese 20 omitted terms are:\n\n$$\\dfrac{1}{111},
+  \\dfrac{1}{222}, \\dfrac{1}{333}, \\dfrac{1}{444}, \\dfrac{1}{555}, \\dfrac{1}{666},
+  \\dfrac{1}{777}, \\dfrac{1}{888}, \\dfrac{1}{999}, \\dfrac{1}{1000}, \\dfrac{1}{1110},
+  \\\\\\ \\dfrac{1}{1111}, \\dfrac{1}{1112}, \\dfrac{1}{1113}, \\dfrac{1}{1114}, \\dfrac{1}{1115},
+  \\dfrac{1}{1116}, \\dfrac{1}{1117}, \\dfrac{1}{1118}, \\dfrac{1}{1119}$$\n\nThis
+  series converges as well.\n\nFind the value the series converges to.  \nGive your
   answer rounded to 10 digits behind the decimal point.\n\n"

data/data/problems/369.yml

@@ -1,11 +1,11 @@
 ---
 :id: 369
 :name: Badugi
-:url: http://projecteuler.net/problem=369
+:url: https://projecteuler.net/problem=369
 :content: |+
   In a standard 52 card deck of playing cards, a set of 4 cards is a **Badugi** if it contains 4 cards with no pairs and no two cards of the same suit.
 
   Let f(<var>n</var>) be the number of ways to choose <var>n</var> cards with a 4 card subset that is a Badugi. For example, there are 2598960 ways to choose five cards from a standard 52 card deck, of which 514800 contain a 4 card subset that is a Badugi, so f(5) = 514800.
 
-  Find ![∑]({{ images_dir }}/symbol_sum.gif)f(<var>n</var>) for 4 ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif) 13.
+  Find ∑f(<var>n</var>) for 4 ≤ <var>n</var> ≤ 13.
 

data/data/problems/37.yml

@@ -1,7 +1,7 @@
 ---
 :id: 37
 :name: Truncatable primes
-:url: http://projecteuler.net/problem=37
+:url: https://projecteuler.net/problem=37
 :content: |+
   The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right, and remain prime at each stage: 3797, 797, 97, and 7. Similarly we can work from right to left: 3797, 379, 37, and 3.
 

data/data/problems/370.yml

@@ -1,13 +1,13 @@
 ---
 :id: 370
 :name: Geometric triangles
-:url: http://projecteuler.net/problem=370
+:url: https://projecteuler.net/problem=370
 :content: |+
-  Let us define a _geometric triangle_ as an integer sided triangle with sides <var>a</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>b</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>c</var> so that its sides form a **geometric progression** , i.e. <var>b<sup>2</sup></var> = <var>a</var> · <var>c</var> . 
+  Let us define a _geometric triangle_ as an integer sided triangle with sides <var>a</var> ≤ <var>b</var> ≤ <var>c</var> so that its sides form a **geometric progression** , i.e. <var>b<sup>2</sup></var>&nbsp;=&nbsp;<var>a</var>&nbsp;·&nbsp;<var>c</var>&nbsp;.&nbsp;
 
   An example of such a geometric triangle is the triangle with sides <var>a</var> = 144, <var>b</var> = 156 and <var>c</var> = 169.
 
-  There are 861805 geometric triangles with perimeter ![≤]({{ images_dir }}/symbol_le.gif) 10<sup>6</sup> .
+  There are 861805 geometric triangles with perimeter ≤ 10<sup>6</sup> .
 
-  How many geometric triangles exist with perimeter ![≤]({{ images_dir }}/symbol_le.gif) 2.5·10<sup>13</sup> ?
+  How many geometric triangles exist with perimeter ≤ 2.5·10<sup>13</sup> ?
 

data/data/problems/371.yml

@@ -1,12 +1,12 @@
 ---
 :id: 371
 :name: Licence plates
-:url: http://projecteuler.net/problem=371
+:url: https://projecteuler.net/problem=371
 :content: "Oregon licence plates consist of three letters followed by a three digit
-  number (each digit can be from [0..9]).  \n\rWhile driving to work Seth plays the
-  following game:  \n\rWhenever the numbers of two licence plates seen on his trip
-  add to 1000 that's a win.\n\nE.g. MIC-012 and HAN-988 is a win and RYU-500 and SET-500
+  number (each digit can be from [0..9]).  \nWhile driving to work Seth plays the
+  following game:  \nWhenever the numbers of two licence plates seen on his trip add
+  to 1000 that's a win.\n\nE.g. MIC-012 and HAN-988 is a win and RYU-500 and SET-500
   too. (as long as he sees them in the same trip).\n\nFind the expected number of
-  plates he needs to see for a win.  \n\rGive your answer rounded to 8 decimal places
+  plates he needs to see for a win.  \nGive your answer rounded to 8 decimal places
   behind the decimal point.\n\n**Note:** We assume that each licence plate seen is
   equally likely to have any three digit number on it.\n\n"

data/data/problems/372.yml

@@ -1,11 +1,10 @@
 ---
 :id: 372
 :name: Pencils of rays
-:url: http://projecteuler.net/problem=372
+:url: https://projecteuler.net/problem=372
 :content: "Let R(<var>M</var>, <var>N</var>) be the number of lattice points (<var>x</var>,
-  <var>y</var>) which satisfy <var>M</var> ![<]({{ images_dir }}/symbol_lt.gif)<var>x</var>
-  ![≤]({{ images_dir }}/symbol_le.gif)<var>N</var>, <var>M</var> ![<]({{ images_dir
-  }}/symbol_lt.gif)<var>y</var> ![≤]({{ images_dir }}/symbol_le.gif)<var>N</var> and
-  ![]({{ images_dir }}/p_372_pencilray1.jpg) is odd.  \n\rWe can verify that R(0,
-  100) = 3019 and R(100, 10000) = 29750422.  \n\rFind R(2·10<sup>6</sup>, 10<sup>9</sup>).\n\n<u><i>Note</i></u>:
-  ![]({{ images_dir }}/p_372_pencilray2.gif) represents the floor function.\n\n"
+  <var>y</var>) which satisfy <var>M</var>\\<<var>x</var>≤<var>N</var>, <var>M</var>\\<<var>y</var>≤<var>N</var>
+  and ![p372_pencilray1.jpg]({{ images_dir }}/p372_pencilray1.jpg) is odd.  \nWe can
+  verify that R(0, 100) = 3019 and R(100, 10000) = 29750422.  \nFind R(2·10<sup>6</sup>,
+  10<sup>9</sup>).\n\n<u><i>Note</i></u>: ![p372_pencilray2.gif]({{ images_dir }}/p372_pencilray2.gif)
+  represents the floor function.\n\n"

data/data/problems/373.yml

@@ -1,9 +1,13 @@
 ---
 :id: 373
 :name: Circumscribed Circles
-:url: http://projecteuler.net/problem=373
-:content: "Every triangle has a circumscribed circle that goes through the three vertices.\rConsider
-  all integer sided triangles for which the radius of the circumscribed circle is
-  integral as well.\n\nLet S(<var>n</var>) be the sum of the radii of the circumscribed
-  circles of all such triangles for which the radius does not exceed <var>n</var>.\n\nS(100)=4950
-  and S(1200)=1653605.\n\nFind S(10<sup>7</sup>).\n\n"
+:url: https://projecteuler.net/problem=373
+:content: |+
+  Every triangle has a circumscribed circle that goes through the three vertices. Consider all integer sided triangles for which the radius of the circumscribed circle is integral as well.
+
+  Let S(<var>n</var>) be the sum of the radii of the circumscribed circles of all such triangles for which the radius does not exceed <var>n</var>.
+
+  S(100)=4950 and S(1200)=1653605.
+
+  Find S(10<sup>7</sup>).
+

data/data/problems/374.yml

@@ -1,19 +1,17 @@
 ---
 :id: 374
 :name: Maximum Integer Partition Product
-:url: http://projecteuler.net/problem=374
+:url: https://projecteuler.net/problem=374
 :content: "An integer partition of a number <var>n</var> is a way of writing <var>n</var>
   as a sum of positive integers.\n\nPartitions that differ only in the order of their
-  summands are considered the same.\rA partition of <var>n</var> into **distinct parts**
+  summands are considered the same. A partition of <var>n</var> into **distinct parts**
   is a partition of <var>n</var> in which every part occurs at most once.\n\nThe partitions
-  of 5 into distinct parts are:\r  \n5, 4+1 and 3+2.\n\nLet f(<var>n</var>) be the
-  maximum product of the parts of any such partition of <var>n</var> into distinct
-  parts and let m(<var>n</var>) be the number of elements of any such partition of
-  <var>n</var> with that product.\n\nSo f(5)=6 and m(5)=2.\n\nFor <var>n</var>=10
-  the partition with the largest product is 10=2+3+5, which gives f(10)=30 and m(10)=3.\r
-  \ \nAnd their product, f(10)·m(10) = 30·3 = 90\n\nIt can be verified that\r  \n
-  ![∑]({{ images_dir }}/symbol_sum.gif)f(<var>n</var>)·m(<var>n</var>) for 1 ![≤]({{
-  images_dir }}/symbol_le.gif) <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif) 100
-  = 1683550844462.\n\nFind ![∑]({{ images_dir }}/symbol_sum.gif)f(<var>n</var>)·m(<var>n</var>)
-  for 1 ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  10<sup>14</sup>.\r  \nGive your answer modulo 982451653, the 50 millionth prime.\n\n"
+  of 5 into distinct parts are:  \n5, 4+1 and 3+2.\n\nLet f(<var>n</var>) be the maximum
+  product of the parts of any such partition of <var>n</var> into distinct parts and
+  let m(<var>n</var>) be the number of elements of any such partition of <var>n</var>
+  with that product.\n\nSo f(5)=6 and m(5)=2.\n\nFor <var>n</var>=10 the partition
+  with the largest product is 10=2+3+5, which gives f(10)=30 and m(10)=3.  \nAnd their
+  product, f(10)·m(10) = 30·3 = 90\n\nIt can be verified that  \n∑f(<var>n</var>)·m(<var>n</var>)
+  for 1 ≤ <var>n</var> ≤ 100 = 1683550844462.\n\nFind ∑f(<var>n</var>)·m(<var>n</var>)
+  for 1 ≤ <var>n</var> ≤ 10<sup>14</sup>.  \nGive your answer modulo 982451653, the
+  50 millionth prime.\n\n"

data/data/problems/375.yml

@@ -1,18 +1,15 @@
 ---
 :id: 375
 :name: Minimum of subsequences
-:url: http://projecteuler.net/problem=375
-:content: "<style type=\"text/css\"><![CDATA[\r\ntable.p375 td {\r\n  padding: 0px
-  3px 0px 3px;\r\n  vertical-align: bottom;\r\n  text-align: left;\r\n}\r\n]]></style>\n\nLet
-  <var>S</var><sub><var>n</var></sub> be an integer sequence produced with the following
-  pseudo-random number generator:\n\n<center><table class=\"p375\">\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>\r\n</table></center>\n\nLet A(<var>i</var>, <var>j</var>)
+:url: https://projecteuler.net/problem=375
+:content: "Let <var>S</var><sub><var>n</var></sub> be an integer sequence produced
+  with the following pseudo-random number generator:\n\n<center><table class=\"p375\">\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</table></center>\n\nLet A(<var>i</var>, <var>j</var>)
   be the minimum of the numbers <var>S</var><sub><var>i</var></sub>, <var>S</var><sub><var>i</var>+1</sub>,
-  ... , <var>S</var><sub><var>j</var></sub> for <var>i</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  <var>j</var>.  \n\rLet M(<var>N</var>) = ΣA(<var>i</var>, <var>j</var>) for 1 ![≤]({{
-  images_dir }}/symbol_le.gif) <var>i</var> ![≤]({{ images_dir }}/symbol_le.gif) <var>j</var>
-  ![≤]({{ images_dir }}/symbol_le.gif) <var>N</var>.  \n\rWe can verify that M(10)
-  = 432256955 and M(10 000) = 3264567774119.\n\nFind M(2 000 000 000).\n\n"
+  ... , <var>S</var><sub><var>j</var></sub> for <var>i</var> ≤ <var>j</var>.  \nLet
+  M(<var>N</var>) = ΣA(<var>i</var>, <var>j</var>) for 1 ≤ <var>i</var> ≤ <var>j</var>
+  ≤ <var>N</var>.  \nWe can verify that M(10) = 432256955 and M(10 000) = 3264567774119.\n\nFind
+  M(2 000 000 000).\n\n"

data/data/problems/376.yml

@@ -1,23 +1,23 @@
 ---
 :id: 376
 :name: Nontransitive sets of dice
-:url: http://projecteuler.net/problem=376
+:url: https://projecteuler.net/problem=376
 :content: "Consider the following set of dice with nonstandard pips:\n\nDie A: 1 4
-  4 4 4 4  \n\rDie B: 2 2 2 5 5 5  \n\rDie C: 3 3 3 3 3 6\n\nA game is played by two
-  players picking a die in turn and rolling it. The player who rolls the highest value
-  wins.\n\nIf the first player picks die A and the second player picks die B we get
-  \ \n\rP(second player wins) = <sup>7</sup>/<sub>12</sub> > <sup>1</sup>/<sub>2</sub>\n\nIf
-  the first player picks die B and the second player picks die C we get  \n\rP(second
-  player wins) = <sup>7</sup>/<sub>12</sub> > <sup>1</sup>/<sub>2</sub>\n\nIf the
-  first player picks die C and the second player picks die A we get  \n\rP(second
-  player wins) = <sup>25</sup>/<sub>36</sub> > <sup>1</sup>/<sub>2</sub>\n\nSo whatever
-  die the first player picks, the second player can pick another die and have a larger
-  than 50% chance of winning.  \n\rA set of dice having this property is called a
-  **nontransitive set of dice** .\n\nWe wish to investigate how many sets of nontransitive
-  dice exist. We will assume the following conditions:\n\n- There are three six-sided
-  dice with each side having between 1 and <var>N</var> pips, inclusive.\n- Dice with
-  the same set of pips are equal, regardless of which side on the die the pips are
-  located.\n- The same pip value may appear on multiple dice; if both players roll
-  the same value neither player wins.\n- The sets of dice {A,B,C}, {B,C,A} and {C,A,B}
-  are the same set.\n\nFor <var>N</var> = 7 we find there are 9780 such sets.  \n\rHow
-  many are there for <var>N</var> = 30 ?\n\n"
+  4 4 4 4  \nDie B: 2 2 2 5 5 5  \nDie C: 3 3 3 3 3 6\n\nA game is played by two players
+  picking a die in turn and rolling it. The player who rolls the highest value wins.\n\nIf
+  the first player picks die A and the second player picks die B we get  \nP(second
+  player wins) = <sup>7</sup>/<sub>12</sub> \\> <sup>1</sup>/<sub>2</sub>\n\nIf the
+  first player picks die B and the second player picks die C we get  \nP(second player
+  wins) = <sup>7</sup>/<sub>12</sub> \\> <sup>1</sup>/<sub>2</sub>\n\nIf the first
+  player picks die C and the second player picks die A we get  \nP(second player wins)
+  = <sup>25</sup>/<sub>36</sub> \\> <sup>1</sup>/<sub>2</sub>\n\nSo whatever die the
+  first player picks, the second player can pick another die and have a larger than
+  50% chance of winning.  \nA set of dice having this property is called a **nontransitive
+  set of dice**.\n\nWe wish to investigate how many sets of nontransitive dice exist.
+  We will assume the following conditions:\n\n- There are three six-sided dice with
+  each side having between 1 and <var>N</var> pips, inclusive.\n- Dice with the same
+  set of pips are equal, regardless of which side on the die the pips are located.\n-
+  The same pip value may appear on multiple dice; if both players roll the same value
+  neither player wins.\n- The sets of dice {A,B,C}, {B,C,A} and {C,A,B} are the same
+  set.\n\nFor <var>N</var> = 7 we find there are 9780 such sets.  \nHow many are there
+  for <var>N</var> = 30 ?\n\n"

data/data/problems/377.yml

@@ -1,10 +1,10 @@
 ---
 :id: 377
 :name: Sum of digits, experience 13
-:url: http://projecteuler.net/problem=377
+:url: https://projecteuler.net/problem=377
 :content: "There are 16 positive integers that do not have a zero in their digits
-  and that have a digital sum equal to 5, namely:   \n\r5, 14, 23, 32, 41, 113, 122,
-  131, 212, 221, 311, 1112, 1121, 1211, 2111 and 11111.  \n\rTheir sum is 17891.\n\nLet
+  and that have a digital sum equal to 5, namely:   \n5, 14, 23, 32, 41, 113, 122,
+  131, 212, 221, 311, 1112, 1121, 1211, 2111 and 11111.  \nTheir sum is 17891.\n\nLet
   <var>f</var>(<var>n</var>) be the sum of all positive integers that do not have
-  a zero in their digits and have a digital sum equal to <var>n</var>.\n\nFind ![]({{
-  images_dir }}/sod_13.gif).  \n\rGive the last 9 digits as your answer.\n\n"
+  a zero in their digits and have a digital sum equal to <var>n</var>.\n\nFind $\\displaystyle
+  \\sum\\_{i=1}^{17} f(13^i)$.  \nGive the last 9 digits as your answer.\n\n"

data/data/problems/378.yml

@@ -1,12 +1,11 @@
 ---
 :id: 378
 :name: Triangle Triples
-:url: http://projecteuler.net/problem=378
-:content: "| \rLet T(<var>n</var>) be the <var>n</var><sup>th</sup> triangle number,
-  so T(<var>n</var>) =\r | \n\n| <var>n</var> (<var>n</var>+1) |\n| 2 |\n\n | \r.\r
-  |\n\nLet dT(<var>n</var>) be the number of divisors of T(<var>n</var>).  \n\rE.g.:\rT(7)
-  = 28 and dT(7) = 6.\n\nLet Tr(<var>n</var>) be the number of triples (<var>i</var>,
-  <var>j</var>, <var>k</var>) such that 1 ![≤]({{ images_dir }}/symbol_le.gif) <var>i
-  n</var> and dT(<var>i</var>) > dT(<var>j</var>) > dT(<var>k</var>).  \n\rTr(20)
-  = 14, Tr(100) = 5772 and Tr(1000) = 11174776.\n\nFind Tr(60 000 000).   \n\rGive
-  the last 18 digits of your answer.\n\n"
+:url: https://projecteuler.net/problem=378
+:content: "| Let T(<var>n</var>) be the <var>n</var><sup>th</sup> triangle number,
+  so T(<var>n</var>) = | \n\n| <var>n</var> (<var>n</var>+1) |\n| 2 |\n\n | . |\n\nLet
+  dT(<var>n</var>) be the number of divisors of T(<var>n</var>).  \nE.g.: T(7) = 28
+  and dT(7) = 6.\n\nLet Tr(<var>n</var>) be the number of triples (<var>i</var>, <var>j</var>,
+  <var>k</var>) such that 1 ≤ <var>i &lt; j &lt; k ≤ n</var> and dT(<var>i</var>)
+  \\> dT(<var>j</var>) \\> dT(<var>k</var>).  \nTr(20) = 14, Tr(100) = 5772 and Tr(1000)
+  = 11174776.\n\nFind Tr(60 000 000).   \nGive the last 18 digits of your answer.\n\n"