euler-manager 0.0.5 → 0.0.6

data/data/problems/29.yml

@@ -2,23 +2,16 @@
 :id: 29
 :name: Distinct powers
 :url: http://projecteuler.net/problem=29
-:content: "\r\n\n<p>Consider all integer combinations of <i>a</i><sup><i>b</i></sup>
-  for 2 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><i>a</i> <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 5 and 2 <img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><i>b</i>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 5:</p>\n<blockquote>2<sup>2</sup>=4, 2<sup>3</sup>=8,
-  2<sup>4</sup>=16, 2<sup>5</sup>=32<br>\n3<sup>2</sup>=9, 3<sup>3</sup>=27, 3<sup>4</sup>=81,
-  3<sup>5</sup>=243<br>\n4<sup>2</sup>=16, 4<sup>3</sup>=64, 4<sup>4</sup>=256, 4<sup>5</sup>=1024<br>\n5<sup>2</sup>=25,
-  5<sup>3</sup>=125, 5<sup>4</sup>=625, 5<sup>5</sup>=3125<br>\n</blockquote>\n<p>If
-  they are then placed in numerical order, with any repeats removed, we get the following
-  sequence of 15 distinct terms:</p>\n<p style=\"text-align:center;\">4, 8, 9, 16,
-  25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125</p>\n<p>How many distinct terms
-  are in the sequence generated by <i>a</i><sup><i>b</i></sup> for 2 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><i>a</i>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 100 and 2 <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><i>b</i> <img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  100?</p>\n\r\n"
+:content: "Consider all integer combinations of _a_<sup><i>b</i></sup> for 2 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  _a_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 5 and
+  2 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) _b_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  5:\n\n> 2<sup>2</sup>=4, 2<sup>3</sup>=8, 2<sup>4</sup>=16, 2<sup>5</sup>=32  \n>
+  3<sup>2</sup>=9, 3<sup>3</sup>=27, 3<sup>4</sup>=81, 3<sup>5</sup>=243  \n> 4<sup>2</sup>=16,
+  4<sup>3</sup>=64, 4<sup>4</sup>=256, 4<sup>5</sup>=1024  \n> 5<sup>2</sup>=25, 5<sup>3</sup>=125,
+  5<sup>4</sup>=625, 5<sup>5</sup>=3125\n\nIf they are then placed in numerical order,
+  with any repeats removed, we get the following sequence of 15 distinct terms:\n\n4,
+  8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125\n\nHow many distinct
+  terms are in the sequence generated by _a_<sup><i>b</i></sup> for 2 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  _a_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 100 and
+  2 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) _b_ ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  100?\n\n"

data/data/problems/290.yml

@@ -2,7 +2,6 @@
 :id: 290
 :name: Digital Signature
 :url: http://projecteuler.net/problem=290
-:content: "\r\n<p>How many integers 0 <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>
-  &amp;lt 10<sup>18</sup> have the property that the sum of the digits of <var>n</var>
-  equals the sum of digits of 137<var>n</var>?</p>\r\n"
+:content: |+
+  How many integers 0 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>n</var> &lt 10<sup>18</sup> have the property that the sum of the digits of <var>n</var> equals the sum of digits of 137<var>n</var>?
+

data/data/problems/291.yml

@@ -2,9 +2,6 @@
 :id: 291
 :name: Panaitopol Primes
 :url: http://projecteuler.net/problem=291
-:content: "\r\n<p>\r\nA prime number <var>p</var> is called a Panaitopol prime if
-  <img src=\"project/images/p_291_formula.gif\" style=\"vertical-align:middle\"> for
-  some positive integers<br><var>x</var> and <var>y</var>.\r\n</p>\r\n<p>\r\nFind
-  how many Panaitopol primes are less than 5<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">10<sup>15</sup>.\r\n</p>\r\n\r\n
-  \ \r\n"
+:content: "A prime number <var>p</var> is called a Panaitopol prime if ![](/home/will/src/euler-manager/config/../data/images/p_291_formula.gif)
+  for some positive integers  \n <var>x</var> and <var>y</var>.\n\nFind how many Panaitopol
+  primes are less than 5 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)10<sup>15</sup>.\n\n"

data/data/problems/292.yml

@@ -2,12 +2,11 @@
 :id: 292
 :name: Pythagorean Polygons
 :url: http://projecteuler.net/problem=292
-:content: "\r\n<p>We shall define a <i>pythagorean polygon</i>  to be a <b>convex
-  polygon</b> with the following properties:<br></p>\n<ul>\n<li>there are at least
-  three vertices,</li>\r\n<li>no three vertices are aligned,</li>\r\n<li>each vertex
-  has <b>integer coordinates</b>,</li>\r\n<li>each edge has <b>integer length</b>.</li>\n</ul>\n<p>For
-  a given integer <var>n</var>, define P(<var>n</var>) as the number of distinct pythagorean
-  polygons for which the perimeter is <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> <var>n</var>.<br>\r\nPythagorean
-  polygons should be considered distinct as long as none is a translation of another.</p>\r\n\r\n<p>You
-  are given that P(4) = 1, P(30) = 3655 and P(60) = 891045.<br>\r\nFind P(120).</p>\r\n"
+:content: "We shall define a _pythagorean polygon_ to be a **convex polygon** with
+  the following properties:\n\n- there are at least three vertices,\n- no three vertices
+  are aligned,\n- each vertex has **integer coordinates** ,\n- each edge has **integer
+  length** .\n\nFor a given integer <var>n</var>, define P(<var>n</var>) as the number
+  of distinct pythagorean polygons for which the perimeter is ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) <var>n</var>.
+  \ \n\rPythagorean polygons should be considered distinct as long as none is a translation
+  of another.\n\nYou are given that P(4) = 1, P(30) = 3655 and P(60) = 891045.  \n\rFind
+  P(120).\n\n"

data/data/problems/293.yml

@@ -2,14 +2,13 @@
 :id: 293
 :name: Pseudo-Fortunate Numbers
 :url: http://projecteuler.net/problem=293
-:content: "\r\n<p>\r\nAn even positive integer N will be called admissible, if it
-  is a power of 2 or its distinct prime factors are consecutive primes.<br>\r\nThe
-  first twelve admissible numbers are 2,4,6,8,12,16,18,24,30,32,36,48.\r\n</p>\r\n<p>\r\nIf
-  N is admissible, the smallest integer M <img src=\"images/symbol_gt.gif\" width=\"10\"
-  height=\"10\" alt=\"&gt;\" border=\"0\" style=\"vertical-align:middle;\"> 1 such
-  that N+M is prime, will be called the pseudo-Fortunate number for N.\r\n</p>\r\n<p>\r\nFor
+:content: "An even positive integer N will be called admissible, if it is a power
+  of 2 or its distinct prime factors are consecutive primes.  \n\rThe first twelve
+  admissible numbers are 2,4,6,8,12,16,18,24,30,32,36,48.\n\nIf N is admissible, the
+  smallest integer M ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)
+  1 such that N+M is prime, will be called the pseudo-Fortunate number for N.\n\nFor
   example, N=630 is admissible since it is even and its distinct prime factors are
-  the consecutive primes 2,3,5 and 7.<br> \r\nThe next prime number after 631 is 641;
-  hence, the pseudo-Fortunate number for 630 is M=11.<br>\r\nIt can also be seen that
-  the pseudo-Fortunate number for 16 is 3.\r\n</p>\r\n<p>\r\nFind the sum of all distinct
-  pseudo-Fortunate numbers for admissible numbers N less than 10<sup>9</sup>.\r\n</p>\r\n\r\n\r\n\r\n"
+  the consecutive primes 2,3,5 and 7.  \n \rThe next prime number after 631 is 641;
+  hence, the pseudo-Fortunate number for 630 is M=11.  \n\rIt can also be seen that
+  the pseudo-Fortunate number for 16 is 3.\n\nFind the sum of all distinct pseudo-Fortunate
+  numbers for admissible numbers N less than 10<sup>9</sup>.\n\n"

data/data/problems/294.yml

@@ -2,9 +2,9 @@
 :id: 294
 :name: 'Sum of digits - experience #23'
 :url: http://projecteuler.net/problem=294
-:content: "\r\n<p>\r\nFor a positive integer k, define d(k) as the sum of the digits
-  of k in its usual decimal representation.\r\nThus d(42) = 4+2 = 6.\r\n</p>\r\n<p>\r\nFor
-  a positive integer n, define S(n) as the number of positive integers k n with the
-  following properties :\r\n</p>\n<ul>\n<li>k is divisible by 23 and\r\n</li>\n<li>d(k)
-  = 23.\r\n</li>\n</ul>\r\nYou are given that S(9) = 263626 and S(42) = 6377168878570056.\r\n\r\n<p>\r\nFind
-  S(11<sup>12</sup>) and give your answer mod 10<sup>9</sup>.\r\n</p>\r\n\r\n"
+:content: "For a positive integer k, define d(k) as the sum of the digits of k in
+  its usual decimal representation.\rThus d(42) = 4+2 = 6.\n\nFor a positive integer
+  n, define S(n) as the number of positive integers k n with the following properties
+  :\n\n- k is divisible by 23 and\r\n- d(k) = 23.\r\n\r\rYou are given that S(9) =
+  263626 and S(42) = 6377168878570056.\r\r\n\nFind S(11<sup>12</sup>) and give your
+  answer mod 10<sup>9</sup>.\n\n"

data/data/problems/295.yml

@@ -2,25 +2,20 @@
 :id: 295
 :name: Lenticular holes
 :url: http://projecteuler.net/problem=295
-:content: "\r\n<p>We call the convex area enclosed by two circles a <i>lenticular
-  hole</i> if:\r\n</p>\n<ul>\n<li>The centres of both circles are on lattice points.</li>\r\n<li>The
-  two circles intersect at two distinct lattice points.</li>\r\n<li>The interior of
-  the convex area enclosed by both circles does not contain any lattice points.\r\n</li>\r\n</ul>\n<p>Consider
-  the circles:<br>\r\nC<sub>0</sub>: <var>x</var><sup>2</sup>+<var>y</var><sup>2</sup>=25<br>\r\nC<sub>1</sub>:
-  (<var>x</var>+4)<sup>2</sup>+(<var>y</var>-4)<sup>2</sup>=1<br>\r\nC<sub>2</sub>:
-  (<var>x</var>-12)<sup>2</sup>+(<var>y</var>-4)<sup>2</sup>=65\r\n</p>\r\n<p>\r\nThe
+:content: "We call the convex area enclosed by two circles a _lenticular hole_ if:\n\n-
+  The centres of both circles are on lattice points.\n- The two circles intersect
+  at two distinct lattice points.\n- The interior of the convex area enclosed by both
+  circles does not contain any lattice points.\r\n\nConsider the circles:  \n\rC<sub>0</sub>:
+  <var>x</var><sup>2</sup>+<var>y</var><sup>2</sup>=25  \n\rC<sub>1</sub>: (<var>x</var>+4)<sup>2</sup>+(<var>y</var>-4)<sup>2</sup>=1
+  \ \n\rC<sub>2</sub>: (<var>x</var>-12)<sup>2</sup>+(<var>y</var>-4)<sup>2</sup>=65\n\nThe
   circles C<sub>0</sub>, C<sub>1</sub> and C<sub>2</sub> are drawn in the picture
-  below.</p>\r\n<div align=\"center\"><img src=\"project/images/p295_lenticular.gif\"></div>\r\n<p>\r\nC<sub>0</sub>
-  and C<sub>1</sub> form a lenticular hole, as well as C<sub>0</sub> and C<sub>2</sub>.</p>\r\n<p>\r\nWe
-  call an ordered pair of positive real numbers (r<sub>1</sub>, r<sub>2</sub>) a <i>lenticular
-  pair</i> if there exist two circles with radii r<sub>1</sub> and r<sub>2</sub> that
-  form a lenticular hole.\r\nWe can verify that (1, 5) and (5, <img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">65)
-  are the lenticular pairs of the example above.</p>\r\n<p>\r\nLet L(N) be the number
-  of <b>distinct</b> lenticular pairs (r<sub>1</sub>, r<sub>2</sub>) for which 0 <img
-  src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> r<sub>1</sub><img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  r<sub>2</sub><img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
-  border=\"0\" style=\"vertical-align:middle;\"> N.<br>\r\nWe can verify that L(10)
-  = 30 and L(100) = 3442.</p>\r\n<p>\r\nFind L(100 000).\r\n</p>\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n"
+  below.\n\n ![](/home/will/src/euler-manager/config/../data/images/p295_lenticular.gif)\n\nC<sub>0</sub>
+  and C<sub>1</sub> form a lenticular hole, as well as C<sub>0</sub> and C<sub>2</sub>.\n\nWe
+  call an ordered pair of positive real numbers (r<sub>1</sub>, r<sub>2</sub>) a _lenticular
+  pair_ if there exist two circles with radii r<sub>1</sub> and r<sub>2</sub> that
+  form a lenticular hole.\rWe can verify that (1, 5) and (5, ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)65)
+  are the lenticular pairs of the example above.\n\nLet L(N) be the number of **distinct**
+  lenticular pairs (r<sub>1</sub>, r<sub>2</sub>) for which 0 ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif)
+  r<sub>1</sub> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  r<sub>2</sub> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  N.  \n\rWe can verify that L(10) = 30 and L(100) = 3442.\n\nFind L(100 000).\n\n"

data/data/problems/296.yml

@@ -2,14 +2,12 @@
 :id: 296
 :name: Angular Bisector and Tangent
 :url: http://projecteuler.net/problem=296
-:content: "\r\n<p>\r\nGiven is an integer sided triangle <var>ABC</var> with <var>BC</var>
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>AC</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>AB</var>.<br><var>k</var>
-  is the angular bisector of angle <var>ACB</var>.<br><var>m</var> is the tangent
-  at <var>C</var> to the circumscribed circle of <var>ABC</var>.<br><var>n</var> is
-  a line parallel to <var>m</var> through <var>B</var>.<br>\r\nThe intersection of
-  <var>n</var> and <var>k</var> is called <var>E</var>.\r\n</p>\r\n<div align=\"center\"><img
-  src=\"project/images/p296_bisector.gif\"></div>\r\n<p>\r\nHow many triangles <var>ABC</var>
-  with a perimeter not exceeding 100 000 exist such that <var>BE</var> has integral
-  length?\r\n</p>\r\n\r\n\r\n"
+:content: "Given is an integer sided triangle <var>ABC</var> with <var>BC</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>AC</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  <var>AB</var>.  \n<var>k</var> is the angular bisector of angle <var>ACB</var>.
+  \ \n <var>m</var> is the tangent at <var>C</var> to the circumscribed circle of
+  <var>ABC</var>.  \n <var>n</var> is a line parallel to <var>m</var> through <var>B</var>.
+  \ \n\rThe intersection of <var>n</var> and <var>k</var> is called <var>E</var>.\n\n
+  ![](/home/will/src/euler-manager/config/../data/images/p296_bisector.gif)\n\nHow
+  many triangles <var>ABC</var> with a perimeter not exceeding 100 000 exist such
+  that <var>BE</var> has integral length?\n\n"

data/data/problems/297.yml

@@ -2,18 +2,15 @@
 :id: 297
 :name: Zeckendorf Representation
 :url: http://projecteuler.net/problem=297
-:content: "\r\n<p>Each new term in the Fibonacci sequence is generated by adding the
-  previous two terms.<br>\r\nStarting with 1 and 2, the first 10 terms will be: 1,
-  2, 3, 5, 8, 13, 21, 34, 55, 89.</p>\r\n\r\n<p>Every positive integer can be uniquely
-  written as a sum of nonconsecutive terms of the Fibonacci sequence. For example,
-  100 = 3 + 8 + 89.<br>\r\nSuch a sum is called the <b>Zeckendorf representation</b>
-  of the number.</p>\r\n\r\n<p>For any integer <var>n</var>&gt;0, let <var>z</var>(<var>n</var>)
-  be the number of terms in the Zeckendorf representation of <var>n</var>.<br>\r\nThus,
-  <var>z</var>(5) = 1, <var>z</var>(14) = 2, <var>z</var>(100) = 3 etc.<br>\r\nAlso,
-  for 0<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>6</sup>,
-  ∑ <var>z</var>(<var>n</var>) = 7894453.</p>\r\n\r\n<p>Find ∑ <var>z</var>(<var>n</var>)
-  for 0<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>17</sup>.</p>\r\n"
+:content: "Each new term in the Fibonacci sequence is generated by adding the previous
+  two terms.  \n\rStarting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8,
+  13, 21, 34, 55, 89.\n\nEvery positive integer can be uniquely written as a sum of
+  nonconsecutive terms of the Fibonacci sequence. For example, 100 = 3 + 8 + 89.  \n\rSuch
+  a sum is called the **Zeckendorf representation** of the number.\n\nFor any integer
+  <var>n</var>>0, let <var>z</var>(<var>n</var>) be the number of terms in the Zeckendorf
+  representation of <var>n</var>.  \n\rThus, <var>z</var>(5) = 1, <var>z</var>(14) = 2,
+  <var>z</var>(100) = 3 etc.  \n\rAlso, for 0 ![<](/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>6</sup>,
+  ∑ <var>z</var>(<var>n</var>) = 7894453.\n\nFind ∑ <var>z</var>(<var>n</var>) for
+  0 ![<](/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>17</sup>.\n\n"

data/data/problems/298.yml

@@ -2,45 +2,45 @@
 :id: 298
 :name: Selective Amnesia
 :url: http://projecteuler.net/problem=298
-:content: "\r\n<style type=\"text/css\">\r\ntable.p298, table.p298 th, table.p298
+:content: "<style type=\"text/css\"><![CDATA[\r\ntable.p298, table.p298 th, table.p298
   td {\r\n  border-width: 1px 1px 1px 1px;\r\n  border-style: solid solid solid solid;\r\n
   \ border-color: black black black black;\r\n  text-align:center;\r\n  -moz-border-radius:
   0px 0px 0px 0px;\r\n}\r\ntable.p298 {\r\n  border-spacing: 1px;\r\n  border-collapse:
   separate;\r\n  background-color: rgb(255,255,255);\r\n}\r\ntable.p298 th, table.p298
   td {\r\n  padding: 1px 6px 1px 6px;\r\n}\r\ntable.p298 th { background-color: rgb(200,220,250);
-  }\r\ntable.p298 td { background-color: rgb(255,255,255); }\r\n</style>\n<p>Larry
+  }\r\ntable.p298 td { background-color: rgb(255,255,255); }\r\n]]></style>\n\nLarry
   and Robin play a memory game involving of a sequence of random numbers between 1
   and 10, inclusive, that are called out one at a time. Each player can remember up
   to 5 previous numbers. When the called number is in a player's memory, that player
   is awarded a point. If it's not, the player adds the called number to his memory,
-  removing another number if his memory is full.</p>\r\n\r\n<p>Both players start
-  with empty memories. Both players always add new missed numbers to their memory
-  but use a different strategy in deciding which number to remove:<br>\r\nLarry's
-  strategy is to remove the number that hasn't been called in the longest time.<br>\r\nRobin's
-  strategy is to remove the number that's been in the memory the longest time.</p>\r\n\r\n<p>Example
-  game:<br></p>\n<center><table class=\"p298\">\n<tr>\n<th>Turn</th>\r\n  <th>Called<br>number</th>\r\n
-  \ <th style=\"text-align:right\">Larry's<br>memory</th>\r\n  <th>Larry's<br>score</th>\r\n
-  \ <th style=\"text-align:right\">Robin's<br>memory</th>\r\n  <th>Robin's<br>score</th>\r\n</tr>\n<tr>\n<td>1</td>\r\n
-  \ <td>1</td>\r\n  <td style=\"text-align:right\">1</td>\r\n  <td>0</td>\r\n  <td
-  style=\"text-align:right\">1</td>\r\n  <td>0</td>\r\n</tr>\n<tr>\n<td>2</td>\r\n
+  removing another number if his memory is full.\n\nBoth players start with empty
+  memories. Both players always add new missed numbers to their memory but use a different
+  strategy in deciding which number to remove:  \n\rLarry's strategy is to remove
+  the number that hasn't been called in the longest time.  \n\rRobin's strategy is
+  to remove the number that's been in the memory the longest time.\n\nExample game:\n\n<center><table
+  class=\"p298\">\r\n<tr>\r\n  <th>Turn</th>\r\n  <th>Called<br>number</th>\r\n  <th
+  style=\"text-align:right\">Larry's<br>memory</th>\r\n  <th>Larry's<br>score</th>\r\n
+  \ <th style=\"text-align:right\">Robin's<br>memory</th>\r\n  <th>Robin's<br>score</th>\r\n</tr>\r\n<tr>\r\n
+  \ <td>1</td>\r\n  <td>1</td>\r\n  <td style=\"text-align:right\">1</td>\r\n  <td>0</td>\r\n
+  \ <td style=\"text-align:right\">1</td>\r\n  <td>0</td>\r\n</tr>\r\n<tr>\r\n  <td>2</td>\r\n
   \ <td>2</td>\r\n  <td style=\"text-align:right\">1,2</td>\r\n  <td>0</td>\r\n  <td
-  style=\"text-align:right\">1,2</td>\r\n  <td>0</td>\r\n</tr>\n<tr>\n<td>3</td>\r\n
+  style=\"text-align:right\">1,2</td>\r\n  <td>0</td>\r\n</tr>\r\n<tr>\r\n  <td>3</td>\r\n
   \ <td>4</td>\r\n  <td style=\"text-align:right\">1,2,4</td>\r\n  <td>0</td>\r\n
-  \ <td style=\"text-align:right\">1,2,4</td>\r\n  <td>0</td>\r\n</tr>\n<tr>\n<td>4</td>\r\n
-  \ <td>6</td>\r\n  <td style=\"text-align:right\">1,2,4,6</td>\r\n  <td>0</td>\r\n
-  \ <td style=\"text-align:right\">1,2,4,6</td>\r\n  <td>0</td>\r\n</tr>\n<tr>\n<td>5</td>\r\n
-  \ <td>1</td>\r\n  <td style=\"text-align:right\">1,2,4,6</td>\r\n  <td>1</td>\r\n
-  \ <td style=\"text-align:right\">1,2,4,6</td>\r\n  <td>1</td>\r\n</tr>\n<tr>\n<td>6</td>\r\n
-  \ <td>8</td>\r\n  <td style=\"text-align:right\">1,2,4,6,8</td>\r\n  <td>1</td>\r\n
-  \ <td style=\"text-align:right\">1,2,4,6,8</td>\r\n  <td>1</td>\r\n</tr>\n<tr>\n<td>7</td>\r\n
-  \ <td>10</td>\r\n  <td style=\"text-align:right\">1,4,6,8,10</td>\r\n  <td>1</td>\r\n
-  \ <td style=\"text-align:right\">2,4,6,8,10</td>\r\n  <td>1</td>\r\n</tr>\n<tr>\n<td>8</td>\r\n
-  \ <td>2</td>\r\n  <td style=\"text-align:right\">1,2,6,8,10</td>\r\n  <td>1</td>\r\n
-  \ <td style=\"text-align:right\">2,4,6,8,10</td>\r\n  <td>2</td>\r\n</tr>\n<tr>\n<td>9</td>\r\n
-  \ <td>4</td>\r\n  <td style=\"text-align:right\">1,2,4,8,10</td>\r\n  <td>1</td>\r\n
-  \ <td style=\"text-align:right\">2,4,6,8,10</td>\r\n  <td>3</td>\r\n</tr>\n<tr>\n<td>10</td>\r\n
-  \ <td>1</td>\r\n  <td style=\"text-align:right\">1,2,4,8,10</td>\r\n  <td>2</td>\r\n
-  \ <td style=\"text-align:right\">1,4,6,8,10</td>\r\n  <td>3</td>\r\n</tr>\n</table></center>\r\n\r\n<p>Denoting
+  \ <td style=\"text-align:right\">1,2,4</td>\r\n  <td>0</td>\r\n</tr>\r\n<tr>\r\n
+  \ <td>4</td>\r\n  <td>6</td>\r\n  <td style=\"text-align:right\">1,2,4,6</td>\r\n
+  \ <td>0</td>\r\n  <td style=\"text-align:right\">1,2,4,6</td>\r\n  <td>0</td>\r\n</tr>\r\n<tr>\r\n
+  \ <td>5</td>\r\n  <td>1</td>\r\n  <td style=\"text-align:right\">1,2,4,6</td>\r\n
+  \ <td>1</td>\r\n  <td style=\"text-align:right\">1,2,4,6</td>\r\n  <td>1</td>\r\n</tr>\r\n<tr>\r\n
+  \ <td>6</td>\r\n  <td>8</td>\r\n  <td style=\"text-align:right\">1,2,4,6,8</td>\r\n
+  \ <td>1</td>\r\n  <td style=\"text-align:right\">1,2,4,6,8</td>\r\n  <td>1</td>\r\n</tr>\r\n<tr>\r\n
+  \ <td>7</td>\r\n  <td>10</td>\r\n  <td style=\"text-align:right\">1,4,6,8,10</td>\r\n
+  \ <td>1</td>\r\n  <td style=\"text-align:right\">2,4,6,8,10</td>\r\n  <td>1</td>\r\n</tr>\r\n<tr>\r\n
+  \ <td>8</td>\r\n  <td>2</td>\r\n  <td style=\"text-align:right\">1,2,6,8,10</td>\r\n
+  \ <td>1</td>\r\n  <td style=\"text-align:right\">2,4,6,8,10</td>\r\n  <td>2</td>\r\n</tr>\r\n<tr>\r\n
+  \ <td>9</td>\r\n  <td>4</td>\r\n  <td style=\"text-align:right\">1,2,4,8,10</td>\r\n
+  \ <td>1</td>\r\n  <td style=\"text-align:right\">2,4,6,8,10</td>\r\n  <td>3</td>\r\n</tr>\r\n<tr>\r\n
+  \ <td>10</td>\r\n  <td>1</td>\r\n  <td style=\"text-align:right\">1,2,4,8,10</td>\r\n
+  \ <td>2</td>\r\n  <td style=\"text-align:right\">1,4,6,8,10</td>\r\n  <td>3</td>\r\n</tr>\n</table></center>\n\nDenoting
   Larry's score by <var>L</var> and Robin's score by <var>R</var>, what is the expected
   value of |<var>L</var>-<var>R</var>| after 50 turns? Give your answer rounded to
-  eight decimal places using the format x.xxxxxxxx .</p>\r\n"
+  eight decimal places using the format x.xxxxxxxx .\n\n"

data/data/problems/299.yml

@@ -2,30 +2,24 @@
 :id: 299
 :name: Three similar triangles
 :url: http://projecteuler.net/problem=299
-:content: "\r\n<p>Four points with integer coordinates are selected:<br>A(<var>a</var>, 0),
-  B(<var>b</var>, 0), C(0, <var>c</var>) and D(0, <var>d</var>), \r\nwith 0 <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"> <var>a</var> <img
-  src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> <var>b</var> and 0 <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"> <var>c</var> <img
-  src=\"images/symbol_lt.gif\" width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\"
-  style=\"vertical-align:middle;\"> <var>d</var>.<br>\r\nPoint P, also with integer
-  coordinates, is chosen on the line AC so that the three triangles ABP, CDP and BDP
-  are all <dfn title=\"Have equal angles\">similar</dfn>.</p>\r\n<div align=\"center\"><img
-  src=\"project/images/p_299_ThreeSimTri.gif\"></div>\r\n<p>It is easy to prove that
-  the three triangles can be similar, only if <var>a</var>=<var>c</var>.</p>\r\n\r\n<p>So,
+:content: "Four points with integer coordinates are selected:  \nA(<var>a</var>, 0),
+  B(<var>b</var>, 0), C(0, <var>c</var>) and D(0, <var>d</var>), \rwith 0  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) <var>a</var> 
+  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) <var>b</var>
+  and 0  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) <var>c</var> 
+  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) <var>d</var>.
+  \ \n\rPoint P, also with integer coordinates, is chosen on the line AC so that the
+  three triangles ABP, CDP and BDP are all <dfn title=\"Have equal angles\">similar</dfn>.\n\n
+  ![](/home/will/src/euler-manager/config/../data/images/p_299_ThreeSimTri.gif)\n\nIt
+  is easy to prove that the three triangles can be similar, only if <var>a</var>=<var>c</var>.\n\nSo,
   given that <var>a</var>=<var>c</var>, we are looking for triplets (<var>a</var>,<var>b</var>,<var>d</var>)
   such that at least one point P (with integer coordinates) exists on AC, making the
-  three triangles ABP, CDP and BDP all similar.</p>\r\n\r\n<p>For example, if (<var>a</var>,<var>b</var>,<var>d</var>)=(2,3,4),
-  it can be easily verified that point P(1,1) satisfies the above condition. \r\nNote
+  three triangles ABP, CDP and BDP all similar.\n\nFor example, if (<var>a</var>,<var>b</var>,<var>d</var>)=(2,3,4),
+  it can be easily verified that point P(1,1) satisfies the above condition. \rNote
   that the triplets (2,3,4) and (2,4,3) are considered as distinct, although point
-  P(1,1) is common for both.</p>\r\n\r\n<p>If <var>b</var>+<var>d</var> <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"> 100,
+  P(1,1) is common for both.\n\nIf <var>b</var>+<var>d</var>  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 100,
   there are 92 distinct triplets (<var>a</var>,<var>b</var>,<var>d</var>) such that
-  point P exists.<br>\r\nIf <var>b</var>+<var>d</var> <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"> 100
+  point P exists.  \n\rIf <var>b</var>+<var>d</var>  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 100
   000, there are 320471 distinct triplets (<var>a</var>,<var>b</var>,<var>d</var>)
-  such that point P exists.</p>\r\n<p>If <var>b</var>+<var>d</var> <img src=\"images/symbol_lt.gif\"
-  width=\"10\" height=\"10\" alt=\"&lt;\" border=\"0\" style=\"vertical-align:middle;\"> 100
+  such that point P exists.\n\nIf <var>b</var>+<var>d</var>  ![<](/home/will/src/euler-manager/config/../data/images/symbol_lt.gif) 100
   000 000, how many distinct triplets (<var>a</var>,<var>b</var>,<var>d</var>) are
-  there such that point P exists?</p>\r\n"
+  there such that point P exists?\n\n"

data/data/problems/3.yml

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

data/data/problems/30.yml

@@ -2,11 +2,10 @@
 :id: 30
 :name: Digit fifth powers
 :url: http://projecteuler.net/problem=30
-:content: "\r\n\n<p>Surprisingly there are only three numbers that can be written
-  as the sum of fourth powers of their digits:</p>\n<blockquote>1634 = 1<sup>4</sup>
-  + 6<sup>4</sup> + 3<sup>4</sup> + 4<sup>4</sup><br>\n8208 = 8<sup>4</sup> + 2<sup>4</sup>
-  + 0<sup>4</sup> + 8<sup>4</sup><br>\n9474 = 9<sup>4</sup> + 4<sup>4</sup> + 7<sup>4</sup>
-  + 4<sup>4</sup>\n</blockquote>\n<p class=\"info\">As 1 = 1<sup>4</sup> is not a
-  sum it is not included.</p>\n<p>The sum of these numbers is 1634 + 8208 + 9474 =
-  19316.</p>\n<p>Find the sum of all the numbers that can be written as the sum of
-  fifth powers of their digits.</p>\n\r\n"
+:content: "Surprisingly there are only three numbers that can be written as the sum
+  of fourth powers of their digits:\n\n> 1634 = 1<sup>4</sup> + 6<sup>4</sup> + 3<sup>4</sup>
+  + 4<sup>4</sup>  \n> 8208 = 8<sup>4</sup> + 2<sup>4</sup> + 0<sup>4</sup> + 8<sup>4</sup>
+  \ \n> 9474 = 9<sup>4</sup> + 4<sup>4</sup> + 7<sup>4</sup> + 4<sup>4</sup>\n\nAs
+  1 = 1<sup>4</sup> is not a sum it is not included.\n\nThe sum of these numbers is
+  1634 + 8208 + 9474 = 19316.\n\nFind the sum of all the numbers that can be written
+  as the sum of fifth powers of their digits.\n\n"

data/data/problems/300.yml

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

data/data/problems/301.yml

@@ -2,24 +2,22 @@
 :id: 301
 :name: Nim
 :url: http://projecteuler.net/problem=301
-:content: "\r\n<p><i>Nim</i> is a game played with heaps of stones, where two players
-  take it in turn to remove any number of stones from any heap until no stones remain.</p>\r\n\r\n<p>We'll
-  consider the three-heap normal-play version of Nim, which works as follows:<br>\r\n-
-  At the start of the game there are three heaps of stones.<br>\r\n- On his turn the
-  player removes any positive number of stones from any single heap.<br>\r\n- The
-  first player unable to move (because no stones remain) loses.</p>\r\n\r\n<p> If
-  (<var>n</var><sub>1</sub>,<var>n</var><sub>2</sub>,<var>n</var><sub>3</sub>) indicates
-  a Nim position consisting of heaps of size <var>n</var><sub>1</sub>, <var>n</var><sub>2</sub>
+:content: "_Nim_ is a game played with heaps of stones, where two players take it
+  in turn to remove any number of stones from any heap until no stones remain.\n\nWe'll
+  consider the three-heap normal-play version of Nim, which works as follows:  \n\r-
+  At the start of the game there are three heaps of stones.  \n\r- On his turn the
+  player removes any positive number of stones from any single heap.  \n\r- The first
+  player unable to move (because no stones remain) loses.\n\nIf (<var>n</var><sub>1</sub>,<var>n</var><sub>2</sub>,<var>n</var><sub>3</sub>)
+  indicates a Nim position consisting of heaps of size <var>n</var><sub>1</sub>, <var>n</var><sub>2</sub>
   and <var>n</var><sub>3</sub> then there is a simple function <var>X</var>(<var>n</var><sub>1</sub>,<var>n</var><sub>2</sub>,<var>n</var><sub>3</sub>)
-  — that you may look up or attempt to deduce for yourself — that returns:\r\n</p>\n<ul>\n<li>zero
-  if, with perfect strategy, the player about to move will eventually lose; or</li>\r\n<li>non-zero
-  if, with perfect strategy, the player about to move will eventually win.</li>\n</ul>\n<p>For
+  — that you may look up or attempt to deduce for yourself — that returns:\n\n- zero
+  if, with perfect strategy, the player about to move will eventually lose; or\n-
+  non-zero if, with perfect strategy, the player about to move will eventually win.\n\nFor
   example <var>X</var>(1,2,3) = 0 because, no matter what the current player does,
   his opponent can respond with a move that leaves two heaps of equal size, at which
   point every move by the current player can be mirrored by his opponent until no
-  stones remain; so the current player loses. To illustrate:<br>\r\n- current player
-  moves to (1,2,1)<br>\r\n- opponent moves to (1,0,1)<br>\r\n- current player moves
-  to (0,0,1)<br>\r\n- opponent moves to (0,0,0), and so wins.</p>\r\n\r\n<p>For how
-  many positive integers <var>n</var> <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 2<sup>30</sup>
-  does <var>X</var>(<var>n</var>,2<var>n</var>,3<var>n</var>) = 0 ?\r\n</p>\r\n\r\n"
+  stones remain; so the current player loses. To illustrate:  \n\r- current player
+  moves to (1,2,1)  \n\r- opponent moves to (1,0,1)  \n\r- current player moves to
+  (0,0,1)  \n\r- opponent moves to (0,0,0), and so wins.\n\nFor how many positive
+  integers <var>n</var>  ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 2<sup>30</sup>
+  does <var>X</var>(<var>n</var>,2<var>n</var>,3<var>n</var>) = 0 ?\n\n"

data/data/problems/302.yml

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

data/data/problems/303.yml

@@ -2,10 +2,12 @@
 :id: 303
 :name: Multiples with small digits
 :url: http://projecteuler.net/problem=303
-:content: "\r\n<p>\r\nFor a positive integer <var>n</var>, define <var>f</var>(<var>n</var>)
-  as the least positive multiple of <var>n</var> that, written in base 10, uses only
-  digits <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> 2.</p>\r\n<p>Thus <var>f</var>(2)=2, <var>f</var>(3)=12,
-  <var>f</var>(7)=21, <var>f</var>(42)=210, <var>f</var>(89)=1121222.</p>\r\n<p>Also,
-  <img src=\"project/images/p303_formula100.gif\" style=\"vertical-align:middle\">.</p>\r\n<p>\r\nFind
-  <img src=\"project/images/p303_formula10000.gif\" style=\"vertical-align:middle\">.\r\n</p>\r\n\r\n"
+:content: |+
+  For a positive integer <var>n</var>, define <var>f</var>(<var>n</var>) as the least positive multiple of <var>n</var> that, written in base 10, uses only digits ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif) 2.
+
+  Thus <var>f</var>(2)=2, <var>f</var>(3)=12, <var>f</var>(7)=21, <var>f</var>(42)=210, <var>f</var>(89)=1121222.
+
+  Also, ![](/home/will/src/euler-manager/config/../data/images/p303_formula100.gif).
+
+  Find ![](/home/will/src/euler-manager/config/../data/images/p303_formula10000.gif).
+