euler-manager 0.0.5 → 0.0.6

data/data/problems/338.yml

@@ -2,40 +2,30 @@
 :id: 338
 :name: Cutting Rectangular Grid Paper
 :url: http://projecteuler.net/problem=338
-:content: "\r\n<p>A rectangular sheet of grid paper with integer dimensions <var>w</var>
-  <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>h</var> is given. Its grid spacing is 1.<br>\r\nWhen
-  we cut the sheet along the grid lines into two pieces and rearrange those pieces
-  without overlap, we can make new rectangles with different dimensions.</p>\r\n<p>For
-  example, from a sheet with dimensions 9 <img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 4 , we can
-  make rectangles with dimensions 18 <img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 2, 12 <img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 3 and 6 <img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 6 by cutting
-  and rearranging as below:</p>\r\n\r\n<div align=\"center\">\r\n<img src=\"project/images/p_338_gridpaper.gif\"><br>\n</div>\r\n\r\n<p>Similarly,
-  from a sheet with dimensions 9 <img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 8 , we can
-  make rectangles with dimensions 18 <img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 4 and 12 <img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 6 .</p>\r\n\r\n<p>For a pair <var>w</var> and
-  <var>h</var>, let F(<var>w</var>,<var>h</var>) be the number of distinct rectangles
-  that can be made from a sheet with dimensions <var>w</var> <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><var>h</var>
-  .<br>\r\nFor example, F(2,1) = 0, F(2,2) = 1, F(9,4) = 3 and F(9,8) = 2. <br>\r\nNote
-  that rectangles congruent to the initial one are not counted in F(<var>w</var>,<var>h</var>).<br>\r\nNote
-  also that rectangles with dimensions <var>w</var> <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><var>h</var>
-  and dimensions <var>h</var> <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><var>w</var> are not considered
-  distinct.</p>\r\n\r\n<p>For an integer <var>N</var>, let G(<var>N</var>) be the
-  sum of F(<var>w</var>,<var>h</var>) for all pairs <var>w</var> and <var>h</var>
-  which satisfy 0 <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>h</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>w</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>N</var>.<br>\r\nWe can verify that G(10) =
-  55, G(10<sup>3</sup>) = 971745 and G(10<sup>5</sup>) = 9992617687.</p>\r\n\r\n<p>Find
-  G(10<sup>12</sup>). Give your answer modulo 10<sup>8</sup>.</p>\r\n"
+:content: "A rectangular sheet of grid paper with integer dimensions <var>w</var>
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) <var>h</var>
+  is given. Its grid spacing is 1.  \n\rWhen we cut the sheet along the grid lines
+  into two pieces and rearrange those pieces without overlap, we can make new rectangles
+  with different dimensions.\n\nFor example, from a sheet with dimensions 9 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  4 , we can make rectangles with dimensions 18 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  2, 12 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  3 and 6 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  6 by cutting and rearranging as below:\n\n ![](/home/will/src/euler-manager/config/../data/images/p_338_gridpaper.gif)
+  \ \n\nSimilarly, from a sheet with dimensions 9 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  8 , we can make rectangles with dimensions 18 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  4 and 12 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  6 .\n\nFor a pair <var>w</var> and <var>h</var>, let F(<var>w</var>,<var>h</var>)
+  be the number of distinct rectangles that can be made from a sheet with dimensions
+  <var>w</var> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  <var>h</var> .  \n\rFor example, F(2,1) = 0, F(2,2) = 1, F(9,4) = 3 and F(9,8) =
+  2.   \n\rNote that rectangles congruent to the initial one are not counted in F(<var>w</var>,<var>h</var>).
+  \ \n\rNote also that rectangles with dimensions <var>w</var> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  <var>h</var> and dimensions <var>h</var> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  <var>w</var> are not considered distinct.\n\nFor an integer <var>N</var>, let G(<var>N</var>)
+  be the sum of F(<var>w</var>,<var>h</var>) for all pairs <var>w</var> and <var>h</var>
+  which satisfy 0 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>h</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>w</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>N</var>.  \n\rWe can verify that G(10) = 55, G(10<sup>3</sup>) = 971745 and
+  G(10<sup>5</sup>) = 9992617687.\n\nFind G(10<sup>12</sup>). Give your answer modulo
+  10<sup>8</sup>.\n\n"

data/data/problems/339.yml

@@ -2,16 +2,16 @@
 :id: 339
 :name: Peredur fab Efrawg
 :url: http://projecteuler.net/problem=339
-:content: "\r\n<p>\r\n<i>\"And he came towards a valley, through which ran a river;
-  and the borders of the valley were wooded, and on each side of the river were level
-  meadows. And on one side of the river he saw a flock of white sheep, and on the
-  other a flock of black sheep. And whenever one of the white sheep bleated, one of
-  the black sheep would cross over and become white; and when one of the black sheep
-  bleated, one of the white sheep would cross over and become black.\"</i><br><a href=\"http://en.wikisource.org/wiki/The_Mabinogion/Peredur_the_Son_of_Evrawc\">en.wikisource.org</a>\r\n</p>\r\n<p>\r\n\r\nInitially
+:content: "_\"And he came towards a valley, through which ran a river; and the borders
+  of the valley were wooded, and on each side of the river were level meadows. And
+  on one side of the river he saw a flock of white sheep, and on the other a flock
+  of black sheep. And whenever one of the white sheep bleated, one of the black sheep
+  would cross over and become white; and when one of the black sheep bleated, one
+  of the white sheep would cross over and become black.\"_  \n [en.wikisource.org](http://en.wikisource.org/wiki/The_Mabinogion/Peredur_the_Son_of_Evrawc)\n\nInitially
   each flock consists of <var>n</var> sheep. Each sheep (regardless of colour) is
   equally likely to be the next sheep to bleat. After a sheep has bleated and a sheep
   from the other flock has crossed over, Peredur may remove a number of white sheep
   in order to maximize the expected final number of black sheep. Let E(<var>n</var>)
-  be the expected final number of black sheep if Peredur uses an optimal strategy.\r\n</p>\r\n<p>\r\n\r\nYou
-  are given that E(5) = 6.871346 rounded to 6 places behind the decimal point.<br>\r\nFind
-  E(10 000) and give your answer rounded to 6 places behind the decimal point.\r\n</p>\r\n\r\n\r\n"
+  be the expected final number of black sheep if Peredur uses an optimal strategy.\n\nYou
+  are given that E(5) = 6.871346 rounded to 6 places behind the decimal point.  \n\rFind
+  E(10 000) and give your answer rounded to 6 places behind the decimal point.\n\n"

data/data/problems/34.yml

@@ -2,6 +2,10 @@
 :id: 34
 :name: Digit factorials
 :url: http://projecteuler.net/problem=34
-:content: "\r\n\n<p>145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.</p>\n<p>Find
-  the sum of all numbers which are equal to the sum of the factorial of their digits.</p>\n<p
-  class=\"info\">Note: as 1! = 1 and 2! = 2 are not sums they are not included.</p>\n\r\n"
+:content: |+
+  145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.
+
+  Find the sum of all numbers which are equal to the sum of the factorial of their digits.
+
+  Note: as 1! = 1 and 2! = 2 are not sums they are not included.
+

data/data/problems/340.yml

@@ -2,13 +2,11 @@
 :id: 340
 :name: Crazy Function
 :url: http://projecteuler.net/problem=340
-:content: "\r\n<p>\r\nFor fixed integers a, b, c, define the <i>crazy function</i>
-  F(<var>n</var>) as follows:<br>\r\nF(<var>n</var>) = <var>n</var> - c for all <var>n</var>
-  <img src=\"images/symbol_gt.gif\" width=\"10\" height=\"10\" alt=\"&gt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> b <br>\r\nF(<var>n</var>) = F(a + F(a + F(a +
-  F(a + <var>n</var>)))) for all <var>n</var> <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> b.\r\n</p>\r\n<p>\r\nAlso,
-  define S(a, b, c) = <img src=\"project/images/p_340_formula.gif\" style=\"vertical-align:middle;\">.\r\n</p>\r\n<p>\r\nFor
-  example, if a = 50, b = 2000 and c = 40, then F(0) = 3240 and F(2000) = 2040.<br>\r\nAlso,
-  S(50, 2000, 40) = 5204240.\r\n</p>\r\n<p>\r\nFind the last 9 digits of S(21<sup>7</sup>,
-  7<sup>21</sup>, 12<sup>7</sup>).\r\n</p>\r\n\r\n\r\n\r\n\r\n\r\n"
+:content: "For fixed integers a, b, c, define the _crazy function_ F(<var>n</var>)
+  as follows:  \n\rF(<var>n</var>) = <var>n</var> - c for all <var>n</var> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)
+  b   \n\rF(<var>n</var>) = F(a + F(a + F(a + F(a + <var>n</var>)))) for all <var>n</var>
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) b.\n\nAlso,
+  define S(a, b, c) = ![](/home/will/src/euler-manager/config/../data/images/p_340_formula.gif).\n\nFor
+  example, if a = 50, b = 2000 and c = 40, then F(0) = 3240 and F(2000) = 2040.  \n\rAlso,
+  S(50, 2000, 40) = 5204240.\n\nFind the last 9 digits of S(21<sup>7</sup>, 7<sup>21</sup>,
+  12<sup>7</sup>).\n\n"

data/data/problems/341.yml

@@ -2,17 +2,15 @@
 :id: 341
 :name: Golomb's self-describing sequence
 :url: http://projecteuler.net/problem=341
-:content: "\r\n<p>The <b>Golomb's self-describing sequence</b> {G(<var>n</var>)} is
-  the only nondecreasing sequence of natural numbers such that <var>n</var> appears
-  exactly G(<var>n</var>) times in the sequence. The values of G(<var>n</var>) for
-  the first few <var>n</var> are</p>\r\n\r\n<p></p>\n<div align=\"center\">\r\n<table
-  cellspacing=\"1\" cellpadding=\"5\" border=\"0\" align=\"center\">\n<tr>\n<td align=\"left\"><var>n</var></td>\n<td>1</td>\n<td>2</td>\n<td>3</td>\n<td>4</td>\n<td>5</td>\n<td>6</td>\n<td>7</td>\n<td>8</td>\n<td>9</td>\n<td>10</td>\n<td>11</td>\n<td>12</td>\n<td>13</td>\n<td>14</td>\n<td>15</td>\n<td>…</td>\n</tr>\n<tr>\n<td>G(<var>n</var>)</td>\n<td>1</td>\n<td>2</td>\n<td>2</td>\n<td>3</td>\n<td>3</td>\n<td>4</td>\n<td>4</td>\n<td>4</td>\n<td>5</td>\n<td>5</td>\n<td>5</td>\n<td>6</td>\n<td>6</td>\n<td>6</td>\n<td>6</td>\n<td>…</td>\n</tr>\n</table>\n</div>\r\n\r\n<p>You
-  are given that G(10<sup>3</sup>) = 86, G(10<sup>6</sup>) = 6137.<br>\r\nYou are
-  also given that ΣG(<var>n</var><sup>3</sup>) = 153506976 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_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> 10<sup>3</sup>.</p>\r\n\r\n<p>Find ΣG(<var>n</var><sup>3</sup>)
-  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_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\">
-  10<sup>6</sup>.</p>\r\n\r\n\r\n"
+:content: "The **Golomb's self-describing sequence** {G(<var>n</var>)} is the only
+  nondecreasing sequence of natural numbers such that <var>n</var> appears exactly
+  G(<var>n</var>) times in the sequence. The values of G(<var>n</var>) for the first
+  few <var>n</var> are\n\n| <var>n</var> | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10
+  | 11 | 12 | 13 | 14 | 15 | … |\n| G(<var>n</var>) | 1 | 2 | 2 | 3 | 3 | 4 | 4 |
+  4 | 5 | 5 | 5 | 6 | 6 | 6 | 6 | … |\n\nYou are given that G(10<sup>3</sup>) = 86,
+  G(10<sup>6</sup>) = 6137.  \n\rYou are also given that ΣG(<var>n</var><sup>3</sup>)
+  = 153506976 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_lt.gif)
+  10<sup>3</sup>.\n\nFind ΣG(<var>n</var><sup>3</sup>) 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_lt.gif)
+  10<sup>6</sup>.\n\n"

data/data/problems/342.yml

@@ -2,16 +2,12 @@
 :id: 342
 :name: The totient of a square is a cube
 :url: http://projecteuler.net/problem=342
-:content: "\r\n<p>\r\nConsider the number 50.<br>\r\n50<sup>2</sup> = 2500 = 2<sup>2</sup><img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 5<sup>4</sup>, so φ(2500) = 2 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  4 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 5<sup>3</sup> = 8 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  5<sup>3</sup> = 2<sup>3</sup><img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 5<sup>3</sup>. <sup>1</sup><br>\r\nSo
-  2500 is a square and  φ(2500) is a cube.\r\n</p>\r\n<p>\r\nFind the sum of all numbers
-  n, 1 &amp;lt n <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  border=\"0\" style=\"vertical-align:middle;\"> 10<sup>10</sup> such that φ(n<sup>2</sup>)
-  is a cube.\r\n</p>\r\n<p>\r\n<sup>1</sup> φ denotes <b>Euler's totient function</b>.\r\n</p>\r\n\r\n\r\n\r\n"
+:content: "Consider the number 50.  \n\r50<sup>2</sup> = 2500 = 2<sup>2</sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  5<sup>4</sup>, so φ(2500) = 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  4 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 5<sup>3</sup>
+  = 8 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 5<sup>3</sup>
+  = 2<sup>3</sup> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  5<sup>3</sup>. <sup>1</sup>  \n\rSo 2500 is a square and φ(2500) is a cube.\n\nFind
+  the sum of all numbers n, 1 &lt n ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  10<sup>10</sup> such that φ(n<sup>2</sup>) is a cube.\n\n<sup>1</sup> φ denotes
+  **Euler's totient function** .\n\n"

data/data/problems/343.yml

@@ -2,28 +2,21 @@
 :id: 343
 :name: Fractional Sequences
 :url: http://projecteuler.net/problem=343
-:content: "\r\n<p>For any positive integer <var>k</var>, a finite sequence a<sub><var>i</var></sub>
-  of fractions x<sub><var>i</var></sub>/y<sub><var>i</var></sub> is defined by:<br>\r\na<sub>1</sub>
-  = 1/<var>k</var> and<br>\r\na<sub><var>i</var></sub> = (x<sub><var>i</var>-1</sub>+1)/(y<sub><var>i</var>-1</sub>-1)
-  reduced to lowest terms for <var>i</var>&gt;1.<br>\r\nWhen a<sub><var>i</var></sub>
-  reaches some integer <var>n</var>, the sequence stops. (That is, when y<sub><var>i</var></sub>=1.)<br>\r\nDefine
-  f(<var>k</var>) = <var>n</var>. <br>\r\nFor example, for <var>k</var> = 20:\r\n</p>\r\n\r\n<p>\r\n1/20
-  <img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 2/19 <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 3/18 = 1/6
-  <img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 2/5 <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 3/4 <img src=\"images/symbol_maps.gif\"
-  width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\">
-  4/3 <img src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
-  style=\"vertical-align:middle;\"> 5/2 <img src=\"images/symbol_maps.gif\" width=\"15\"
-  height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\"> 6/1 = 6\r\n</p>\r\n\r\n<p>\r\nSo
-  f(20) = 6.\r\n</p>\r\n\r\n<p>\r\nAlso f(1) = 1, f(2) = 2, f(3) = 1 and Σf(<var>k</var><sup>3</sup>)
-  = 118937 for 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"><var>k</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  100.\r\n</p>\r\n\r\n<p>\r\nFind Σf(<var>k</var><sup>3</sup>) for 1 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>k</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" 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;\">10<sup>6</sup>.\r\n</p>\r\n"
+:content: "For any positive integer <var>k</var>, a finite sequence a<sub><var>i</var></sub>
+  of fractions x<sub><var>i</var></sub>/y<sub><var>i</var></sub> is defined by:  \n\ra<sub>1</sub>
+  = 1/<var>k</var> and  \n\ra<sub><var>i</var></sub> = (x<sub><var>i</var>-1</sub>+1)/(y<sub><var>i</var>-1</sub>-1)
+  reduced to lowest terms for <var>i</var>>1.  \n\rWhen a<sub><var>i</var></sub> reaches
+  some integer <var>n</var>, the sequence stops. (That is, when y<sub><var>i</var></sub>=1.)
+  \ \n\rDefine f(<var>k</var>) = <var>n</var>.   \n\rFor example, for <var>k</var>
+  = 20:\n\n1/20 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  2/19 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 3/18
+  = 1/6 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 2/5
+  ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 3/4 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif)
+  4/3 ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 5/2
+  ![→](/home/will/src/euler-manager/config/../data/images/symbol_maps.gif) 6/1 = 6\n\nSo
+  f(20) = 6.\n\nAlso f(1) = 1, f(2) = 2, f(3) = 1 and Σf(<var>k</var><sup>3</sup>)
+  = 118937 for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>k</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  100.\n\nFind Σf(<var>k</var><sup>3</sup>) for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>k</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)10<sup>6</sup>.\n\n"

data/data/problems/344.yml

@@ -2,20 +2,19 @@
 :id: 344
 :name: Silver dollar game
 :url: http://projecteuler.net/problem=344
-:content: "\r\n<p>One variant of N.G. de Bruijn's <b>silver dollar</b> game can be
-  described as follows:</p>\r\n\r\n<p>On a strip of squares a number of coins are
-  placed, at most one coin per square. Only one coin, called the <b>silver dollar</b>,
-  has any value. Two players take turns making moves. At each turn a player must make
-  either a <i>regular</i> or a <i>special</i> move.</p>\r\n\r\n<p>A <i>regular</i>
-  move consists of selecting one coin and moving it one or more squares to the left.
-  The coin cannot move out of the strip or jump on or over another coin.</p>\r\n\r\n<p>Alternatively,
-  the player can choose to make the <i>special</i> move of pocketing the leftmost
-  coin rather than making a regular move. If no regular moves are possible, the player
-  is forced to pocket the leftmost coin.</p>\r\n\r\n<p>The winner is the player who
-  pockets the silver dollar.</p>\r\n\r\n\r\n<div align=\"center\">\r\n<img src=\"project/images/p_344_silverdollar.gif\"><br>\n</div>\r\n\r\n<p>A
-  <i>winning configuration</i> is an arrangement of coins on the strip where the first
-  player can force a win no matter what the second player does.</p>\r\n\r\n<p>Let
-  W(<var>n</var>,<var>c</var>) be the number of winning configurations for a strip
-  of <var>n</var> squares, <var>c</var> worthless coins and one silver dollar.</p>\r\n\r\n<p>You
-  are given that W(10,2) = 324 and W(100,10) = 1514704946113500.</p>\r\n\r\n<p>Find
-  W(1 000 000, 100) modulo the semiprime 1000 036 000 099 (= 1 000 003 · 1 000 033).\r\n</p>\r\n\r\n"
+:content: "One variant of N.G. de Bruijn's **silver dollar** game can be described
+  as follows:\n\nOn a strip of squares a number of coins are placed, at most one coin
+  per square. Only one coin, called the **silver dollar** , has any value. Two players
+  take turns making moves. At each turn a player must make either a _regular_ or a
+  _special_ move.\n\nA _regular_ move consists of selecting one coin and moving it
+  one or more squares to the left. The coin cannot move out of the strip or jump on
+  or over another coin.\n\nAlternatively, the player can choose to make the _special_
+  move of pocketing the leftmost coin rather than making a regular move. If no regular
+  moves are possible, the player is forced to pocket the leftmost coin.\n\nThe winner
+  is the player who pockets the silver dollar.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_344_silverdollar.gif)
+  \ \n\nA _winning configuration_ is an arrangement of coins on the strip where the
+  first player can force a win no matter what the second player does.\n\nLet W(<var>n</var>,<var>c</var>)
+  be the number of winning configurations for a strip of <var>n</var> squares, <var>c</var>
+  worthless coins and one silver dollar.\n\nYou are given that W(10,2) = 324 and W(100,10)
+  = 1514704946113500.\n\nFind W(1 000 000, 100) modulo the semiprime 1000 036 000
+  099 (= 1 000 003 · 1 000 033).\n\n"

data/data/problems/345.yml

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

data/data/problems/346.yml

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

data/data/problems/347.yml

@@ -2,15 +2,12 @@
 :id: 347
 :name: Largest integer divisible by two primes
 :url: http://projecteuler.net/problem=347
-:content: "\r\n<p>\r\nThe largest integer <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 100 that
-  is only divisible by both the primes 2 and 3 is 96, as 96=32*3=2<sup>5</sup>*3.\r\nFor
-  two <i>distinct</i> primes p and q let M(p,q,N) be the largest positive integer
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\">N only divisible\r\nby both p and q and M(p,q,N)=0
-  if such a positive integer does not exist.\r\n</p>\r\n<p>\r\nE.g. M(2,3,100)=96.<br>
-  \r\nM(3,5,100)=75 and not 90 because 90 is divisible by 2 ,3 and 5.<br>\r\nAlso
-  M(2,73,100)=0 because there does not exist a positive integer <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  100 that is divisible by both 2 and 73.\r\n</p>\r\n<p>\r\nLet S(N) be the sum of
-  all distinct M(p,q,N).\r\nS(100)=2262.\r\n</p>\r\n<p>\r\nFind S(10 000 000).\r\n</p>\r\n\r\n\r\n\r\n\r\n\r\n"
+:content: "The largest integer ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  100 that is only divisible by both the primes 2 and 3 is 96, as 96=32\\*3=2<sup>5</sup>\\*3.\rFor
+  two _distinct_ primes p and q let M(p,q,N) be the largest positive integer ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)N
+  only divisible\rby both p and q and M(p,q,N)=0 if such a positive integer does not
+  exist.\n\nE.g. M(2,3,100)=96.  \n \rM(3,5,100)=75 and not 90 because 90 is divisible
+  by 2 ,3 and 5.  \n\rAlso M(2,73,100)=0 because there does not exist a positive integer
+  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 100 that
+  is divisible by both 2 and 73.\n\nLet S(N) be the sum of all distinct M(p,q,N).\rS(100)=2262.\n\nFind
+  S(10 000 000).\n\n"

data/data/problems/348.yml

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

data/data/problems/349.yml

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

data/data/problems/35.yml

@@ -2,7 +2,10 @@
 :id: 35
 :name: Circular primes
 :url: http://projecteuler.net/problem=35
-:content: "\r\n\n<p>The number, 197, is called a circular prime because all rotations
-  of the digits: 197, 971, and 719, are themselves prime.</p>\n<p>There are thirteen
-  such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.</p>\n<p>How
-  many circular primes are there below one million?</p>\n\r\n"
+:content: |+
+  The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.
+
+  There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.
+
+  How many circular primes are there below one million?
+

data/data/problems/350.yml

@@ -2,17 +2,15 @@
 :id: 350
 :name: Constraining the least greatest and the greatest least
 :url: http://projecteuler.net/problem=350
-:content: "\r\n<p>A <i>list of size n</i> is a sequence of <var>n</var> natural numbers.<br>
-  Examples are (2,4,6), (2,6,4), (10,6,15,6), and (11).\r\n</p>\n<p>\r\nThe <b>greatest
-  common divisor</b>, or gcd, of a list is the largest natural number that divides
-  all entries of the list. <br>Examples: gcd(2,6,4) = 2, gcd(10,6,15,6) = 1 and gcd(11)
-  = 11.\r\n</p>\n<p>\r\nThe <b>least common multiple</b>, or lcm, of a list is the
-  smallest natural number divisible by each entry of the list. <br>Examples: lcm(2,6,4)
-  = 12, lcm(10,6,15,6) = 30 and lcm(11) = 11.\r\n</p>\n<p>\r\nLet f(<var>G</var>,
-  <var>L</var>, <var>N</var>) be the number of lists of size <var>N</var> with gcd
-  <img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>G</var> and lcm <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>L</var>.
-  For example:\r\n</p>\n<p>\r\nf(10, 100, 1) = 91.<br>\r\nf(10, 100, 2) = 327.<br>\r\nf(10,
-  100, 3) = 1135.<br>\r\nf(10, 100, 1000) mod 101<sup>4</sup> = 3286053.\r\n</p>\n<p>\r\nFind
-  f(10<sup>6</sup>, 10<sup>12</sup>, 10<sup>18</sup>) mod 101<sup>4</sup>.\r\n</p>\r\n\r\n"
+:content: "A _list of size n_ is a sequence of <var>n</var> natural numbers.  \n Examples
+  are (2,4,6), (2,6,4), (10,6,15,6), and (11).\n\nThe **greatest common divisor**
+  , or gcd, of a list is the largest natural number that divides all entries of the
+  list.   \nExamples: gcd(2,6,4) = 2, gcd(10,6,15,6) = 1 and gcd(11) = 11.\n\nThe
+  **least common multiple** , or lcm, of a list is the smallest natural number divisible
+  by each entry of the list.   \nExamples: lcm(2,6,4) = 12, lcm(10,6,15,6) = 30 and
+  lcm(11) = 11.\n\nLet f(<var>G</var>, <var>L</var>, <var>N</var>) be the number of
+  lists of size <var>N</var> with gcd ![≥](/home/will/src/euler-manager/config/../data/images/symbol_ge.gif)
+  <var>G</var> and lcm ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>L</var>. For example:\n\nf(10, 100, 1) = 91.  \n\rf(10, 100, 2) = 327.  \n\rf(10,
+  100, 3) = 1135.  \n\rf(10, 100, 1000) mod 101<sup>4</sup> = 3286053.\n\nFind f(10<sup>6</sup>,
+  10<sup>12</sup>, 10<sup>18</sup>) mod 101<sup>4</sup>.\n\n"

data/data/problems/351.yml

@@ -2,12 +2,11 @@
 :id: 351
 :name: Hexagonal orchards
 :url: http://projecteuler.net/problem=351
-:content: "\r\n<p>A <i>hexagonal orchard</i> of order <var>n</var> is a triangular
-  lattice made up of points within a regular hexagon with side <var>n</var>. The following
-  is an example of a hexagonal orchard of order 5:\r\n</p>\r\n\r\n<div align=\"center\">\r\n<img
-  src=\"project/images/p_351_hexorchard.png\"><br>\n</div>\r\n\r\n<p>\r\nHighlighted
-  in green are the points which are hidden from the center by a point closer to it.
-  It can be seen that for a hexagonal orchard of order 5, 30 points are hidden from
-  the center.\r\n</p>\r\n\r\n<p>\r\nLet H(<var>n</var>) be the number of points hidden
-  from the center in a hexagonal orchard of order <var>n</var>.\r\n</p>\r\n\r\n<p>\r\nH(5)
-  = 30. H(10) = 138. H(1 000) = 1177848.\r\n</p>\r\n\r\n<p>\r\nFind H(100 000 000).\r\n</p>\r\n"
+:content: "A _hexagonal orchard_ of order <var>n</var> is a triangular lattice made
+  up of points within a regular hexagon with side <var>n</var>. The following is an
+  example of a hexagonal orchard of order 5:\n\n ![](/home/will/src/euler-manager/config/../data/images/p_351_hexorchard.png)
+  \ \n\nHighlighted in green are the points which are hidden from the center by a
+  point closer to it. It can be seen that for a hexagonal orchard of order 5, 30 points
+  are hidden from the center.\n\nLet H(<var>n</var>) be the number of points hidden
+  from the center in a hexagonal orchard of order <var>n</var>.\n\nH(5) = 30. H(10)
+  = 138. H(1 000) = 1177848.\n\nFind H(100 000 000).\n\n"