euler-manager 0.0.5 → 0.0.6

data/data/problems/154.yml

@@ -2,15 +2,13 @@
 :id: 154
 :name: Exploring Pascal's pyramid
 :url: http://projecteuler.net/problem=154
-:content: "\r\n<p>A triangular pyramid is constructed using spherical balls so that
-  each ball rests on exactly three balls of the next lower level.</p>\r\n<div style=\"text-align:center;\"><img
-  src=\"project/images/p_154_pyramid.gif\" width=\"488\" height=\"379\" alt=\"\"></div>\r\n<p>Then,
-  we calculate the number of paths leading from the apex to each position:</p>\r\n<p>A
-  path starts at the apex and progresses downwards to any of the three spheres directly
-  below the current position.</p>\r\n<p>Consequently, the number of paths to reach
-  a certain position is the sum of the numbers immediately above it (depending on
-  the position, there are up to three numbers above it).</p>\r\n<p>The result is <i>Pascal's
-  pyramid</i> and the numbers at each level <var>n</var> are the coefficients of the
-  trinomial expansion \r\n(<var>x + y + z</var>)<sup><var>n</var></sup>.</p>\r\n<p>How
-  many coefficients in the expansion of (<var>x + y + z</var>)<sup>200000</sup> are
-  multiples of 10<sup>12</sup>?</p>\r\n"
+:content: "A triangular pyramid is constructed using spherical balls so that each
+  ball rests on exactly three balls of the next lower level.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_154_pyramid.gif)\n\nThen,
+  we calculate the number of paths leading from the apex to each position:\n\nA path
+  starts at the apex and progresses downwards to any of the three spheres directly
+  below the current position.\n\nConsequently, the number of paths to reach a certain
+  position is the sum of the numbers immediately above it (depending on the position,
+  there are up to three numbers above it).\n\nThe result is _Pascal's pyramid_ and
+  the numbers at each level <var>n</var> are the coefficients of the trinomial expansion
+  \r(<var>x + y + z</var>)<sup><var>n</var></sup>.\n\nHow many coefficients in the
+  expansion of (<var>x + y + z</var>)<sup>200000</sup> are multiples of 10<sup>12</sup>?\n\n"

data/data/problems/155.yml

@@ -2,21 +2,18 @@
 :id: 155
 :name: Counting Capacitor Circuits
 :url: http://projecteuler.net/problem=155
-:content: "\r\n<p>An electric circuit uses exclusively identical capacitors of the
-  same value C.\r\n<br>\r\nThe capacitors can be connected in series or in parallel
-  to form sub-units, which can then be connected in series or in parallel with other
-  capacitors or other sub-units to form larger sub-units, and so on up to a final
-  circuit.</p>\r\n<p>Using this simple procedure and up to <var>n</var> identical
-  capacitors, we can make circuits having a range of different total capacitances.
-  For example, using up to <var>n</var>=3 capacitors of 60 <img src=\"project/images/p_155_capsmu.gif\"
-  width=\"12\" height=\"21\" alt=\"\" style=\"vertical-align:middle;\">F each, we
-  can obtain the following 7 distinct total capacitance values: </p>\r\n<div style=\"text-align:center;\"><img
-  src=\"project/images/p_155_capacitors1.gif\" width=\"387\" height=\"557\" alt=\"\"></div>\r\n<p>If
+:content: "An electric circuit uses exclusively identical capacitors of the same value
+  C.\r  \n\rThe capacitors can be connected in series or in parallel to form sub-units,
+  which can then be connected in series or in parallel with other capacitors or other
+  sub-units to form larger sub-units, and so on up to a final circuit.\n\nUsing this
+  simple procedure and up to <var>n</var> identical capacitors, we can make circuits
+  having a range of different total capacitances. For example, using up to <var>n</var>=3
+  capacitors of 60 ![](/home/will/src/euler-manager/config/../data/images/p_155_capsmu.gif)F
+  each, we can obtain the following 7 distinct total capacitance values:\n\n ![](/home/will/src/euler-manager/config/../data/images/p_155_capacitors1.gif)\n\nIf
   we denote by <var>D</var>(<var>n</var>) the number of distinct total capacitance
   values we can obtain when using up to <var>n</var> equal-valued capacitors and the
   simple procedure described above, we have: <var>D</var>(1)=1, <var>D</var>(2)=3,
-  <var>D</var>(3)=7 ...</p>\r\n<p>Find <var>D</var>(18).</p>\r\n<p><i>Reminder :</i>
-  When connecting capacitors C<sub>1</sub>, C<sub>2</sub> etc in parallel, the total
-  capacitance is C<sub>T</sub> = C<sub>1</sub> + C<sub>2</sub> +...,\r\n<br>\r\nwhereas
-  when connecting them in series, the overall capacitance is given by:\r\n<img src=\"project/images/p_155_capsform.gif\"
-  width=\"127\" height=\"38\" alt=\"\" style=\"vertical-align:middle;\"></p>\r\n\r\n"
+  <var>D</var>(3)=7 ...\n\nFind <var>D</var>(18).\n\n_Reminder :_ When connecting
+  capacitors C<sub>1</sub>, C<sub>2</sub> etc in parallel, the total capacitance is
+  C<sub>T</sub> = C<sub>1</sub> + C<sub>2</sub> +...,\r  \n\rwhereas when connecting
+  them in series, the overall capacitance is given by:\r ![](/home/will/src/euler-manager/config/../data/images/p_155_capsform.gif)\n\n"

data/data/problems/156.yml

@@ -2,26 +2,24 @@
 :id: 156
 :name: Counting Digits
 :url: http://projecteuler.net/problem=156
-:content: "\r\n<p>Starting from zero the natural numbers are written down in base
-  10 like this:\r\n<br>\r\n0 1 2 3 4 5 6 7 8 9 10 11 12....\r\n</p>\r\n<p>Consider
-  the digit <var>d</var>=1. After we write down each number <var>n</var>, we will
-  update the number of ones that have occurred and call this number <var>f</var>(<var>n</var>,1).
-  The first values for <var>f</var>(<var>n</var>,1), then, are as follows:</p>\r\n<div
-  style=\"text-align:center;\">\r\n<table style=\"text-align:center;\" align=\"center\">\n<tr>\n<td><var>n</var></td>\n<td>\n<var>f</var>(<var>n</var>,1)</td>\r\n</tr>\n<tr>\n<td>0</td>\n<td>0</td>\r\n</tr>\n<tr>\n<td>1</td>\n<td>1</td>\r\n</tr>\n<tr>\n<td>2</td>\n<td>1</td>\r\n</tr>\n<tr>\n<td>3</td>\n<td>1</td>\r\n</tr>\n<tr>\n<td>4</td>\n<td>1</td>\r\n</tr>\n<tr>\n<td>5</td>\n<td>1</td>\r\n</tr>\n<tr>\n<td>6</td>\n<td>1</td>\r\n</tr>\n<tr>\n<td>7</td>\n<td>1</td>\r\n</tr>\n<tr>\n<td>8</td>\n<td>1</td>\r\n</tr>\n<tr>\n<td>9</td>\n<td>1</td>\r\n</tr>\n<tr>\n<td>10</td>\n<td>2</td>\r\n</tr>\n<tr>\n<td>11</td>\n<td>4</td>\r\n</tr>\n<tr>\n<td>12</td>\n<td>5</td>\r\n</tr>\n</table>\n</div>\r\n<p>Note
-  that <var>f</var>(<var>n</var>,1) never equals 3.\r\n<br>\r\nSo the first two solutions
-  of the equation <var>f</var>(<var>n</var>,1)=<var>n</var> are <var>n</var>=0 and
-  <var>n</var>=1. The next solution is <var>n</var>=199981.</p>\r\n<p>In the same
-  manner the function <var>f</var>(<var>n,d</var>) gives the total number of digits
-  <var>d</var> that have been written down after the number <var>n</var> has been
-  written.\r\n<br>\r\nIn fact, for every digit <var>d</var> <img src=\"images/symbol_ne.gif\"
-  width=\"11\" height=\"10\" alt=\"≠\" border=\"0\" style=\"vertical-align:middle;\">
-  0, 0 is the first solution of the equation <var>f</var>(<var>n,d</var>)=<var>n</var>.</p>\r\n<p>Let
-  <var>s</var>(<var>d</var>) be the sum of all the solutions for which <var>f</var>(<var>n,d</var>)=<var>n</var>.\r\n<br>\r\nYou
-  are given that <var>s</var>(1)=22786974071.</p>\r\n<p>Find  <img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\"><var>s</var>(<var>d</var>)
-  for 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> d <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 9.</p>\r\n<p>Note:
-  if, for some <var>n</var>, <var>f</var>(<var>n,d</var>)=<var>n</var>\r\n for more
+:content: "Starting from zero the natural numbers are written down in base 10 like
+  this:\r  \n\r0 1 2 3 4 5 6 7 8 9 10 11 12....\n\nConsider the digit <var>d</var>=1.
+  After we write down each number <var>n</var>, we will update the number of ones
+  that have occurred and call this number <var>f</var>(<var>n</var>,1). The first
+  values for <var>f</var>(<var>n</var>,1), then, are as follows:\n\n| <var>n</var>
+  | <var>f</var>(<var>n</var>,1) |\n| 0 | 0 |\n| 1 | 1 |\n| 2 | 1 |\n| 3 | 1 |\n|
+  4 | 1 |\n| 5 | 1 |\n| 6 | 1 |\n| 7 | 1 |\n| 8 | 1 |\n| 9 | 1 |\n| 10 | 2 |\n| 11
+  | 4 |\n| 12 | 5 |\n\nNote that <var>f</var>(<var>n</var>,1) never equals 3.\r  \n\rSo
+  the first two solutions of the equation <var>f</var>(<var>n</var>,1)=<var>n</var>
+  are <var>n</var>=0 and <var>n</var>=1. The next solution is <var>n</var>=199981.\n\nIn
+  the same manner the function <var>f</var>(<var>n,d</var>) gives the total number
+  of digits <var>d</var> that have been written down after the number <var>n</var>
+  has been written.\r  \n\rIn fact, for every digit <var>d</var> ![≠](/home/will/src/euler-manager/config/../data/images/symbol_ne.gif)
+  0, 0 is the first solution of the equation <var>f</var>(<var>n,d</var>)=<var>n</var>.\n\nLet
+  <var>s</var>(<var>d</var>) be the sum of all the solutions for which <var>f</var>(<var>n,d</var>)=<var>n</var>.\r
+  \ \n\rYou are given that <var>s</var>(1)=22786974071.\n\nFind ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)
+  <var>s</var>(<var>d</var>) for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  d ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 9.\n\nNote:
+  if, for some <var>n</var>, <var>f</var>(<var>n,d</var>)=<var>n</var>\r for more
   than one value of <var>d</var> this value of <var>n</var> is counted again for every
-  value of <var>d</var> for which <var>f</var>(<var>n,d</var>)=<var>n</var>.</p>\r\n"
+  value of <var>d</var> for which <var>f</var>(<var>n,d</var>)=<var>n</var>.\n\n"

data/data/problems/157.yml

@@ -3,32 +3,30 @@
 :name: Solving the diophantine equation <sup>1</sup>/<sub><var>a</var></sub>+<sup>1</sup>/<sub><var>b</var></sub>=
   <sup><var>p</var></sup>/<sub>10<sup><var>n</var></sup></sub>
 :url: http://projecteuler.net/problem=157
-:content: "\r\n<p>Consider the diophantine equation <sup>1</sup>/<sub><var>a</var></sub>+<sup>1</sup>/<sub><var>b</var></sub>=
+:content: "Consider the diophantine equation <sup>1</sup>/<sub><var>a</var></sub>+<sup>1</sup>/<sub><var>b</var></sub>=
   <sup><var>p</var></sup>/<sub>10<sup><var>n</var></sup></sub> with <var>a, b, p,
-  n</var> positive integers and <var>a</var> <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>b</var>.<br>\r\nFor
-  <var>n</var>=1 this equation has 20 solutions that are listed below:</p>\r\n<table>\n<tr>\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>1</sub>+<sup>1</sup>/<sub>1</sub>=<sup>20</sup>/<sub>10</sub>\n</td>\r\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>1</sub>+<sup>1</sup>/<sub>2</sub>=<sup>15</sup>/<sub>10</sub>\n</td>\r\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>1</sub>+<sup>1</sup>/<sub>5</sub>=<sup>12</sup>/<sub>10</sub>\n</td>\r\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>1</sub>+<sup>1</sup>/<sub>10</sub>=<sup>11</sup>/<sub>10</sub>\n</td>\r\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>2</sub>+<sup>1</sup>/<sub>2</sub>=<sup>10</sup>/<sub>10</sub>\n</td>\r\n</tr>\n<tr>\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>2</sub>+<sup>1</sup>/<sub>5</sub>=<sup>7</sup>/<sub>10</sub>\n</td>\r\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>2</sub>+<sup>1</sup>/<sub>10</sub>=<sup>6</sup>/<sub>10</sub>\n</td>\r\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>3</sub>+<sup>1</sup>/<sub>6</sub>=<sup>5</sup>/<sub>10</sub>\n</td>\r\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>3</sub>+<sup>1</sup>/<sub>15</sub>=<sup>4</sup>/<sub>10</sub>\n</td>\r\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>4</sub>+<sup>1</sup>/<sub>4</sub>=<sup>5</sup>/<sub>10</sub>\n</td>\r\n</tr>\n<tr>\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>4</sub>+<sup>1</sup>/<sub>20</sub>=<sup>3</sup>/<sub>10</sub>\n</td>\r\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>5</sub>+<sup>1</sup>/<sub>5</sub>=<sup>4</sup>/<sub>10</sub>\n</td>\r\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>5</sub>+<sup>1</sup>/<sub>10</sub>=<sup>3</sup>/<sub>10</sub>\n</td>\r\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>6</sub>+<sup>1</sup>/<sub>30</sub>=<sup>2</sup>/<sub>10</sub>\n</td>\r\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>10</sub>+<sup>1</sup>/<sub>10</sub>=<sup>2</sup>/<sub>10</sub>\n</td>\r\n</tr>\n<tr>\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>11</sub>+<sup>1</sup>/<sub>110</sub>=<sup>1</sup>/<sub>10</sub>\n</td>\r\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>12</sub>+<sup>1</sup>/<sub>60</sub>=<sup>1</sup>/<sub>10</sub>\n</td>\r\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>14</sub>+<sup>1</sup>/<sub>35</sub>=<sup>1</sup>/<sub>10</sub>\n</td>\r\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>15</sub>+<sup>1</sup>/<sub>30</sub>=<sup>1</sup>/<sub>10</sub>\n</td>\r\n<td
-  width=\"120\">\n<sup>1</sup>/<sub>20</sub>+<sup>1</sup>/<sub>20</sub>=<sup>1</sup>/<sub>10</sub>\n</td>\r\n</tr>\n</table>\n<p>How
-  many solutions has this equation 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;\"> 9?</p>\r\n"
+  n</var> positive integers and <var>a</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>b</var>.  \n\rFor <var>n</var>=1 this equation has 20 solutions that are listed
+  below:\n\n| <sup>1</sup>/<sub>1</sub>+<sup>1</sup>/<sub>1</sub>=<sup>20</sup>/<sub>10</sub>
+  | <sup>1</sup>/<sub>1</sub>+<sup>1</sup>/<sub>2</sub>=<sup>15</sup>/<sub>10</sub>
+  | <sup>1</sup>/<sub>1</sub>+<sup>1</sup>/<sub>5</sub>=<sup>12</sup>/<sub>10</sub>
+  | <sup>1</sup>/<sub>1</sub>+<sup>1</sup>/<sub>10</sub>=<sup>11</sup>/<sub>10</sub>
+  | <sup>1</sup>/<sub>2</sub>+<sup>1</sup>/<sub>2</sub>=<sup>10</sup>/<sub>10</sub>
+  |\n| <sup>1</sup>/<sub>2</sub>+<sup>1</sup>/<sub>5</sub>=<sup>7</sup>/<sub>10</sub>
+  | <sup>1</sup>/<sub>2</sub>+<sup>1</sup>/<sub>10</sub>=<sup>6</sup>/<sub>10</sub>
+  | <sup>1</sup>/<sub>3</sub>+<sup>1</sup>/<sub>6</sub>=<sup>5</sup>/<sub>10</sub>
+  | <sup>1</sup>/<sub>3</sub>+<sup>1</sup>/<sub>15</sub>=<sup>4</sup>/<sub>10</sub>
+  | <sup>1</sup>/<sub>4</sub>+<sup>1</sup>/<sub>4</sub>=<sup>5</sup>/<sub>10</sub>
+  |\n| <sup>1</sup>/<sub>4</sub>+<sup>1</sup>/<sub>20</sub>=<sup>3</sup>/<sub>10</sub>
+  | <sup>1</sup>/<sub>5</sub>+<sup>1</sup>/<sub>5</sub>=<sup>4</sup>/<sub>10</sub>
+  | <sup>1</sup>/<sub>5</sub>+<sup>1</sup>/<sub>10</sub>=<sup>3</sup>/<sub>10</sub>
+  | <sup>1</sup>/<sub>6</sub>+<sup>1</sup>/<sub>30</sub>=<sup>2</sup>/<sub>10</sub>
+  | <sup>1</sup>/<sub>10</sub>+<sup>1</sup>/<sub>10</sub>=<sup>2</sup>/<sub>10</sub>
+  |\n| <sup>1</sup>/<sub>11</sub>+<sup>1</sup>/<sub>110</sub>=<sup>1</sup>/<sub>10</sub>
+  | <sup>1</sup>/<sub>12</sub>+<sup>1</sup>/<sub>60</sub>=<sup>1</sup>/<sub>10</sub>
+  | <sup>1</sup>/<sub>14</sub>+<sup>1</sup>/<sub>35</sub>=<sup>1</sup>/<sub>10</sub>
+  | <sup>1</sup>/<sub>15</sub>+<sup>1</sup>/<sub>30</sub>=<sup>1</sup>/<sub>10</sub>
+  | <sup>1</sup>/<sub>20</sub>+<sup>1</sup>/<sub>20</sub>=<sup>1</sup>/<sub>10</sub>
+  |\n\nHow many solutions has this equation 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)
+  9?\n\n"

data/data/problems/158.yml

@@ -3,17 +3,16 @@
 :name: Exploring strings for which only one character comes lexicographically after
   its neighbour to the left
 :url: http://projecteuler.net/problem=158
-:content: "\r\n<p>Taking three different letters from the 26 letters of the alphabet,
-  character strings of length three can be formed.<br>\r\nExamples are 'abc', 'hat'
-  and 'zyx'.<br>\r\nWhen we study these three examples we see that for 'abc' two characters
-  come lexicographically after its neighbour to the left.<br> \r\nFor 'hat' there
-  is exactly one character that comes lexicographically after its neighbour to the
-  left. For 'zyx' there are zero characters that come lexicographically after its
-  neighbour to the left.<br>\r\nIn all there are 10400 strings of length 3 for which
-  exactly one character comes lexicographically after its neighbour to the left.</p>\r\n<p>We
-  now consider strings of <var>n</var> <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 26 different
-  characters from the alphabet.<br> \r\nFor every <var>n</var>, p(<var>n</var>) is
-  the number of strings of length <var>n</var> for which exactly one character comes
-  lexicographically after its neighbour to the left.</p> \r\n<p>What is the maximum
-  value of p(<var>n</var>)?</p>\r\n"
+:content: "Taking three different letters from the 26 letters of the alphabet, character
+  strings of length three can be formed.  \n\rExamples are 'abc', 'hat' and 'zyx'.
+  \ \n\rWhen we study these three examples we see that for 'abc' two characters come
+  lexicographically after its neighbour to the left.  \n \rFor 'hat' there is exactly
+  one character that comes lexicographically after its neighbour to the left. For
+  'zyx' there are zero characters that come lexicographically after its neighbour
+  to the left.  \n\rIn all there are 10400 strings of length 3 for which exactly one
+  character comes lexicographically after its neighbour to the left.\n\nWe now consider
+  strings of <var>n</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  26 different characters from the alphabet.  \n \rFor every <var>n</var>, p(<var>n</var>)
+  is the number of strings of length <var>n</var> for which exactly one character
+  comes lexicographically after its neighbour to the left.\n\nWhat is the maximum
+  value of p(<var>n</var>)?\n\n"

data/data/problems/159.yml

@@ -2,28 +2,18 @@
 :id: 159
 :name: Digital root sums of factorisations
 :url: http://projecteuler.net/problem=159
-:content: "\r\n<p>A composite number can be factored many different ways.  \r\nFor
-  instance, not including multiplication by one, 24 can be factored in 7 distinct
-  ways:</p>\r\n<div style=\"margin-left:50px;\">\r\n24 = 2x2x2x3<br>\r\n24 = 2x3x4<br>\r\n24
-  = 2x2x6<br>\r\n24 = 4x6<br>\r\n24 = 3x8<br>\r\n24 = 2x12<br>\r\n24 = 24\r\n</div>\r\n<p>Recall
-  that the digital root of a number, in base 10, is found by adding together the digits
-  of that number, \r\nand repeating that process until a number is arrived at that
-  is less than 10.  \r\nThus the digital root of 467 is 8.</p>\r\n<p>We shall call
-  a Digital Root Sum (DRS) the sum of the digital roots of the individual factors
-  of our number.<br>\r\n The chart below demonstrates all of the DRS values for 24.</p>\r\n<table
-  align=\"center\" border=\"1\" cellpadding=\"2\" cellspacing=\"0\">\n<tr>\n<th>Factorisation</th>\n<th>Digital
-  Root Sum</th>\n</tr>\n<tr>\n<td><div style=\"margin-left:20px;\">2x2x2x3</div></td>\r\n<td><div
-  style=\"text-align:center;\">9</div></td>\n</tr>\n<tr>\n<td><div style=\"margin-left:20px;\">2x3x4</div></td>\r\n<td><div
-  style=\"text-align:center;\">9</div></td>\n</tr>\n<tr>\n<td><div style=\"margin-left:20px;\">2x2x6</div></td>\r\n<td><div
-  style=\"text-align:center;\">10</div></td>\n</tr>\n<tr>\n<td><div style=\"margin-left:20px;\">4x6</div></td>\r\n<td><div
-  style=\"text-align:center;\">10</div></td>\n</tr>\n<tr>\n<td><div style=\"margin-left:20px;\">3x8</div></td>\r\n<td><div
-  style=\"text-align:center;\">11</div></td>\n</tr>\n<tr>\n<td><div style=\"margin-left:20px;\">2x12</div></td>\r\n<td><div
-  style=\"text-align:center;\">5</div></td>\n</tr>\n<tr>\n<td><div style=\"margin-left:20px;\">24</div></td>\r\n<td><div
-  style=\"text-align:center;\">6</div></td>\n</tr>\n</table>\n<p>The maximum Digital
-  Root Sum  of 24 is 11.<br>\r\nThe function mdrs(<var>n</var>) gives the maximum
-  Digital Root Sum of <var>n</var>. So  mdrs(24)=11.<br>\r\nFind <img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">mdrs(<var>n</var>)
-  for 1 <img src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\"
-  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;\">
-  1,000,000.</p>\r\n"
+:content: "A composite number can be factored many different ways. \rFor instance,
+  not including multiplication by one, 24 can be factored in 7 distinct ways:\n\n\r24
+  = 2x2x2x3  \n\r24 = 2x3x4  \n\r24 = 2x2x6  \n\r24 = 4x6  \n\r24 = 3x8  \n\r24 =
+  2x12  \n\r24 = 24\r\n\nRecall that the digital root of a number, in base 10, is
+  found by adding together the digits of that number, \rand repeating that process
+  until a number is arrived at that is less than 10. \rThus the digital root of 467
+  is 8.\n\nWe shall call a Digital Root Sum (DRS) the sum of the digital roots of
+  the individual factors of our number.  \n\r The chart below demonstrates all of
+  the DRS values for 24.\n\n| Factorisation | Digital Root Sum |\n| --- | --- |\n|
+  \n2x2x2x3\n | \n9\n |\n| \n2x3x4\n | \n9\n |\n| \n2x2x6\n | \n10\n |\n| \n4x6\n
+  | \n10\n |\n| \n3x8\n | \n11\n |\n| \n2x12\n | \n5\n |\n| \n24\n | \n6\n |\n\nThe
+  maximum Digital Root Sum of 24 is 11.  \n\rThe function mdrs(<var>n</var>) gives
+  the maximum Digital Root Sum of <var>n</var>. So mdrs(24)=11.  \n\rFind ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)mdrs(<var>n</var>)
+  for 1 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) <var>n</var>
+  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 1,000,000.\n\n"

data/data/problems/16.yml

@@ -2,5 +2,8 @@
 :id: 16
 :name: Power digit sum
 :url: http://projecteuler.net/problem=16
-:content: "\r\n\n<p>2<sup>15</sup> = 32768 and the sum of its digits is 3 + 2 + 7
-  + 6 + 8 = 26.</p>\n<p>What is the sum of the digits of the number 2<sup>1000</sup>?</p>\n\r\n"
+:content: |+
+  2<sup>15</sup> = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
+
+  What is the sum of the digits of the number 2<sup>1000</sup>?
+

data/data/problems/160.yml

@@ -2,7 +2,6 @@
 :id: 160
 :name: Factorial trailing digits
 :url: http://projecteuler.net/problem=160
-:content: "\r\n<p>For any N, let f(N) be the last five digits before the trailing
-  zeroes in N!.<br>\r\nFor example,</p>\r\n<p style=\"margin-left:50px;\">9! = 362880
-  so f(9)=36288<br>\r\n10! = 3628800 so f(10)=36288<br>\r\n20! = 2432902008176640000
-  so f(20)=17664</p>\r\n<p>Find f(1,000,000,000,000)</p>\r\n"
+:content: "For any N, let f(N) be the last five digits before the trailing zeroes
+  in N!.  \n\rFor example,\n\n9! = 362880 so f(9)=36288  \n\r10! = 3628800 so f(10)=36288
+  \ \n\r20! = 2432902008176640000 so f(20)=17664\n\nFind f(1,000,000,000,000)\n\n"

data/data/problems/161.yml

@@ -2,14 +2,10 @@
 :id: 161
 :name: Triominoes
 :url: http://projecteuler.net/problem=161
-:content: "\r\n<p>A triomino is a shape consisting of three squares joined via the
-  edges.\r\nThere are two basic forms:</p>\r\n\r\n<p style=\"text-align:center;\"><img
-  src=\"http://projecteuler.net/project/images/p_161_trio1.gif\" alt=\"\"></p>\r\n\r\n<p>If
-  all possible orientations are taken into account there are six:</p>\r\n\r\n<p style=\"text-align:center;\"><img
-  src=\"http://projecteuler.net/project/images/p_161_trio3.gif\" alt=\"\"></p>\r\n\r\n<p>Any
-  n by m grid for which nxm is divisible by 3 can be tiled with triominoes.<br>\r\nIf
+:content: "A triomino is a shape consisting of three squares joined via the edges.\rThere
+  are two basic forms:\n\n![](/home/will/src/euler-manager/config/../data/images/p_161_trio1.gif)\n\nIf
+  all possible orientations are taken into account there are six:\n\n![](/home/will/src/euler-manager/config/../data/images/p_161_trio3.gif)\n\nAny
+  n by m grid for which nxm is divisible by 3 can be tiled with triominoes.  \n\rIf
   we consider tilings that can be obtained by reflection or rotation from another
-  tiling as different there are 41 ways a 2 by 9 grid can be  tiled with triominoes:</p>\r\n\r\n<p
-  style=\"text-align:center;\"><img src=\"http://projecteuler.net/project/images/p_161_k9.gif\"
-  alt=\"\"></p>\r\n\r\n<p>In how many ways can a 9 by 12 grid be tiled in this way
-  by triominoes?</p>\r\n"
+  tiling as different there are 41 ways a 2 by 9 grid can be tiled with triominoes:\n\n![](/home/will/src/euler-manager/config/../data/images/p_161_k9.gif)\n\nIn
+  how many ways can a 9 by 12 grid be tiled in this way by triominoes?\n\n"

data/data/problems/162.yml

@@ -2,14 +2,13 @@
 :id: 162
 :name: Hexadecimal numbers
 :url: http://projecteuler.net/problem=162
-:content: "\r\n<p>In  the hexadecimal number system numbers are represented using
-  16 different digits:</p>\r\n<div style=\"text-align:center;\">0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F</div>\r\n<p>The
-  hexadecimal number AF when written in the decimal number system equals 10x16+15=175.</p>\r\n<p>In
-  the 3-digit hexadecimal numbers 10A, 1A0, A10, and A01 the digits 0,1 and A are
-  all present.<br>\r\nLike numbers written in base ten we write hexadecimal numbers
-  without leading zeroes.</p>\r\n<p>How many hexadecimal numbers containing at most
-  sixteen hexadecimal digits exist with all of the digits 0,1, and A present at least
-  once?<br>\r\nGive your answer as a hexadecimal number.</p>\r\n<p>(A,B,C,D,E and
-  F in upper case, without any leading or trailing code that marks the number as hexadecimal
-  and without leading zeroes , e.g. 1A3F and not: 1a3f and not 0x1a3f and not $1A3F
-  and not #1A3F and not 0000001A3F)</p>\r\n"
+:content: "In the hexadecimal number system numbers are represented using 16 different
+  digits:\n\n0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F\n\nThe hexadecimal number AF when written
+  in the decimal number system equals 10x16+15=175.\n\nIn the 3-digit hexadecimal
+  numbers 10A, 1A0, A10, and A01 the digits 0,1 and A are all present.  \n\rLike numbers
+  written in base ten we write hexadecimal numbers without leading zeroes.\n\nHow
+  many hexadecimal numbers containing at most sixteen hexadecimal digits exist with
+  all of the digits 0,1, and A present at least once?  \n\rGive your answer as a hexadecimal
+  number.\n\n(A,B,C,D,E and F in upper case, without any leading or trailing code
+  that marks the number as hexadecimal and without leading zeroes , e.g. 1A3F and
+  not: 1a3f and not 0x1a3f and not $1A3F and not #1A3F and not 0000001A3F)\n\n"

data/data/problems/163.yml

@@ -2,18 +2,16 @@
 :id: 163
 :name: Cross-hatched triangles
 :url: http://projecteuler.net/problem=163
-:content: "\r\n<p>Consider an equilateral triangle in which straight lines are drawn
-  from each vertex to the middle of the opposite side, such as in the <i>size 1</i>
-  triangle in the sketch below.</p>\r\n<div style=\"text-align:center;\"><img src=\"project/images/p_163.gif\"
-  width=\"300\" height=\"200\" alt=\"\"></div>\r\n<p>Sixteen triangles of either different
-  shape or size or orientation or location can now be observed in that triangle. Using
-  <i>size 1</i> triangles as building blocks, larger triangles can be formed, such
-  as the <i>size 2</i> triangle in the above sketch. One-hundred and four triangles
-  of either different shape or size or orientation or location can now be observed
-  in that <i>size 2</i> triangle.</p>\r\n<p>It can be observed that the <i>size 2</i>
-  triangle contains 4 <i>size 1</i> triangle building blocks. A <i>size 3</i> triangle
-  would contain 9 <i>size 1</i> triangle building blocks and a <i>size n</i> triangle
-  would thus contain <i>n<sup>2</sup> size 1</i> triangle building blocks.</p>\r\n<p>If
-  we denote T(<var>n</var>) as the number of triangles present in a triangle of <i>size
-  <var>n</var></i>, then</p>\r\n<p style=\"margin-left:50px;\">T(1) = 16<br>\r\nT(2)
-  = 104</p>\r\n<p>Find T(36).</p>\r\n\r\n"
+:content: "Consider an equilateral triangle in which straight lines are drawn from
+  each vertex to the middle of the opposite side, such as in the _size 1_ triangle
+  in the sketch below.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_163.gif)\n\nSixteen
+  triangles of either different shape or size or orientation or location can now be
+  observed in that triangle. Using _size 1_ triangles as building blocks, larger triangles
+  can be formed, such as the _size 2_ triangle in the above sketch. One-hundred and
+  four triangles of either different shape or size or orientation or location can
+  now be observed in that _size 2_ triangle.\n\nIt can be observed that the _size
+  2_ triangle contains 4 _size 1_ triangle building blocks. A _size 3_ triangle would
+  contain 9 _size 1_ triangle building blocks and a _size n_ triangle would thus contain
+  _n<sup>2</sup> size 1_ triangle building blocks.\n\nIf we denote T(<var>n</var>)
+  as the number of triangles present in a triangle of _size <var>n</var>_, then\n\nT(1)
+  = 16  \n\rT(2) = 104\n\nFind T(36).\n\n"

data/data/problems/164.yml

@@ -3,6 +3,6 @@
 :name: Numbers for which no three consecutive digits have a sum greater than a given
   value
 :url: http://projecteuler.net/problem=164
-:content: "\r\n<p>How many 20 digit numbers <var>n</var> (without any leading zero)
-  exist such that no three consecutive digits of <var>n</var> have a sum greater than
-  9?</p>\r\n"
+:content: |+
+  How many 20 digit numbers <var>n</var> (without any leading zero) exist such that no three consecutive digits of <var>n</var> have a sum greater than 9?
+

data/data/problems/165.yml

@@ -2,31 +2,28 @@
 :id: 165
 :name: Intersections
 :url: http://projecteuler.net/problem=165
-:content: "\r\n<p>A segment is uniquely defined by its two endpoints.<br> By considering
-  two line segments in plane geometry there are three possibilities:<br> \r\nthe segments
-  have zero points, one point, or infinitely many points in common.</p>\r\n<p>Moreover
-  when two segments have exactly one point in common it might be the case that that
-  common point is an endpoint of either one of the segments or of both. If a common
-  point of two segments is not an endpoint of either of the segments it is an interior
-  point of both segments.<br>\r\nWe will call a common point T of two segments L<sub>1</sub>
-  and L<sub>2</sub> a true intersection point of L<sub>1</sub> and L<sub>2</sub>  if
-  T is the only common point of L<sub>1</sub> and L<sub>2</sub>  and T is an interior
-  point of both segments.\r\n</p>\r\n<p>Consider the three segments L<sub>1</sub>,
-  L<sub>2</sub>, and L<sub>3</sub>:</p>\r\n<p style=\"margin-left:20px;\">L<sub>1</sub>:
-  (27, 44) to (12, 32)<br>\r\nL<sub>2</sub>: (46, 53) to (17, 62)<br>\r\nL<sub>3</sub>:
-  (46, 70) to (22, 40)</p>\r\n<p>It can be verified that line segments L<sub>2</sub>
-  and L<sub>3</sub> have a true intersection point. We note that as the one of the
-  end points of L<sub>3</sub>: (22,40) lies on L<sub>1</sub> this is not considered
-  to be a true point of intersection. L<sub>1</sub> and L<sub>2</sub> have no common
-  point. So among the three line segments, we find one true intersection point.</p>\r\n<p>Now
-  let us do the same for 5000 line segments. To this end, we generate 20000 numbers
-  using the so-called \"Blum Blum Shub\" pseudo-random number generator.</p>\r\n<p
-  style=\"margin-left:50px;\">s<sub>0</sub> = 290797<br><br>\r\ns<sub>n+1</sub> =
-  s<sub>n</sub><img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\"
-  border=\"0\" style=\"vertical-align:middle;\">s<sub>n</sub> (modulo 50515093)<br><br>\r\nt<sub>n</sub>
-  = s<sub>n</sub> (modulo 500)</p>\r\n<p>To create each line segment, we use four
-  consecutive numbers t<sub>n</sub>. That is, the first line segment is given by:</p>\r\n<p>(t<sub>1</sub>,
-  t<sub>2</sub>) to (t<sub>3</sub>, t<sub>4</sub>)</p>\r\n<p>The first four numbers
-  computed according to the above generator should be: 27, 144, 12 and 232. The first
-  segment would thus be (27,144) to (12,232).</p>\r\n<p>How many distinct true intersection
-  points are found among the 5000 line segments?</p>\r\n\r\n"
+:content: "A segment is uniquely defined by its two endpoints.  \n By considering
+  two line segments in plane geometry there are three possibilities:  \n \rthe segments
+  have zero points, one point, or infinitely many points in common.\n\nMoreover when
+  two segments have exactly one point in common it might be the case that that common
+  point is an endpoint of either one of the segments or of both. If a common point
+  of two segments is not an endpoint of either of the segments it is an interior point
+  of both segments.  \n\rWe will call a common point T of two segments L<sub>1</sub>
+  and L<sub>2</sub> a true intersection point of L<sub>1</sub> and L<sub>2</sub> if
+  T is the only common point of L<sub>1</sub> and L<sub>2</sub> and T is an interior
+  point of both segments.\n\nConsider the three segments L<sub>1</sub>, L<sub>2</sub>,
+  and L<sub>3</sub>:\n\nL<sub>1</sub>: (27, 44) to (12, 32)  \n\rL<sub>2</sub>: (46,
+  53) to (17, 62)  \n\rL<sub>3</sub>: (46, 70) to (22, 40)\n\nIt can be verified that
+  line segments L<sub>2</sub> and L<sub>3</sub> have a true intersection point. We
+  note that as the one of the end points of L<sub>3</sub>: (22,40) lies on L<sub>1</sub>
+  this is not considered to be a true point of intersection. L<sub>1</sub> and L<sub>2</sub>
+  have no common point. So among the three line segments, we find one true intersection
+  point.\n\nNow let us do the same for 5000 line segments. To this end, we generate
+  20000 numbers using the so-called \"Blum Blum Shub\" pseudo-random number generator.\n\ns<sub>0</sub>
+  = 290797  \n  \n  \n\rs<sub>n+1</sub> = s<sub>n</sub> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)s<sub>n</sub>
+  (modulo 50515093)  \n  \n  \n\rt<sub>n</sub> = s<sub>n</sub> (modulo 500)\n\nTo
+  create each line segment, we use four consecutive numbers t<sub>n</sub>. That is,
+  the first line segment is given by:\n\n(t<sub>1</sub>, t<sub>2</sub>) to (t<sub>3</sub>,
+  t<sub>4</sub>)\n\nThe first four numbers computed according to the above generator
+  should be: 27, 144, 12 and 232. The first segment would thus be (27,144) to (12,232).\n\nHow
+  many distinct true intersection points are found among the 5000 line segments?\n\n"

data/data/problems/166.yml

@@ -2,14 +2,10 @@
 :id: 166
 :name: Criss Cross
 :url: http://projecteuler.net/problem=166
-:content: "\r\n<p>A 4x4 grid is filled with digits d, 0 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  d <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 9.</p>\r\n\r\n<p>It can be seen that in the grid</p>\r\n\r\n<p
-  style=\"text-align:center;\">\r\n6 3 3 0<br>\r\n5 0 4 3<br>\r\n0 7 1 4<br>\r\n1
-  2 4 5</p>\r\n\r\n<p>the sum of each row and each column has the value 12. Moreover
-  the sum of each diagonal is also 12.</p>\r\n\r\n<p>In how many ways can you fill
-  a 4x4 grid with the digits d, 0 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> d <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  9 so that each row, each column, and both diagonals have the same sum?</p>\r\n"
+:content: "A 4x4 grid is filled with digits d, 0 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  d ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 9.\n\nIt
+  can be seen that in the grid\n\n6 3 3 0  \n\r5 0 4 3  \n\r0 7 1 4  \n\r1 2 4 5\n\nthe
+  sum of each row and each column has the value 12. Moreover the sum of each diagonal
+  is also 12.\n\nIn how many ways can you fill a 4x4 grid with the digits d, 0 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  d ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 9 so that
+  each row, each column, and both diagonals have the same sum?\n\n"

data/data/problems/167.yml

@@ -2,16 +2,14 @@
 :id: 167
 :name: Investigating Ulam sequences
 :url: http://projecteuler.net/problem=167
-:content: "\r\n<p>For two positive integers a and b, the Ulam sequence U(a,b) is defined
-  by U(a,b)<sub>1</sub> = a, U(a,b)<sub>2</sub> = b and for k &gt; 2,\r\nU(a,b)<sub>k</sub>
+:content: "For two positive integers a and b, the Ulam sequence U(a,b) is defined
+  by U(a,b)<sub>1</sub> = a, U(a,b)<sub>2</sub> = b and for k > 2,\rU(a,b)<sub>k</sub>
   is the smallest integer greater than U(a,b)<sub>(k-1)</sub> which can be written
-  in exactly one way as the sum of two distinct previous members of U(a,b).</p>\r\n<p>For
-  example, the sequence U(1,2) begins with<br>\r\n1, 2, 3 = 1 + 2, 4 = 1 + 3, 6 =
-  2 + 4, 8 = 2 + 6, 11 = 3 + 8;<br>\r\n5 does not belong to it because 5 = 1 + 4 =
-  2 + 3 has two representations as the sum of two previous members, likewise 7 = 1
-  + 6 = 3 + 4.</p>\r\n<p>Find <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\"
-  alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">U(2,2<var>n</var>+1)<sub><var>k</var></sub>
-  for 2 <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;\">10,
-  where <var>k</var> = 10<sup>11</sup>.</p>\r\n"
+  in exactly one way as the sum of two distinct previous members of U(a,b).\n\nFor
+  example, the sequence U(1,2) begins with  \n\r1, 2, 3 = 1 + 2, 4 = 1 + 3, 6 = 2
+  + 4, 8 = 2 + 6, 11 = 3 + 8;  \n\r5 does not belong to it because 5 = 1 + 4 = 2 +
+  3 has two representations as the sum of two previous members, likewise 7 = 1 + 6
+  = 3 + 4.\n\nFind ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)U(2,2<var>n</var>+1)<sub><var>k</var></sub>
+  for 2 ![≤](/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)10, where
+  <var>k</var> = 10<sup>11</sup>.\n\n"

data/data/problems/168.yml

@@ -2,12 +2,10 @@
 :id: 168
 :name: Number Rotations
 :url: http://projecteuler.net/problem=168
-:content: "\r\n<p>Consider the number 142857. We can right-rotate this number by moving
-  the last digit (7) to the front of it, giving us 714285.<br>\r\nIt can be verified
-  that 714285=5<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\"
-  border=\"0\" style=\"vertical-align:middle;\">142857.<br>\r\nThis demonstrates an
-  unusual property of 142857: it is a divisor of its right-rotation.</p>\r\n<p>Find
-  the last 5 digits of the sum of all integers <var>n</var>, 10 <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" 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>100</sup>, that have this property.</p>\r\n\r\n"
+:content: "Consider the number 142857. We can right-rotate this number by moving the
+  last digit (7) to the front of it, giving us 714285.  \n\rIt can be verified that
+  714285=5 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)142857.
+  \ \n\rThis demonstrates an unusual property of 142857: it is a divisor of its right-rotation.\n\nFind
+  the last 5 digits of the sum of all integers <var>n</var>, 10 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  <var>n</var> ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  10<sup>100</sup>, that have this property.\n\n"

data/data/problems/169.yml

@@ -3,8 +3,7 @@
 :name: Exploring the number of different ways a number can be expressed as a sum of
   powers of 2
 :url: http://projecteuler.net/problem=169
-:content: "\r\n<p>Define f(0)=1 and f(<var>n</var>) to be the number of different
-  ways <var>n</var> can be expressed as a sum of integer powers of 2 using each power
-  no more than twice.</p>\r\n<p>For example, f(10)=5 since there are five different
-  ways to express 10:</p>\r\n<p style=\"margin-left:50px;\">1 + 1 + 8<br>\r\n1 + 1
-  + 4 + 4<br>1 + 1 + 2 + 2 + 4<br>\r\n2 + 4 + 4<br>\r\n2 + 8</p>\r\n<p>What is f(10<sup>25</sup>)?</p>\r\n\r\n"
+:content: "Define f(0)=1 and f(<var>n</var>) to be the number of different ways <var>n</var>
+  can be expressed as a sum of integer powers of 2 using each power no more than twice.\n\nFor
+  example, f(10)=5 since there are five different ways to express 10:\n\n1 + 1 + 8
+  \ \n\r1 + 1 + 4 + 4  \n1 + 1 + 2 + 2 + 4  \n\r2 + 4 + 4  \n\r2 + 8\n\nWhat is f(10<sup>25</sup>)?\n\n"