euler-manager 0.1.1 → 0.2.0

data/data/problems/3.yml

@@ -1,7 +1,9 @@
 ---
 :id: 3
 :name: Largest prime factor
-:url: http://projecteuler.net/problem=3
-:content: "The prime factors of 13195 are 5, 7, 13 and 29.\n\nWhat is the largest
-  prime factor of the number 600851475143 ?\n\n<!--\r\nNote: This problem has been
-  changed recently, please check that you are using the right number.\r\n-->\n"
+:url: https://projecteuler.net/problem=3
+:content: |+
+  The prime factors of 13195 are 5, 7, 13 and 29.
+
+  What is the largest prime factor of the number 600851475143 ?
+

data/data/problems/30.yml

@@ -1,7 +1,7 @@
 ---
 :id: 30
 :name: Digit fifth powers
-:url: http://projecteuler.net/problem=30
+:url: https://projecteuler.net/problem=30
 :content: "Surprisingly there are only three numbers that can be written as the sum
   of fourth powers of their digits:\n\n> 1634 = 1<sup>4</sup> + 6<sup>4</sup> + 3<sup>4</sup>
   + 4<sup>4</sup>  \n> 8208 = 8<sup>4</sup> + 2<sup>4</sup> + 0<sup>4</sup> + 8<sup>4</sup>

data/data/problems/300.yml

@@ -1,24 +1,24 @@
 ---
 :id: 300
 :name: Protein folding
-:url: http://projecteuler.net/problem=300
+:url: https://projecteuler.net/problem=300
 :content: "In a very simplified form, we can consider proteins as strings consisting
-  of hydrophobic (H) and polar (P) elements, e.g. HHPPHHHPHHPH.   \n\rFor this problem,
+  of hydrophobic (H) and polar (P) elements, e.g. HHPPHHHPHHPH.   \nFor this problem,
   the orientation of a protein is important; e.g. HPP is considered distinct from
   PPH. Thus, there are 2<sup><var>n</var></sup> distinct proteins consisting of <var>n</var>
   elements.\n\nWhen one encounters these strings in nature, they are always folded
   in such a way that the number of H-H contact points is as large as possible, since
-  this is energetically advantageous.  \n\rAs a result, the H-elements tend to accumulate
-  in the inner part, with the P-elements on the outside.  \n\rNatural proteins are
-  folded in three dimensions of course, but we will only consider protein folding
-  in <u>two dimensions</u>.\n\nThe figure below shows two possible ways that our example
-  protein could be folded (H-H contact points are shown with red dots).\n\n ![]({{
-  images_dir }}/p_300_protein.gif)\n\nThe folding on the left has only six H-H contact
-  points, thus it would never occur naturally.  \n\rOn the other hand, the folding
-  on the right has nine H-H contact points, which is optimal for this string.\n\nAssuming
+  this is energetically advantageous.  \nAs a result, the H-elements tend to accumulate
+  in the inner part, with the P-elements on the outside.  \nNatural proteins are folded
+  in three dimensions of course, but we will only consider protein folding in <u>two
+  dimensions</u>.\n\nThe figure below shows two possible ways that our example protein
+  could be folded (H-H contact points are shown with red dots).\n\n ![p300_protein.gif]({{
+  images_dir }}/p300_protein.gif)\n\nThe folding on the left has only six H-H contact
+  points, thus it would never occur naturally.  \nOn the other hand, the folding on
+  the right has nine H-H contact points, which is optimal for this string.\n\nAssuming
   that H and P elements are equally likely to occur in any position along the string,
   the average number of H-H contact points in an optimal folding of a random protein
-  string of length 8 turns out to be 850 / 2<sup>8</sup>=3.3203125.\n\nWhat is the
-  average number of H-H contact points in an optimal folding of a random protein string
-  of length 15?  \n\rGive your answer using as many decimal places as necessary for
-  an exact result.\n\n"
+  string of length 8 turns out to be 850&nbsp;/&nbsp;2<sup>8</sup>=3.3203125.\n\nWhat
+  is the average number of H-H contact points in an optimal folding of a random protein
+  string of length 15?  \nGive your answer using as many decimal places as necessary
+  for an exact result.\n\n"

data/data/problems/301.yml

@@ -1,13 +1,13 @@
 ---
 :id: 301
 :name: Nim
-:url: http://projecteuler.net/problem=301
+:url: https://projecteuler.net/problem=301
 :content: "_Nim_ is a game played with heaps of stones, where two players take it
   in turn to remove any number of stones from any heap until no stones remain.\n\nWe'll
-  consider the three-heap normal-play version of Nim, which works as follows:  \n\r-
-  At the start of the game there are three heaps of stones.  \n\r- On his turn the
-  player removes any positive number of stones from any single heap.  \n\r- The first
-  player unable to move (because no stones remain) loses.\n\nIf (<var>n</var><sub>1</sub>,<var>n</var><sub>2</sub>,<var>n</var><sub>3</sub>)
+  consider the three-heap normal-play version of Nim, which works as follows:  \n-
+  At the start of the game there are three heaps of stones.  \n- On his turn the player
+  removes any positive number of stones from any single heap.  \n- The first player
+  unable to move (because no stones remain) loses.\n\nIf (<var>n</var><sub>1</sub>,<var>n</var><sub>2</sub>,<var>n</var><sub>3</sub>)
   indicates a Nim position consisting of heaps of size <var>n</var><sub>1</sub>, <var>n</var><sub>2</sub>
   and <var>n</var><sub>3</sub> then there is a simple function <var>X</var>(<var>n</var><sub>1</sub>,<var>n</var><sub>2</sub>,<var>n</var><sub>3</sub>)
   — that you may look up or attempt to deduce for yourself — that returns:\n\n- zero
@@ -16,8 +16,7 @@
   example <var>X</var>(1,2,3) = 0 because, no matter what the current player does,
   his opponent can respond with a move that leaves two heaps of equal size, at which
   point every move by the current player can be mirrored by his opponent until no
-  stones remain; so the current player loses. To illustrate:  \n\r- current player
-  moves to (1,2,1)  \n\r- opponent moves to (1,0,1)  \n\r- current player moves to
-  (0,0,1)  \n\r- opponent moves to (0,0,0), and so wins.\n\nFor how many positive
-  integers <var>n</var>  ![≤]({{ images_dir }}/symbol_le.gif) 2<sup>30</sup> does
-  <var>X</var>(<var>n</var>,2<var>n</var>,3<var>n</var>) = 0 ?\n\n"
+  stones remain; so the current player loses. To illustrate:  \n- current player moves
+  to (1,2,1)  \n- opponent moves to (1,0,1)  \n- current player moves to (0,0,1)  \n-
+  opponent moves to (0,0,0), and so wins.\n\nFor how many positive integers <var>n</var> ≤ 2<sup>30</sup>
+  does <var>X</var>(<var>n</var>,2<var>n</var>,3<var>n</var>) = 0 ?\n\n"

data/data/problems/302.yml

@@ -1,7 +1,7 @@
 ---
 :id: 302
 :name: Strong Achilles Numbers
-:url: http://projecteuler.net/problem=302
+:url: https://projecteuler.net/problem=302
 :content: "A positive integer <var>n</var> is **powerful** if p<sup>2</sup> is a divisor
   of <var>n</var> for every prime factor p in <var>n</var>.\n\nA positive integer
   <var>n</var> is a **perfect power** if <var>n</var> can be expressed as a power
@@ -9,9 +9,9 @@
   number** if <var>n</var> is powerful but not a perfect power. For example, 864 and
   1800 are Achilles numbers: 864 = 2<sup>5</sup>·3<sup>3</sup> and 1800 = 2<sup>3</sup>·3<sup>2</sup>·5<sup>2</sup>.\n\nWe
   shall call a positive integer <var>S</var> a _Strong Achilles number_ if both <var>S</var>
-  and φ(<var>S</var>) are Achilles numbers.<sup>1</sup>  \n\rFor example, 864 is a
-  Strong Achilles number: φ(864) = 288 = 2<sup>5</sup>·3<sup>2</sup>. However, 1800
-  isn't a Strong Achilles number because: φ(1800) = 480 = 2<sup>5</sup>·3<sup>1</sup>·5<sup>1</sup>.\n\nThere
+  and φ(<var>S</var>) are Achilles numbers.<sup>1</sup>  \nFor example, 864 is a Strong
+  Achilles number: φ(864) = 288 = 2<sup>5</sup>·3<sup>2</sup>. However, 1800 isn't
+  a Strong Achilles number because: φ(1800) = 480 = 2<sup>5</sup>·3<sup>1</sup>·5<sup>1</sup>.\n\nThere
   are 7 Strong Achilles numbers below 10<sup>4</sup> and 656 below 10<sup>8</sup>.\n\nHow
   many Strong Achilles numbers are there below 10<sup>18</sup>?\n\n<sup>1</sup> φ
-  denotes **Euler's totient function** .\n\n"
+  denotes **Euler's totient function**.\n\n"

data/data/problems/303.yml

@@ -1,13 +1,13 @@
 ---
 :id: 303
 :name: Multiples with small digits
-:url: http://projecteuler.net/problem=303
+:url: https://projecteuler.net/problem=303
 :content: |+
-  For a positive integer <var>n</var>, define <var>f</var>(<var>n</var>) as the least positive multiple of <var>n</var> that, written in base 10, uses only digits ![≤]({{ images_dir }}/symbol_le.gif) 2.
+  For a positive integer <var>n</var>, define <var>f</var>(<var>n</var>) as the least positive multiple of <var>n</var> that, written in base 10, uses only digits ≤ 2.
 
   Thus <var>f</var>(2)=2, <var>f</var>(3)=12, <var>f</var>(7)=21, <var>f</var>(42)=210, <var>f</var>(89)=1121222.
 
-  Also, ![]({{ images_dir }}/p303_formula100.gif).
+  Also, ![p303_formula100.gif]({{ images_dir }}/p303_formula100.gif).
 
-  Find ![]({{ images_dir }}/p303_formula10000.gif).
+  Find ![p303_formula10000.gif]({{ images_dir }}/p303_formula10000.gif).
 

data/data/problems/304.yml

@@ -1,13 +1,11 @@
 ---
 :id: 304
 :name: Primonacci
-:url: http://projecteuler.net/problem=304
+:url: https://projecteuler.net/problem=304
 :content: "For any positive integer <var>n</var> the function next\\_prime(<var>n</var>)
-  returns the smallest prime p   \n such that p ![>]({{ images_dir }}/symbol_gt.gif)<var>n</var>.\n\nThe
-  sequence a(<var>n</var>) is defined by:  \n\ra(1)=next\\_prime(10<sup>14</sup>)
-  and a(<var>n</var>)=next\\_prime(a(<var>n</var>-1)) for n ![>]({{ images_dir }}/symbol_gt.gif)1.\n\nThe
-  fibonacci sequence f(<var>n</var>) is defined by:\rf(0)=0, f(1)=1 and f(<var>n</var>)=f(<var>n</var>-1)+f(<var>n</var>-2)
-  for <var>n</var> ![>]({{ images_dir }}/symbol_gt.gif)1.\n\nThe sequence b(<var>n</var>)
-  is defined as f(a(<var>n</var>)).\n\nFind ![∑]({{ images_dir }}/symbol_sum.gif)b(<var>n</var>)
-  for 1 ![≤]({{ images_dir }}/symbol_le.gif)<var>n</var> ![≤]({{ images_dir }}/symbol_le.gif)100
-  000. \rGive your answer mod 1234567891011.\n\n"
+  returns the smallest prime p   \n such that p\\><var>n</var>.\n\nThe sequence a(<var>n</var>)
+  is defined by:  \na(1)=next\\_prime(10<sup>14</sup>) and a(<var>n</var>)=next\\_prime(a(<var>n</var>-1))
+  for n\\>1.\n\nThe fibonacci sequence f(<var>n</var>) is defined by: f(0)=0, f(1)=1
+  and f(<var>n</var>)=f(<var>n</var>-1)+f(<var>n</var>-2) for <var>n</var>\\>1.\n\nThe
+  sequence b(<var>n</var>) is defined as f(a(<var>n</var>)).\n\nFind ∑b(<var>n</var>)
+  for 1≤<var>n</var>≤100 000. Give your answer mod 1234567891011.\n\n"

data/data/problems/305.yml

@@ -1,11 +1,10 @@
 ---
 :id: 305
 :name: Reflexive Position
-:url: http://projecteuler.net/problem=305
+:url: https://projecteuler.net/problem=305
 :content: "Let's call S the (infinite) string that is made by concatenating the consecutive
-  positive integers (starting from 1) written down in base 10.  \n \rThus, S = 1234567891011121314151617181920212223242...\n\nIt's
+  positive integers (starting from 1) written down in base 10.  \n Thus, S = 1234567891011121314151617181920212223242...\n\nIt's
   easy to see that any number will show up an infinite number of times in S.\n\nLet's
   call f(n) the starting position of the n<sup>th</sup> occurrence of n in S.  \n
-  \rFor example, f(1)=1, f(5)=81, f(12)=271 and f(7780)=111111365.\n\nFind ![∑]({{
-  images_dir }}/symbol_sum.gif)f(3<sup>k</sup>) for 1 ![≤]({{ images_dir }}/symbol_le.gif)k
-  ![≤]({{ images_dir }}/symbol_le.gif)13.\n\n"
+  For example, f(1)=1, f(5)=81, f(12)=271 and f(7780)=111111365.\n\nFind ∑f(3<sup>k</sup>)
+  for 1≤k≤13.\n\n"

data/data/problems/306.yml

@@ -1,22 +1,20 @@
 ---
 :id: 306
 :name: Paper-strip Game
-:url: http://projecteuler.net/problem=306
+:url: https://projecteuler.net/problem=306
 :content: "The following game is a classic example of Combinatorial Game Theory:\n\nTwo
   players start with a strip of <var>n</var> white squares and they take alternate
-  turns.  \n\rOn each turn, a player picks two contiguous white squares and paints
-  them black.  \n\rThe first player who cannot make a move loses.\n\n- If <var>n</var>
-  = 1, there are no valid moves, so the first player loses automatically.\n- If <var>n</var>
+  turns.  \nOn each turn, a player picks two contiguous white squares and paints them
+  black.  \nThe first player who cannot make a move loses.\n\n- If <var>n</var> =
+  1, there are no valid moves, so the first player loses automatically.\n- If <var>n</var>
   = 2, there is only one valid move, after which the second player loses.\n- If <var>n</var>
   = 3, there are two valid moves, but both leave a situation where the second player
   loses.\n- If <var>n</var> = 4, there are three valid moves for the first player;
   she can win the game by painting the two middle squares.\n- If <var>n</var> = 5,
   there are four valid moves for the first player (shown below in red); but no matter
-  what she does, the second player (blue) wins.\n\n ![]({{ images_dir }}/p_306_pstrip.gif)\n\nSo,
-  for 1 ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var> ![≤]({{ images_dir }}/symbol_le.gif)
-  5, there are 3 values of <var>n</var> for which the first player can force a win.
-  \ \n\rSimilarly, for 1 ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var> ![≤]({{
-  images_dir }}/symbol_le.gif) 50, there are 40 values of <var>n</var> for which the
-  first player can force a win.\n\nFor 1 ![≤]({{ images_dir }}/symbol_le.gif) <var>n</var>
-  ![≤]({{ images_dir }}/symbol_le.gif) 1 000 000, how many values of <var>n</var>
-  are there for which the first player can force a win?\n\n"
+  what she does, the second player (blue) wins.\n\n ![p306_pstrip.gif]({{ images_dir
+  }}/p306_pstrip.gif)\n\nSo, for 1 ≤ <var>n</var> ≤ 5, there are 3 values of <var>n</var>
+  for which the first player can force a win.  \nSimilarly, for 1 ≤ <var>n</var> ≤
+  50, there are 40 values of <var>n</var> for which the first player can force a win.\n\nFor
+  1 ≤ <var>n</var> ≤ 1 000 000, how many values of <var>n</var> are there for which
+  the first player can force a win?\n\n"

data/data/problems/307.yml

@@ -1,10 +1,10 @@
 ---
 :id: 307
 :name: Chip Defects
-:url: http://projecteuler.net/problem=307
+:url: https://projecteuler.net/problem=307
 :content: "<var>k</var> defects are randomly distributed amongst <var>n</var> integrated-circuit
   chips produced by a factory (any number of defects may be found on a chip and each
   defect is independent of the other defects).\n\nLet p(<var>k,n</var>) represent
-  the probability that there is a chip with at least 3 defects.  \n\rFor instance
-  p(3,7) ![≈]({{ images_dir }}/symbol_asymp.gif) 0.0204081633.\n\nFind p(20 000, 1
-  000 000) and give your answer rounded to 10 decimal places in the form 0.abcdefghij\n\n"
+  the probability that there is a chip with at least 3 defects.  \nFor instance p(3,7)
+  ≈ 0.0204081633.\n\nFind p(20 000, 1 000 000) and give your answer rounded to 10
+  decimal places in the form 0.abcdefghij\n\n"

data/data/problems/308.yml

@@ -1,7 +1,7 @@
 ---
 :id: 308
 :name: An amazing Prime-generating Automaton
-:url: http://projecteuler.net/problem=308
+:url: https://projecteuler.net/problem=308
 :content: "A program written in the programming language Fractran consists of a list
   of fractions.\n\nThe internal state of the Fractran Virtual Machine is a positive
   integer, which is initially set to a seed value. Each iteration of a Fractran program
@@ -13,11 +13,11 @@
   \n\n| 95 |\n| 23 |\n\n | , | \n\n| 77 |\n| 19 |\n\n | , | \n\n| 1 |\n| 17 |\n\n
   | , | \n\n| 11 |\n| 13 |\n\n | , | \n\n| 13 |\n| 11 |\n\n | , | \n\n| 15 |\n| 2
   |\n\n | , | \n\n| 1 |\n| 7 |\n\n | , | \n\n| 55 |\n| 1 |\n\n | . |\n\nStarting with
-  the seed integer 2, successive iterations of the program produce the sequence:  \n\r15,
+  the seed integer 2, successive iterations of the program produce the sequence:  \n15,
   825, 725, 1925, 2275, 425, ..., 68, **4** , 30, ..., 136, **8** , 60, ..., 544,
   **32** , 240, ...\n\nThe powers of 2 that appear in this sequence are 2<sup>2</sup>,
-  2<sup>3</sup>, 2<sup>5</sup>, ...  \n\rIt can be shown that _all_ the powers of
-  2 in this sequence have prime exponents and that _all_ the primes appear as exponents
+  2<sup>3</sup>, 2<sup>5</sup>, ...  \nIt can be shown that _all_ the powers of 2
+  in this sequence have prime exponents and that _all_ the primes appear as exponents
   of powers of 2, in proper order!\n\nIf someone uses the above Fractran program to
   solve Project Euler Problem 7 (find the 10001<sup>st</sup> prime), how many iterations
   would be needed until the program produces 2<sup>10001st prime</sup> ?\n\n"

data/data/problems/309.yml

@@ -1,16 +1,18 @@
 ---
 :id: 309
 :name: Integer Ladders
-:url: http://projecteuler.net/problem=309
+:url: https://projecteuler.net/problem=309
 :content: "In the classic \"Crossing Ladders\" problem, we are given the lengths <var>x</var>
   and <var>y</var> of two ladders resting on the opposite walls of a narrow, level
   street. We are also given the height <var>h</var> above the street where the two
   ladders cross and we are asked to find the width of the street (<var>w</var>).\n\n
-  ![]({{ images_dir }}/p_309_ladders.gif)\n\nHere, we are only concerned with instances
-  where all four variables are positive integers.  \n\rFor example, if <var>x</var>
-  = 70, <var>y</var> = 119 and <var>h</var> = 30, we can calculate that <var>w</var>
-  = 56.\n\nIn fact, for integer values <var>x</var>, <var>y</var>, <var>h</var> and
-  0 x y x,<var>y</var>,<var>h</var>) producing integer solutions for <var>w</var>:
-  \ \n\r(70, 119, 30), (74, 182, 21), (87, 105, 35), (100, 116, 35) and (119, 175,
-  40).\n\nFor integer values <var>x</var>, <var>y</var>, <var>h</var> and 0 x y x,<var>y</var>,<var>h</var>)
-  produce integer solutions for <var>w</var>?\n\n"
+  ![p309_ladders.gif]({{ images_dir }}/p309_ladders.gif)\n\nHere, we are only concerned
+  with instances where all four variables are positive integers.  \nFor example, if
+  <var>x</var> = 70, <var>y</var> = 119 and <var>h</var> = 30, we can calculate that
+  <var>w</var> = 56.\n\nIn fact, for integer values <var>x</var>, <var>y</var>, <var>h</var>
+  and 0 \\< <var>x</var> \\< <var>y</var> \\< 200, there are only five triplets (<var>x</var>,<var>y</var>,<var>h</var>)
+  producing integer solutions for <var>w</var>:  \n(70, 119, 30), (74, 182, 21), (87,
+  105, 35), (100, 116, 35) and (119, 175, 40).\n\nFor integer values <var>x</var>,
+  <var>y</var>, <var>h</var> and 0 \\< <var>x</var> \\< <var>y</var> \\< 1 000 000,
+  how many triplets (<var>x</var>,<var>y</var>,<var>h</var>) produce integer solutions
+  for <var>w</var>?\n\n"

data/data/problems/31.yml

@@ -1,7 +1,7 @@
 ---
 :id: 31
 :name: Coin sums
-:url: http://projecteuler.net/problem=31
+:url: https://projecteuler.net/problem=31
 :content: |+
   In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation:
 
@@ -9,7 +9,7 @@
 
   It is possible to make £2 in the following way:
 
-  > 1 ![×]({{ images_dir }}/symbol_times.gif)£1 + 1 ![×]({{ images_dir }}/symbol_times.gif)50p + 2 ![×]({{ images_dir }}/symbol_times.gif)20p + 1 ![×]({{ images_dir }}/symbol_times.gif)5p + 1 ![×]({{ images_dir }}/symbol_times.gif)2p + 3 ![×]({{ images_dir }}/symbol_times.gif)1p
+  > 1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p
 
   How many different ways can £2 be made using any number of coins?
 

data/data/problems/310.yml

@@ -1,13 +1,10 @@
 ---
 :id: 310
 :name: Nim Square
-:url: http://projecteuler.net/problem=310
-:content: "Alice and Bob play the game Nim Square.  \n\rNim Square is just like ordinary
+:url: https://projecteuler.net/problem=310
+:content: "Alice and Bob play the game Nim Square.  \nNim Square is just like ordinary
   three-heap normal play Nim, but the players may only remove a square number of stones
-  from a heap.  \n\rThe number of stones in the three heaps is represented by the
-  ordered triple (a,b,c).  \n\rIf 0 ![≤]({{ images_dir }}/symbol_le.gif)a ![≤]({{
-  images_dir }}/symbol_le.gif)b ![≤]({{ images_dir }}/symbol_le.gif)c ![≤]({{ images_dir
-  }}/symbol_le.gif)29 then the number of losing positions for the next player is 1160.\n\nFind
-  the number of losing positions for the next player if 0 ![≤]({{ images_dir }}/symbol_le.gif)a
-  ![≤]({{ images_dir }}/symbol_le.gif)b ![≤]({{ images_dir }}/symbol_le.gif)c ![≤]({{
-  images_dir }}/symbol_le.gif)100 000.\n\n"
+  from a heap.  \nThe number of stones in the three heaps is represented by the ordered
+  triple (a,b,c).  \nIf 0≤a≤b≤c≤29 then the number of losing positions for the next
+  player is 1160.\n\nFind the number of losing positions for the next player if 0≤a≤b≤c≤100
+  000.\n\n"

data/data/problems/311.yml

@@ -1,15 +1,13 @@
 ---
 :id: 311
 :name: Biclinic Integral Quadrilaterals
-:url: http://projecteuler.net/problem=311
-:content: "ABCD is a convex, integer sided quadrilateral with 1 ![≤]({{ images_dir
-  }}/symbol_le.gif) AB ![<]({{ images_dir }}/symbol_lt.gif) BC ![<]({{ images_dir
-  }}/symbol_lt.gif) CD ![<]({{ images_dir }}/symbol_lt.gif) AD.  \n\rBD has integer
-  length. O is the midpoint of BD. AO has integer length.  \n\rWe'll call ABCD a _biclinic
-  integral quadrilateral_ if AO = CO ![≤]({{ images_dir }}/symbol_le.gif) BO = DO.\n\nFor
-  example, the following quadrilateral is a biclinic integral quadrilateral:  \n\rAB
-  = 19, BC = 29, CD = 37, AD = 43, BD = 48 and AO = CO = 23.\n\n ![]({{ images_dir
-  }}/p_311_biclinic.gif)\n\nLet B(<var>N</var>) be the number of distinct biclinic
-  integral quadrilaterals ABCD that satisfy AB<sup>2</sup>+BC<sup>2</sup>+CD<sup>2</sup>+AD<sup>2</sup>
-  ![≤]({{ images_dir }}/symbol_le.gif) <var>N</var>.  \n\rWe can verify that B(10
-  000) = 49 and B(1 000 000) = 38239.\n\nFind B(10 000 000 000).\n\n"
+:url: https://projecteuler.net/problem=311
+:content: "ABCD is a convex, integer sided quadrilateral with 1 ≤ AB \\< BC \\< CD
+  \\< AD.  \nBD has integer length. O is the midpoint of BD. AO has integer length.
+  \ \nWe'll call ABCD a _biclinic integral quadrilateral_ if AO = CO ≤ BO = DO.\n\nFor
+  example, the following quadrilateral is a biclinic integral quadrilateral:  \nAB
+  = 19, BC = 29, CD = 37, AD = 43, BD = 48 and AO = CO = 23.\n\n ![p311_biclinic.gif]({{
+  images_dir }}/p311_biclinic.gif)\n\nLet B(<var>N</var>) be the number of distinct
+  biclinic integral quadrilaterals ABCD that satisfy AB<sup>2</sup>+BC<sup>2</sup>+CD<sup>2</sup>+AD<sup>2</sup>
+  ≤ <var>N</var>.  \nWe can verify that B(10 000) = 49 and B(1 000 000) = 38239.\n\nFind
+  B(10 000 000 000).\n\n"

data/data/problems/312.yml

@@ -1,14 +1,15 @@
 ---
 :id: 312
 :name: Cyclic paths on Sierpiński graphs
-:url: http://projecteuler.net/problem=312
+:url: https://projecteuler.net/problem=312
 :content: "- A **Sierpiński graph** of order-1 (<var>S</var><sub>1</sub>) is an equilateral
-  triangle.  \n\r- <var>S</var><sub><var>n</var>+1</sub> is obtained from <var>S</var><sub><var>n</var></sub>
+  triangle.  \n- <var>S</var><sub><var>n</var>+1</sub> is obtained from <var>S</var><sub><var>n</var></sub>
   by positioning three copies of <var>S</var><sub><var>n</var></sub> so that every
-  pair of copies has one common corner.\n\n ![]({{ images_dir }}/p_312_sierpinskyAt.gif)\n\nLet
-  C(<var>n</var>) be the number of cycles that pass exactly once through all the vertices
-  of <var>S</var><sub><var>n</var></sub>.  \n\rFor example, C(3) = 8 because eight
-  such cycles can be drawn on <var>S</var><sub>3</sub>, as shown below:\n\n ![]({{
-  images_dir }}/p_312_sierpinsky8t.gif)\n\nIt can also be verified that :  \n\rC(1)
-  = C(2) = 1  \n\rC(5) = 71328803586048  \n\rC(10 000) mod 10<sup>8</sup> = 37652224
-  \ \n\rC(10 000) mod 13<sup>8</sup> = 617720485\n\nFind C(C(C(10 000))) mod 13<sup>8</sup>.\n\n"
+  pair of copies has one common corner.\n\n ![p312_sierpinskyAt.gif]({{ images_dir
+  }}/p312_sierpinskyAt.gif)\n\nLet C(<var>n</var>) be the number of cycles that pass
+  exactly once through all the vertices of <var>S</var><sub><var>n</var></sub>.  \nFor
+  example, C(3) = 8 because eight such cycles can be drawn on <var>S</var><sub>3</sub>,
+  as shown below:\n\n ![p312_sierpinsky8t.gif]({{ images_dir }}/p312_sierpinsky8t.gif)\n\nIt
+  can also be verified that :  \nC(1) = C(2) = 1  \nC(5) = 71328803586048  \nC(10
+  000) mod 10<sup>8</sup> = 37652224  \nC(10 000) mod 13<sup>8</sup> = 617720485\n\nFind
+  C(C(C(10 000))) mod 13<sup>8</sup>.\n\n"

data/data/problems/313.yml

@@ -1,17 +1,17 @@
 ---
 :id: 313
 :name: Sliding game
-:url: http://projecteuler.net/problem=313
+:url: https://projecteuler.net/problem=313
 :content: |+
   In a sliding game a counter may slide horizontally or vertically into an empty space. The objective of the game is to move the red counter from the top left corner of a grid to the bottom right corner; the space always starts in the bottom right corner. For example, the following sequence of pictures show how the game can be completed in five moves on a 2 by 2 grid.
 
-   ![]({{ images_dir }}/p_313_sliding_game_1.gif)
+   ![p313_sliding_game_1.gif]({{ images_dir }}/p313_sliding_game_1.gif)
 
   Let S(m,n) represent the minimum number of moves to complete the game on an m by n grid. For example, it can be verified that S(5,4) = 25.
 
-   ![]({{ images_dir }}/p_313_sliding_game_2.gif)
+   ![p313_sliding_game_2.gif]({{ images_dir }}/p313_sliding_game_2.gif)
 
-  There are exactly 5482 grids for which S(m,n) = p<sup>2</sup>, where p ![<]({{ images_dir }}/symbol_lt.gif) 100 is prime.
+  There are exactly 5482 grids for which S(m,n) = p<sup>2</sup>, where p \< 100 is prime.
 
-  How many grids does S(m,n) = p<sup>2</sup>, where p ![<]({{ images_dir }}/symbol_lt.gif) 10<sup>6</sup> is prime?
+  How many grids does S(m,n) = p<sup>2</sup>, where p \< 10<sup>6</sup> is prime?
 

data/data/problems/314.yml

@@ -1,7 +1,7 @@
 ---
 :id: 314
 :name: The Mouse on the Moon
-:url: http://projecteuler.net/problem=314
+:url: https://projecteuler.net/problem=314
 :content: "The moon has been opened up, and land can be obtained for free, but there
   is a catch. You have to build a wall around the land that you stake out, and building
   a wall on the moon is expensive. Every country has been allotted a 500 m by 500
@@ -12,15 +12,14 @@
   area. The [Duchy of Grand Fenwick](http://en.wikipedia.org/wiki/Grand_Fenwick),
   has a tighter budget, and has asked you (their Royal Programmer) to compute what
   shape would get best maximum enclosed-area/wall-length ratio.\n\nYou have done some
-  preliminary calculations on a sheet of paper.\rFor a 2000 meter wall enclosing the
-  250 000 m<sup>2</sup> area the\renclosed-area/wall-length ratio is 125.  \n\rAlthough
+  preliminary calculations on a sheet of paper. For a 2000 meter wall enclosing the
+  250 000 m<sup>2</sup> area the enclosed-area/wall-length ratio is 125.  \nAlthough
   not allowed , but to get an idea if this is anything better: if you place a circle
   inside the square area touching the four sides the area will be equal to π\\*250<sup>2</sup>
   m<sup>2</sup> and the perimeter will be π\\*500 m, so the enclosed-area/wall-length
   ratio will also be 125.\n\nHowever, if you cut off from the square four triangles
-  with sides 75 m, 75 m and 75 ![√]({{ images_dir }}/symbol_radic.gif)2 m the total
-  area becomes 238750 m<sup>2</sup> and the perimeter becomes 1400+300 ![√]({{ images_dir
-  }}/symbol_radic.gif)2 m. So this gives an enclosed-area/wall-length ratio of 130.87,
-  which is significantly better.\n\n ![]({{ images_dir }}/p_314_landgrab.gif)\n\nFind
-  the maximum enclosed-area/wall-length ratio.  \n\rGive your answer rounded to 8
-  places behind the decimal point in the form abc.defghijk.\n\n"
+  with sides 75 m, 75 m and 75√2 m the total area becomes 238750 m<sup>2</sup> and
+  the perimeter becomes 1400+300√2 m. So this gives an enclosed-area/wall-length ratio
+  of 130.87, which is significantly better.\n\n ![p314_landgrab.gif]({{ images_dir
+  }}/p314_landgrab.gif)\n\nFind the maximum enclosed-area/wall-length ratio.  \nGive
+  your answer rounded to 8 places behind the decimal point in the form abc.defghijk.\n\n"

data/data/problems/315.yml

@@ -1,42 +1,39 @@
 ---
 :id: 315
 :name: Digital root clocks
-:url: http://projecteuler.net/problem=315
-:content: " ![]({{ images_dir }}/p_315_clocks.gif)\n\nSam and Max are asked to transform
-  two digital clocks into two \"digital root\" clocks.  \n\rA digital root clock is
-  a digital clock that calculates digital roots step by step.\n\nWhen a clock is fed
-  a number, it will show it and then it will start the calculation, showing all the
-  intermediate values until it gets to the result.  \n\rFor example, if the clock
-  is fed the number 137, it will show: \" **137** \" ![→]({{ images_dir }}/symbol_maps.gif)
-  \" **11** \" ![→]({{ images_dir }}/symbol_maps.gif) \" **2** \" and then it will
-  go black, waiting for the next number.\n\nEvery digital number consists of some
-  light segments: three horizontal (top, middle, bottom) and four vertical (top-left,
-  top-right, bottom-left, bottom-right).  \n\rNumber \" **1** \" is made of vertical
-  top-right and bottom-right, number \" **4** \" is made by middle horizontal and
-  vertical top-left, top-right and bottom-right. Number \" **8** \" lights them all.\n\nThe
-  clocks consume energy only when segments are turned on/off.  \n\rTo turn on a \"
-  **2** \" will cost 5 transitions, while a \" **7** \" will cost only 4 transitions.\n\nSam
-  and Max built two different clocks.\n\nSam's clock is fed e.g. number 137: the clock
-  shows \" **137** \", then the panel is turned off, then the next number (\" **11**
-  \") is turned on, then the panel is turned off again and finally the last number
-  (\" **2** \") is turned on and, after some time, off.  \n\rFor the example, with
-  number 137, Sam's clock requires:\n\n| \" **137** \" | : | (2 + 5 + 4) ![×]({{ images_dir
-  }}/symbol_times.gif) 2 = 22 transitions (\" **137** \" on/off). |\n| \" **11** \"
-  | : | (2 + 2) ![×]({{ images_dir }}/symbol_times.gif) 2 = 8 transitions (\" **11**
-  \" on/off). |\n| \" **2** \" | : | (5) ![×]({{ images_dir }}/symbol_times.gif) 2
-  = 10 transitions (\" **2** \" on/off). |\n\n\rFor a grand total of 40 transitions.\r\r\n\nMax's
+:url: https://projecteuler.net/problem=315
+:content: " ![p315_clocks.gif]({{ images_dir }}/p315_clocks.gif)\n\nSam and Max are
+  asked to transform two digital clocks into two \"digital root\" clocks.  \nA digital
+  root clock is a digital clock that calculates digital roots step by step.\n\nWhen
+  a clock is fed a number, it will show it and then it will start the calculation,
+  showing all the intermediate values until it gets to the result.  \nFor example,
+  if the clock is fed the number 137, it will show: \" **137**\" → \" **11**\" → \"
+  **2**\" and then it will go black, waiting for the next number.\n\nEvery digital
+  number consists of some light segments: three horizontal (top, middle, bottom) and
+  four vertical (top-left, top-right, bottom-left, bottom-right).  \nNumber \" **1**\"
+  is made of vertical top-right and bottom-right, number \" **4**\" is made by middle
+  horizontal and vertical top-left, top-right and bottom-right. Number \" **8**\"
+  lights them all.\n\nThe clocks consume energy only when segments are turned on/off.
+  \ \nTo turn on a \" **2**\" will cost 5 transitions, while a \" **7**\" will cost
+  only 4 transitions.\n\nSam and Max built two different clocks.\n\nSam's clock is
+  fed e.g. number 137: the clock shows \" **137**\", then the panel is turned off,
+  then the next number (\" **11**\") is turned on, then the panel is turned off again
+  and finally the last number (\" **2**\") is turned on and, after some time, off.
+  \ \nFor the example, with number 137, Sam's clock requires:\n\n| \" **137**\" |
+  : | (2 + 5 + 4) × 2 = 22 transitions (\" **137**\" on/off). |\n| \" **11**\" | :
+  | (2 + 2) × 2 = 8 transitions (\" **11**\" on/off). |\n| \" **2**\" | : | (5) ×
+  2 = 10 transitions (\" **2**\" on/off). |\n\nFor a grand total of 40 transitions.\n\nMax's
   clock works differently. Instead of turning off the whole panel, it is smart enough
-  to turn off only those segments that won't be needed for the next number.  \n\rFor
-  number 137, Max's clock requires:\n\n| \" **137** \"  \n  \n  \n | :  \n  \n  \n
-  | 2 + 5 + 4 = 11 transitions (\" **137** \" on)  \n\r7 transitions (to turn off
-  the segments that are not needed for number \" **11** \"). |\n| \" **11** \"  \n
-  \ \n  \n  \n  \n | :  \n  \n  \n  \n  \n | 0 transitions (number \" **11** \" is
-  already turned on correctly)  \n\r3 transitions (to turn off the first \" **1**
-  \" and the bottom part of the second \" **1** \";   \n\rthe top part is common with
-  number \" **2** \"). |\n| \" **2** \"  \n  \n  \n | :  \n  \n  \n | 4 tansitions
-  (to turn on the remaining segments in order to get a \" **2** \")  \n\r5 transitions
-  (to turn off number \" **2** \"). |\n\n\rFor a grand total of 30 transitions.\r\r\n\nOf
-  course, Max's clock consumes less power than Sam's one.  \n\rThe two clocks are
-  fed all the prime numbers between A = 10<sup>7</sup> and B = 2 ![×]({{ images_dir
-  }}/symbol_times.gif)10<sup>7</sup>.   \n\rFind the difference between the total
-  number of transitions needed by Sam's clock and that needed by Max's one.\n\n"
+  to turn off only those segments that won't be needed for the next number.  \nFor
+  number 137, Max's clock requires:\n\n| \" **137**\"  \n  \n | :  \n  \n | 2 + 5
+  + 4 = 11 transitions (\" **137**\" on)  \n7 transitions (to turn off the segments
+  that are not needed for number \" **11**\"). |\n| \" **11**\"  \n  \n  \n | :  \n
+  \ \n  \n | 0 transitions (number \" **11**\" is already turned on correctly)  \n3
+  transitions (to turn off the first \" **1**\" and the bottom part of the second
+  \" **1**\";   \nthe top part is common with number \" **2**\"). |\n| \" **2**\"
+  \ \n  \n | :  \n  \n | 4 transitions (to turn on the remaining segments in order
+  to get a \" **2**\")  \n5 transitions (to turn off number \" **2**\"). |\n\nFor
+  a grand total of 30 transitions.\n\nOf course, Max's clock consumes less power than
+  Sam's one.  \nThe two clocks are fed all the prime numbers between A = 10<sup>7</sup>
+  and B = 2×10<sup>7</sup>.   \nFind the difference between the total number of transitions
+  needed by Sam's clock and that needed by Max's one.\n\n"