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

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

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

Решение на Трета задача от Кристиан Цветков

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

Към профила на Кристиан Цветков

Резултати

  • 5 точки от тестове
  • 0 бонус точки
  • 5 точки общо
  • 18 успешни тест(а)
  • 2 неуспешни тест(а)

Код

class Integer
def prime?
return false if self < 2
2.upto(pred).all? { |divisor| remainder(divisor).nonzero? }
end
end
class RationalSequence
include Enumerable
def initialize(limit)
@limit = limit
@level = 0
@cache = []
@level_numbers = []
end
def each(&block)
while @limit > 0
yield next_rational
@limit -= 1
end
end
def next_rational
if @level_numbers.any?
return filter_next
else
@level += 1
end
if @level.even?
@level_numbers = @level.downto(1).zip(1..@level)
else
@level_numbers = (1..@level).zip(@level.downto(1))
end
return filter_next
end
def filter_next
next_number = @level_numbers.shift.join('/').to_r
unless @cache.include? next_number
@cache << next_number
return next_number
else
return next_rational
end
end
end
class PrimeSequence
include Enumerable
def initialize(limit)
@limit = limit
end
def each(&block)
current = 2
while @limit > 0
if current.prime?
yield current
@limit -= 1
end
current += 1
end
end
end
class FibonacciSequence
include Enumerable
def initialize(limit, first: 1, second: 1)
@limit = limit
@first = first
@second = second
end
def each(&block)
while @limit > 0
yield @first
@limit -= 1
@first, @second = @second, @first + @second
end
end
end
module DrunkenMathematician
module_function
def meaningless(number)
rational_numbers = RationalSequence.new(number).to_a
primes_group = rational_numbers.select { |r| r.numerator.prime? || r.denominator.prime? }
no_primes_group = rational_numbers - primes_group.to_a
primes_group << '1/1'.to_r unless primes_group.any?
no_primes_group << '1/1'.to_r unless no_primes_group.any?
primes_group.reduce(:*)/no_primes_group.reduce(:*)
end
def aimless(number)
prime_sequence = PrimeSequence.new(number)
rational_sequence = prime_sequence.each_slice(2)
.map { |couple| couple.join('/').to_r }
sum = rational_sequence.reduce(:+)
end
def worthless(number)
rational_numbers = RationalSequence.new(number).to_a
fibonacci_numbers = FibonacciSequence.new(number).to_a
limit = fibonacci_numbers.last
sum = 0
rational_numbers.each_with_object([]) do |item, result|
if sum + item <= limit
sum += item
result << item
end
end
end
end

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

..................FF

Failures:

  1) 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), (3/1), (4/1), (3/2), (2/3)]
       
       (compared using ==)
     # /tmp/d20151111-27349-qfhnir/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)>'

  2) 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), (3/1), (4/1), (3/2), (2/3), (1/4), (1/5), (5/1), (6/1), (5/2), (4/3), (3/4)]
       
       (compared using ==)
     # /tmp/d20151111-27349-qfhnir/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.02258 seconds
20 examples, 2 failures

Failed examples:

rspec /tmp/d20151111-27349-qfhnir/spec.rb:106 # Fifth task DrunkenMathematician #worthless can calculate for 8
rspec /tmp/d20151111-27349-qfhnir/spec.rb:111 # Fifth task DrunkenMathematician #worthless can calculate for 15

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

Кристиан обнови решението на 26.10.2015 09:56 (преди над 9 години)

+class Integer
+ def prime?(number)
+ Math.sqrt(number).floor
+ .downto(2).each { |i| return false if number % i == 0 }
+ true
+ end
+end
+
+class RationalSequence
+ include Enumerable
+
+ def initialize(limit)
+ @limit = limit
+ @level = 0
+ @cache = []
+ @level_numbers = []
+ end
+
+ def each(&block)
+ while @limit > 0
+ yield next_rational
+ @limit -= 1
+ end
+ end
+
+ def next_rational
+ if @level_numbers.any?
+ return filter_next
+ else
+ @level += 1
+ end
+
+ if @level.even?
+ @level_numbers = @level.downto(1).zip(1..@level)
+ else
+ @level_numbers = (1..@level).zip(@level.downto(1))
+ end
+ return filter_next
+ end
+
+ def filter_next
+ next_number = @level_numbers.shift.join('/').to_r
+ unless @cache.include? next_number
+ @cache << next_number
+ return next_number
+ else
+ return next_rational
+ end
+ end
+end
+
+
+class PrimeSequence
+ include Enumerable
+
+ def initialize(limit)
+ @limit = limit
+ end
+
+ def each(&block)
+ current = 2
+
+ while @limit > 0
+ if current.prime?
+ yield current
+ @limit -= 1
+ end
+ current += 1
+ end
+ end
+end
+
+class FibonacciSequence
+ include Enumerable
+
+ def initialize(limit, first: 1, second: 1)
+ @limit = limit
+ @first = first
+ @second = second
+ end
+
+ def each(&block)
+ while @limit > 0
+ yield @first
+ @limit -= 1
+ @first, @second = @second, @first + @second
+ end
+ end
+end
+
+module DrunkenMathematician
+ module_function
+
+ def meaningless(number)
+ rational_numbers = RationalSequence.new(number).to_a
+
+ primes_group = rational_numbers.select { |r| r.numerator.prime? || r.denominator.prime? }
+ no_primes_group = rational_numbers - primes_group.to_a
+
+ primes_group << '1/1'.to_r unless primes_group.any?
+ no_primes_group << '1/1'.to_r unless no_primes_group.any?
+
+ primes_group.reduce(:*)/no_primes_group.reduce(:*)
+ end
+
+ def aimless(number)
+ prime_sequence = PrimeSequence.new(number)
+ rational_sequence = prime_sequence.each_slice(2)
+ .map { |couple| couple.join('/').to_r }
+ sum = rational_sequence.reduce(:+)
+ end
+
+ def worthless(number)
+ rational_numbers = RationalSequence.new(number).to_a
+ fibonacci_numbers = FibonacciSequence.new(number).to_a
+
+ limit = fibonacci_numbers.last
+ sum = 0
+ rational_numbers.each_with_object([]) do |item, result|
+ if sum + item <= limit
+ sum += item
+ result << item
+ end
+ end
+ end
+end

Кристиан обнови решението на 26.10.2015 10:13 (преди над 9 години)

class Integer
- def prime?(number)
- Math.sqrt(number).floor
- .downto(2).each { |i| return false if number % i == 0 }
- true
+ def prime?
+ return false if self < 2
+ 2.upto(pred).all? { |divisor| remainder(divisor).nonzero? }
end
end
class RationalSequence
include Enumerable
def initialize(limit)
@limit = limit
@level = 0
@cache = []
@level_numbers = []
end
def each(&block)
while @limit > 0
yield next_rational
@limit -= 1
end
end
def next_rational
if @level_numbers.any?
return filter_next
else
@level += 1
end
if @level.even?
@level_numbers = @level.downto(1).zip(1..@level)
else
@level_numbers = (1..@level).zip(@level.downto(1))
end
return filter_next
end
def filter_next
next_number = @level_numbers.shift.join('/').to_r
unless @cache.include? next_number
@cache << next_number
return next_number
else
return next_rational
end
end
end
class PrimeSequence
include Enumerable
def initialize(limit)
@limit = limit
end
def each(&block)
current = 2
while @limit > 0
if current.prime?
yield current
@limit -= 1
end
current += 1
end
end
end
class FibonacciSequence
include Enumerable
def initialize(limit, first: 1, second: 1)
@limit = limit
@first = first
@second = second
end
def each(&block)
while @limit > 0
yield @first
@limit -= 1
@first, @second = @second, @first + @second
end
end
end
module DrunkenMathematician
module_function
def meaningless(number)
rational_numbers = RationalSequence.new(number).to_a
primes_group = rational_numbers.select { |r| r.numerator.prime? || r.denominator.prime? }
no_primes_group = rational_numbers - primes_group.to_a
primes_group << '1/1'.to_r unless primes_group.any?
no_primes_group << '1/1'.to_r unless no_primes_group.any?
primes_group.reduce(:*)/no_primes_group.reduce(:*)
end
def aimless(number)
prime_sequence = PrimeSequence.new(number)
rational_sequence = prime_sequence.each_slice(2)
.map { |couple| couple.join('/').to_r }
sum = rational_sequence.reduce(:+)
end
def worthless(number)
rational_numbers = RationalSequence.new(number).to_a
fibonacci_numbers = FibonacciSequence.new(number).to_a
limit = fibonacci_numbers.last
sum = 0
rational_numbers.each_with_object([]) do |item, result|
if sum + item <= limit
sum += item
result << item
end
end
end
end