euler-manager 0.0.5 → 0.0.6

data/example/2/README.md

@@ -1,9 +1,11 @@
 # [Even Fibonacci numbers](http://projecteuler.net/problem=2)
 
-
-<p>Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:</p>
-<p style="text-align:center;">1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...</p>
-<p>By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.</p>
+Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
+
+1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
+
+By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
+
 <!--
 Note: This problem has been changed recently, please check that you are using the right parameters.
--->
+-->

data/example/Eulerfile.rb

@@ -11,6 +11,7 @@ Euler.config do |config|
 
   config.answers_file "#{data_dir}/answers.yml"
   config.problems_dir "#{data_dir}/problems"
+  config.images_dir   "https://raw.githubusercontent.com/yaworsw/euler-manager/develop/data/images"
 
   # The +directory_strategy+ is a Proc which returns the directory assigned to a
   # a given solution.

data/lib/euler/problem.rb

@@ -13,7 +13,7 @@ module Euler
       Problem.new problem_spec
     end
 
-    attr_reader :id, :name, :url, :content
+    attr_reader :id, :name, :url
 
     # Given a hash with symbol keys initialize the problem using the +:id+,
     # +:name+, +url+, and +:content+ keys.
@@ -24,6 +24,11 @@ module Euler
       @content = options[:content]
     end
 
+    # Passing content though an ultra simple template engine before returning it
+    def content
+      @content.gsub(/\{\{\s?images_dir\s?\}\}/, Euler.images_dir)
+    end
+
     # Returns true if this problem has an answer.
     def has_answer?
       not answer.empty?

data/lib/euler/solution.rb

@@ -1,3 +1,5 @@
+require 'digest/sha1'
+
 module Euler
 
   # This class represents a user created solution to a project Euler problem.
@@ -15,7 +17,7 @@ module Euler
     # initialize the instance.
     def initialize problem, language
       if problem.is_a?(Problem)
-        @problem    = problems
+        @problem = problem
       else
         @problem_id = problem
       end
@@ -65,7 +67,7 @@ module Euler
     def test
       expected =  answer
       result   =  run
-      expected == result
+      expected == Digest::SHA1.hexdigest(result)
     end
 
     # Alias for +test+.

data/lib/euler/version.rb

@@ -1,3 +1,3 @@
 module Euler
-  VERSION = '0.0.5'
+  VERSION = '0.0.6'
 end

data/rake/clean.rake

@@ -0,0 +1,16 @@
+# Delete all of the problem's .yaml files and the images from the data directory
+
+desc "Deletes all of the data that has been downloaded for Project Euler problems"
+task :clean do
+
+  data_dir     = "#{__dir__}/../data"
+  answers_file = "#{data_dir}/answers.yml"
+  problems_dir = "#{data_dir}/problems"
+  images_dir   = "#{data_dir}/images"
+
+  FileUtils.rm_rf(images_dir)
+  FileUtils.rm_rf(problems_dir)
+
+  FileUtils.mkdir(images_dir)
+  FileUtils.mkdir(problems_dir)
+end

data/rake/update.rake

@@ -0,0 +1,88 @@
+# Gets all of the problems from projecteuler.net and serializes them as yaml
+# into the data/problems directory.  This way http requests do not need to be
+# each time the manager is asked to describe a problem.
+
+$LOAD_PATH << File.join(File.dirname(__FILE__), '..', 'lib')
+
+require 'colorize'
+require 'nokogiri'
+require 'open-uri'
+require 'reverse_markdown'
+require 'yaml'
+
+require 'euler'
+
+desc "Scrape the Project Euler website and download problem descriptions and images"
+task :update do
+
+  # Number of seconds to wait in the beginning of each iteration of the http request loop
+  sleep_time = 0.5
+
+  puts
+  puts 'Updating project Euler problem specs.'
+  puts
+
+  data_dir     = "#{__dir__}/../data"
+  answers_file = "#{data_dir}/answers.yml"
+  problems_dir = "#{data_dir}/problems"
+  images_dir   = "#{data_dir}/images"
+
+  puts 'Data directory:     '.light_black + data_dir.underline
+  puts 'Answers File:       '.light_black + answers_file.underline
+  puts 'Problems Directory: '.light_black + problems_dir.underline
+  puts
+
+  problem_ids           = YAML.load_file(answers_file).keys
+  problems_count        = problem_ids.count
+  problems_count_digits = problems_count.to_s.size
+
+  puts problems_count.to_s.underline + ' Problems will be updated.'
+  puts
+
+  # Fetch problems from projecteuler.net
+  problems = problem_ids.map.with_index do |problem_id, index|
+    zero_padded_index      = (index + 1).to_s.rjust(problems_count_digits, '0')
+    zero_padded_problem_id =  problem_id.to_s.rjust(problems_count_digits, '0')
+
+    print "(#{zero_padded_index} / #{problems_count}) ##{zero_padded_index} "
+
+    sleep(sleep_time)
+
+    url = "http://projecteuler.net/problem=#{problem_id}"
+
+    doc = Nokogiri::HTML(open(url))
+
+    problem_name = ReverseMarkdown.convert(doc.css('h2').first.inner_html).strip
+
+    print ": #{problem_name.strip.bold.underline} "
+
+    # download images
+    doc.css('.problem_content img').each do |img|
+      image_url = "http://projecteuler.net/#{img['src']}"
+      file_name = File.basename(image_url)
+      file_path = "#{images_dir}/#{file_name}"
+      open(image_url) do |i|
+        File.open(file_path, 'wb') do |f|
+          f.puts(i.read)
+        end
+      end
+      img['src'] = "\{\{\ images_dir\ \}\}/#{file_name}"
+    end
+
+    problem = Euler::Problem.new({
+      id:       problem_id,
+      name:     problem_name,
+      url:      url,
+      content:  ReverseMarkdown.convert(doc.css('.problem_content').first.to_xml)
+    })
+
+    File.open("#{problems_dir}/#{problem.id}.yml", 'w') do |f|
+      f.write(problem.to_yaml)
+    end
+
+    print "\u2713".encode('utf-8').green.bold
+    puts
+
+    problem
+  end
+end

data/spec/euler/solution_spec.rb

@@ -1,4 +1,5 @@
 require 'spec_helper'
+require 'digest/sha1'
 
 class EulerLang
   def run solution
@@ -59,7 +60,7 @@ describe Euler::Solution do
 
     solution = Euler::Solution.new(1, 'euler-lang')
     problem  = solution.problem
-    allow(problem).to receive(:answer).and_return('42', '9001')
+    allow(problem).to receive(:answer).and_return(Digest::SHA1.hexdigest('42'), Digest::SHA1.hexdigest('9001'))
 
     solution.correct?.should be_truthy
 

data/templates/Eulerfile.rb

@@ -0,0 +1,12 @@
+Euler.config do |config|
+
+  # Images included in problem prompts are typically loaded from your local
+  # file system.  You can opt into loading the images from this gem's github
+  # repo by uncommenting the following line.
+  # config.images_dir "https://raw.githubusercontent.com/yaworsw/euler-manager/develop/data/images"
+
+  # Also you can have the images included in your kata repo by running the
+  # command euler include_images and uncommenting the following line.
+  # config.images_dir "#{File.dirname(__FILE__)}/.data/images"
+
+end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: euler-manager
 version: !ruby/object:Gem::Version
-  version: 0.0.5
+  version: 0.0.6
 platform: ruby
 authors:
 - William Yaworsky
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2014-06-22 00:00:00.000000000 Z
+date: 2014-07-07 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: commander
@@ -122,6 +122,20 @@ dependencies:
     - - '>='
       - !ruby/object:Gem::Version
         version: '0'
+- !ruby/object:Gem::Dependency
+  name: reverse_markdown
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
 description: 
 email:
 - wj.px01@gmail.com
@@ -139,6 +153,173 @@ files:
 - bin/euler
 - config/config.rb
 - data/answers.yml
+- data/images/blackdot.gif
+- data/images/bracket_left.gif
+- data/images/bracket_right.gif
+- data/images/p295_lenticular.gif
+- data/images/p296_bisector.gif
+- data/images/p303_formula100.gif
+- data/images/p303_formula10000.gif
+- data/images/p392_gridlines.png
+- data/images/p400_winning.png
+- data/images/p411_longpath.png
+- data/images/p412_table53.png
+- data/images/p412_tablenums.png
+- data/images/p422_hyperbola.gif
+- data/images/p428_necklace.png
+- data/images/p_015.gif
+- data/images/p_068_1.gif
+- data/images/p_068_2.gif
+- data/images/p_085.gif
+- data/images/p_086.gif
+- data/images/p_090.gif
+- data/images/p_091_1.gif
+- data/images/p_091_2.gif
+- data/images/p_107_1.gif
+- data/images/p_107_2.gif
+- data/images/p_109.gif
+- data/images/p_126.gif
+- data/images/p_128.gif
+- data/images/p_138.gif
+- data/images/p_139.gif
+- data/images/p_143_torricelli.gif
+- data/images/p_144_1.gif
+- data/images/p_144_2.gif
+- data/images/p_147.gif
+- data/images/p_150.gif
+- data/images/p_151.gif
+- data/images/p_152_sum.gif
+- data/images/p_153_formule1.gif
+- data/images/p_153_formule2.gif
+- data/images/p_153_formule5.gif
+- data/images/p_153_formule6.gif
+- data/images/p_154_pyramid.gif
+- data/images/p_155_capacitors1.gif
+- data/images/p_155_capsform.gif
+- data/images/p_155_capsmu.gif
+- data/images/p_161_k9.gif
+- data/images/p_161_trio1.gif
+- data/images/p_161_trio3.gif
+- data/images/p_163.gif
+- data/images/p_173_square_laminas.gif
+- data/images/p_177_quad.gif
+- data/images/p_184.gif
+- data/images/p_189_colours.gif
+- data/images/p_189_grid.gif
+- data/images/p_194_Fig.png
+- data/images/p_194_GraphA.png
+- data/images/p_194_GraphB.png
+- data/images/p_199_circles_in_circles.gif
+- data/images/p_201_laserbeam.gif
+- data/images/p_208_robotwalk.gif
+- data/images/p_215_crackfree.gif
+- data/images/p_220.gif
+- data/images/p_226_formula.gif
+- data/images/p_226_scoop2.gif
+- data/images/p_228.png
+- data/images/p_237.gif
+- data/images/p_244_example.gif
+- data/images/p_244_start.gif
+- data/images/p_244_target.gif
+- data/images/p_246_anim.gif
+- data/images/p_246_ellipse.gif
+- data/images/p_247_hypersquares.gif
+- data/images/p_251_cardano.gif
+- data/images/p_252_convexhole.gif
+- data/images/p_255_Example.gif
+- data/images/p_255_Heron.gif
+- data/images/p_256_tatami3.gif
+- data/images/p_257_bisector.gif
+- data/images/p_262_formula1.gif
+- data/images/p_264_TriangleCentres.gif
+- data/images/p_265_BinaryCircles.gif
+- data/images/p_270_CutSquare.gif
+- data/images/p_275_sculptures2.gif
+- data/images/p_281_pizza.gif
+- data/images/p_282_formula.gif
+- data/images/p_282formula3.gif
+- data/images/p_287_quadtree.gif
+- data/images/p_289_euler.gif
+- data/images/p_291_formula.gif
+- data/images/p_299_ThreeSimTri.gif
+- data/images/p_300_protein.gif
+- data/images/p_306_pstrip.gif
+- data/images/p_309_ladders.gif
+- data/images/p_311_biclinic.gif
+- data/images/p_312_sierpinsky8t.gif
+- data/images/p_312_sierpinskyAt.gif
+- data/images/p_313_sliding_game_1.gif
+- data/images/p_313_sliding_game_2.gif
+- data/images/p_314_landgrab.gif
+- data/images/p_315_clocks.gif
+- data/images/p_316_decexp1.gif
+- data/images/p_316_decexp2.gif
+- data/images/p_316_decexp3.gif
+- data/images/p_321_swapping_counters_1.gif
+- data/images/p_321_swapping_counters_2.gif
+- data/images/p_326_formula1.gif
+- data/images/p_326_formula2.gif
+- data/images/p_327_rooms_of_doom.gif
+- data/images/p_328_sum1.gif
+- data/images/p_328_sum2.gif
+- data/images/p_330_formula.gif
+- data/images/p_331_crossflips1.gif
+- data/images/p_331_crossflips2.gif
+- data/images/p_331_crossflips3.gif
+- data/images/p_332_spherical.jpg
+- data/images/p_332_sum.gif
+- data/images/p_334_beans.gif
+- data/images/p_334_cases.gif
+- data/images/p_334_lfloor.gif
+- data/images/p_334_oplus.gif
+- data/images/p_334_rfloor.gif
+- data/images/p_335_mancala.gif
+- data/images/p_335_sum.gif
+- data/images/p_336_maximix.gif
+- data/images/p_338_gridpaper.gif
+- data/images/p_340_formula.gif
+- data/images/p_344_silverdollar.gif
+- data/images/p_351_hexorchard.png
+- data/images/p_354_bee_honeycomb.png
+- data/images/p_356_cubicpoly1.gif
+- data/images/p_356_cubicpoly2.gif
+- data/images/p_361_Thue-Morse1.gif
+- data/images/p_364_comf_dist.gif
+- data/images/p_372_pencilray1.jpg
+- data/images/p_372_pencilray2.gif
+- data/images/p_380_mazes.gif
+- data/images/p_384_formula.gif
+- data/images/p_385_ellipsetriangle.png
+- data/images/p_394_eatpie.gif
+- data/images/p_395_pythagorean.gif
+- data/images/p_404_c_ellipse.gif
+- data/images/p_405_tile1.png
+- data/images/p_405_tile2.gif
+- data/images/p_420_matrix.gif
+- data/images/p_424_kakuro1.gif
+- data/images/p_426_baxball1.gif
+- data/images/p_426_baxball2.gif
+- data/images/p_430_flips.gif
+- data/images/sod_13.gif
+- data/images/spacer.gif
+- data/images/symbol_asymp.gif
+- data/images/symbol_cong.gif
+- data/images/symbol_ge.gif
+- data/images/symbol_gt.gif
+- data/images/symbol_implies.gif
+- data/images/symbol_lceil.gif
+- data/images/symbol_le.gif
+- data/images/symbol_lfloor.gif
+- data/images/symbol_lt.gif
+- data/images/symbol_maps.gif
+- data/images/symbol_minus.gif
+- data/images/symbol_ne.gif
+- data/images/symbol_plusmn.gif
+- data/images/symbol_radic.gif
+- data/images/symbol_rceil.gif
+- data/images/symbol_rfloor.gif
+- data/images/symbol_sum.gif
+- data/images/symbol_times.gif
 - data/problems/1.yml
 - data/problems/10.yml
 - data/problems/100.yml
@@ -508,34 +689,8 @@ files:
 - data/problems/429.yml
 - data/problems/43.yml
 - data/problems/430.yml
-- data/problems/431.yml
-- data/problems/432.yml
-- data/problems/433.yml
-- data/problems/434.yml
-- data/problems/435.yml
-- data/problems/436.yml
-- data/problems/437.yml
-- data/problems/438.yml
-- data/problems/439.yml
 - data/problems/44.yml
-- data/problems/440.yml
-- data/problems/441.yml
-- data/problems/442.yml
-- data/problems/443.yml
-- data/problems/444.yml
-- data/problems/445.yml
-- data/problems/446.yml
-- data/problems/447.yml
-- data/problems/448.yml
-- data/problems/449.yml
 - data/problems/45.yml
-- data/problems/450.yml
-- data/problems/451.yml
-- data/problems/452.yml
-- data/problems/453.yml
-- data/problems/454.yml
-- data/problems/455.yml
-- data/problems/456.yml
 - data/problems/46.yml
 - data/problems/47.yml
 - data/problems/48.yml
@@ -600,6 +755,9 @@ files:
 - example/1/README.md
 - example/1/ruby/1.rb
 - example/1/scala/1.scala
+- example/15/README.md
+- example/15/python/15.py
+- example/15/python/euler.py
 - example/2/README.md
 - example/2/python/2.py
 - example/2/python/euler.py
@@ -619,11 +777,13 @@ files:
 - lib/euler/problem.rb
 - lib/euler/solution.rb
 - lib/euler/version.rb
-- scripts/update_problems
+- rake/clean.rake
+- rake/update.rake
 - spec/euler/problem_spec.rb
 - spec/euler/solution_spec.rb
 - spec/euler_spec.rb
 - spec/spec_helper.rb
+- templates/Eulerfile.rb
 - templates/coffeescript.coffee
 - templates/java.java
 - templates/javascript.js

data/data/problems/431.yml

@@ -1,33 +0,0 @@
----
-:id: 431
-:name: Square Space Silo
-:url: http://projecteuler.net/problem=431
-:content: "\r\n<p>Fred the farmer arranges to have a new storage silo installed on
-  his farm and having an obsession for all things square he is absolutely devastated
-  when he discovers that it is circular. Quentin, the representative from the company
-  that installed the silo, explains that they only manufacture cylindrical silos,
-  but he points out that it is resting on a square base. Fred is not amused and insists
-  that it is removed from his property.</p>\r\n\r\n<p>Quick thinking Quentin explains
-  that when granular materials are delivered from above a conical slope is formed
-  and the natural angle made with the horizontal is called the angle of repose. For
-  example if the angle of repose, $\\alpha = 30$ degrees, and grain is delivered at
-  the centre of the silo then a perfect cone will form towards the top of the cylinder.
-  In the case of this silo, which has a diameter of 6m, the amount of space wasted
-  would be approximately 32.648388556 m<sup>3</sup>. However, if grain is delivered
-  at a point on the top which has a horizontal distance of $x$ metres from the centre
-  then a cone with a strangely curved and sloping base is formed. He shows Fred a
-  picture.</p>\r\n\r\n<div style=\"text-align:center;\">\r\n   <img src=\"project/images/p_431_grain_silo.png\">\n</div>\r\n\r\n<p>We
-  shall let the amount of space wasted in cubic metres be given by $V(x)$. If $x =
-  1.114785284$, which happens to have three squared decimal places, then the amount
-  of space wasted, $V(1.114785284) \\approx 36$. Given the range of possible solutions
-  to this problem there is exactly one other option: $V(2.511167869) \\approx 49$.
-  It would be like knowing that the square is king of the silo, sitting in splendid
-  glory on top of your grain.</p>\r\n\r\n<p>Fred's eyes light up with delight at this
-  elegant resolution, but on closer inspection of Quentin's drawings and calculations
-  his happiness turns to despondency once more. Fred points out to Quentin that it's
-  the radius of the silo that is 6 metres, not the diameter, and the angle of repose
-  for his grain is 40 degrees. However, if Quentin can find a set of solutions for
-  this particular silo then he will be more than happy to keep it.</p>\r\n\r\n<p>If
-  Quick thinking Quentin is to satisfy frustratingly fussy Fred the farmer's appetite
-  for all things square then determine the values of $x$ for all possible square space
-  wastage options and calculate $\\sum x$ correct to 9 decimal places.</p>\r\n"

data/data/problems/432.yml

@@ -1,13 +0,0 @@
----
-:id: 432
-:name: Totient sum
-:url: http://projecteuler.net/problem=432
-:content: "\r\n<p>\r\nLet S(<var>n,m</var>) = <img src=\"images/symbol_sum.gif\" width=\"11\"
-  height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">φ(<var>n <img
-  src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
-  style=\"vertical-align:middle;\"> i</var>) for 1 <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>i
-  <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> m</var>. (φ is Euler's totient function)<br>\r\nYou
-  are given that S(510510,10<sup>6</sup> )= 45480596821125120. \r\n</p>\r\n<p>\r\nFind
-  S(510510,10<sup>11</sup>).<br>\r\nGive the last 9 digits of your answer.\r\n</p>\r\n\r\n"

data/data/problems/433.yml

@@ -1,18 +0,0 @@
----
-:id: 433
-:name: Steps in Euclid's algorithm
-:url: http://projecteuler.net/problem=433
-:content: "\r\n<p>\r\nLet E(<var>x</var><sub>0</sub>, <var>y</var><sub>0</sub>) be
-  the number of steps it takes to determine the greatest common divisor of <var>x</var><sub>0</sub>
-  and <var>y</var><sub>0</sub> with <b>Euclid's algorithm</b>. More formally:<br><var>x</var><sub>1</sub>
-  = <var>y</var><sub>0</sub>, <var>y</var><sub>1</sub> = <var>x</var><sub>0</sub>
-  mod <var>y</var><sub>0</sub><br><var>x<sub>n</sub></var> = <var>y</var><sub><var>n</var>-1</sub>,
-  <var>y</var><sub><var>n</var></sub> = <var>x</var><sub><var>n</var>-1</sub> mod
-  <var>y</var><sub><var>n</var>-1</sub><br>\r\nE(<var>x</var><sub>0</sub>, <var>y</var><sub>0</sub>)
-  is the smallest <var>n</var> such that <var>y</var><sub><var>n</var></sub> = 0.\r\n</p>\r\n<p>\r\nWe
-  have E(1,1) = 1, E(10,6) = 3 and E(6,10) = 4.\r\n</p>\r\n<p>\r\nDefine S(N) as the
-  sum of E(<var>x,y</var>) for 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
-  alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>x,y</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
-  N.<br>\r\nWe have S(1) = 1, S(10) = 221 and S(100) = 39826.\r\n</p>\r\n<p>\r\nFind
-  S(5·10<sup>6</sup>).\r\n</p>\r\n\r\n\r\n"

data/data/problems/434.yml

@@ -1,32 +0,0 @@
----
-:id: 434
-:name: Rigid graphs
-:url: http://projecteuler.net/problem=434
-:content: "\r\n<p>Recall that a graph is a collection of vertices and edges connecting
-  the vertices, and that two vertices connected by an edge are called adjacent.<br>\r\nGraphs
-  can be embedded in Euclidean space by associating each vertex with a point in the
-  Euclidean space.<br>\r\nA <strong>flexible</strong> graph is an embedding of a graph
-  where it is possible to move one or more vertices continuously so that the distance
-  between at least two nonadjacent vertices is altered while the distances between
-  each pair of adjacent vertices is kept constant.<br>\r\nA <strong>rigid</strong>
-  graph is an embedding of a graph which is not flexible.<br>\r\nInformally, a graph
-  is rigid if by replacing the vertices with fully rotating hinges and the edges with
-  rods that are unbending and inelastic, no parts of the graph can be moved independently
-  from the rest of the graph.\r\n</p>\r\n<p>The <strong>grid graphs</strong> embedded
-  in the Euclidean plane are not rigid, as the following animation demonstrates:<br><img
-  src=\"project/images/p434_rigid.gif\"></p>\r\n<p>However, one can make them rigid
-  by adding diagonal edges to the cells. For example, for the 2x3 grid graph, there
-  are 19 ways to make the graph rigid:<br><img src=\"project/images/p434_rigid23.png\"></p>\r\n<p>Note
-  that for the purposes of this problem, we do not consider changing the orientation
-  of a diagonal edge or adding both diagonal edges to a cell as a different way of
-  making a grid graph rigid.\r\n</p>\r\n<p>Let <var>R</var>(<var>m</var>,<var>n</var>)
-  be the number of ways to make the <var>m</var> <img src=\"images/symbol_times.gif\"
-  width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"><var>n</var>
-  grid graph rigid. <br>\r\nE.g. <var>R</var>(2,3) = 19 and <var>R</var>(5,5) = 23679901\r\n</p>\r\n<p>Define
-  <var>S</var>(<var>N</var>) as <img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\"
-  alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\"><var>R</var>(<var>i</var>,<var>j</var>)
-  for 1 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"><var>i</var>, <var>j</var> <img src=\"images/symbol_le.gif\"
-  width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>N</var>.<br>\r\nE.g.
-  <var>S</var>(5) = 25021721.<br>\r\nFind <var>S</var>(100), give your answer modulo
-  1000000033\r\n</p>\r\n"

data/data/problems/435.yml

@@ -1,21 +0,0 @@
----
-:id: 435
-:name: Polynomials of Fibonacci numbers
-:url: http://projecteuler.net/problem=435
-:content: "\r\n<p>The <strong>Fibonacci numbers</strong> {f<sub>n</sub>, n <img src=\"images/symbol_ge.gif\"
-  width=\"10\" height=\"12\" alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\">
-  0} are defined recursively as f<sub>n</sub> = f<sub>n-1</sub> + f<sub>n-2</sub>
-  with base cases f<sub>0</sub> = 0 and f<sub>1</sub> = 1.</p>\r\n<p>Define the polynomials
-  {F<sub>n</sub>, n <img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\"
-  border=\"0\" style=\"vertical-align:middle;\"> 0} as F<sub>n</sub>(x) = <img src=\"images/symbol_sum.gif\"
-  width=\"11\" height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\">f<sub>i</sub>x<sup>i</sup>
-  for 0 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
-  style=\"vertical-align:middle;\"> i <img src=\"images/symbol_le.gif\" width=\"10\"
-  height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> n.</p>\r\n<p>For
-  example, F<sub>7</sub>(x) = x + x<sup>2</sup> + 2x<sup>3</sup> + 3x<sup>4</sup>
-  + 5x<sup>5</sup> + 8x<sup>6</sup> + 13x<sup>7</sup>, and F<sub>7</sub>(11) = 268357683.</p>\r\n<p>Let
-  n = 10<sup>15</sup>. Find the sum [<img src=\"images/symbol_sum.gif\" width=\"11\"
-  height=\"14\" alt=\"∑\" border=\"0\" style=\"vertical-align:middle;\"><sub>0<img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">x<img
-  src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">100</sub>
-  F<sub>n</sub>(x)] mod 1307674368000 (= 15!).</p>\r\n"

data/data/problems/436.yml

@@ -1,21 +0,0 @@
----
-:id: 436
-:name: Unfair wager
-:url: http://projecteuler.net/problem=436
-:content: "\r\n<p>Julie proposes the following wager to her sister Louise.<br>\r\nShe
-  suggests they play a game of chance to determine who will wash the dishes.<br>\r\nFor
-  this game, they shall use a generator of independent random numbers uniformly distributed
-  between 0 and 1.<br>\r\nThe game starts with <var>S</var> = 0.<br>\r\nThe first
-  player, Louise, adds to <var>S</var> different random numbers from the generator
-  until <var>S</var> &gt; 1 and records her last random number '<var>x</var>'.<br>\r\nThe
-  second player, Julie, continues adding to <var>S</var> different random numbers
-  from the generator until <var>S</var> &gt; 2 and records her last random number
-  '<var>y</var>'.<br>\r\nThe player with the highest number wins and the loser washes
-  the dishes, i.e. if <var>y</var> &gt; <var>x</var> the second player wins.</p>\r\n\r\n<p>For
-  e<var>x</var>ample, if the first player draws 0.62 and 0.44, the first player turn
-  ends since 0.62+0.44 &gt; 1 and <var>x</var> = 0.44.<br>\r\nIf the second players
-  draws 0.1, 0.27 and 0.91, the second player turn ends since 0.62+0.44+0.1+0.27+0.91
-  &gt; 2 and <var>y</var> = 0.91.\r\nSince <var>y</var> &gt; <var>x</var>, the second
-  player wins.</p>\r\n\r\n<p>Louise thinks about it for a second, and objects: \"That's
-  not fair\".<br>\r\nWhat is the probability that the second player wins?<br>\r\nGive
-  your answer rounded to 10 places behind the decimal point in the form 0.abcdefghij</p>\r\n\r\n"

data/data/problems/437.yml

@@ -1,22 +0,0 @@
----
-:id: 437
-:name: Fibonacci primitive roots
-:url: http://projecteuler.net/problem=437
-:content: "\r\n<p>\r\nWhen we calculate 8<sup>n</sup> modulo 11 for n=0 to 9 we get:
-  1, 8, 9, 6, 4, 10, 3, 2, 5, 7.<br>\r\nAs we see all possible values from 1 to 10
-  occur. So 8 is a <b>primitive root</b> of 11.<br>\r\nBut there is more:<br>\r\nIf
-  we take a closer look we see:<br>\r\n1+8=9<br>\r\n8+9=17<img src=\"images/symbol_cong.gif\"
-  width=\"9\" height=\"11\" alt=\"≡\" border=\"0\" style=\"vertical-align:middle;\">6
-  mod 11<br>\r\n9+6=15<img src=\"images/symbol_cong.gif\" width=\"9\" height=\"11\"
-  alt=\"≡\" border=\"0\" style=\"vertical-align:middle;\">4 mod 11<br>\r\n6+4=10<br>\r\n4+10=14<img
-  src=\"images/symbol_cong.gif\" width=\"9\" height=\"11\" alt=\"≡\" border=\"0\"
-  style=\"vertical-align:middle;\">3 mod 11<br>\r\n10+3=13<img src=\"images/symbol_cong.gif\"
-  width=\"9\" height=\"11\" alt=\"≡\" border=\"0\" style=\"vertical-align:middle;\">2
-  mod 11<br>\r\n3+2=5<br>\r\n2+5=7<br>\r\n5+7=12<img src=\"images/symbol_cong.gif\"
-  width=\"9\" height=\"11\" alt=\"≡\" border=\"0\" style=\"vertical-align:middle;\">1
-  mod 11.\r\n</p>\r\nSo the powers of 8 mod 11 are cyclic with period 10, and 8<sup>n</sup>
-  + 8<sup>n+1</sup> ≡ 8<sup>n+2</sup> (mod 11).<br>\r\n8 is called a <b>Fibonacci
-  primitive root</b> of 11.<br>\r\nNot every prime has a Fibonacci primitive root.<br>\r\nThere
-  are 323 primes less than 10000 with one or more Fibonacci primitive roots and the
-  sum of these primes is 1480491.<br>\r\nFind the sum of the primes less than 100,000,000
-  with at least one Fibonacci primitive root.\r\n\r\n\r\n"