euler-manager 0.1.1 → 0.2.0

data/data/problems/90.yml

@@ -1,11 +1,11 @@
 ---
 :id: 90
 :name: Cube digit pairs
-:url: http://projecteuler.net/problem=90
+:url: https://projecteuler.net/problem=90
 :content: "Each of the six faces on a cube has a different digit (0 to 9) written
   on it; the same is done to a second cube. By placing the two cubes side-by-side
   in different positions we can form a variety of 2-digit numbers.\n\nFor example,
-  the square number 64 could be formed:\n\n ![]({{ images_dir }}/p_090.gif)  \n\nIn
+  the square number 64 could be formed:\n\n ![]({{ images_dir }}/p090.gif)  \n\nIn
   fact, by carefully choosing the digits on both cubes it is possible to display all
   of the square numbers below one-hundred: 01, 04, 09, 16, 25, 36, 49, 64, and 81.\n\nFor
   example, one way this can be achieved is by placing {0, 5, 6, 7, 8, 9} on one cube
@@ -14,8 +14,8 @@
   7, 8, 9} and {1, 2, 3, 4, 6, 7} allows for all nine square numbers to be displayed;
   otherwise it would be impossible to obtain 09.\n\nIn determining a distinct arrangement
   we are interested in the digits on each cube, not the order.\n\n{1, 2, 3, 4, 5,
-  6} is equivalent to {3, 6, 4, 1, 2, 5}  \n\r{1, 2, 3, 4, 5, 6} is distinct from
-  {1, 2, 3, 4, 5, 9}\n\nBut because we are allowing 6 and 9 to be reversed, the two
-  distinct sets in the last example both represent the extended set {1, 2, 3, 4, 5,
-  6, 9} for the purpose of forming 2-digit numbers.\n\nHow many distinct arrangements
-  of the two cubes allow for all of the square numbers to be displayed?\n\n"
+  6} is equivalent to {3, 6, 4, 1, 2, 5}  \n{1, 2, 3, 4, 5, 6} is distinct from {1,
+  2, 3, 4, 5, 9}\n\nBut because we are allowing 6 and 9 to be reversed, the two distinct
+  sets in the last example both represent the extended set {1, 2, 3, 4, 5, 6, 9} for
+  the purpose of forming 2-digit numbers.\n\nHow many distinct arrangements of the
+  two cubes allow for all of the square numbers to be displayed?\n\n"

data/data/problems/91.yml

@@ -1,14 +1,12 @@
 ---
 :id: 91
 :name: Right triangles with integer coordinates
-:url: http://projecteuler.net/problem=91
+:url: https://projecteuler.net/problem=91
 :content: "The points P (_x_<sub>1</sub>, _y_<sub>1</sub>) and Q (_x_<sub>2</sub>,
   _y_<sub>2</sub>) are plotted at integer co-ordinates and are joined to the origin,
-  O(0,0), to form ΔOPQ.\n\n ![]({{ images_dir }}/p_091_1.gif)  \n\nThere are exactly
+  O(0,0), to form ΔOPQ.\n\n ![]({{ images_dir }}/p091_1.gif)  \n\nThere are exactly
   fourteen triangles containing a right angle that can be formed when each co-ordinate
-  lies between 0 and 2 inclusive; that is,  \n0 ![≤]({{ images_dir }}/symbol_le.gif)
-  _x_<sub>1</sub>, _y_<sub>1</sub>, _x_<sub>2</sub>, _y_<sub>2</sub> ![≤]({{ images_dir
-  }}/symbol_le.gif) 2.\n\n ![]({{ images_dir }}/p_091_2.gif)  \n\nGiven that 0 ![≤]({{
-  images_dir }}/symbol_le.gif) _x_<sub>1</sub>, _y_<sub>1</sub>, _x_<sub>2</sub>,
-  _y_<sub>2</sub> ![≤]({{ images_dir }}/symbol_le.gif) 50, how many right triangles
-  can be formed?\n\n"
+  lies between 0 and 2 inclusive; that is,  \n0 ≤ _x_<sub>1</sub>, _y_<sub>1</sub>,
+  _x_<sub>2</sub>, _y_<sub>2</sub> ≤ 2.\n\n ![]({{ images_dir }}/p091_2.gif)  \n\nGiven
+  that 0 ≤ _x_<sub>1</sub>, _y_<sub>1</sub>, _x_<sub>2</sub>, _y_<sub>2</sub> ≤ 50,
+  how many right triangles can be formed?\n\n"

data/data/problems/92.yml

@@ -1,16 +1,11 @@
 ---
 :id: 92
 :name: Square digit chains
-:url: http://projecteuler.net/problem=92
+:url: https://projecteuler.net/problem=92
 :content: "A number chain is created by continuously adding the square of the digits
   in a number to form a new number until it has been seen before.\n\nFor example,\n\n44
-  ![→]({{ images_dir }}/symbol_maps.gif) 32 ![→]({{ images_dir }}/symbol_maps.gif)
-  13 ![→]({{ images_dir }}/symbol_maps.gif) 10 ![→]({{ images_dir }}/symbol_maps.gif)
-  **1** ![→]({{ images_dir }}/symbol_maps.gif) **1**  \n85 ![→]({{ images_dir }}/symbol_maps.gif)
-  **89** ![→]({{ images_dir }}/symbol_maps.gif) 145 ![→]({{ images_dir }}/symbol_maps.gif)
-  42 ![→]({{ images_dir }}/symbol_maps.gif) 20 ![→]({{ images_dir }}/symbol_maps.gif)
-  4 ![→]({{ images_dir }}/symbol_maps.gif) 16 ![→]({{ images_dir }}/symbol_maps.gif)
-  37 ![→]({{ images_dir }}/symbol_maps.gif) 58 ![→]({{ images_dir }}/symbol_maps.gif)
-  **89**\n\nTherefore any chain that arrives at 1 or 89 will become stuck in an endless
-  loop. What is most amazing is that EVERY starting number will eventually arrive
-  at 1 or 89.\n\nHow many starting numbers below ten million will arrive at 89?\n\n"
+  → 32 → 13 → 10 → **1** → **1**  \n85 → **89** → 145 → 42 → 20 → 4 → 16 → 37 → 58
+  → **89**\n\nTherefore any chain that arrives at 1 or 89 will become stuck in an
+  endless loop. What is most amazing is that EVERY starting number will eventually
+  arrive at 1 or 89.\n\nHow many starting numbers below ten million will arrive at
+  89?\n\n"

data/data/problems/93.yml

@@ -1,16 +1,15 @@
 ---
 :id: 93
 :name: Arithmetic expressions
-:url: http://projecteuler.net/problem=93
+:url: https://projecteuler.net/problem=93
 :content: "By using each of the digits from the set, {1, 2, 3, 4}, exactly once, and
-  making use of the four arithmetic operations (+, ![−]({{ images_dir }}/symbol_minus.gif),
-  \\*, /) and brackets/parentheses, it is possible to form different positive integer
-  targets.\n\nFor example,\n\n8 = (4 \\* (1 + 3)) / 2  \n14 = 4 \\* (3 + 1 / 2)  \n19
-  = 4 \\* (2 + 3) ![−]({{ images_dir }}/symbol_minus.gif) 1  \n36 = 3 \\* 4 \\* (2
-  + 1)\n\nNote that concatenations of the digits, like 12 + 34, are not allowed.\n\nUsing
-  the set, {1, 2, 3, 4}, it is possible to obtain thirty-one different target numbers
-  of which 36 is the maximum, and each of the numbers 1 to 28 can be obtained before
-  encountering the first non-expressible number.\n\nFind the set of four distinct
-  digits, _a_ ![<]({{ images_dir }}/symbol_lt.gif) _b_ &lt _c_ ![<]({{ images_dir
-  }}/symbol_lt.gif) _d_, for which the longest set of consecutive positive integers,
-  1 to _n_, can be obtained, giving your answer as a string: _abcd_.\n\n"
+  making use of the four arithmetic operations (+, −, \\*, /) and brackets/parentheses,
+  it is possible to form different positive integer targets.\n\nFor example,\n\n8
+  = (4 \\* (1 + 3)) / 2  \n14 = 4 \\* (3 + 1 / 2)  \n19 = 4 \\* (2 + 3) − 1  \n36
+  = 3 \\* 4 \\* (2 + 1)\n\nNote that concatenations of the digits, like 12 + 34, are
+  not allowed.\n\nUsing the set, {1, 2, 3, 4}, it is possible to obtain thirty-one
+  different target numbers of which 36 is the maximum, and each of the numbers 1 to
+  28 can be obtained before encountering the first non-expressible number.\n\nFind
+  the set of four distinct digits, _a_ \\< _b_ \\< _c_ \\< _d_, for which the longest
+  set of consecutive positive integers, 1 to _n_, can be obtained, giving your answer
+  as a string: _abcd_.\n\n"

data/data/problems/94.yml

@@ -1,7 +1,7 @@
 ---
 :id: 94
 :name: Almost equilateral triangles
-:url: http://projecteuler.net/problem=94
+:url: https://projecteuler.net/problem=94
 :content: |+
   It is easily proved that no equilateral triangle exists with integral length sides and integral area. However, the _almost equilateral triangle_ 5-5-6 has an area of 12 square units.
 

data/data/problems/95.yml

@@ -1,7 +1,7 @@
 ---
 :id: 95
 :name: Amicable chains
-:url: http://projecteuler.net/problem=95
+:url: https://projecteuler.net/problem=95
 :content: |+
   The proper divisors of a number are all the divisors excluding the number itself. For example, the proper divisors of 28 are 1, 2, 4, 7, and 14. As the sum of these divisors is equal to 28, we call it a perfect number.
 
@@ -9,7 +9,7 @@
 
   Perhaps less well known are longer chains. For example, starting with 12496, we form a chain of five numbers:
 
-  12496 ![→]({{ images_dir }}/symbol_maps.gif) 14288 ![→]({{ images_dir }}/symbol_maps.gif) 15472 ![→]({{ images_dir }}/symbol_maps.gif) 14536 ![→]({{ images_dir }}/symbol_maps.gif) 14264 ( ![→]({{ images_dir }}/symbol_maps.gif) 12496 ![→]({{ images_dir }}/symbol_maps.gif) ...)
+  12496 → 14288 → 15472 → 14536 → 14264 (→ 12496 → ...)
 
   Since this chain returns to its starting point, it is called an amicable chain.
 

data/data/problems/96.yml

@@ -1,7 +1,7 @@
 ---
 :id: 96
 :name: Su Doku
-:url: http://projecteuler.net/problem=96
+:url: https://projecteuler.net/problem=96
 :content: "Su Doku (Japanese meaning _number place_) is the name given to a popular
   puzzle concept. Its origin is unclear, but credit must be attributed to Leonhard
   Euler who invented a similar, and much more difficult, puzzle idea called Latin
@@ -20,11 +20,9 @@
   to eliminate options (there is much contested opinion over this). The complexity
   of the search determines the difficulty of the puzzle; the example above is considered
   _easy_ because it can be solved by straight forward direct deduction.\n\nThe 6K
-  text file, [sudoku.txt](project/sudoku.txt) (right click and 'Save Link/Target As...'),
-  contains fifty different Su Doku puzzles ranging in difficulty, but all with unique
-  solutions (the first puzzle in the file is the example above).\n\nBy solving all
-  fifty puzzles find the sum of the 3-digit numbers found in the top left corner of
-  each solution grid; for example, 483 is the 3-digit number found in the top left
-  corner of the solution grid above.\n\n<!--<p class='info'>Note: If you're convinced
-  that &quot;guess and test&quot; methods need not be employed please tell how you
-  would solve #6 and #46. (c;</p>-->\n"
+  text file, [sudoku.txt](project/resources/p096_sudoku.txt) (right click and 'Save
+  Link/Target As...'), contains fifty different Su Doku puzzles ranging in difficulty,
+  but all with unique solutions (the first puzzle in the file is the example above).\n\nBy
+  solving all fifty puzzles find the sum of the 3-digit numbers found in the top left
+  corner of each solution grid; for example, 483 is the 3-digit number found in the
+  top left corner of the solution grid above.\n\n"

data/data/problems/97.yml

@@ -1,11 +1,11 @@
 ---
 :id: 97
 :name: Large non-Mersenne prime
-:url: http://projecteuler.net/problem=97
+:url: https://projecteuler.net/problem=97
 :content: |+
-  The first known prime found to exceed one million digits was discovered in 1999, and is a Mersenne prime of the form 2<sup>6972593</sup> ![−]({{ images_dir }}/symbol_minus.gif)1; it contains exactly 2,098,960 digits. Subsequently other Mersenne primes, of the form 2<sup><i>p</i></sup> ![−]({{ images_dir }}/symbol_minus.gif)1, have been found which contain more digits.
+  The first known prime found to exceed one million digits was discovered in 1999, and is a Mersenne prime of the form 2<sup>6972593</sup>−1; it contains exactly 2,098,960 digits. Subsequently other Mersenne primes, of the form 2<sup><i>p</i></sup>−1, have been found which contain more digits.
 
-  However, in 2004 there was found a massive non-Mersenne prime which contains 2,357,207 digits: 28433 ![×]({{ images_dir }}/symbol_times.gif)2<sup>7830457</sup>+1.
+  However, in 2004 there was found a massive non-Mersenne prime which contains 2,357,207 digits: 28433×2<sup>7830457</sup>+1.
 
   Find the last ten digits of this prime number.
 

data/data/problems/98.yml

@@ -1,11 +1,11 @@
 ---
 :id: 98
 :name: Anagramic squares
-:url: http://projecteuler.net/problem=98
+:url: https://projecteuler.net/problem=98
 :content: |+
   By replacing each of the letters in the word CARE with 1, 2, 9, and 6 respectively, we form a square number: 1296 = 36<sup>2</sup>. What is remarkable is that, by using the same digital substitutions, the anagram, RACE, also forms a square number: 9216 = 96<sup>2</sup>. We shall call CARE (and RACE) a square anagram word pair and specify further that leading zeroes are not permitted, neither may a different letter have the same digital value as another letter.
 
-  Using [words.txt](project/words.txt) (right click and 'Save Link/Target As...'), a 16K text file containing nearly two-thousand common English words, find all the square anagram word pairs (a palindromic word is NOT considered to be an anagram of itself).
+  Using [words.txt](project/resources/p098_words.txt) (right click and 'Save Link/Target As...'), a 16K text file containing nearly two-thousand common English words, find all the square anagram word pairs (a palindromic word is NOT considered to be an anagram of itself).
 
   What is the largest square number formed by any member of such a pair?
 

data/data/problems/99.yml

@@ -1,13 +1,13 @@
 ---
 :id: 99
 :name: Largest exponential
-:url: http://projecteuler.net/problem=99
+:url: https://projecteuler.net/problem=99
 :content: |+
-  Comparing two numbers written in index form like 2<sup>11</sup> and 3<sup>7</sup> is not difficult, as any calculator would confirm that 2<sup>11</sup> = 2048 ![<]({{ images_dir }}/symbol_lt.gif) 3<sup>7</sup> = 2187.
+  Comparing two numbers written in index form like 2<sup>11</sup> and 3<sup>7</sup> is not difficult, as any calculator would confirm that 2<sup>11</sup> = 2048 \< 3<sup>7</sup> = 2187.
 
-  However, confirming that 632382<sup>518061</sup> ![>]({{ images_dir }}/symbol_gt.gif) 519432<sup>525806</sup> would be much more difficult, as both numbers contain over three million digits.
+  However, confirming that 632382<sup>518061</sup> \> 519432<sup>525806</sup> would be much more difficult, as both numbers contain over three million digits.
 
-  Using [base\_exp.txt](project/base_exp.txt) (right click and 'Save Link/Target As...'), a 22K text file containing one thousand lines with a base/exponent pair on each line, determine which line number has the greatest numerical value.
+  Using [base\_exp.txt](project/resources/p099_base_exp.txt) (right click and 'Save Link/Target As...'), a 22K text file containing one thousand lines with a base/exponent pair on each line, determine which line number has the greatest numerical value.
 
   NOTE: The first two lines in the file represent the numbers in the example given above.
 

data/euler-manager.gemspec

@@ -9,7 +9,7 @@ Gem::Specification.new do |spec|
   spec.authors       = ['William Yaworsky']
   spec.email         = ['wj.px01@gmail.com']
   spec.summary       = %q{Manage and test project Euler problems from your command line.}
-  # spec.description   = %q{This gem provides a framework for solving project Euler problems.  You can test}
+  spec.description   = %q{This gem provides a framework for managing project Euler solutions.}
   spec.homepage      = 'https://github.com/yaworsw/euler-manager'
   spec.license       = 'MIT'
 
@@ -18,7 +18,7 @@ Gem::Specification.new do |spec|
   spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
   spec.require_paths = ['lib']
 
-  spec.required_ruby_version = '>= 1.9.3'
+  spec.required_ruby_version = '>= 2.0.0'
 
   spec.add_dependency 'commander'
   spec.add_dependency 'colorize'

data/example/1/README.md

@@ -1,4 +1,4 @@
-# [Multiples of 3 and 5](http://projecteuler.net/problem=1)
+# [Multiples of 3 and 5](https://projecteuler.net/problem=1)
 
 If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
 

data/example/1/ruby/1.rb

@@ -1,5 +1,11 @@
 require_relative '../../lib/euler.rb'
 
-answer = 0
+one_to_one_thousand = (1...1000).to_a
+
+divisible_by_three_or_five = lambda { |num|
+  num % 3 == 0 || num % 5 == 0
+}
+
+answer = one_to_one_thousand.select(&divisible_by_three_or_five).reduce(:+)
 
 puts answer

data/example/1/scala/1.scala

@@ -2,7 +2,7 @@ import euler._
 
 object Main extends App {
 
-  val answer = 0
+  val answer = (1 until 1000).filter((x) => x % 3 == 0 || x % 5 == 0).foldLeft(0)(_+_)
 
   println(answer)
 

data/example/15/README.md

@@ -1,8 +1,8 @@
-# [Lattice paths](http://projecteuler.net/problem=15)
+# [Lattice paths](https://projecteuler.net/problem=15)
 
-Starting in the top left corner of a 2 ![×](https://raw.githubusercontent.com/yaworsw/euler-manager/develop/.data/images/symbol_times.gif)2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.
+Starting in the top left corner of a 2×2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.
 
- ![](https://raw.githubusercontent.com/yaworsw/euler-manager/develop/.data/images/p_015.gif)
+ ![](https://raw.githubusercontent.com/yaworsw/euler-manager/develop/data/images/p015.gif)
 
-How many such routes are there through a 20 ![×](https://raw.githubusercontent.com/yaworsw/euler-manager/develop/.data/images/symbol_times.gif)20 grid?
+How many such routes are there through a 20×20 grid?
 

data/example/2/README.md

@@ -1,4 +1,4 @@
-# [Even Fibonacci numbers](http://projecteuler.net/problem=2)
+# [Even Fibonacci numbers](https://projecteuler.net/problem=2)
 
 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:
 
@@ -6,6 +6,3 @@ Each new term in the Fibonacci sequence is generated by adding the previous two
 
 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/languages/c.rb

@@ -0,0 +1,22 @@
+Euler.register_language('c', Class.new do
+  def run solution
+    dir = File.dirname(file_path(solution))
+    Dir.chdir(dir)
+    `gcc #{file_path(solution)} -o #{solution.dir}/solution`
+    `#{solution.dir}/solution`
+  end
+
+  def init solution
+    FileUtils.cp(template_path, file_path(solution))
+  end
+
+  private
+
+    def file_path solution
+      "#{solution.dir}/#{solution.problem.id}.c"
+    end
+
+    def template_path
+      "#{File.dirname(__FILE__)}/../templates/c.c"
+    end
+end)

data/languages/elixir.rb

@@ -0,0 +1,25 @@
+Euler.register_language('elixir', Class.new do
+
+  # Compile and run the solution
+  def run solution
+    `elixir #{file_path(solution)}`
+  end
+
+  # Copy the template to the solution directory
+  def init solution
+    FileUtils.cp(template_path, file_path(solution))
+  end
+
+  private
+
+    # Returns the path of the solution
+    def file_path solution
+      "#{solution.dir}/#{solution.problem.id}.ex"
+    end
+
+    # Returns the path of the template
+    def template_path
+      "#{File.dirname(__FILE__)}/../templates/elixir.ex"
+    end
+
+end)

data/languages/java.rb

@@ -4,8 +4,9 @@ Euler.register_language('java', Class.new do
   def run solution
     dir = File.dirname(file_path(solution))
     Dir.chdir(dir)
-    `find #{Euler.root}/lib -type f -name "*.java" -not -name "java.java" -print | xargs javac`
-    `javac -cp .:#{Euler.root}/lib ./*.java && java Main`
+    libs = Dir["#{Euler.root}/lib/**/*.java"].reject { |f| File.basename(f) == 'java.java' }
+    `javac #{libs.join(' ')}`
+    `javac -cp .:#{Euler.root}/lib ./*.java && java -cp .:#{Euler.root}/lib Main`
   end
 
   # Copy the java template to the solution directory

data/languages/perl.rb

@@ -0,0 +1,25 @@
+Euler.register_language('perl', Class.new do
+
+  # Run the solution
+  def run solution
+    `perl #{file_path(solution)}`
+  end
+  
+  # Copy the template into the solution's directory
+  def init solution
+    FileUtils.cp(template_path, file_path(solution))
+  end
+ 
+  private
+  
+    # Returns the path to the solution
+    def file_path solution
+      "#{solution.dir}/#{solution.problem.id}.pl"
+    end
+    
+  # Returns the path to the template
+  def template_path
+    "#{File.dirname(__FILE__)}/../templates/perl.pl"
+  end
+  
+end)

data/languages/php.rb

@@ -0,0 +1,25 @@
+Euler.register_language('php', Class.new do
+
+  # Run the solution
+  def run solution
+    `php #{file_path(solution)}`
+  end
+
+  # Copy the template into the solution's directory
+  def init solution
+    FileUtils.cp(template_path, file_path(solution))
+  end
+
+  private
+
+    # Returns the path to the solution
+    def file_path solution
+      "#{solution.dir}/#{solution.problem.id}.php"
+    end
+
+    # Returns the path to the template
+    def template_path
+      "#{File.dirname(__FILE__)}/../templates/php.php"
+    end
+
+end)

data/lib/euler/version.rb

@@ -1,3 +1,3 @@
 module Euler
-  VERSION = '0.1.1'
+  VERSION = '0.2.0'
 end

data/rake/clean.rake

@@ -1,5 +1,3 @@
-# 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/rake/sha_answers.rake

@@ -0,0 +1,20 @@
+require 'digest/sha1'
+require 'yaml'
+
+desc "SHA problem solutions"
+task :sha_answers do
+
+  data_dir         = "#{__dir__}/../data"
+  answers_file     = "#{data_dir}/answers.yml"
+  raw_answers_file = "#{data_dir}/answers-raw.yml"
+
+  raw_answers = YAML.load_file(answers_file)
+
+  raw_answers.map do |id, answer|
+    Digest::SHA1.hexdigest(answer)
+  end
+
+  File.open(answers_file, 'w') do |f|
+    f.write(raw_answers.to_yaml)
+  end
+end

data/rake/update.rake

@@ -15,6 +15,9 @@ require 'euler'
 desc "Scrape the Project Euler website and download problem descriptions and images"
 task :update do
 
+  protocol = 'https'
+  domain   = 'projecteuler.net'
+
   # Number of seconds to wait in the beginning of each iteration of the http request loop
   sleep_time = 0.5
 
@@ -48,7 +51,7 @@ task :update do
 
     sleep(sleep_time)
 
-    url = "http://projecteuler.net/problem=#{problem_id}"
+    url = "#{protocol}://#{domain}/problem=#{problem_id}"
 
     doc = Nokogiri::HTML(open(url))
 
@@ -58,7 +61,7 @@ task :update do
 
     # download images
     doc.css('.problem_content img').each do |img|
-      image_url = "http://projecteuler.net/#{img['src']}"
+      image_url = "#{protocol}://#{domain}/#{img['src']}"
       file_name = File.basename(image_url)
       file_path = "#{images_dir}/#{file_name}"
       open(image_url) do |i|