euler-manager 0.0.5 → 0.0.6

data/data/problems/110.yml

@@ -2,18 +2,14 @@
 :id: 110
 :name: Diophantine reciprocals II
 :url: http://projecteuler.net/problem=110
-:content: "\r\n<p>In the following equation <var>x</var>, <var>y</var>, and <var>n</var>
-  are positive integers.</p>\r\n<div style=\"text-align:center;\">\r\n<table align=\"center\"><tr>\n<td><div
-  style=\"text-align:center;\">1<br><img src=\"images/blackdot.gif\" width=\"15\"
-  height=\"1\" alt=\"\"><br><var>x</var>\n</div></td>\r\n<td> + </td>\r\n<td><div
-  style=\"text-align:center;\">1<br><img src=\"images/blackdot.gif\" width=\"15\"
-  height=\"1\" alt=\"\"><br><var>y</var>\n</div></td>\r\n<td> = </td>\r\n<td><div
-  style=\"text-align:center;\">1<br><img src=\"images/blackdot.gif\" width=\"15\"
-  height=\"1\" alt=\"\"><br><var>n</var>\n</div></td>\r\n</tr></table>\n</div>\r\n<p>It
-  can be verified that when <var>n</var> = 1260 there are 113 distinct solutions and
-  this is the least value of <var>n</var> for which the total number of distinct solutions
-  exceeds one hundred.</p>\r\n<p>What is the least value of <var>n</var> for which
-  the number of distinct solutions exceeds four million?</p>\r\n<p class=\"note\">NOTE:
-  This problem is a much more difficult version of <a href=\"problem=108\">Problem
-  108</a> and as it is well beyond the limitations of a brute force approach it requires
-  a clever implementation.</p>\r\n"
+:content: "In the following equation <var>x</var>, <var>y</var>, and <var>n</var>
+  are positive integers.\n\n| \n1  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n <var>x</var>\n | + | \n1  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n <var>y</var>\n | = | \n1  \n ![](/home/will/src/euler-manager/config/../data/images/blackdot.gif)
+  \ \n <var>n</var>\n |\n\nIt can be verified that when <var>n</var> = 1260 there
+  are 113 distinct solutions and this is the least value of <var>n</var> for which
+  the total number of distinct solutions exceeds one hundred.\n\nWhat is the least
+  value of <var>n</var> for which the number of distinct solutions exceeds four million?\n\nNOTE:
+  This problem is a much more difficult version of [Problem 108](problem=108) and
+  as it is well beyond the limitations of a brute force approach it requires a clever
+  implementation.\n\n"

data/data/problems/111.yml

@@ -2,20 +2,30 @@
 :id: 111
 :name: Primes with runs
 :url: http://projecteuler.net/problem=111
-:content: "\r\n<p>Considering 4-digit primes containing repeated digits it is clear
-  that they cannot all be the same: 1111 is divisible by 11, 2222 is divisible by
-  22, and so on. But there are nine 4-digit primes containing three ones:</p>\r\n<p
-  style=\"text-align:center;\">1117, 1151, 1171, 1181, 1511, 1811, 2111, 4111, 8111</p>\r\n<p>We
-  shall say that M(<i>n</i>, <i>d</i>) represents the maximum number of repeated digits
-  for an <i>n</i>-digit prime where <i>d</i> is the repeated digit, N(<i>n</i>, <i>d</i>)
-  represents the number of such primes, and S(<i>n</i>, <i>d</i>) represents the sum
-  of these primes.</p>\r\n<p>So M(4, 1) = 3 is the maximum number of repeated digits
-  for a 4-digit prime where one is the repeated digit, there are N(4, 1) = 9 such
-  primes, and the sum of these primes is S(4, 1) = 22275. It turns out that for <i>d</i>
-  = 0, it is only possible to have M(4, 0) = 2 repeated digits, but there are N(4,
-  0) = 13 such cases.</p>\r\n<p>In the same way we obtain the following results for
-  4-digit primes.</p>\r\n<div style=\"text-align:center;\">\r\n<table align=\"center\"
-  border=\"1\" cellspacing=\"0\" cellpadding=\"5\">\n<tr>\n<td><b>Digit, <i>d</i></b></td>\r\n<td><b>M(4,
-  <i>d</i>)</b></td>\r\n<td><b>N(4, <i>d</i>)</b></td>\r\n<td><b>S(4, <i>d</i>)</b></td>\r\n</tr>\n<tr>\n<td>0</td>\r\n<td>2</td>\r\n<td>13</td>\r\n<td>67061</td>\r\n</tr>\n<tr>\n<td>1</td>\r\n<td>3</td>\r\n<td>9</td>\r\n<td>22275</td>\r\n</tr>\n<tr>\n<td>2</td>\r\n<td>3</td>\r\n<td>1</td>\r\n<td>2221</td>\r\n</tr>\n<tr>\n<td>3</td>\r\n<td>3</td>\r\n<td>12</td>\r\n<td>46214</td>\r\n</tr>\n<tr>\n<td>4</td>\r\n<td>3</td>\r\n<td>2</td>\r\n<td>8888</td>\r\n</tr>\n<tr>\n<td>5</td>\r\n<td>3</td>\r\n<td>1</td>\r\n<td>5557</td>\r\n</tr>\n<tr>\n<td>6</td>\r\n<td>3</td>\r\n<td>1</td>\r\n<td>6661</td>\r\n</tr>\n<tr>\n<td>7</td>\r\n<td>3</td>\r\n<td>9</td>\r\n<td>57863</td>\r\n</tr>\n<tr>\n<td>8</td>\r\n<td>3</td>\r\n<td>1</td>\r\n<td>8887</td>\r\n</tr>\n<tr>\n<td>9</td>\r\n<td>3</td>\r\n<td>7</td>\r\n<td>48073</td>\r\n</tr>\n</table>\n</div>\r\n<p>For
-  <i>d</i> = 0 to 9, the sum of all S(4, <i>d</i>) is 273700.</p>\r\n<p>Find the sum
-  of all S(10, <i>d</i>).</p>\r\n\r\n"
+:content: |+
+  Considering 4-digit primes containing repeated digits it is clear that they cannot all be the same: 1111 is divisible by 11, 2222 is divisible by 22, and so on. But there are nine 4-digit primes containing three ones:
+
+  1117, 1151, 1171, 1181, 1511, 1811, 2111, 4111, 8111
+
+  We shall say that M(_n_, _d_) represents the maximum number of repeated digits for an _n_-digit prime where _d_ is the repeated digit, N(_n_, _d_) represents the number of such primes, and S(_n_, _d_) represents the sum of these primes.
+
+  So M(4, 1) = 3 is the maximum number of repeated digits for a 4-digit prime where one is the repeated digit, there are N(4, 1) = 9 such primes, and the sum of these primes is S(4, 1) = 22275. It turns out that for _d_ = 0, it is only possible to have M(4, 0) = 2 repeated digits, but there are N(4, 0) = 13 such cases.
+
+  In the same way we obtain the following results for 4-digit primes.
+
+  | **Digit, _d_** | **M(4, _d_)** | **N(4, _d_)** | **S(4, _d_)** |
+  | 0 | 2 | 13 | 67061 |
+  | 1 | 3 | 9 | 22275 |
+  | 2 | 3 | 1 | 2221 |
+  | 3 | 3 | 12 | 46214 |
+  | 4 | 3 | 2 | 8888 |
+  | 5 | 3 | 1 | 5557 |
+  | 6 | 3 | 1 | 6661 |
+  | 7 | 3 | 9 | 57863 |
+  | 8 | 3 | 1 | 8887 |
+  | 9 | 3 | 7 | 48073 |
+
+  For _d_ = 0 to 9, the sum of all S(4, _d_) is 273700.
+
+  Find the sum of all S(10, _d_).
+

data/data/problems/112.yml

@@ -2,14 +2,16 @@
 :id: 112
 :name: Bouncy numbers
 :url: http://projecteuler.net/problem=112
-:content: "\r\n<p>Working from left-to-right if no digit is exceeded by the digit
-  to its left it is called an increasing number; for example, 134468.</p>\r\n<p>Similarly
-  if no digit is exceeded by the digit to its right it is called a decreasing number;
-  for example, 66420.</p>\r\n<p>We shall call a positive integer that is neither increasing
-  nor decreasing a \"bouncy\" number; for example, 155349.</p>\r\n<p>Clearly there
-  cannot be any bouncy numbers below one-hundred, but just over half of the numbers
-  below one-thousand (525) are bouncy. In fact, the least number for which the proportion
-  of bouncy numbers first reaches 50% is 538.</p>\r\n<p>Surprisingly, bouncy numbers
-  become more and more common and by the time we reach 21780 the proportion of bouncy
-  numbers is equal to 90%.</p>\r\n<p>Find the least number for which the proportion
-  of bouncy numbers is exactly 99%.</p>\r\n\r\n"
+:content: |+
+  Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number; for example, 134468.
+
+  Similarly if no digit is exceeded by the digit to its right it is called a decreasing number; for example, 66420.
+
+  We shall call a positive integer that is neither increasing nor decreasing a "bouncy" number; for example, 155349.
+
+  Clearly there cannot be any bouncy numbers below one-hundred, but just over half of the numbers below one-thousand (525) are bouncy. In fact, the least number for which the proportion of bouncy numbers first reaches 50% is 538.
+
+  Surprisingly, bouncy numbers become more and more common and by the time we reach 21780 the proportion of bouncy numbers is equal to 90%.
+
+  Find the least number for which the proportion of bouncy numbers is exactly 99%.
+

data/data/problems/113.yml

@@ -2,12 +2,14 @@
 :id: 113
 :name: Non-bouncy numbers
 :url: http://projecteuler.net/problem=113
-:content: "\r\n\n<p>Working from left-to-right if no digit is exceeded by the digit
-  to its left it is called an increasing number; for example, 134468.</p>\n<p>Similarly
-  if no digit is exceeded by the digit to its right it is called a decreasing number;
-  for example, 66420.</p>\n<p>We shall call a positive integer that is neither increasing
-  nor decreasing a \"bouncy\" number; for example, 155349.</p>\n<p>As <i>n</i> increases,
-  the proportion of bouncy numbers below <i>n</i> increases such that there are only
-  12951 numbers below one-million that are not bouncy and only 277032 non-bouncy numbers
-  below 10<sup>10</sup>.</p>\n<p>How many numbers below a googol (10<sup>100</sup>)
-  are not bouncy?</p>\n\r\n"
+:content: |+
+  Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number; for example, 134468.
+
+  Similarly if no digit is exceeded by the digit to its right it is called a decreasing number; for example, 66420.
+
+  We shall call a positive integer that is neither increasing nor decreasing a "bouncy" number; for example, 155349.
+
+  As _n_ increases, the proportion of bouncy numbers below _n_ increases such that there are only 12951 numbers below one-million that are not bouncy and only 277032 non-bouncy numbers below 10<sup>10</sup>.
+
+  How many numbers below a googol (10<sup>100</sup>) are not bouncy?
+

data/data/problems/114.yml

@@ -2,105 +2,51 @@
 :id: 114
 :name: Counting block combinations I
 :url: http://projecteuler.net/problem=114
-:content: "\r\n<p>A row measuring seven units in length has red blocks with a minimum
-  length of three units placed on it, such that any two red blocks (which are allowed
-  to be different lengths) are separated by at least one black square. There are exactly
-  seventeen ways of doing this.</p>\r\n\r\n<table cellpadding=\"5\" cellspacing=\"1\"
-  border=\"0\" align=\"center\">\n<tr>\n<td>\r\n<table cellspacing=\"1\" cellpadding=\"0\"
-  border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"1\" cellpadding=\"0\" border=\"1\"><tr>\n<td colspan=\"3\" style=\"background-color:#cc0000\"><img
-  src=\"images/spacer.gif\" width=\"66\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"1\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"3\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"66\" height=\"20\"
-  alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n</tr>\n<tr>\n<td>\r\n<table
-  cellspacing=\"1\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"3\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"66\" height=\"20\"
-  alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"1\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"3\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"66\" height=\"20\"
-  alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"1\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"3\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"66\" height=\"20\"
-  alt=\"\"></td>\r\n</tr></table>\n</td>\r\n</tr>\n<tr>\n<td>\r\n<table cellspacing=\"1\"
-  cellpadding=\"0\" border=\"1\"><tr>\n<td colspan=\"3\" style=\"background-color:#cc0000\"><img
-  src=\"images/spacer.gif\" width=\"66\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"3\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"66\" height=\"20\"
-  alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table cellspacing=\"1\" cellpadding=\"0\"
-  border=\"1\"><tr>\n<td colspan=\"4\" style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\"
-  width=\"89\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"1\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"4\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"89\" height=\"20\"
-  alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n</tr>\n<tr>\n<td>\r\n<table
-  cellspacing=\"1\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"4\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"89\" height=\"20\"
-  alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"1\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"4\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"89\" height=\"20\"
-  alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table cellspacing=\"1\" cellpadding=\"0\"
-  border=\"1\"><tr>\n<td colspan=\"5\" style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\"
-  width=\"112\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n</tr>\n<tr>\n<td>\r\n<table
-  cellspacing=\"1\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"5\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"112\"
-  height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"1\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"5\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"112\"
-  height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table cellspacing=\"1\"
-  cellpadding=\"0\" border=\"1\"><tr>\n<td colspan=\"6\" style=\"background-color:#cc0000\"><img
-  src=\"images/spacer.gif\" width=\"135\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n</tr>\n<tr>\n<td>\r\n<table
-  cellspacing=\"1\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"6\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"135\"
-  height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table cellspacing=\"1\"
-  cellpadding=\"0\" border=\"1\"><tr>\n<td colspan=\"7\" style=\"background-color:#cc0000\"><img
-  src=\"images/spacer.gif\" width=\"158\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td> </td>\r\n</tr>\n</table>\n<p>How
-  many ways can a row measuring fifty units in length be filled?</p>\r\n<p class=\"note\">NOTE:
+:content: "A row measuring seven units in length has red blocks with a minimum length
+  of three units placed on it, such that any two red blocks (which are allowed to
+  be different lengths) are separated by at least one black square. There are exactly
+  seventeen ways of doing this.\n\n| \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n |\n| \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n |\n| \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) |\n\n | \n\n|
+  ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n |\n| \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) |\n\n | \n\n|
+  ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n |\n| \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) |\n\n |\n|
+  \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n |   |\n\nHow many ways can a row measuring fifty units in length be filled?\n\nNOTE:
   Although the example above does not lend itself to the possibility, in general it
   is permitted to mix block sizes. For example, on a row measuring eight units in
-  length you could use red (3), black (1), and red (4).</p>\r\n"
+  length you could use red (3), black (1), and red (4).\n\n"

data/data/problems/115.yml

@@ -2,15 +2,18 @@
 :id: 115
 :name: Counting block combinations II
 :url: http://projecteuler.net/problem=115
-:content: "\r\n<p class=\"note\">NOTE: This is a more difficult version of <a href=\"problem=114\">Problem
-  114</a>.</p>\r\n<p>A row measuring <i>n</i> units in length has red blocks with
-  a minimum length of <i>m</i> units placed on it, such that any two red blocks (which
-  are allowed to be different lengths) are separated by at least one black square.</p>\r\n<p>Let
-  the fill-count function, F(<i>m</i>, <i>n</i>), represent the number of ways that
-  a row can be filled.</p>\r\n<p>For example, F(3, 29) = 673135 and F(3, 30) = 1089155.</p>\r\n<p>That
-  is, for <i>m</i> = 3, it can be seen that <i>n</i> = 30 is the smallest value for
-  which the fill-count function first exceeds one million.</p>\r\n<p>In the same way,
-  for <i>m</i> = 10, it can be verified that F(10, 56) = 880711 and F(10, 57) = 1148904,
-  so <i>n</i> = 57 is the least value for which the fill-count function first exceeds
-  one million.</p>\r\n<p>For <i>m</i> = 50, find the least value of <i>n</i> for which
-  the fill-count function first exceeds one million.</p>\r\n\r\n"
+:content: |+
+  NOTE: This is a more difficult version of [Problem 114](problem=114).
+
+  A row measuring _n_ units in length has red blocks with a minimum length of _m_ units placed on it, such that any two red blocks (which are allowed to be different lengths) are separated by at least one black square.
+
+  Let the fill-count function, F(_m_, _n_), represent the number of ways that a row can be filled.
+
+  For example, F(3, 29) = 673135 and F(3, 30) = 1089155.
+
+  That is, for _m_ = 3, it can be seen that _n_ = 30 is the smallest value for which the fill-count function first exceeds one million.
+
+  In the same way, for _m_ = 10, it can be verified that F(10, 56) = 880711 and F(10, 57) = 1148904, so _n_ = 57 is the least value for which the fill-count function first exceeds one million.
+
+  For _m_ = 50, find the least value of _n_ for which the fill-count function first exceeds one million.
+

data/data/problems/116.yml

@@ -2,75 +2,36 @@
 :id: 116
 :name: Red, green or blue tiles
 :url: http://projecteuler.net/problem=116
-:content: "\r\n<p>A row of five black square tiles is to have a number of its tiles
-  replaced with coloured oblong tiles chosen from red (length two), green (length
-  three), or blue (length four).</p>\r\n<p>If red tiles are chosen there are exactly
-  seven ways this can be done.</p>\r\n\r\n<table cellpadding=\"10\" cellspacing=\"0\"
-  border=\"0\" align=\"center\">\n<tr>\n<td>\r\n<table cellspacing=\"2\" cellpadding=\"0\"
-  border=\"1\"><tr>\n<td colspan=\"2\" style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\"
-  width=\"44\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"2\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"2\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"44\" height=\"20\"
-  alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"2\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"2\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"44\" height=\"20\"
-  alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"2\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"2\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"44\" height=\"20\"
-  alt=\"\"></td>\r\n</tr></table>\n</td>\r\n</tr>\n<tr>\n<td>\r\n<table cellspacing=\"2\"
-  cellpadding=\"0\" border=\"1\"><tr>\n<td colspan=\"2\" style=\"background-color:#cc0000\"><img
-  src=\"images/spacer.gif\" width=\"44\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"2\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"44\" height=\"20\"
-  alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"2\" cellpadding=\"0\" border=\"1\"><tr>\n<td colspan=\"2\" style=\"background-color:#cc0000\"><img
-  src=\"images/spacer.gif\" width=\"44\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"2\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"44\" height=\"20\"
-  alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table cellspacing=\"2\" cellpadding=\"0\"
-  border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"2\" style=\"background-color:#cc0000\"><img
-  src=\"images/spacer.gif\" width=\"44\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"2\"
-  style=\"background-color:#cc0000\"><img src=\"images/spacer.gif\" width=\"44\" height=\"20\"
-  alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td> </td>\r\n</tr>\n</table>\n<p>If green
-  tiles are chosen there are three ways.</p>\r\n\r\n<table cellpadding=\"10\" cellspacing=\"0\"
-  border=\"0\" align=\"center\"><tr>\n<td>\r\n<table cellspacing=\"2\" cellpadding=\"0\"
-  border=\"1\"><tr>\n<td colspan=\"3\" style=\"background-color:#00cc00\"><img src=\"images/spacer.gif\"
-  width=\"68\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"2\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"3\"
-  style=\"background-color:#00cc00\"><img src=\"images/spacer.gif\" width=\"68\" height=\"20\"
-  alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"2\" cellpadding=\"0\" border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"3\"
-  style=\"background-color:#00cc00\"><img src=\"images/spacer.gif\" width=\"68\" height=\"20\"
-  alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td> </td>\r\n</tr></table>\n<p>And if
-  blue tiles are chosen there are two ways.</p>\r\n\r\n<table cellpadding=\"10\" cellspacing=\"0\"
-  border=\"0\" align=\"center\"><tr>\n<td>\r\n<table cellspacing=\"2\" cellpadding=\"0\"
-  border=\"1\"><tr>\n<td style=\"background-color:#000000\"><img src=\"images/spacer.gif\"
-  width=\"20\" height=\"20\" alt=\"\"></td>\r\n<td colspan=\"4\" style=\"background-color:#0000cc\"><img
-  src=\"images/spacer.gif\" width=\"92\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n<td>\r\n<table
-  cellspacing=\"2\" cellpadding=\"0\" border=\"1\"><tr>\n<td colspan=\"4\" style=\"background-color:#0000cc\"><img
-  src=\"images/spacer.gif\" width=\"92\" height=\"20\" alt=\"\"></td>\r\n<td style=\"background-color:#000000\"><img
-  src=\"images/spacer.gif\" width=\"20\" height=\"20\" alt=\"\"></td>\r\n</tr></table>\n</td>\r\n</tr></table>\n<p>Assuming
-  that colours cannot be mixed there are 7 + 3 + 2 = 12 ways of replacing the black
-  tiles in a row measuring five units in length.</p>\r\n<p>How many different ways
-  can the black tiles in a row measuring fifty units in length be replaced if colours
-  cannot be mixed and at least one coloured tile must be used?</p>\r\n<p class=\"note\">NOTE:
-  This is related to <a href=\"problem=117\">Problem 117</a>.</p>\r\n"
+:content: "A row of five black square tiles is to have a number of its tiles replaced
+  with coloured oblong tiles chosen from red (length two), green (length three), or
+  blue (length four).\n\nIf red tiles are chosen there are exactly seven ways this
+  can be done.\n\n| \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) |\n\n | \n\n|
+  ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) |\n\n | \n\n|
+  ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n |\n| \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n |   |\n\nIf green tiles are chosen there are three ways.\n\n| \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n | \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n |   |\n\nAnd if blue tiles are chosen there are two ways.\n\n| \n\n| ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) |\n\n | \n\n|
+  ![](/home/will/src/euler-manager/config/../data/images/spacer.gif) | ![](/home/will/src/euler-manager/config/../data/images/spacer.gif)
+  |\n\n |\n\nAssuming that colours cannot be mixed there are 7 + 3 + 2 = 12 ways of
+  replacing the black tiles in a row measuring five units in length.\n\nHow many different
+  ways can the black tiles in a row measuring fifty units in length be replaced if
+  colours cannot be mixed and at least one coloured tile must be used?\n\nNOTE: This
+  is related to [Problem 117](problem=117).\n\n"