euler-manager 0.0.5 → 0.0.6

data/data/problems/47.yml

@@ -2,20 +2,15 @@
 :id: 47
 :name: Distinct primes factors
 :url: http://projecteuler.net/problem=47
-:content: "\r\n<p>The first two consecutive numbers to have two distinct prime factors
-  are:</p>\r\n<p style=\"margin-left:100px;\">14 = 2 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  7<br>15 = 3 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\"
-  border=\"0\" style=\"vertical-align:middle;\"> 5</p>\r\n<p>The first three consecutive
-  numbers to have three distinct prime factors are:</p>\r\n<p style=\"margin-left:100px;\">644
-  = 2² <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 7 <img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 23<br>645
-  = 3 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 5 <img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 43<br>646
-  = 2 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 17 <img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 19.</p>\r\n<p>Find
+:content: "The first two consecutive numbers to have two distinct prime factors are:\n\n14
+  = 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 7
+  \ \n15 = 3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  5\n\nThe first three consecutive numbers to have three distinct prime factors are:\n\n644
+  = 2² ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 7
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 23  \n645
+  = 3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 5
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 43  \n646
+  = 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 17
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 19.\n\nFind
   the first four consecutive integers to have four distinct prime factors. What is
-  the first of these numbers?</p>\r\n\r\n"
+  the first of these numbers?\n\n"

data/data/problems/48.yml

@@ -2,6 +2,8 @@
 :id: 48
 :name: Self powers
 :url: http://projecteuler.net/problem=48
-:content: "\r\n\n<p>The series, 1<sup>1</sup> + 2<sup>2</sup> + 3<sup>3</sup> + ...
-  + 10<sup>10</sup> = 10405071317.</p>\n<p>Find the last ten digits of the series,
-  1<sup>1</sup> + 2<sup>2</sup> + 3<sup>3</sup> + ... + 1000<sup>1000</sup>.</p>\n\r\n"
+:content: |+
+  The series, 1<sup>1</sup> + 2<sup>2</sup> + 3<sup>3</sup> + ... + 10<sup>10</sup> = 10405071317.
+
+  Find the last ten digits of the series, 1<sup>1</sup> + 2<sup>2</sup> + 3<sup>3</sup> + ... + 1000<sup>1000</sup>.
+

data/data/problems/49.yml

@@ -2,9 +2,10 @@
 :id: 49
 :name: Prime permutations
 :url: http://projecteuler.net/problem=49
-:content: "\r\n<p>The arithmetic sequence, 1487, 4817, 8147, in which each of the
-  terms increases by 3330, is unusual in two ways: (i) each of the three terms are
-  prime, and, (ii) each of the 4-digit numbers are permutations of one another.</p>\r\n<p>There
-  are no arithmetic sequences made up of three 1-, 2-, or 3-digit primes, exhibiting
-  this property, but there is one other 4-digit increasing sequence.</p>\r\n<p>What
-  12-digit number do you form by concatenating the three terms in this sequence?</p>\r\n\r\n"
+:content: |+
+  The arithmetic sequence, 1487, 4817, 8147, in which each of the terms increases by 3330, is unusual in two ways: (i) each of the three terms are prime, and, (ii) each of the 4-digit numbers are permutations of one another.
+
+  There are no arithmetic sequences made up of three 1-, 2-, or 3-digit primes, exhibiting this property, but there is one other 4-digit increasing sequence.
+
+  What 12-digit number do you form by concatenating the three terms in this sequence?
+

data/data/problems/5.yml

@@ -2,7 +2,8 @@
 :id: 5
 :name: Smallest multiple
 :url: http://projecteuler.net/problem=5
-:content: "\r\n<p>2520 is the smallest number that can be divided by each of the numbers
-  from 1 to 10 without any remainder.</p>\r\n<p>What is the smallest positive number
-  that is <dfn title=\"divisible with no remainder\">evenly divisible</dfn> by all
-  of the numbers from 1 to 20?</p>\r\n\r\n"
+:content: |+
+  2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
+
+  What is the smallest positive number that is <dfn title="divisible with no remainder">evenly divisible</dfn> by all of the numbers from 1 to 20?
+

data/data/problems/50.yml

@@ -2,9 +2,14 @@
 :id: 50
 :name: Consecutive prime sum
 :url: http://projecteuler.net/problem=50
-:content: "\r\n\n<p>The prime 41, can be written as the sum of six consecutive primes:</p>\n<div
-  style=\"text-align:center;\">41 = 2 + 3 + 5 + 7 + 11 + 13</div>\n<p>This is the
-  longest sum of consecutive primes that adds to a prime below one-hundred.</p>\n<p>The
-  longest sum of consecutive primes below one-thousand that adds to a prime, contains
-  21 terms, and is equal to 953.</p>\n<p>Which prime, below one-million, can be written
-  as the sum of the most consecutive primes?</p>\n\r\n"
+:content: |+
+  The prime 41, can be written as the sum of six consecutive primes:
+
+  41 = 2 + 3 + 5 + 7 + 11 + 13
+
+  This is the longest sum of consecutive primes that adds to a prime below one-hundred.
+
+  The longest sum of consecutive primes below one-thousand that adds to a prime, contains 21 terms, and is equal to 953.
+
+  Which prime, below one-million, can be written as the sum of the most consecutive primes?
+

data/data/problems/51.yml

@@ -2,14 +2,12 @@
 :id: 51
 :name: Prime digit replacements
 :url: http://projecteuler.net/problem=51
-:content: "\r\n<!--<p>By replacing the 1<sup>st</sup> digit of *57, it turns out that
-  six of the possible values: 157, 257, 457, 557, 757, and 857, are all prime.</p>
-  -->\r\n<p>By replacing the 1<sup>st</sup> digit of the 2-digit number *3, it turns
-  out that six of the nine possible values: 13, 23, 43, 53, 73, and 83, are all prime.</p>\r\n<p>By
-  replacing the 3<sup>rd</sup> and 4<sup>th</sup> digits of 56**3 with the same digit,
-  this 5-digit number is the first example having seven primes among the ten generated
-  numbers, yielding the family: 56003, 56113, 56333, 56443, 56663, 56773, and 56993.
-  Consequently 56003, being the first member of this family, is the smallest prime
-  with this property.</p>\r\n<p>Find the smallest prime which, by replacing part of
-  the number (not necessarily adjacent digits) with the same digit, is part of an
-  eight prime value family.</p>\r\n\r\n"
+:content: |+
+  <!--<p>By replacing the 1<sup>st</sup> digit of *57, it turns out that six of the possible values: 157, 257, 457, 557, 757, and 857, are all prime.</p> -->
+
+  By replacing the 1<sup>st</sup> digit of the 2-digit number \*3, it turns out that six of the nine possible values: 13, 23, 43, 53, 73, and 83, are all prime.
+
+  By replacing the 3<sup>rd</sup> and 4<sup>th</sup> digits of 56\*\*3 with the same digit, this 5-digit number is the first example having seven primes among the ten generated numbers, yielding the family: 56003, 56113, 56333, 56443, 56663, 56773, and 56993. Consequently 56003, being the first member of this family, is the smallest prime with this property.
+
+  Find the smallest prime which, by replacing part of the number (not necessarily adjacent digits) with the same digit, is part of an eight prime value family.
+

data/data/problems/52.yml

@@ -2,7 +2,8 @@
 :id: 52
 :name: Permuted multiples
 :url: http://projecteuler.net/problem=52
-:content: "\r\n\n<p>It can be seen that the number, 125874, and its double, 251748,
-  contain exactly the same digits, but in a different order.</p>\n<p>Find the smallest
-  positive integer, <i>x</i>, such that 2<i>x</i>, 3<i>x</i>, 4<i>x</i>, 5<i>x</i>,
-  and 6<i>x</i>, contain the same digits.</p>\n\r\n"
+:content: |+
+  It can be seen that the number, 125874, and its double, 251748, contain exactly the same digits, but in a different order.
+
+  Find the smallest positive integer, _x_, such that 2_x_, 3_x_, 4_x_, 5_x_, and 6_x_, contain the same digits.
+

data/data/problems/53.yml

@@ -2,27 +2,18 @@
 :id: 53
 :name: Combinatoric selections
 :url: http://projecteuler.net/problem=53
-:content: "\r\n<p>There are exactly ten ways of selecting three from five, 12345:</p>\r\n<p
-  style=\"text-align:center;\">123, 124, 125, 134, 135, 145, 234, 235, 245, and 345</p>\r\n<p>In
-  combinatorics, we use the notation, <sup>5</sup>C<sub>3</sub> = 10.</p>\r\n<p>In
-  general,</p>\r\n<div style=\"text-align:center;\">\r\n<table><tr>\n<td>\n<sup><var>n</var></sup>C<sub><var>r</var></sub>
-  = </td>\r\n<td><div style=\"text-align:center;\">\n<var>n</var>!<br><span style=\"border-top:1px
-  solid #000;\"><var>r</var>!(<var>n<img src=\"images/symbol_minus.gif\" width=\"9\"
-  height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">r</var>)!</span>\n</div></td>\r\n<td>,where
-  <var>r</var> <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>n</var>, <var>n</var>! = <var>n</var><img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">(<var>n</var><img src=\"images/symbol_minus.gif\"
-  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">1)<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">...<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">3<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">2<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">1, and 0! = 1.</td>\r\n</tr></table>\n</div>\r\n<p>It
-  is not until <var>n</var> = 23, that a value exceeds one-million: <sup>23</sup>C<sub>10</sub>
-  = 1144066.</p>\r\n<p>How many, not necessarily distinct, values of  <sup><var>n</var></sup>C<sub><var>r</var></sub>,
-  for 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>n</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  100, are greater than one-million?</p>\r\n\r\n"
+:content: "There are exactly ten ways of selecting three from five, 12345:\n\n123,
+  124, 125, 134, 135, 145, 234, 235, 245, and 345\n\nIn combinatorics, we use the
+  notation, <sup>5</sup>C<sub>3</sub> = 10.\n\nIn general,\n\n| <sup><var>n</var></sup>C<sub><var>r</var></sub>
+  = | \n<var>n</var>!  \n<var>r</var>!(<var>n<img src=\"%7B%7B%20images_dir%20%7D%7D/symbol_minus.gif\"
+  width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">r</var>)!\n
+  | ,where <var>r</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>n</var>, <var>n</var>! = <var>n</var> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)(<var>n</var>
+  ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)1) ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)...
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)2
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)1, and
+  0! = 1. |\n\nIt is not until <var>n</var> = 23, that a value exceeds one-million:
+  <sup>23</sup>C<sub>10</sub> = 1144066.\n\nHow many, not necessarily distinct, values
+  of  <sup><var>n</var></sup>C<sub><var>r</var></sub>, for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>n</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  100, are greater than one-million?\n\n"

data/data/problems/54.yml

@@ -2,42 +2,32 @@
 :id: 54
 :name: Poker hands
 :url: http://projecteuler.net/problem=54
-:content: "\r\n<p>In the card game poker, a hand consists of five cards and are ranked,
-  from lowest to highest, in the following way:</p>\r\n<ul>\n<li>\n<b>High Card</b>:
-  Highest value card.</li>\r\n<li>\n<b>One Pair</b>: Two cards of the same value.</li>\r\n<li>\n<b>Two
-  Pairs</b>: Two different pairs.</li>\r\n<li>\n<b>Three of a Kind</b>: Three cards
-  of the same value.</li>\r\n<li>\n<b>Straight</b>: All cards are consecutive values.</li>\r\n<li>\n<b>Flush</b>:
-  All cards of the same suit.</li>\r\n<li>\n<b>Full House</b>: Three of a kind and
-  a pair.</li>\r\n<li>\n<b>Four of a Kind</b>: Four cards of the same value.</li>\r\n<li>\n<b>Straight
-  Flush</b>: All cards are consecutive values of same suit.</li>\r\n<li>\n<b>Royal
-  Flush</b>: Ten, Jack, Queen, King, Ace, in same suit.</li>\r\n</ul>\n<p>The cards
-  are valued in the order:<br>2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King, Ace.</p>\r\n<p>If
-  two players have the same ranked hands then the rank made up of the highest value
-  wins; for example, a pair of eights beats a pair of fives (see example 1 below).
-  But if two ranks tie, for example, both players have a pair of queens, then highest
-  cards in each hand are compared (see example 4 below); if the highest cards tie
-  then the next highest cards are compared, and so on.</p>\r\n<p>Consider the following
-  five hands dealt to two players:</p>\r\n<div style=\"text-align:center;\">\r\n<table>\n<tr>\n<td><b>Hand</b></td>\n<td> </td>\n<td><b>Player
-  1</b></td>\n<td> </td>\n<td><b>Player 2</b></td>\n<td> </td>\n<td><b>Winner</b></td>\r\n</tr>\n<tr>\n<td
-  style=\"vertical-align:top;\"><b>1</b></td>\n<td> </td>\n<td>5H 5C 6S 7S KD<br><div
-  class=\"note\">Pair of Fives</div>\n</td>\n<td> </td>\n<td>2C 3S 8S 8D TD<br><div
-  class=\"note\">Pair of Eights</div>\n</td>\n<td> </td>\n<td style=\"vertical-align:top;\">Player
-  2</td>\r\n</tr>\n<tr>\n<td style=\"vertical-align:top;\"><b>2</b></td>\n<td> </td>\n<td>5D
-  8C 9S JS AC<br><div class=\"note\">Highest card Ace</div>\n</td>\n<td> </td>\n<td>2C
-  5C 7D 8S QH<br><div class=\"note\">Highest card Queen</div>\n</td>\n<td> </td>\n<td
-  style=\"vertical-align:top;\">Player 1</td>\r\n</tr>\n<tr>\n<td style=\"vertical-align:top;\"><b>3</b></td>\n<td> </td>\n<td>2D
-  9C AS AH AC<br><div class=\"note\">Three Aces</div>\n</td>\n<td> </td>\n<td>3D 6D
-  7D TD QD<br><div class=\"note\">Flush  with Diamonds</div>\n</td>\n<td> </td>\n<td
-  style=\"vertical-align:top;\">Player 2</td>\r\n</tr>\n<tr>\n<td style=\"vertical-align:top;\"><b>4</b></td>\n<td> </td>\n<td>4D
-  6S 9H QH QC<br><div class=\"note\">Pair of Queens<br>Highest card Nine</div>\n</td>\n<td> </td>\n<td>3D
-  6D 7H QD QS<br><div class=\"note\">Pair of Queens<br>Highest card Seven</div>\n</td>\n<td> </td>\n<td
-  style=\"vertical-align:top;\">Player 1</td>\r\n</tr>\n<tr>\n<td style=\"vertical-align:top;\"><b>5</b></td>\n<td> </td>\n<td>2H
-  2D 4C 4D 4S<br><div class=\"note\">Full House<br>With Three Fours</div>\n</td>\n<td> </td>\n<td>3C
-  3D 3S 9S 9D<br><div class=\"note\">Full House<br>with Three Threes</div>\n</td>\n<td> </td>\n<td
-  style=\"vertical-align:top;\">Player 1</td>\r\n</tr>\n</table>\n</div>\r\n<p>The
-  file, <a href=\"project/poker.txt\">poker.txt</a>, contains one-thousand random
-  hands dealt to two players. Each line of the file contains ten cards (separated
-  by a single space): the first five are Player 1's cards and the last five are Player
-  2's cards. You can assume that all hands are valid (no invalid characters or repeated
-  cards), each player's hand is in no specific order, and in each hand there is a
-  clear winner.</p>\r\n<p>How many hands does Player 1 win?</p>\r\n"
+:content: "In the card game poker, a hand consists of five cards and are ranked, from
+  lowest to highest, in the following way:\n\n- **High Card** : Highest value card.\n-
+  **One Pair** : Two cards of the same value.\n- **Two Pairs** : Two different pairs.\n-
+  **Three of a Kind** : Three cards of the same value.\n- **Straight** : All cards
+  are consecutive values.\n- **Flush** : All cards of the same suit.\n- **Full House**
+  : Three of a kind and a pair.\n- **Four of a Kind** : Four cards of the same value.\n-
+  **Straight Flush** : All cards are consecutive values of same suit.\n- **Royal Flush**
+  : Ten, Jack, Queen, King, Ace, in same suit.\n\nThe cards are valued in the order:
+  \ \n2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King, Ace.\n\nIf two players have the
+  same ranked hands then the rank made up of the highest value wins; for example,
+  a pair of eights beats a pair of fives (see example 1 below). But if two ranks tie,
+  for example, both players have a pair of queens, then highest cards in each hand
+  are compared (see example 4 below); if the highest cards tie then the next highest
+  cards are compared, and so on.\n\nConsider the following five hands dealt to two
+  players:\n\n| **Hand** |   | **Player 1** |   | **Player 2** |   | **Winner** |\n|
+  **1** |   | 5H 5C 6S 7S KD  \n\nPair of Fives\n |   | 2C 3S 8S 8D TD  \n\nPair of
+  Eights\n |   | Player 2 |\n| **2** |   | 5D 8C 9S JS AC  \n\nHighest card Ace\n
+  |   | 2C 5C 7D 8S QH  \n\nHighest card Queen\n |   | Player 1 |\n| **3** |   | 2D
+  9C AS AH AC  \n\nThree Aces\n |   | 3D 6D 7D TD QD  \n\nFlush with Diamonds\n |
+    | Player 2 |\n| **4** |   | 4D 6S 9H QH QC  \n\nPair of Queens  \nHighest card
+  Nine\n |   | 3D 6D 7H QD QS  \n\nPair of Queens  \nHighest card Seven\n |   | Player
+  1 |\n| **5** |   | 2H 2D 4C 4D 4S  \n\nFull House  \nWith Three Fours\n |   | 3C
+  3D 3S 9S 9D  \n\nFull House  \nwith Three Threes\n |   | Player 1 |\n\nThe file,
+  [poker.txt](project/poker.txt), contains one-thousand random hands dealt to two
+  players. Each line of the file contains ten cards (separated by a single space):
+  the first five are Player 1's cards and the last five are Player 2's cards. You
+  can assume that all hands are valid (no invalid characters or repeated cards), each
+  player's hand is in no specific order, and in each hand there is a clear winner.\n\nHow
+  many hands does Player 1 win?\n\n"

data/data/problems/55.yml

@@ -2,20 +2,19 @@
 :id: 55
 :name: Lychrel numbers
 :url: http://projecteuler.net/problem=55
-:content: "\r\n<p>If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.</p>\r\n<p>Not
-  all numbers produce palindromes so quickly. For example,</p>\r\n<p style=\"margin-left:50px;\">349
-  + 943 = 1292,<br>\r\n1292 + 2921 = 4213<br>\r\n4213 + 3124 = 7337</p>\r\n<p>That
-  is, 349 took three iterations to arrive at a palindrome.</p>\r\n<p>Although no one
-  has proved it yet, it is thought that some numbers, like 196, never produce a palindrome.
-  A number that never forms a palindrome through the reverse and add process is called
-  a Lychrel number. Due to the theoretical nature of these numbers, and for the purpose
-  of this problem, we shall assume that a number is Lychrel until proven otherwise.
-  In addition you are given that for every number below ten-thousand, it will either
-  (i) become a palindrome in less than fifty iterations, or, (ii) no one, with all
-  the computing power that exists, has managed so far to map it to a palindrome. In
-  fact, 10677 is the first number to be shown to require over fifty iterations before
-  producing a palindrome: 4668731596684224866951378664 (53 iterations, 28-digits).</p>\r\n<p>Surprisingly,
-  there are palindromic numbers that are themselves Lychrel numbers; the first example
-  is 4994.</p>\r\n<p>How many Lychrel numbers are there below ten-thousand?</p>\r\n<p
-  class=\"note\">NOTE: Wording was modified slightly on 24 April 2007 to emphasise
-  the theoretical nature of Lychrel numbers.</p>\r\n"
+:content: "If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.\n\nNot
+  all numbers produce palindromes so quickly. For example,\n\n349 + 943 = 1292,  \n\r1292
+  + 2921 = 4213  \n\r4213 + 3124 = 7337\n\nThat is, 349 took three iterations to arrive
+  at a palindrome.\n\nAlthough no one has proved it yet, it is thought that some numbers,
+  like 196, never produce a palindrome. A number that never forms a palindrome through
+  the reverse and add process is called a Lychrel number. Due to the theoretical nature
+  of these numbers, and for the purpose of this problem, we shall assume that a number
+  is Lychrel until proven otherwise. In addition you are given that for every number
+  below ten-thousand, it will either (i) become a palindrome in less than fifty iterations,
+  or, (ii) no one, with all the computing power that exists, has managed so far to
+  map it to a palindrome. In fact, 10677 is the first number to be shown to require
+  over fifty iterations before producing a palindrome: 4668731596684224866951378664
+  (53 iterations, 28-digits).\n\nSurprisingly, there are palindromic numbers that
+  are themselves Lychrel numbers; the first example is 4994.\n\nHow many Lychrel numbers
+  are there below ten-thousand?\n\nNOTE: Wording was modified slightly on 24 April
+  2007 to emphasise the theoretical nature of Lychrel numbers.\n\n"

data/data/problems/56.yml

@@ -2,10 +2,8 @@
 :id: 56
 :name: Powerful digit sum
 :url: http://projecteuler.net/problem=56
-:content: "\r\n\n<p>A googol (10<sup>100</sup>) is a massive number: one followed
-  by one-hundred zeros; 100<sup>100</sup> is almost unimaginably large: one followed
-  by two-hundred zeros. Despite their size, the sum of the digits in each number is
-  only 1.</p>\n<p>Considering natural numbers of the form, <i>a<sup>b</sup></i>, where
-  <i>a, b</i> <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  border=\"0\" style=\"vertical-align:middle;\"> 100, what is the maximum digital
-  sum?</p>\n\r\n"
+:content: |+
+  A googol (10<sup>100</sup>) is a massive number: one followed by one-hundred zeros; 100<sup>100</sup> is almost unimaginably large: one followed by two-hundred zeros. Despite their size, the sum of the digits in each number is only 1.
+
+  Considering natural numbers of the form, _a<sup>b</sup>_, where _a, b_ ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 100, what is the maximum digital sum?
+

data/data/problems/57.yml

@@ -2,14 +2,13 @@
 :id: 57
 :name: Square root convergents
 :url: http://projecteuler.net/problem=57
-:content: "\r\n<p>It is possible to show that the square root of two can be expressed
-  as an infinite continued fraction.</p>\r\n<p style=\"text-align:center;\"><img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">
-  2 = 1 + 1/(2 + 1/(2 + 1/(2 + ... ))) = 1.414213...</p>\r\n<p>By expanding this for
-  the first four iterations, we get:</p>\r\n<p>1 + 1/2 = 3/2 = 1.5<br>\r\n1 + 1/(2
-  + 1/2) = 7/5 = 1.4<br>\r\n1 + 1/(2 + 1/(2 + 1/2)) = 17/12 = 1.41666...<br>\r\n1
-  + 1/(2 + 1/(2 + 1/(2 + 1/2))) = 41/29 = 1.41379...<br></p>\r\n<p>The next three
-  expansions are 99/70, 239/169, and 577/408, but the eighth expansion, 1393/985,
-  is the first example where the number of digits in the numerator exceeds the number
-  of digits in the denominator.</p>\r\n<p>In the first one-thousand expansions, how
-  many fractions contain a numerator with more digits than denominator?</p>\r\n\r\n"
+:content: "It is possible to show that the square root of two can be expressed as
+  an infinite continued fraction.\n\n![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)
+  2 = 1 + 1/(2 + 1/(2 + 1/(2 + ... ))) = 1.414213...\n\nBy expanding this for the
+  first four iterations, we get:\n\n1 + 1/2 = 3/2 = 1.5  \n\r1 + 1/(2 + 1/2) = 7/5
+  = 1.4  \n\r1 + 1/(2 + 1/(2 + 1/2)) = 17/12 = 1.41666...  \n\r1 + 1/(2 + 1/(2 + 1/(2
+  + 1/2))) = 41/29 = 1.41379...\n\nThe next three expansions are 99/70, 239/169, and
+  577/408, but the eighth expansion, 1393/985, is the first example where the number
+  of digits in the numerator exceeds the number of digits in the denominator.\n\nIn
+  the first one-thousand expansions, how many fractions contain a numerator with more
+  digits than denominator?\n\n"

data/data/problems/58.yml

@@ -2,21 +2,14 @@
 :id: 58
 :name: Spiral primes
 :url: http://projecteuler.net/problem=58
-:content: "\r\n<p>Starting with 1 and spiralling anticlockwise in the following way,
-  a square spiral with side length 7 is formed.</p>\r\n<p style=\"text-align:center;font-family:courier
-  new;\"><span style=\"color:#ff0000;font-family:courier new;\"><b>37</b></span> 36
-  35 34 33 32 <span style=\"color:#ff0000;font-family:courier new;\"><b>31</b></span><br>\r\n38
-  <span style=\"color:#ff0000;font-family:courier new;\"><b>17</b></span> 16 15 14
-  <span style=\"color:#ff0000;font-family:courier new;\"><b>13</b></span> 30<br>\r\n39
-  18 <span style=\"color:#ff0000;font-family:courier new;\"> <b>5</b></span>  4 <span
-  style=\"color:#ff0000;font-family:courier new;\"> <b>3</b></span> 12 29<br>\r\n40
-  19  6  1  2 11 28<br>\r\n41 20 <span style=\"color:#ff0000;font-family:courier new;\"> <b>7</b></span>
-   8  9 10 27<br>\r\n42 21 22 23 24 25 26<br><span style=\"color:#ff0000;font-family:courier
-  new;\"><b>43</b></span> 44 45 46 47 48 49</p>\r\n<p>It is interesting to note that
-  the odd squares lie along the bottom right diagonal, but what is more interesting
-  is that 8 out of the 13 numbers lying along both diagonals are prime; that is, a
-  ratio of 8/13 <img src=\"images/symbol_asymp.gif\" width=\"11\" height=\"9\" alt=\"≈\"
-  border=\"0\" style=\"vertical-align:middle;\"> 62%.</p>\r\n<p>If one complete new
-  layer is wrapped around the spiral above, a square spiral with side length 9 will
-  be formed. If this process is continued, what is the side length of the square spiral
-  for which the ratio of primes along both diagonals first falls below 10%?</p>\r\n\r\n"
+:content: "Starting with 1 and spiralling anticlockwise in the following way, a square
+  spiral with side length 7 is formed.\n\n**37** 36 35 34 33 32 **31**  \n\r38 **17**
+  16 15 14 **13** 30  \n\r39 18   **5**  4   **3** 12 29  \n\r40 19  6  1  2 11 28
+  \ \n\r41 20   **7**  8  9 10 27  \n\r42 21 22 23 24 25 26  \n**43** 44 45 46 47
+  48 49\n\nIt is interesting to note that the odd squares lie along the bottom right
+  diagonal, but what is more interesting is that 8 out of the 13 numbers lying along
+  both diagonals are prime; that is, a ratio of 8/13 ![≈](/home/will/src/euler-manager/config/../data/images/symbol_asymp.gif)
+  62%.\n\nIf one complete new layer is wrapped around the spiral above, a square spiral
+  with side length 9 will be formed. If this process is continued, what is the side
+  length of the square spiral for which the ratio of primes along both diagonals first
+  falls below 10%?\n\n"

data/data/problems/59.yml

@@ -2,22 +2,14 @@
 :id: 59
 :name: XOR decryption
 :url: http://projecteuler.net/problem=59
-:content: "\r\n\n<p>Each character on a computer is assigned a unique code and the
-  preferred standard is ASCII (American Standard Code for Information Interchange).
-  For example, uppercase A = 65, asterisk (*) = 42, and lowercase k = 107.</p>\n<p>A
-  modern encryption method is to take a text file, convert the bytes to ASCII, then
-  XOR each byte with a given value, taken from a secret key. The advantage with the
-  XOR function is that using the same encryption key on the cipher text, restores
-  the plain text; for example, 65 XOR 42 = 107, then 107 XOR 42 = 65.</p>\n<p>For
-  unbreakable encryption, the key is the same length as the plain text message, and
-  the key is made up of random bytes. The user would keep the encrypted message and
-  the encryption key in different locations, and without both \"halves\", it is impossible
-  to decrypt the message.</p>\n<p>Unfortunately, this method is impractical for most
-  users, so the modified method is to use a password as a key. If the password is
-  shorter than the message, which is likely, the key is repeated cyclically throughout
-  the message. The balance for this method is using a sufficiently long password key
-  for security, but short enough to be memorable.</p>\n<p>Your task has been made
-  easy, as the encryption key consists of three lower case characters. Using <a href=\"project/cipher1.txt\">cipher1.txt</a>
-  (right click and 'Save Link/Target As...'), a file containing the encrypted ASCII
-  codes, and the knowledge that the plain text must contain common English words,
-  decrypt the message and find the sum of the ASCII values in the original text.</p>\n\r\n"
+:content: |+
+  Each character on a computer is assigned a unique code and the preferred standard is ASCII (American Standard Code for Information Interchange). For example, uppercase A = 65, asterisk (\*) = 42, and lowercase k = 107.
+
+  A modern encryption method is to take a text file, convert the bytes to ASCII, then XOR each byte with a given value, taken from a secret key. The advantage with the XOR function is that using the same encryption key on the cipher text, restores the plain text; for example, 65 XOR 42 = 107, then 107 XOR 42 = 65.
+
+  For unbreakable encryption, the key is the same length as the plain text message, and the key is made up of random bytes. The user would keep the encrypted message and the encryption key in different locations, and without both "halves", it is impossible to decrypt the message.
+
+  Unfortunately, this method is impractical for most users, so the modified method is to use a password as a key. If the password is shorter than the message, which is likely, the key is repeated cyclically throughout the message. The balance for this method is using a sufficiently long password key for security, but short enough to be memorable.
+
+  Your task has been made easy, as the encryption key consists of three lower case characters. Using [cipher1.txt](project/cipher1.txt) (right click and 'Save Link/Target As...'), a file containing the encrypted ASCII codes, and the knowledge that the plain text must contain common English words, decrypt the message and find the sum of the ASCII values in the original text.
+

data/data/problems/6.yml

@@ -2,12 +2,16 @@
 :id: 6
 :name: Sum square difference
 :url: http://projecteuler.net/problem=6
-:content: "\r\n<p>The sum of the squares of the first ten natural numbers is,</p>\r\n<div
-  style=\"text-align:center\">1<sup>2</sup> + 2<sup>2</sup> + ... + 10<sup>2</sup>
-  = 385</div>\r\n<p>The square of the sum of the first ten natural numbers is,</p>\r\n<div
-  style=\"text-align:center\">(1 + 2 + ... + 10)<sup>2</sup> = 55<sup>2</sup> = 3025</div>\r\n<p>Hence
-  the difference between the sum of the squares of the first ten natural numbers and
-  the square of the sum is 3025 <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\"
-  alt=\"−\" border=\"0\" style=\"vertical-align:middle;\"> 385 = 2640.</p>\r\n<p>Find
-  the difference between the sum of the squares of the first one hundred natural numbers
-  and the square of the sum.</p>\r\n\r\n"
+:content: |+
+  The sum of the squares of the first ten natural numbers is,
+
+  1<sup>2</sup> + 2<sup>2</sup> + ... + 10<sup>2</sup> = 385
+
+  The square of the sum of the first ten natural numbers is,
+
+  (1 + 2 + ... + 10)<sup>2</sup> = 55<sup>2</sup> = 3025
+
+  Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif) 385 = 2640.
+
+  Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.
+

data/data/problems/60.yml

@@ -2,9 +2,8 @@
 :id: 60
 :name: Prime pair sets
 :url: http://projecteuler.net/problem=60
-:content: "\r\n\n<p>The primes 3, 7, 109, and 673, are quite remarkable. By taking
-  any two primes and concatenating them in any order the result will always be prime.
-  For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four
-  primes, 792, represents the lowest sum for a set of four primes with this property.</p>\n<p>Find
-  the lowest sum for a set of five primes for which any two primes concatenate to
-  produce another prime.</p>\n\r\n"
+:content: |+
+  The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a set of four primes with this property.
+
+  Find the lowest sum for a set of five primes for which any two primes concatenate to produce another prime.
+

data/data/problems/61.yml

@@ -2,29 +2,21 @@
 :id: 61
 :name: Cyclical figurate numbers
 :url: http://projecteuler.net/problem=61
-:content: "\r\n<p>Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal
-  numbers are all figurate (polygonal) numbers and are generated by the following
-  formulae:</p>\r\n<table>\n<tr>\n<td>Triangle</td>\r\n<td> </td>\r\n<td>P<sub>3,<i>n</i></sub>=<i>n</i>(<i>n</i>+1)/2</td>\r\n<td> </td>\r\n<td>1,
-  3, 6, 10, 15, ...</td>\r\n</tr>\n<tr>\n<td>Square</td>\r\n<td> </td>\r\n<td>P<sub>4,<i>n</i></sub>=<i>n</i><sup>2</sup>\n</td>\r\n<td> </td>\r\n<td>1,
-  4, 9, 16, 25, ...</td>\r\n</tr>\n<tr>\n<td>Pentagonal</td>\r\n<td> </td>\r\n<td>P<sub>5,<i>n</i></sub>=<i>n</i>(3<i>n</i><img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\">1)/2</td>\r\n<td> </td>\r\n<td>1, 5, 12, 22, 35,
-  ...</td>\r\n</tr>\n<tr>\n<td>Hexagonal</td>\r\n<td> </td>\r\n<td>P<sub>6,<i>n</i></sub>=<i>n</i>(2<i>n</i><img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\">1)</td>\r\n<td> </td>\r\n<td>1, 6, 15, 28, 45,
-  ...</td>\r\n</tr>\n<tr>\n<td>Heptagonal</td>\r\n<td> </td>\r\n<td>P<sub>7,<i>n</i></sub>=<i>n</i>(5<i>n</i><img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\">3)/2</td>\r\n<td> </td>\r\n<td>1, 7, 18, 34, 55,
-  ...</td>\r\n</tr>\n<tr>\n<td>Octagonal</td>\r\n<td> </td>\r\n<td>P<sub>8,<i>n</i></sub>=<i>n</i>(3<i>n</i><img
-  src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\" border=\"0\"
-  style=\"vertical-align:middle;\">2)</td>\r\n<td> </td>\r\n<td>1, 8, 21, 40, 65,
-  ...</td>\r\n</tr>\n</table>\n<p>The ordered set of three 4-digit numbers: 8128,
-  2882, 8281, has three interesting properties.</p>\r\n<ol>\n<li>The set is cyclic,
-  in that the last two digits of each number is the first two digits of the next number
-  (including the last number with the first).</li>\r\n<li>Each polygonal type: triangle
-  (P<sub>3,127</sub>=8128), square (P<sub>4,91</sub>=8281), and pentagonal (P<sub>5,44</sub>=2882),
-  is represented by a different number in the set.</li>\r\n<li>This is the only set
-  of 4-digit numbers with this property.</li>\r\n</ol>\n<p>Find the sum of the only
-  ordered set of six cyclic 4-digit numbers for which each polygonal type: triangle,
-  square, pentagonal, hexagonal, heptagonal, and octagonal, is represented by a different
-  number in the set.</p>\r\n\r\n"
+:content: |+
+  Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers are all figurate (polygonal) numbers and are generated by the following formulae:
+
+  | Triangle |   | P<sub>3,<i>n</i></sub>=_n_(_n_+1)/2 |   | 1, 3, 6, 10, 15, ... |
+  | Square |   | P<sub>4,<i>n</i></sub>=_n_<sup>2</sup> |   | 1, 4, 9, 16, 25, ... |
+  | Pentagonal |   | P<sub>5,<i>n</i></sub>=_n_(3_n_ ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)1)/2 |   | 1, 5, 12, 22, 35, ... |
+  | Hexagonal |   | P<sub>6,<i>n</i></sub>=_n_(2_n_ ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)1) |   | 1, 6, 15, 28, 45, ... |
+  | Heptagonal |   | P<sub>7,<i>n</i></sub>=_n_(5_n_ ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)3)/2 |   | 1, 7, 18, 34, 55, ... |
+  | Octagonal |   | P<sub>8,<i>n</i></sub>=_n_(3_n_ ![−](/home/will/src/euler-manager/config/../data/images/symbol_minus.gif)2) |   | 1, 8, 21, 40, 65, ... |
+
+  The ordered set of three 4-digit numbers: 8128, 2882, 8281, has three interesting properties.
+
+  1. The set is cyclic, in that the last two digits of each number is the first two digits of the next number (including the last number with the first).
+  2. Each polygonal type: triangle (P<sub>3,127</sub>=8128), square (P<sub>4,91</sub>=8281), and pentagonal (P<sub>5,44</sub>=2882), is represented by a different number in the set.
+  3. This is the only set of 4-digit numbers with this property.
+
+  Find the sum of the only ordered set of six cyclic 4-digit numbers for which each polygonal type: triangle, square, pentagonal, hexagonal, heptagonal, and octagonal, is represented by a different number in the set.
+

data/data/problems/62.yml

@@ -2,8 +2,8 @@
 :id: 62
 :name: Cubic permutations
 :url: http://projecteuler.net/problem=62
-:content: "\r\n<p>The cube, 41063625 (345<sup>3</sup>), can be permuted to produce
-  two other cubes: 56623104 (384<sup>3</sup>) and 66430125 (405<sup>3</sup>). In fact,
-  41063625 is the smallest cube which has exactly three permutations of its digits
-  which are also cube.</p>\r\n<p>Find the smallest cube for which exactly five permutations
-  of its digits are cube.</p>\r\n\r\n"
+:content: |+
+  The cube, 41063625 (345<sup>3</sup>), can be permuted to produce two other cubes: 56623104 (384<sup>3</sup>) and 66430125 (405<sup>3</sup>). In fact, 41063625 is the smallest cube which has exactly three permutations of its digits which are also cube.
+
+  Find the smallest cube for which exactly five permutations of its digits are cube.
+

data/data/problems/63.yml

@@ -2,6 +2,8 @@
 :id: 63
 :name: Powerful digit counts
 :url: http://projecteuler.net/problem=63
-:content: "\r\n\n<p>The 5-digit number, 16807=7<sup>5</sup>, is also a fifth power.
-  Similarly, the 9-digit number, 134217728=8<sup>9</sup>, is a ninth power.</p>\n<p>How
-  many <i>n</i>-digit positive integers exist which are also an <i>n</i>th power?</p>\n\r\n"
+:content: |+
+  The 5-digit number, 16807=7<sup>5</sup>, is also a fifth power. Similarly, the 9-digit number, 134217728=8<sup>9</sup>, is a ninth power.
+
+  How many _n_-digit positive integers exist which are also an _n_th power?
+