euler-manager 0.0.5 → 0.0.6

data/data/problems/352.yml

@@ -2,48 +2,44 @@
 :id: 352
 :name: Blood tests
 :url: http://projecteuler.net/problem=352
-:content: "\r\n<p>\r\nEach one of the 25 sheep in a flock must be tested for a rare
-  virus, known to affect 2% of the sheep population.\r\nAn accurate and extremely
-  sensitive PCR test exists for blood samples, producing a clear positive / negative
-  result, but it is very time-consuming and expensive.\r\n</p>\r\n\r\n<p>\r\nBecause
-  of the high cost, the vet-in-charge suggests that instead of performing 25 separate
-  tests, the following procedure can be used instead:<br><br>\r\nThe sheep are split
-  into 5 groups of 5 sheep in each group. \r\nFor each group, the 5 samples are mixed
-  together and a single test is performed. Then,\r\n</p>\n<ul>\n<li>If the result
-  is negative, all the sheep in that group are deemed to be virus-free.</li>\r\n<li>If
-  the result is positive, 5 additional tests will be performed (a separate test for
-  each animal) to determine the affected individual(s).</li>\r\n</ul>\n<p>\r\nSince
+:content: "Each one of the 25 sheep in a flock must be tested for a rare virus, known
+  to affect 2% of the sheep population.\rAn accurate and extremely sensitive PCR test
+  exists for blood samples, producing a clear positive / negative result, but it is
+  very time-consuming and expensive.\n\nBecause of the high cost, the vet-in-charge
+  suggests that instead of performing 25 separate tests, the following procedure can
+  be used instead:  \n  \n  \n\rThe sheep are split into 5 groups of 5 sheep in each
+  group. \rFor each group, the 5 samples are mixed together and a single test is performed.
+  Then,\n\n- If the result is negative, all the sheep in that group are deemed to
+  be virus-free.\n- If the result is positive, 5 additional tests will be performed
+  (a separate test for each animal) to determine the affected individual(s).\n\nSince
   the probability of infection for any specific animal is only 0.02, the first test
-  (on the pooled samples) for each group will be:\r\n</p>\n<ul>\n<li>Negative (and
-  no more tests needed) with probability 0.98<sup>5</sup> = 0.9039207968.</li>\r\n<li>Positive
-  (5 additional tests needed) with probability 1 - 0.9039207968 = 0.0960792032.</li>\r\n</ul>\n<p>\r\nThus,
-  the expected number of tests for each group is 1 + 0.0960792032 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  5 = 1.480396016.<br>\r\nConsequently, all 5 groups can be screened using an average
-  of only 1.480396016 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 5 = <b>7.40198008</b> tests,
-  which represents a huge saving of more than 70% !\r\n</p>\r\n\r\n<p>\r\nAlthough
+  (on the pooled samples) for each group will be:\n\n- Negative (and no more tests
+  needed) with probability 0.98<sup>5</sup> = 0.9039207968.\n- Positive (5 additional
+  tests needed) with probability 1 - 0.9039207968 = 0.0960792032.\n\nThus, the expected
+  number of tests for each group is 1 + 0.0960792032 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  5 = 1.480396016.  \n\rConsequently, all 5 groups can be screened using an average
+  of only 1.480396016 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  5 = **7.40198008** tests, which represents a huge saving of more than 70% !\n\nAlthough
   the scheme we have just described seems to be very efficient, it can still be improved
   considerably (always assuming that the test is sufficiently sensitive and that there
-  are no adverse effects caused by mixing different samples). E.g.:\r\n</p>\n<ul>\n<li>We
-  may start by running a test on a mixture of all the 25 samples. It can be verified
-  that in about 60.35% of the cases this test will be negative, thus no more tests
-  will be needed. Further testing will only be required for the remaining 39.65% of
-  the cases.</li>\r\n<li>If we know that at least one animal in a group of 5 is infected
-  and the first 4 individual tests come out negative, there is no need to run a test
-  on the fifth animal (we know that it must be infected).</li>\r\n<li>We can try a
-  different number of groups / different number of animals in each group, adjusting
-  those numbers at each level so that the total expected number of tests will be minimised.</li>\r\n</ul>\n<p>\r\nTo
-  simplify the very wide range of possibilities, there is one restriction we place
-  when devising the most cost-efficient testing scheme: whenever we start with a mixed
-  sample, all the sheep contributing to that sample must be fully screened (i.e. a
-  verdict of infected / virus-free must be reached for all of them) before we start
-  examining any other animals.\r\n</p>\r\nFor the current example, it turns out that
-  the most cost-efficient testing scheme (we'll call it the <i>optimal strategy</i>)
-  requires an average of just <b>4.155452</b> tests!\r\n\r\n\r\n<p>\r\nUsing the optimal
-  strategy, let T(<var>s</var>,<var>p</var>) represent the average number of tests
-  needed to screen a flock of <var>s</var> sheep for a virus having probability <var>p</var>
-  to be present in any individual.<br>\r\nThus, rounded to six decimal places, T(25,
-  0.02) = 4.155452 and T(25, 0.10) = 12.702124.\r\n</p>\r\n\r\n<p>\r\nFind ΣT(10000,
-  p) for p=0.01, 0.02, 0.03, ... 0.50.<br>\r\nGive your answer rounded to six decimal
-  places.\r\n</p>\r\n\r\n"
+  are no adverse effects caused by mixing different samples). E.g.:\n\n- We may start
+  by running a test on a mixture of all the 25 samples. It can be verified that in
+  about 60.35% of the cases this test will be negative, thus no more tests will be
+  needed. Further testing will only be required for the remaining 39.65% of the cases.\n-
+  If we know that at least one animal in a group of 5 is infected and the first 4
+  individual tests come out negative, there is no need to run a test on the fifth
+  animal (we know that it must be infected).\n- We can try a different number of groups
+  / different number of animals in each group, adjusting those numbers at each level
+  so that the total expected number of tests will be minimised.\n\nTo simplify the
+  very wide range of possibilities, there is one restriction we place when devising
+  the most cost-efficient testing scheme: whenever we start with a mixed sample, all
+  the sheep contributing to that sample must be fully screened (i.e. a verdict of
+  infected / virus-free must be reached for all of them) before we start examining
+  any other animals.\n\n\rFor the current example, it turns out that the most cost-efficient
+  testing scheme (we'll call it the _optimal strategy_) requires an average of just
+  **4.155452** tests!\r\r\r\n\nUsing the optimal strategy, let T(<var>s</var>,<var>p</var>)
+  represent the average number of tests needed to screen a flock of <var>s</var> sheep
+  for a virus having probability <var>p</var> to be present in any individual.  \n\rThus,
+  rounded to six decimal places, T(25, 0.02) = 4.155452 and T(25, 0.10) = 12.702124.\n\nFind
+  ΣT(10000, p) for p=0.01, 0.02, 0.03, ... 0.50.  \n\rGive your answer rounded to
+  six decimal places.\n\n"

data/data/problems/353.yml

@@ -2,24 +2,20 @@
 :id: 353
 :name: Risky moon
 :url: http://projecteuler.net/problem=353
-:content: "\r\n<p>\r\nA moon could be described by the sphere C(<var>r</var>) with
-  centre (0,0,0) and radius <var>r</var>. \r\n</p>\r\n\r\n<p>\r\nThere are stations
-  on the moon at the points on the surface of C(<var>r</var>) with integer coordinates.
-  The station at (0,0,<var>r</var>) is called North Pole station, the station at (0,0,-<var>r</var>)
-  is called South Pole station.\r\n</p>\r\n\r\n<p>\r\nAll stations are connected with
-  each other via the shortest road on the great arc through the stations. A journey
-  between two stations is risky. If <var>d</var> is the length of the road between
-  two stations, (<var>d</var>/(π <var>r</var>))<sup>2</sup> is a measure for the risk
-  of the journey (let us call it the risk of the road). If the journey includes more
-  than two stations, the risk of the journey is the sum of risks of the used roads.\r\n</p>\r\n\r\n<p>\r\nA
-  direct journey from  the North Pole station to the South Pole station has the length
-  π<var>r</var> and risk 1. The journey from the North Pole station to the South Pole
-  station via (0,<var>r</var>,0) has the same length, but a smaller risk: (½π<var>r</var>/(π<var>r</var>))<sup>2</sup>+(½π<var>r</var>/(π<var>r</var>))<sup>2</sup>=0.5.\r\n</p>\r\n\r\n<p>\r\nThe
-  minimal risk of a journey from the North Pole station to the South Pole station
-  on C(<var>r</var>) is M(<var>r</var>).\r\n</p>\r\n\r\n<p>\r\nYou are given that
-  M(7)=0.1784943998  rounded to 10 digits behind the decimal point. \r\n</p>\r\n\r\n<p>\r\nFind
-  <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
-  style=\"vertical-align:middle;\">M(2<sup>n</sup>-1) for 1<img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">n<img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">15.\r\n</p>\r\n\r\n<p>\r\nGive
-  your answer rounded to 10 digits behind the decimal point in the form a.bcdefghijk.\r\n</p>\r\n\r\n\r\n"
+:content: |+
+  A moon could be described by the sphere C(<var>r</var>) with centre (0,0,0) and radius <var>r</var>.
+
+  There are stations on the moon at the points on the surface of C(<var>r</var>) with integer coordinates. The station at (0,0,<var>r</var>) is called North Pole station, the station at (0,0,-<var>r</var>) is called South Pole station.
+
+  All stations are connected with each other via the shortest road on the great arc through the stations. A journey between two stations is risky. If <var>d</var> is the length of the road between two stations, (<var>d</var>/(π <var>r</var>))<sup>2</sup> is a measure for the risk of the journey (let us call it the risk of the road). If the journey includes more than two stations, the risk of the journey is the sum of risks of the used roads.
+
+  A direct journey from the North Pole station to the South Pole station has the length π<var>r</var> and risk 1. The journey from the North Pole station to the South Pole station via (0,<var>r</var>,0) has the same length, but a smaller risk: (½π<var>r</var>/(π<var>r</var>))<sup>2</sup>+(½π<var>r</var>/(π<var>r</var>))<sup>2</sup>=0.5.
+
+  The minimal risk of a journey from the North Pole station to the South Pole station on C(<var>r</var>) is M(<var>r</var>).
+
+  You are given that M(7)=0.1784943998 rounded to 10 digits behind the decimal point.
+
+  Find ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)M(2<sup>n</sup>-1) for 1 ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)n ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)15.
+
+  Give your answer rounded to 10 digits behind the decimal point in the form a.bcdefghijk.
+

data/data/problems/354.yml

@@ -1,16 +1,14 @@
 ---
 :id: 354
-:name: 'Distances in a bee''s honeycomb '
+:name: Distances in a bee's honeycomb
 :url: http://projecteuler.net/problem=354
-:content: "\r\n<p>Consider a honey bee's honeycomb where each cell is a perfect regular
-  hexagon with side length 1.</p>\r\n\r\n<div align=\"center\">\r\n<img src=\"project/images/p_354_bee_honeycomb.png\">\n</div>\r\n\r\n\r\n<p>\r\nOne
-  particular cell is occupied by the queen bee.<br>\r\nFor a positive real number
-  <var>L</var>, let B(<var>L</var>) count the cells with distance <var>L</var> from
-  the queen bee cell (all distances are measured from centre to centre); you may assume
-  that the honeycomb is large enough to accommodate for any distance we wish to consider.
-  <br>\r\nFor example, B(<img src=\"images/symbol_radic.gif\" width=\"14\" height=\"16\"
-  alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">3) = 6, B(<img src=\"images/symbol_radic.gif\"
-  width=\"14\" height=\"16\" alt=\"√\" border=\"0\" style=\"vertical-align:middle;\">21)
-  = 12 and B(111 111 111) = 54.</p>\r\n\r\n<p>Find the number of <var>L</var> <img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  5·10<sup>11</sup> such that B(<var>L</var>) = 450.</p>\r\n"
+:content: "Consider a honey bee's honeycomb where each cell is a perfect regular hexagon
+  with side length 1.\n\n ![](/home/will/src/euler-manager/config/../data/images/p_354_bee_honeycomb.png)\n\nOne
+  particular cell is occupied by the queen bee.  \n\rFor a positive real number <var>L</var>,
+  let B(<var>L</var>) count the cells with distance <var>L</var> from the queen bee
+  cell (all distances are measured from centre to centre); you may assume that the
+  honeycomb is large enough to accommodate for any distance we wish to consider.   \n\rFor
+  example, B( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)3)
+  = 6, B( ![√](/home/will/src/euler-manager/config/../data/images/symbol_radic.gif)21)
+  = 12 and B(111 111 111) = 54.\n\nFind the number of <var>L</var> ![≤](/home/will/src/euler-manager/config/../data/images/symbol_le.gif)
+  5·10<sup>11</sup> such that B(<var>L</var>) = 450.\n\n"

data/data/problems/355.yml

@@ -2,7 +2,7 @@
 :id: 355
 :name: Maximal coprime subset
 :url: http://projecteuler.net/problem=355
-:content: "\r\n<p>\r\nDefine Co(<var>n</var>) to be the maximal possible sum of a
-  set of mutually co-prime elements from {1, 2, ..., <var>n</var>}.<br> For example
-  Co(10) is 30 and hits that maximum on the subset {1, 5, 7, 8, 9}.\r\n</p>\r\n\r\n<p>\r\nYou
-  are given that Co(30) = 193 and Co(100) = 1356. \r\n</p>\r\n\r\n<p>Find Co(200000).\r\n</p>\r\n\r\n"
+:content: "Define Co(<var>n</var>) to be the maximal possible sum of a set of mutually
+  co-prime elements from {1, 2, ..., <var>n</var>}.  \n For example Co(10) is 30 and
+  hits that maximum on the subset {1, 5, 7, 8, 9}.\n\nYou are given that Co(30) =
+  193 and Co(100) = 1356.\n\nFind Co(200000).\n\n"

data/data/problems/356.yml

@@ -2,9 +2,9 @@
 :id: 356
 :name: Largest roots of cubic polynomials
 :url: http://projecteuler.net/problem=356
-:content: "\r\n<p>\r\nLet <var>a</var><sub><var>n</var></sub> be the largest real
-  root of a polynomial <var>g</var>(x) = x<sup>3</sup> - 2<sup><var>n</var></sup>·x<sup>2</sup>
-  + <var>n</var>.<br>\r\nFor example, <var>a</var><sub>2</sub> = 3.86619826...</p>\r\n\r\n<p>\r\nFind
-  the last eight digits of<img style=\"vertical-align:middle\" src=\"project/images/p_356_cubicpoly1.gif\">.</p>\r\n\r\n<p>\r\n<u><i>Note</i></u>:
-  <img style=\"vertical-align:middle\" src=\"project/images/p_356_cubicpoly2.gif\">
-  represents the floor function.</p>\r\n\r\n"
+:content: "Let <var>a</var><sub><var>n</var></sub> be the largest real root of a polynomial
+  <var>g</var>(x) = x<sup>3</sup> - 2<sup><var>n</var></sup>·x<sup>2</sup> + <var>n</var>.
+  \ \n\rFor example, <var>a</var><sub>2</sub> = 3.86619826...\n\nFind the last eight
+  digits of ![](/home/will/src/euler-manager/config/../data/images/p_356_cubicpoly1.gif).\n\n<u><i>Note</i></u>:
+  ![](/home/will/src/euler-manager/config/../data/images/p_356_cubicpoly2.gif) represents
+  the floor function.\n\n"

data/data/problems/357.yml

@@ -2,8 +2,8 @@
 :id: 357
 :name: Prime generating integers
 :url: http://projecteuler.net/problem=357
-:content: "\r\n<p>\r\nConsider the divisors of 30: 1,2,3,5,6,10,15,30.<br>\r\nIt can
-  be seen that for every divisor <var>d</var> of 30, <var>d</var>+30/<var>d</var>
-  is prime.\r\n</p>\r\n<p>\r\nFind the sum of all positive integers <var>n</var> not
-  exceeding 100 000 000<br>such that\r\nfor every divisor <var>d</var> of <var>n</var>,
-  <var>d</var>+<var>n</var>/<var>d</var> is prime.\r\n</p>\r\n\r\n"
+:content: "Consider the divisors of 30: 1,2,3,5,6,10,15,30.  \n\rIt can be seen that
+  for every divisor <var>d</var> of 30, <var>d</var>+30/<var>d</var> is prime.\n\nFind
+  the sum of all positive integers <var>n</var> not exceeding 100 000 000  \nsuch
+  that\rfor every divisor <var>d</var> of <var>n</var>, <var>d</var>+<var>n</var>/<var>d</var>
+  is prime.\n\n"

data/data/problems/358.yml

@@ -2,30 +2,21 @@
 :id: 358
 :name: Cyclic numbers
 :url: http://projecteuler.net/problem=358
-:content: "\r\n<p>A <b>cyclic number</b> with <var>n</var> digits has a very interesting
-  property:<br>\r\nWhen it is multiplied by 1, 2, 3, 4, ... <var>n</var>, all the
-  products have exactly the same digits, in the same order, but rotated in a circular
-  fashion!\r\n</p>\r\n\r\n<p>\r\nThe smallest cyclic number is the 6-digit number
-  142857 :<br>\r\n142857 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 1 = 142857<br>\r\n142857
-  <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 2 = 285714<br>\r\n142857 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  3 = 428571<br>\r\n142857 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
-  alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 4 = 571428<br>\r\n142857
-  <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 5 = 714285<br>\r\n142857 <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
-  6 = 857142  \r\n</p>\r\n\r\n<p>\r\nThe next cyclic number is 0588235294117647 with
-  16 digits :<br>\r\n0588235294117647 <img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 1 = 0588235294117647<br>\r\n0588235294117647
-  <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 2 = 1176470588235294<br>\r\n0588235294117647 <img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 3 = 1764705882352941<br>\r\n...<br>\r\n0588235294117647
-  <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> 16 = 9411764705882352\r\n</p>\r\n\r\n<p>\r\nNote
-  that for cyclic numbers, leading zeros are important.\r\n</p>\r\n\r\n<p>\r\nThere
+:content: "A **cyclic number** with <var>n</var> digits has a very interesting property:
+  \ \n\rWhen it is multiplied by 1, 2, 3, 4, ... <var>n</var>, all the products have
+  exactly the same digits, in the same order, but rotated in a circular fashion!\n\nThe
+  smallest cyclic number is the 6-digit number 142857 :  \n\r142857 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  1 = 142857  \n\r142857 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  2 = 285714  \n\r142857 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  3 = 428571  \n\r142857 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  4 = 571428  \n\r142857 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  5 = 714285  \n\r142857 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  6 = 857142\n\nThe next cyclic number is 0588235294117647 with 16 digits :  \n\r0588235294117647
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif) 1 = 0588235294117647
+  \ \n\r0588235294117647 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  2 = 1176470588235294  \n\r0588235294117647 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  3 = 1764705882352941  \n\r...  \n\r0588235294117647 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  16 = 9411764705882352\n\nNote that for cyclic numbers, leading zeros are important.\n\nThere
   is only one cyclic number for which, the eleven leftmost digits are 00000000137
   and the five rightmost digits are 56789 (i.e., it has the form 00000000137...56789
-  with an unknown number of digits in the middle). Find the sum of all its digits.\r\n</p>\r\n\r\n"
+  with an unknown number of digits in the middle). Find the sum of all its digits.\n\n"

data/data/problems/359.yml

@@ -2,25 +2,22 @@
 :id: 359
 :name: Hilbert's New Hotel
 :url: http://projecteuler.net/problem=359
-:content: "\r\n<p>\r\nAn infinite number of people (numbered 1, 2, 3, etc.) are lined
-  up to get a room at Hilbert's newest infinite hotel. The hotel contains an infinite
-  number of floors (numbered 1, 2, 3, etc.), and each floor contains an infinite number
-  of rooms (numbered 1, 2, 3, etc.). \r\n</p>\r\n\r\n<p>\r\nInitially the hotel is
-  empty. Hilbert declares a rule on how the <var>n</var><sup>th</sup> person is assigned
-  a room: person <var>n</var> gets the first vacant room in the lowest numbered floor
-  satisfying either of the following:\r\n</p>\n<ul>\n<li>the floor is empty</li>\r\n<li>the
-  floor is not empty, and if the latest person taking a room in that floor is person
-  <var>m</var>, then <var>m</var> + <var>n</var> is a perfect square</li>\r\n</ul>\n<p>\r\nPerson
-  1 gets room 1 in floor 1 since floor 1 is empty.\r\n<br>Person 2 does not get room
-  2 in floor 1 since 1 + 2 = 3 is not a perfect square.\r\n<br>Person 2 instead gets
-  room 1 in floor 2 since floor 2 is empty.\r\n<br>Person 3 gets room 2 in floor 1
-  since 1 + 3 = 4 is a perfect square.\r\n</p>\r\n\r\n<p>\r\nEventually, every person
-  in the line gets a room in the hotel.\r\n</p>\r\n\r\n<p>\r\nDefine P(<var>f</var>,
-  <var>r</var>) to be <var>n</var> if person <var>n</var> occupies room <var>r</var>
-  in floor <var>f</var>, and 0 if no person occupies the room. Here are a few examples:\r\n<br>P(1,
-  1) = 1\r\n<br>P(1, 2) = 3\r\n<br>P(2, 1) = 2\r\n<br>P(10, 20) = 440\r\n<br>P(25,
-  75) = 4863\r\n<br>P(99, 100) = 19454\r\n</p>\r\n\r\n<p>\r\nFind the sum of all P(<var>f</var>,
-  <var>r</var>) for all positive <var>f</var> and <var>r</var> such that <var>f</var>
-  <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>r</var> = 71328803586048 and give the last
-  8 digits as your answer.\r\n</p>\r\n"
+:content: "An infinite number of people (numbered 1, 2, 3, etc.) are lined up to get
+  a room at Hilbert's newest infinite hotel. The hotel contains an infinite number
+  of floors (numbered 1, 2, 3, etc.), and each floor contains an infinite number of
+  rooms (numbered 1, 2, 3, etc.).\n\nInitially the hotel is empty. Hilbert declares
+  a rule on how the <var>n</var><sup>th</sup> person is assigned a room: person <var>n</var>
+  gets the first vacant room in the lowest numbered floor satisfying either of the
+  following:\n\n- the floor is empty\n- the floor is not empty, and if the latest
+  person taking a room in that floor is person <var>m</var>, then <var>m</var> + <var>n</var>
+  is a perfect square\n\nPerson 1 gets room 1 in floor 1 since floor 1 is empty.\r
+  \ \nPerson 2 does not get room 2 in floor 1 since 1 + 2 = 3 is not a perfect square.\r
+  \ \nPerson 2 instead gets room 1 in floor 2 since floor 2 is empty.\r  \nPerson
+  3 gets room 2 in floor 1 since 1 + 3 = 4 is a perfect square.\n\nEventually, every
+  person in the line gets a room in the hotel.\n\nDefine P(<var>f</var>, <var>r</var>)
+  to be <var>n</var> if person <var>n</var> occupies room <var>r</var> in floor <var>f</var>,
+  and 0 if no person occupies the room. Here are a few examples:\r  \nP(1, 1) = 1\r
+  \ \nP(1, 2) = 3\r  \nP(2, 1) = 2\r  \nP(10, 20) = 440\r  \nP(25, 75) = 4863\r  \nP(99,
+  100) = 19454\n\nFind the sum of all P(<var>f</var>, <var>r</var>) for all positive
+  <var>f</var> and <var>r</var> such that <var>f</var> ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)
+  <var>r</var> = 71328803586048 and give the last 8 digits as your answer.\n\n"

data/data/problems/36.yml

@@ -2,7 +2,10 @@
 :id: 36
 :name: Double-base palindromes
 :url: http://projecteuler.net/problem=36
-:content: "\r\n\n<p>The decimal number, 585 = 1001001001<sub>2</sub> (binary), is
-  palindromic in both bases.</p>\n<p>Find the sum of all numbers, less than one million,
-  which are palindromic in base 10 and base 2.</p>\n<p class=\"info\">(Please note
-  that the palindromic number, in either base, may not include leading zeros.)</p>\n\r\n"
+:content: |+
+  The decimal number, 585 = 1001001001<sub>2</sub> (binary), is palindromic in both bases.
+
+  Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2.
+
+  (Please note that the palindromic number, in either base, may not include leading zeros.)
+

data/data/problems/360.yml

@@ -2,11 +2,11 @@
 :id: 360
 :name: Scary Sphere
 :url: http://projecteuler.net/problem=360
-:content: "\r\n<p>\r\nGiven two points (x<sub>1</sub>,y<sub>1</sub>,z<sub>1</sub>)
-  and (x<sub>2</sub>,y<sub>2</sub>,z<sub>2</sub>) in three dimensional space, the
-  <b>Manhattan distance</b>  between those points is defined as <br> |x<sub>1</sub>-x<sub>2</sub>|+|y<sub>1</sub>-y<sub>2</sub>|+|z<sub>1</sub>-z<sub>2</sub>|.\r\n</p>\r\n<p>\r\nLet
-  C(<var>r</var>) be a sphere with radius <var>r</var> and center in the origin O(0,0,0).<br>\r\nLet
-  I(<var>r</var>) be the set of all points with integer coordinates on the surface
-  of C(<var>r</var>).<br>\r\nLet S(<var>r</var>) be the sum of the Manhattan distances
-  of all elements of I(<var>r</var>) to the origin O.\r\n</p>\r\n<p>\r\nE.g. S(45)=34518.\r\n</p>\r\n<p>\r\nFind
-  S(10<sup>10</sup>).\r\n</p>\r\n\r\n\r\n\r\n"
+:content: "Given two points (x<sub>1</sub>,y<sub>1</sub>,z<sub>1</sub>) and (x<sub>2</sub>,y<sub>2</sub>,z<sub>2</sub>)
+  in three dimensional space, the **Manhattan distance** between those points is defined
+  as   \n |x<sub>1</sub>-x<sub>2</sub>|+|y<sub>1</sub>-y<sub>2</sub>|+|z<sub>1</sub>-z<sub>2</sub>|.\n\nLet
+  C(<var>r</var>) be a sphere with radius <var>r</var> and center in the origin O(0,0,0).
+  \ \n\rLet I(<var>r</var>) be the set of all points with integer coordinates on the
+  surface of C(<var>r</var>).  \n\rLet S(<var>r</var>) be the sum of the Manhattan
+  distances of all elements of I(<var>r</var>) to the origin O.\n\nE.g. S(45)=34518.\n\nFind
+  S(10<sup>10</sup>).\n\n"

data/data/problems/361.yml

@@ -2,19 +2,18 @@
 :id: 361
 :name: Subsequence of Thue-Morse sequence
 :url: http://projecteuler.net/problem=361
-:content: "\r\n<p>The <b>Thue-Morse sequence</b> {T<sub><var>n</var></sub>} is a binary
-  sequence satisfying:</p>\r\n<ul>\n<li>T<sub>0</sub> = 0</li>\r\n<li>T<sub>2<var>n</var></sub>
-  = T<sub><var>n</var></sub>\n</li>\r\n<li>T<sub>2<var>n</var>+1</sub> = 1 - T<sub><var>n</var></sub>\n</li>\r\n</ul>\n<p>\r\nThe
-  first several terms of {T<sub><var>n</var></sub>} are given as follows:<br>\r\n01101001<span
-  style=\"color:red;\">10010</span>1101001011001101001....\r\n</p>\r\n\r\n<p>\r\nWe
+:content: "The **Thue-Morse sequence** {T<sub><var>n</var></sub>} is a binary sequence
+  satisfying:\n\n- T<sub>0</sub> = 0\n- T<sub>2<var>n</var></sub> = T<sub><var>n</var></sub>\n-
+  T<sub>2<var>n</var>+1</sub> = 1 - T<sub><var>n</var></sub>\n\nThe first several
+  terms of {T<sub><var>n</var></sub>} are given as follows:  \n\r01101001100101101001011001101001....\n\nWe
   define {A<sub><var>n</var></sub>} as the sorted sequence of integers such that the
-  binary expression of each element appears as a subsequence in {T<sub><var>n</var></sub>}.<br>\r\nFor
-  example, the decimal number 18 is expressed as 10010 in binary. 10010 appears in
-  {T<sub><var>n</var></sub>} (T<sub>8</sub> to T<sub>12</sub>), so 18 is an element
-  of {A<sub><var>n</var></sub>}.<br>\r\nThe decimal number 14 is expressed as 1110
-  in binary. 1110 never appears in {T<sub><var>n</var></sub>}, so 14 is not an element
-  of {A<sub><var>n</var></sub>}.\r\n</p>\r\n\r\n<p>\r\nThe first several terms of
-  A<sub><var>n</var></sub> are given as follows:<br></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>0</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>…</td>\n</tr>\n<tr>\n<td>A<sub><var>n</var></sub>\n</td>\n<td>0</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>9</td>\n<td>10</td>\n<td>11</td>\n<td>12</td>\n<td>13</td>\n<td>18</td>\n<td>…</td>\n</tr>\n</table>\n</div>\r\n\r\n\r\n<p>\r\nWe
-  can also verify that A<sub>100</sub> = 3251 and A<sub>1000</sub> = 80852364498.\r\n</p>\r\n\r\n<p>\r\nFind
-  the last 9 digits of <img style=\"vertical-align:middle\" src=\"project/images/p_361_Thue-Morse1.gif\">.\r\n</p>\r\n"
+  binary expression of each element appears as a subsequence in {T<sub><var>n</var></sub>}.
+  \ \n\rFor example, the decimal number 18 is expressed as 10010 in binary. 10010
+  appears in {T<sub><var>n</var></sub>} (T<sub>8</sub> to T<sub>12</sub>), so 18 is
+  an element of {A<sub><var>n</var></sub>}.  \n\rThe decimal number 14 is expressed
+  as 1110 in binary. 1110 never appears in {T<sub><var>n</var></sub>}, so 14 is not
+  an element of {A<sub><var>n</var></sub>}.\n\nThe first several terms of A<sub><var>n</var></sub>
+  are given as follows:\n\n| <var>n</var> | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
+  | 10 | 11 | 12 | … |\n| A<sub><var>n</var></sub> | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 9
+  | 10 | 11 | 12 | 13 | 18 | … |\n\nWe can also verify that A<sub>100</sub> = 3251
+  and A<sub>1000</sub> = 80852364498.\n\nFind the last 9 digits of ![](/home/will/src/euler-manager/config/../data/images/p_361_Thue-Morse1.gif).\n\n"

data/data/problems/362.yml

@@ -2,31 +2,19 @@
 :id: 362
 :name: Squarefree factors
 :url: http://projecteuler.net/problem=362
-:content: "\r\n<p>\r\nConsider the number 54.<br>\r\n54 can be factored in 7 distinct
-  ways into one or more factors larger than 1:<br>\r\n54, 2<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">27,
-  3<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">18, 6<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">9, 3<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">3<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">6, 2<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">3<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">9
-  and 2<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">3<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">3<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">3.<br>\r\nIf
-  we require that the factors are all squarefree only two ways remain: 3<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">3<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">6 and 2<img src=\"images/symbol_times.gif\" width=\"9\"
-  height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">3<img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">3<img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\">3.\r\n</p>\r\n<p>\r\nLet's call Fsf(<var>n</var>)
-  the number of ways <var>n</var> can be factored into one or more squarefree factors
-  larger than 1, so\r\nFsf(54)=2.\r\n</p>\r\n<p>\r\nLet S(<var>n</var>) be <img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">Fsf(<var>k</var>)
-  for <var>k</var>=2 to <var>n</var>.\r\n</p>\r\n<p>\r\nS(100)=193.\r\n</p>\r\n<p>\r\nFind
-  S(10 000 000 000). \r\n</p>\r\n\r\n\r\n"
+:content: "Consider the number 54.  \n\r54 can be factored in 7 distinct ways into
+  one or more factors larger than 1:  \n\r54, 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)27,
+  3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)18, 6
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)9, 3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)3
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)6, 2 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)3
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)9 and 2
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)3
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)3.  \n\rIf
+  we require that the factors are all squarefree only two ways remain: 3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)3
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)6 and 2
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)3 ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)3
+  ![×](/home/will/src/euler-manager/config/../data/images/symbol_times.gif)3.\n\nLet's
+  call Fsf(<var>n</var>) the number of ways <var>n</var> can be factored into one
+  or more squarefree factors larger than 1, so\rFsf(54)=2.\n\nLet S(<var>n</var>)
+  be ![∑](/home/will/src/euler-manager/config/../data/images/symbol_sum.gif)Fsf(<var>k</var>)
+  for <var>k</var>=2 to <var>n</var>.\n\nS(100)=193.\n\nFind S(10 000 000 000).\n\n"

data/data/problems/363.yml

@@ -2,32 +2,31 @@
 :id: 363
 :name: Bézier Curves
 :url: http://projecteuler.net/problem=363
-:content: "\r\nA cubic Bézier curve is defined by four points: P<sub>0</sub>, P<sub>1</sub>,
-  P<sub>2</sub> and P<sub>3</sub>.\r\n<p>\r\n\r\nThe curve is constructed as follows:<br>\r\nOn
+:content: "\rA cubic Bézier curve is defined by four points: P<sub>0</sub>, P<sub>1</sub>,
+  P<sub>2</sub> and P<sub>3</sub>.\r\n\nThe curve is constructed as follows:  \n\rOn
   the segments P<sub>0</sub>P<sub>1</sub>, P<sub>1</sub>P<sub>2</sub> and P<sub>2</sub>P<sub>3</sub>
-  the points Q<sub>0</sub>,Q<sub>1</sub> and Q<sub>2</sub> are drawn such that  P<sub>0</sub>Q<sub>0</sub>/P<sub>0</sub>P<sub>1</sub>=P<sub>1</sub>Q<sub>1</sub>/P<sub>1</sub>P<sub>2</sub>=P<sub>2</sub>Q<sub>2</sub>/P<sub>2</sub>P<sub>3</sub>=t
-  (t in [0,1]).<br>\r\nOn the segments Q<sub>0</sub>Q<sub>1</sub> and Q<sub>1</sub>Q<sub>2</sub>
-  the points R<sub>0</sub> and R<sub>1</sub> are drawn such that\r\nQ<sub>0</sub>R<sub>0</sub>/Q<sub>0</sub>Q<sub>1</sub>=Q<sub>1</sub>R<sub>1</sub>/Q<sub>1</sub>Q<sub>2</sub>=t
-  for the same value of t.<br>\r\nOn the segment R<sub>0</sub>R<sub>1</sub> the point
+  the points Q<sub>0</sub>,Q<sub>1</sub> and Q<sub>2</sub> are drawn such that P<sub>0</sub>Q<sub>0</sub>/P<sub>0</sub>P<sub>1</sub>=P<sub>1</sub>Q<sub>1</sub>/P<sub>1</sub>P<sub>2</sub>=P<sub>2</sub>Q<sub>2</sub>/P<sub>2</sub>P<sub>3</sub>=t
+  (t in [0,1]).  \n\rOn the segments Q<sub>0</sub>Q<sub>1</sub> and Q<sub>1</sub>Q<sub>2</sub>
+  the points R<sub>0</sub> and R<sub>1</sub> are drawn such that\rQ<sub>0</sub>R<sub>0</sub>/Q<sub>0</sub>Q<sub>1</sub>=Q<sub>1</sub>R<sub>1</sub>/Q<sub>1</sub>Q<sub>2</sub>=t
+  for the same value of t.  \n\rOn the segment R<sub>0</sub>R<sub>1</sub> the point
   B is drawn such that R<sub>0</sub>B/R<sub>0</sub>R<sub>1</sub>=t for the same value
-  of t.\r\nThe Bézier curve defined by the points P<sub>0</sub>, P<sub>1</sub>, P<sub>2</sub>,
+  of t.\rThe Bézier curve defined by the points P<sub>0</sub>, P<sub>1</sub>, P<sub>2</sub>,
   P<sub>3</sub> is the locus of B as Q<sub>0</sub> takes all possible positions on
   the segment P<sub>0</sub>P<sub>1</sub>. (Please note that for all points the value
-  of t is the same.) \r\n<br></p>\r\n<p><applet code=\"CabriJava.class\" width=\"390\"
-  height=\"300\" align=\"right\" hspace=\"20\" archive=\"http://projecteuler.net/project/images/bezier/CabriJava.jar\">\r\n
-  \  <param name=\"lang\" value=\"en\">\n<param name=\"file\" value=\"http://projecteuler.net/project/images/bezier/bezier.fig\">\n<param
-  name=\"loop\" value=\"true\"></applet>\r\n</p>\r\n\r\n<p>\r\nIn the applet to the
-  right you can drag the points P<sub>0</sub>, P<sub>1</sub>, P<sub>2</sub> and P<sub>3</sub>
-  to see what the Bézier curve (green curve) defined by those points  looks like.
-  You can also drag the point Q<sub>0</sub> along the segment P<sub>0</sub>P<sub>1</sub>.\r\n</p>\r\n<p>\r\nFrom
+  of t is the same.)\n\n<applet code=\"CabriJava.class\" width=\"390\" height=\"300\"
+  align=\"right\" hspace=\"20\" archive=\"project/images/bezier/CabriJava.jar\">\r\n
+  \  <param name=\"lang\" value=\"en\">\r\n   <param name=\"file\" value=\"project/images/bezier/bezier.fig\">\r\n
+  \  <param name=\"loop\" value=\"true\">\r\n</applet>\n\nIn the applet to the right
+  you can drag the points P<sub>0</sub>, P<sub>1</sub>, P<sub>2</sub> and P<sub>3</sub>
+  to see what the Bézier curve (green curve) defined by those points looks like. You
+  can also drag the point Q<sub>0</sub> along the segment P<sub>0</sub>P<sub>1</sub>.\n\nFrom
   the construction it is clear that the Bézier curve will be tangent to the segments
-  P<sub>0</sub>P<sub>1</sub> in P<sub>0</sub> and P<sub>2</sub>P<sub>3</sub> in P<sub>3</sub>.\r\n</p>\r\n<p>\r\n<br><br><br></p>\r\n<p>\r\nA
+  P<sub>0</sub>P<sub>1</sub> in P<sub>0</sub> and P<sub>2</sub>P<sub>3</sub> in P<sub>3</sub>.\n\nA
   cubic Bézier curve with P<sub>0</sub>=(1,0), P<sub>1</sub>=(1,<var>v</var>), P<sub>2</sub>=(<var>v</var>,1)
-  and P<sub>3</sub>=(0,1) is used to approximate a quarter circle.<br>\r\nThe value
-  <var>v</var><img src=\"images/symbol_gt.gif\" width=\"10\" height=\"10\" alt=\"&gt;\"
-  border=\"0\" style=\"vertical-align:middle;\">0 is chosen such that the area enclosed
-  by the lines OP<sub>0</sub>, OP<sub>3</sub> and the curve is equal to <sup>π</sup>/<sub>4</sub>
-  (the area of the quarter circle).\r\n</p>\r\n<p>\r\nBy how many percent does the
-  length of the curve differ from the length of the quarter circle?<br>\r\nThat is,
-  if L is the length of the curve, calculate  100*<sup>(L-π/2)</sup>/<sub>(π/2)</sub>.<br>\r\nGive
-  your answer rounded to 10 digits behind the decimal point.\r\n\r\n\r\n\r\n</p>"
+  and P<sub>3</sub>=(0,1) is used to approximate a quarter circle.  \n\rThe value
+  <var>v</var> ![>](/home/will/src/euler-manager/config/../data/images/symbol_gt.gif)0
+  is chosen such that the area enclosed by the lines OP<sub>0</sub>, OP<sub>3</sub>
+  and the curve is equal to <sup>π</sup>/<sub>4</sub> (the area of the quarter circle).\n\nBy
+  how many percent does the length of the curve differ from the length of the quarter
+  circle?  \n\rThat is, if L is the length of the curve, calculate 100\\*<sup>(L-π/2)</sup>/<sub>(π/2)</sub>.
+  \ \n\rGive your answer rounded to 10 digits behind the decimal point.\n\n"

data/data/problems/364.yml

@@ -2,14 +2,12 @@
 :id: 364
 :name: Comfortable distance
 :url: http://projecteuler.net/problem=364
-:content: "\r\n<p>\r\nThere are <var>N</var> seats in a row. <var>N</var> people come
-  after each other to fill the seats according to the following rules:\r\n</p>\n<ol
-  type=\"1\">\n<li>If there is any seat whose adjacent seat(s) are not occupied take
-  such a seat.</li>\r\n<li>If there is no such seat and there is any seat for which
-  only one adjacent seat is occupied take such a seat.</li>\r\n<li>Otherwise take
-  one of the remaining available seats. </li>\r\n</ol>\r\nLet T(<var>N</var>) be the
-  number of possibilities that <var>N</var> seats are occupied by <var>N</var> people
-  with the given rules.<br> The following figure shows T(4)=8.\r\n\r\n\r\n<div align=\"center\">\r\n<img
-  src=\"project/images/p_364_comf_dist.gif\">\n</div>\r\n\r\n<p>We can verify that
-  T(10) = 61632 and T(1 000) mod 100 000 007 = 47255094.</p>\r\n<p>Find T(1 000 000)
-  mod 100 000 007.</p>\r\n"
+:content: "There are <var>N</var> seats in a row. <var>N</var> people come after each
+  other to fill the seats according to the following rules:\n\n1. If there is any
+  seat whose adjacent seat(s) are not occupied take such a seat.\n2. If there is no
+  such seat and there is any seat for which only one adjacent seat is occupied take
+  such a seat.\n3. Otherwise take one of the remaining available seats. \n\rLet T(<var>N</var>)
+  be the number of possibilities that <var>N</var> seats are occupied by <var>N</var>
+  people with the given rules.  \n The following figure shows T(4)=8.\r\r\r\n ![](/home/will/src/euler-manager/config/../data/images/p_364_comf_dist.gif)\n\nWe
+  can verify that T(10) = 61632 and T(1 000) mod 100 000 007 = 47255094.\n\nFind T(1
+  000 000) mod 100 000 007.\n\n"