Хешове и keyword аргументи на блокове

Програмиране с Ruby

Курс във Факултета по Математика и Информатика към СУ

Решение на Трета задача от Пепа Симеонова

Обратно към всички решения

Към профила на Пепа Симеонова

Резултати

  • 4 точки от тестове
  • 0 бонус точки
  • 4 точки общо
  • 13 успешни тест(а)
  • 7 неуспешни тест(а)

Код

class RationalSequence
include Enumerable
def initialize(limit)
@limit = limit
end
def each
current, previous = Rational(1,1), Rational(0,1)
while @limit > 0
yield current
current, previous, @limit = next_rational(current, previous), current, @limit -= 1
end
end
def next_rational(current, previous)
if previous == Rational(0,1)
return Rational(2, 1)
elsif current.denominator == 1
if previous.denominator == 2
return go_vertical_down(current)
else
return go_up(current)
end
elsif current.numerator == 1
if previous.numerator == 1
return go_down(current)
else
return go_right(current)
end
elsif previous.numerator > current.numerator
return go_up(current)
else
return go_down(current)
end
end
def go_right(current)
return Rational(1, current.denominator + 1)
end
def go_down(current)
return Rational(current.numerator + 1, current.denominator - 1)
end
def go_up(current)
return Rational(current.numerator - 1, current.denominator + 1)
end
def go_vertical_down(current)
return Rational(current.numerator + 1, 1)
end
end
class PrimeSequence
include Enumerable
def initialize(limit)
@limit = limit
end
def each
current = 2
while @limit > 0
if current.prime?
yield current
@limit -=1
end
current = current += 1
end
end
end
class Integer
def prime?
unless self == 1 or self == 0
(((2 ** self) - 2) % self == 0)? true : false
end
end
end
class FibonacciSequence
include Enumerable
def initialize(limit, first: 1, second: 2)
@limit = limit
@current = second - 1
@previous = first -1
end
def each
current, previous = @current, @previous
while @limit > 0
yield current
current, previous, @limit = current + previous.abs, current, @limit -=1
end
end
end
module DrunkenMathematician
module_function
def meaningless(n)
sequence = RationalSequence.new(n)
groupA, groupB = [1], []
sequence.each do |rational|
if rational.numerator.prime? or rational.denominator.prime?
groupA.push rational
elsif !rational.numerator.prime? and !rational.denominator.prime?
groupB.push rational
end
end
groupA.reduce(:*) / groupB.reduce(:*)
end
def aimless(n)
numbers = []
primes = PrimeSequence.new(n).to_a.each_slice(2) do |prime|
if prime[1]
numbers.push Rational(prime[0], prime[1])
else
numbers.push Rational(prime[0], 1)
end
end
numbers.reduce(:+)
end
def worthless(n)
fibonacci = FibonacciSequence.new(n).to_a.last
while n > 0
rationals = RationalSequence.new(n)
if rationals.to_a.reduce(:+).to_i <= fibonacci
return RationalSequence.new(n).to_a
else
n -= 1
end
end
end
end

Лог от изпълнението

..FF..F....F.F....FF

Failures:

  1) Fifth task RationalSequence can calculate the first 28 rational numbers
     Failure/Error: expect(RationalSequence.new(28).to_a).to eq %w(
       
       expected: [(1/1), (2/1), (1/2), (1/3), (3/1), (4/1), (3/2), (2/3), (1/4), (1/5), (5/1), (6/1), (5/2), (4/3), (3/4), (2/5), (1/6), (1/7), (3/5), (5/3), (7/1), (8/1), (7/2), (5/4), (4/5), (2/7), (1/8), (1/9)]
            got: [(1/1), (2/1), (1/2), (1/3), (1/1), (0/1), (-1/2), (2/1), (3/1), (1/1), (0/1), (-1/2), (2/1), (3/1), (1/1), (0/1), (-1/2), (2/1), (3/1), (1/1), (0/1), (-1/2), (2/1), (3/1), (1/1), (0/1), (-1/2), (2/1)]
       
       (compared using ==)
     # /tmp/d20151111-27349-1hwv0gs/spec.rb:12:in `block (3 levels) in <top (required)>'
     # ./lib/language/ruby/run_with_timeout.rb:5:in `block (3 levels) in <top (required)>'
     # ./lib/language/ruby/run_with_timeout.rb:5:in `block (2 levels) in <top (required)>'

  2) Fifth task RationalSequence is properly enumerable
     Failure/Error: expect(ones).to eq %w(1/1 1/2 1/3 1/4 1/5 1/6 1/7 1/8 1/9).map(&:to_r)
       
       expected: [(1/1), (1/2), (1/3), (1/4), (1/5), (1/6), (1/7), (1/8), (1/9)]
            got: [(1/1), (1/2), (1/3), (1/1), (1/1), (1/1), (1/1), (1/1)]
       
       (compared using ==)
     # /tmp/d20151111-27349-1hwv0gs/spec.rb:20:in `block (3 levels) in <top (required)>'
     # ./lib/language/ruby/run_with_timeout.rb:5:in `block (3 levels) in <top (required)>'
     # ./lib/language/ruby/run_with_timeout.rb:5:in `block (2 levels) in <top (required)>'

  3) Fifth task FibonacciSequence can be used to calculate the Lucas numbers
     Failure/Error: expect(FibonacciSequence.new(31, first: 2, second: 1).to_a).to eq [
       
       expected: [2, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, 199, 322, 521, 843, 1364, 2207, 3571, 5778, 9349, 15127, 24476, 39603, 64079, 103682, 167761, 271443, 439204, 710647, 1149851, 1860498]
            got: [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040]
       
       (compared using ==)
     # /tmp/d20151111-27349-1hwv0gs/spec.rb:37:in `block (3 levels) in <top (required)>'
     # ./lib/language/ruby/run_with_timeout.rb:5:in `block (3 levels) in <top (required)>'
     # ./lib/language/ruby/run_with_timeout.rb:5:in `block (2 levels) in <top (required)>'

  4) Fifth task DrunkenMathematician #meaningless can calculate for 0 and 1
     Failure/Error: expect(DrunkenMathematician.meaningless(0)).to eq 1
     TypeError:
       nil can't be coerced into Fixnum
     # /tmp/d20151111-27349-1hwv0gs/solution.rb:114:in `/'
     # /tmp/d20151111-27349-1hwv0gs/solution.rb:114:in `meaningless'
     # /tmp/d20151111-27349-1hwv0gs/spec.rb:73:in `block (4 levels) in <top (required)>'
     # ./lib/language/ruby/run_with_timeout.rb:5:in `block (3 levels) in <top (required)>'
     # ./lib/language/ruby/run_with_timeout.rb:5:in `block (2 levels) in <top (required)>'

  5) Fifth task DrunkenMathematician #meaningless can calculate for 42
     Failure/Error: expect(DrunkenMathematician.meaningless(42)).to eq Rational(1, 11)
     ZeroDivisionError:
       divided by 0
     # /tmp/d20151111-27349-1hwv0gs/solution.rb:114:in `/'
     # /tmp/d20151111-27349-1hwv0gs/solution.rb:114:in `meaningless'
     # /tmp/d20151111-27349-1hwv0gs/spec.rb:82:in `block (4 levels) in <top (required)>'
     # ./lib/language/ruby/run_with_timeout.rb:5:in `block (3 levels) in <top (required)>'
     # ./lib/language/ruby/run_with_timeout.rb:5:in `block (2 levels) in <top (required)>'

  6) Fifth task DrunkenMathematician #worthless can calculate for 8
     Failure/Error: expect(DrunkenMathematician.worthless(8)).to eq expected
       
       expected: [(1/1), (2/1), (1/2), (1/3), (3/1), (4/1), (3/2), (2/3), (1/4), (1/5), (5/1)]
            got: [(1/1), (2/1), (1/2), (1/3), (1/1), (0/1), (-1/2), (2/1)]
       
       (compared using ==)
     # /tmp/d20151111-27349-1hwv0gs/spec.rb:108:in `block (4 levels) in <top (required)>'
     # ./lib/language/ruby/run_with_timeout.rb:5:in `block (3 levels) in <top (required)>'
     # ./lib/language/ruby/run_with_timeout.rb:5:in `block (2 levels) in <top (required)>'

  7) Fifth task DrunkenMathematician #worthless can calculate for 15
     Failure/Error: expect(DrunkenMathematician.worthless(15)).to eq %w(
       
       expected: [(1/1), (2/1), (1/2), (1/3), (3/1), (4/1), (3/2), (2/3), (1/4), (1/5), (5/1), (6/1), (5/2), (4/3), (3/4), (2/5), (1/6), (1/7), (3/5), (5/3), (7/1), (8/1), (7/2), (5/4), (4/5), (2/7), (1/8), (1/9), (3/7), (7/3), (9/1), (10/1), (9/2), (8/3), (7/4), (6/5), (5/6), (4/7), (3/8), (2/9), (1/10), (1/11), (5/7), (7/5), (11/1), (12/1), (11/2), (10/3), (9/4), (8/5), (7/6), (6/7), (5/8), (4/9), (3/10), (2/11), (1/12), (1/13), (3/11), (5/9), (9/5), (11/3), (13/1), (14/1), (13/2), (11/4), (8/7), (7/8), (4/11), (2/13), (1/14), (1/15), (3/13), (5/11), (7/9), (9/7), (11/5), (13/3), (15/1), (16/1), (15/2), (14/3), (13/4), (12/5), (11/6), (10/7), (9/8), (8/9), (7/10), (6/11), (5/12), (4/13), (3/14), (2/15), (1/16), (1/17), (5/13), (7/11), (11/7), (13/5), (17/1), (18/1), (17/2), (16/3), (15/4), (14/5), (13/6), (12/7), (11/8), (10/9), (9/10), (8/11), (7/12), (6/13), (5/14), (4/15), (3/16), (2/17), (1/18), (1/19), (3/17), (7/13), (9/11), (11/9), (13/7), (17/3), (19/1), (20/1), (19/2), (17/4), (16/5), (13/8), (11/10), (10/11), (8/13), (5/16), (4/17), (2/19), (1/20), (1/21), (3/19), (5/17), (7/15), (9/13), (13/9), (15/7), (17/5), (19/3), (21/1), (22/1), (21/2), (20/3), (19/4), (18/5), (17/6), (16/7), (15/8), (14/9), (13/10), (12/11), (11/12), (10/13), (9/14), (8/15), (7/16), (6/17), (5/18), (4/19), (3/20), (2/21), (1/22), (1/23), (5/19), (7/17), (11/13), (13/11), (17/7), (19/5), (23/1), (24/1), (23/2), (22/3), (21/4), (19/6), (18/7), (17/8), (16/9), (14/11), (13/12), (12/13), (11/14), (9/16), (8/17), (7/18), (6/19), (4/21), (3/22), (2/23), (1/24), (1/25), (3/23), (5/21), (7/19), (9/17), (11/15), (15/11), (17/9), (19/7), (21/5), (23/3)]
            got: [(1/1), (2/1), (1/2), (1/3), (1/1), (0/1), (-1/2), (2/1), (3/1), (1/1), (0/1), (-1/2), (2/1), (3/1), (1/1)]
       
       (compared using ==)
     # /tmp/d20151111-27349-1hwv0gs/spec.rb:112:in `block (4 levels) in <top (required)>'
     # ./lib/language/ruby/run_with_timeout.rb:5:in `block (3 levels) in <top (required)>'
     # ./lib/language/ruby/run_with_timeout.rb:5:in `block (2 levels) in <top (required)>'

Finished in 0.01274 seconds
20 examples, 7 failures

Failed examples:

rspec /tmp/d20151111-27349-1hwv0gs/spec.rb:11 # Fifth task RationalSequence can calculate the first 28 rational numbers
rspec /tmp/d20151111-27349-1hwv0gs/spec.rb:18 # Fifth task RationalSequence is properly enumerable
rspec /tmp/d20151111-27349-1hwv0gs/spec.rb:36 # Fifth task FibonacciSequence can be used to calculate the Lucas numbers
rspec /tmp/d20151111-27349-1hwv0gs/spec.rb:72 # Fifth task DrunkenMathematician #meaningless can calculate for 0 and 1
rspec /tmp/d20151111-27349-1hwv0gs/spec.rb:81 # Fifth task DrunkenMathematician #meaningless can calculate for 42
rspec /tmp/d20151111-27349-1hwv0gs/spec.rb:106 # Fifth task DrunkenMathematician #worthless can calculate for 8
rspec /tmp/d20151111-27349-1hwv0gs/spec.rb:111 # Fifth task DrunkenMathematician #worthless can calculate for 15

История (1 версия и 0 коментара)

Пепа обнови решението на 26.10.2015 01:43 (преди над 9 години)

+class RationalSequence
+ include Enumerable
+
+ def initialize(limit)
+ @limit = limit
+ end
+
+ def each
+ current, previous = Rational(1,1), Rational(0,1)
+ while @limit > 0
+ yield current
+ current, previous, @limit = next_rational(current, previous), current, @limit -= 1
+ end
+ end
+
+ def next_rational(current, previous)
+ if previous == Rational(0,1)
+ return Rational(2, 1)
+ elsif current.denominator == 1
+ if previous.denominator == 2
+ return go_vertical_down(current)
+ else
+ return go_up(current)
+ end
+ elsif current.numerator == 1
+ if previous.numerator == 1
+ return go_down(current)
+ else
+ return go_right(current)
+ end
+ elsif previous.numerator > current.numerator
+ return go_up(current)
+ else
+ return go_down(current)
+ end
+ end
+
+ def go_right(current)
+ return Rational(1, current.denominator + 1)
+ end
+
+ def go_down(current)
+ return Rational(current.numerator + 1, current.denominator - 1)
+ end
+
+ def go_up(current)
+ return Rational(current.numerator - 1, current.denominator + 1)
+ end
+
+ def go_vertical_down(current)
+ return Rational(current.numerator + 1, 1)
+ end
+end
+
+class PrimeSequence
+ include Enumerable
+
+ def initialize(limit)
+ @limit = limit
+ end
+
+ def each
+ current = 2
+ while @limit > 0
+ if current.prime?
+ yield current
+ @limit -=1
+ end
+ current = current += 1
+ end
+ end
+end
+
+class Integer
+ def prime?
+ unless self == 1 or self == 0
+ (((2 ** self) - 2) % self == 0)? true : false
+ end
+ end
+end
+
+class FibonacciSequence
+ include Enumerable
+
+ def initialize(limit, first: 1, second: 2)
+ @limit = limit
+ @current = second - 1
+ @previous = first -1
+ end
+
+ def each
+ current, previous = @current, @previous
+ while @limit > 0
+ yield current
+
+ current, previous, @limit = current + previous.abs, current, @limit -=1
+ end
+ end
+end
+
+module DrunkenMathematician
+ module_function
+
+ def meaningless(n)
+ sequence = RationalSequence.new(n)
+ groupA, groupB = [1], []
+ sequence.each do |rational|
+ if rational.numerator.prime? or rational.denominator.prime?
+ groupA.push rational
+ elsif !rational.numerator.prime? and !rational.denominator.prime?
+ groupB.push rational
+ end
+ end
+ groupA.reduce(:*) / groupB.reduce(:*)
+ end
+
+ def aimless(n)
+ numbers = []
+ primes = PrimeSequence.new(n).to_a.each_slice(2) do |prime|
+ if prime[1]
+ numbers.push Rational(prime[0], prime[1])
+ else
+ numbers.push Rational(prime[0], 1)
+ end
+ end
+ numbers.reduce(:+)
+ end
+
+ def worthless(n)
+ fibonacci = FibonacciSequence.new(n).to_a.last
+ while n > 0
+ rationals = RationalSequence.new(n)
+ if rationals.to_a.reduce(:+).to_i <= fibonacci
+ return RationalSequence.new(n).to_a
+ else
+ n -= 1
+ end
+ end
+ end
+end