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

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

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

Решение на Трета задача от Емилия Банчева

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

Към профила на Емилия Банчева

Резултати

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

Код

class RationalSequence
include Enumerable
def initialize(limit)
@limit = limit
end
def each
number, numerator, denominator = 0, 1, 1
while number < @limit do
yield Rational(numerator, denominator)
if (numerator.odd? and denominator == 1)
numerator = numerator + 1
elsif (denominator.even? and numerator == 1)
denominator = denominator + 1
elsif (numerator + denominator).odd?
numerator, denominator = numerator - 1, denominator + 1
else
numerator, denominator = numerator + 1, denominator - 1
end
Rational(numerator, denominator)
number = number + 1
end
end
end
class Integer
def is_prime
counter = 2
return false if self == 1
while counter < self do
if (self % counter) == 0
return false
else
counter = counter + 1
end
end
return true
end
end
class PrimeSequence
include Enumerable
def initialize(limit)
@limit = limit
end
def each
current, counter = 1, 0
while counter < @limit do
if(current.is_prime)
yield current
current
counter = counter + 1
current = current + 1
else
current = current + 1
end
end
end
end
class FibonacciSequence
include Enumerable
def initialize(limit, first = 0, second = 1)
@limit = limit
@first = first
@second = second
end
def each
counter = 0
previous, current = @first, @second
while counter < @limit
yield current
current, previous = current + previous, current
counter = counter + 1
end
end
end
module DrunkenMathematician
module_function
def meaningless(n)
sequence = RationalSequence.new(n).to_a
group_one, group_two = Rational(1), Rational(1)
counter = 0
while counter < sequence.length do
if ((sequence[counter].numerator).is_prime and (sequence[counter].denominator).is_prime)
group_one = group_one * sequence[counter]
counter = counter + 1
else
group_two = group_two * sequence[counter]
counter = counter + 1
end
end
(group_one / group_two)
end
def aimless(n)
sequence = PrimeSequence.new(n).to_a
sum, counter = 0, 0
if n % 2 == 0
while counter < sequence.length do
sum = sum + Rational(sequence[counter], sequence[counter + 1])
counter = counter + 2
end
else
while counter < (sequence.length - 1) do
sum = sum + Rational(sequence[counter], sequence[counter + 1])
counter = counter + 2
end
sum = sum + Rational(sequence[sequence.length - 1], 1)
end
sum
end
def worthless(n)
sequence = FibonacciSequence.new(n).to_a
position, counter, sum = 0, 1, Rational(0)
fibonacci_number = sequence[n - 1]
while sum < fibonacci_number do
sequence_two = RationalSequence.new(counter).to_a
while position < counter do
sum = sum + sequence_two[position]
position = position + 1
end
counter = counter + 1
end
array = RationalSequence.new(counter - 1).to_a
end
end

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

..FF..F.....FF....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), (3/1), (4/1), (3/2), (2/3), (1/4), (1/5), (1/2), (1/1), (2/1), (5/1), (6/1), (5/2), (4/3), (3/4), (2/5), (1/6), (1/7), (1/3), (3/5), (1/1), (5/3), (3/1), (7/1)]
       
       (compared using ==)
     # /tmp/d20151111-27349-58kikq/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/4), (1/5), (1/2), (1/1), (1/6), (1/7), (1/3), (1/1)]
       
       (compared using ==)
     # /tmp/d20151111-27349-58kikq/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 [
     TypeError:
       Hash can't be coerced into Fixnum
     # /tmp/d20151111-27349-58kikq/solution.rb:78:in `+'
     # /tmp/d20151111-27349-58kikq/solution.rb:78:in `each'
     # /tmp/d20151111-27349-58kikq/spec.rb:37:in `to_a'
     # /tmp/d20151111-27349-58kikq/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 3
     Failure/Error: expect(DrunkenMathematician.meaningless(4)).to eq Rational(1, 3)
       
       expected: (1/3)
            got: (3/1)
       
       (compared using ==)
     # /tmp/d20151111-27349-58kikq/spec.rb:78: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)
       
       expected: (1/11)
            got: (108/7)
       
       (compared using ==)
     # /tmp/d20151111-27349-58kikq/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), (3/1), (4/1), (3/2), (2/3), (1/4), (1/5), (1/2), (1/1), (2/1), (5/1)]
       
       (compared using ==)
     # /tmp/d20151111-27349-58kikq/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), (3/1), (4/1), (3/2), (2/3), (1/4), (1/5), (1/2), (1/1), (2/1), (5/1), (6/1), (5/2), (4/3), (3/4), (2/5), (1/6), (1/7), (1/3), (3/5), (1/1), (5/3), (3/1), (7/1), (8/1), (7/2), (2/1), (5/4), (4/5), (1/2), (2/7), (1/8), (1/9), (1/4), (3/7), (2/3), (1/1), (3/2), (7/3), (4/1), (9/1), (10/1), (9/2), (8/3), (7/4), (6/5), (5/6), (4/7), (3/8), (2/9), (1/10), (1/11), (1/5), (1/3), (1/2), (5/7), (1/1), (7/5), (2/1), (3/1), (5/1), (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), (1/6), (3/11), (2/5), (5/9), (3/4), (1/1), (4/3), (9/5), (5/2), (11/3), (6/1), (13/1), (14/1), (13/2), (4/1), (11/4), (2/1), (3/2), (8/7), (7/8), (2/3), (1/2), (4/11), (1/4), (2/13), (1/14), (1/15), (1/7), (3/13), (1/3), (5/11), (3/5), (7/9), (1/1), (9/7), (5/3), (11/5), (3/1), (13/3), (7/1), (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), (1/8), (1/5), (2/7), (5/13), (1/2), (7/11), (4/5), (1/1), (5/4), (11/7), (2/1), (13/5), (7/2), (5/1), (8/1), (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), (1/9), (3/17), (1/4), (1/3), (3/7), (7/13), (2/3), (9/11), (1/1), (11/9), (3/2), (13/7), (7/3), (3/1), (4/1), (17/3), (9/1), (19/1), (20/1), (19/2), (6/1), (17/4), (16/5), (5/2), (2/1), (13/8), (4/3), (11/10), (10/11), (3/4), (8/13), (1/2), (2/5), (5/16), (4/17), (1/6), (2/19), (1/20), (1/21), (1/10), (3/19), (2/9), (5/17), (3/8), (7/15), (4/7), (9/13), (5/6), (1/1), (6/5), (13/9), (7/4), (15/7), (8/3), (17/5), (9/2), (19/3), (10/1), (21/1), (22/1), (21/2), (20/3), (19/4), (18/5)]
       
       (compared using ==)
     # /tmp/d20151111-27349-58kikq/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.10231 seconds
20 examples, 7 failures

Failed examples:

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

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

Емилия обнови решението на 25.10.2015 22:01 (преди над 9 години)

+class RationalSequence
+ include Enumerable
+
+ def initialize(limit)
+ @limit = limit
+ end
+ def each
+ number, numerator, denominator = 1, 1, 1
+ Rational(numerator, denominator)
+ while number < @limit do
+ yield Rational(numerator, denominator)
+ if (numerator.odd? and denominator == 1)
+ numerator = numerator + 1
+ elsif (denominator.even? and numerator == 1)
+ denominator = denominator + 1
+ elsif (numerator + denominator).odd?
+ numerator, denominator = numerator - 1, denominator + 1
+ else
+ numerator, denominator = numerator + 1, denominator - 1
+ end
+ Rational(numerator, denominator)
+ number = number + 1
+ end
+ end
+end
+
+
+class Integer
+ def is_prime
+ counter = 2
+ while counter < self do
+ if self == 1
+ return false
+ elsif (self % counter) == 0
+ return false
+ else
+ counter = counter + 1
+ end
+ end
+ return true
+ end
+end
+
+
+class PrimeSequence
+ include Enumerable
+
+ def initialize(limit)
+ @limit = limit
+ end
+ def each
+ current, counter = 1, 0
+ while counter < @limit do
+ if(current.is_prime)
+ yield current
+ current
+ counter = counter + 1
+ current = current + 1
+ else
+ current = current + 1
+ end
+ end
+ end
+end
+
+
+class FibonacciSequence
+ include Enumerable
+
+ def initialize(limit)
+ @limit = limit
+ end
+ def each
+ counter = 0
+ current, previous = 1, 0
+ while counter < @limit
+ yield current
+ current, previous = current + previous, current
+ counter = counter + 1
+ end
+ end
+end
+
+
+module DrunkenMathematician
+ module_function
+
+ def meaningless(n)
+ sequence = RationalSequence.new(n).to_a
+ group_one, group_two = Rational(1), Rational(1)
+ counter = 0
+ while counter < sequence.length do
+ if ((sequence[counter].numerator).is_prime and (sequence[counter].denominator).is_prime)
+ group_one = group_one * sequence[counter]
+ counter = counter + 1
+ else
+ group_two = group_two * sequence[counter]
+ counter = counter + 1
+ end
+ end
+ (group_one / group_two)
+ end
+
+ def aimless(n)
+ sequence = PrimeSequence.new(n).to_a
+ sum, counter = 0, 0
+ if n % 2 == 0
+ while counter < sequence.length do
+ sum = sum + Rational(sequence[counter], sequence[counter + 1])
+ counter = counter + 2
+ end
+ else
+ while counter < (sequence.length - 1) do
+ sum = sum + Rational(sequence[counter], sequence[counter + 1])
+ counter = counter + 2
+ end
+ sum = sum + Rational(sequence[sequence.length - 1], 1)
+ end
+ sum
+ end
+
+ def worthless(n)
+ sequence = FibonacciSequence.new(n).to_a
+ position, counter = 0, 1
+ fibonacci_number = sequence[n - 1]
+ while sum <= fibonacci_number do
+ sequence_two = RationalSequence.new(counter).to_a
+ while position < counter do
+ sum = 0
+ sum = sum + sequence_two[position]
+ position = position + 1
+ end
+ counter = counter + 1
+ end
+ array = RationalSequence.new(counter).to_a
+ end
+end

Емилия обнови решението на 26.10.2015 15:25 (преди над 9 години)

class RationalSequence
include Enumerable
def initialize(limit)
@limit = limit
end
def each
- number, numerator, denominator = 1, 1, 1
- Rational(numerator, denominator)
+ number, numerator, denominator = 0, 1, 1
while number < @limit do
yield Rational(numerator, denominator)
if (numerator.odd? and denominator == 1)
numerator = numerator + 1
elsif (denominator.even? and numerator == 1)
denominator = denominator + 1
elsif (numerator + denominator).odd?
numerator, denominator = numerator - 1, denominator + 1
else
numerator, denominator = numerator + 1, denominator - 1
end
Rational(numerator, denominator)
number = number + 1
end
end
end
class Integer
def is_prime
counter = 2
+ return false if self == 1
while counter < self do
- if self == 1
+ if (self % counter) == 0
return false
- elsif (self % counter) == 0
- return false
else
counter = counter + 1
end
end
return true
end
end
class PrimeSequence
include Enumerable
def initialize(limit)
@limit = limit
end
def each
current, counter = 1, 0
while counter < @limit do
if(current.is_prime)
yield current
current
counter = counter + 1
current = current + 1
else
current = current + 1
end
end
end
end
class FibonacciSequence
include Enumerable
- def initialize(limit)
+ def initialize(limit, first = 0, second = 1)
@limit = limit
+ @first = first
+ @second = second
end
def each
counter = 0
- current, previous = 1, 0
+ previous, current = @first, @second
while counter < @limit
yield current
current, previous = current + previous, current
counter = counter + 1
end
end
end
module DrunkenMathematician
module_function
def meaningless(n)
sequence = RationalSequence.new(n).to_a
group_one, group_two = Rational(1), Rational(1)
counter = 0
while counter < sequence.length do
if ((sequence[counter].numerator).is_prime and (sequence[counter].denominator).is_prime)
group_one = group_one * sequence[counter]
counter = counter + 1
else
group_two = group_two * sequence[counter]
counter = counter + 1
end
end
(group_one / group_two)
end
def aimless(n)
sequence = PrimeSequence.new(n).to_a
sum, counter = 0, 0
if n % 2 == 0
while counter < sequence.length do
sum = sum + Rational(sequence[counter], sequence[counter + 1])
counter = counter + 2
end
else
while counter < (sequence.length - 1) do
sum = sum + Rational(sequence[counter], sequence[counter + 1])
counter = counter + 2
end
sum = sum + Rational(sequence[sequence.length - 1], 1)
end
sum
end
def worthless(n)
sequence = FibonacciSequence.new(n).to_a
- position, counter = 0, 1
+ position, counter, sum = 0, 1, Rational(0)
fibonacci_number = sequence[n - 1]
- while sum <= fibonacci_number do
+ while sum < fibonacci_number do
sequence_two = RationalSequence.new(counter).to_a
while position < counter do
- sum = 0
sum = sum + sequence_two[position]
position = position + 1
end
counter = counter + 1
end
- array = RationalSequence.new(counter).to_a
+ array = RationalSequence.new(counter - 1).to_a
end
end