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

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

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

Решение на Трета задача от Марк Андонов

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

Към профила на Марк Андонов

Резултати

  • 5 точки от тестове
  • 1 отнета точка
  • 4 точки общо
  • 15 успешни тест(а)
  • 5 неуспешни тест(а)

Код

def prime?(n)
not (n == 1 || (2...n).any? { |x| n % x == 0 } )
end
class PrimeSequence
def initialize (limit)
@limit = limit
end
def to_a
(2..Float::INFINITY).
lazy.
select { |x| prime?(x) }.
first(@limit)
end
end
class RationalSequence
def initialize (limit)
@limit = limit
end
def to_a
sequence, count, denom, num = [], 0, 1, 1
while (@limit > count)
sequence << Rational(num,denom)
if(denom == 1 && num % 2 == 1)
num += 1
elsif(num == 1 && denom % 2 == 0)
denom += 1
elsif((num + denom) % 2 == 0)
num += 1
denom -= 1
else
num -= 1
denom += 1
end
if(num.gcd(denom) == 1)
count += 1
end
end
sequence.uniq
end
end
class FibonacciSequence
def initialize (limit, first = { first: 1 }, second = { second: 1 } )
@limit, @first, @second = limit, first[:first], second[:second]
end
def to_a
count = 1
sequence = [@first]
while(count < @limit)
sequence << @second
@second, @first = @first + @second, @second
count += 1
end
sequence
end
end
module DrunkenMathematician
module_function
def meaningless(limit)
sequence = RationalSequence.new(limit).to_a
prime_sequence = sequence.select { |x| prime?(x.denominator) || prime?(x.numerator) }
prime_sequence << 1
compose_sequence = sequence - prime_sequence
prime_sequence.reduce(:*) / compose_sequence.reduce(:*)
end
def aimless(limit)
sequence = PrimeSequence.new(limit).to_a
count, new_sequence = 0, []
while (count < limit)
new_sequence << Rational(sequence.fetch(count), sequence.fetch(count + 1, 1))
count += 2
end
new_sequence.reduce(:+)
end
def worthless(limit)
max = FibonacciSequence.new(limit).to_a.last
puts max
sequence = RationalSequence.new(limit + 1).to_a
while (sequence.reduce(:+) > max)
sequence.delete_at(-1)
end
sequence
end
end

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

...F...F...F.....1
.21
F610
F

Failures:

  1) Fifth task RationalSequence is properly enumerable
     Failure/Error: ones = RationalSequence.new(28).select { |r| r.numerator == 1 }
     NoMethodError:
       private method `select' called for #<RationalSequence:0x007f75cc1bd340 @limit=28>
     # /tmp/d20151111-27349-xa64x6/spec.rb:19: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 FibonacciSequence is properly enumerable
     Failure/Error: expect(FibonacciSequence.new(20).select { |x| x.even? }).to eq [
     NoMethodError:
       private method `select' called for #<FibonacciSequence:0x007f75cc1aecf0>
     # /tmp/d20151111-27349-xa64x6/spec.rb:45: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 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-xa64x6/solution.rb:77:in `/'
     # /tmp/d20151111-27349-xa64x6/solution.rb:77:in `meaningless'
     # /tmp/d20151111-27349-xa64x6/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)>'

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

  5) 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), (2/5)]
       
       (compared using ==)
     # /tmp/d20151111-27349-xa64x6/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.01483 seconds
20 examples, 5 failures

Failed examples:

rspec /tmp/d20151111-27349-xa64x6/spec.rb:18 # Fifth task RationalSequence is properly enumerable
rspec /tmp/d20151111-27349-xa64x6/spec.rb:44 # Fifth task FibonacciSequence is properly enumerable
rspec /tmp/d20151111-27349-xa64x6/spec.rb:72 # Fifth task DrunkenMathematician #meaningless can calculate for 0 and 1
rspec /tmp/d20151111-27349-xa64x6/spec.rb:106 # Fifth task DrunkenMathematician #worthless can calculate for 8
rspec /tmp/d20151111-27349-xa64x6/spec.rb:111 # Fifth task DrunkenMathematician #worthless can calculate for 15

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

Марк обнови решението на 26.10.2015 12:30 (преди над 8 години)

+def prime?(n)
+ not (n == 1 || (2...n).any? { |x| n % x == 0 } )
+end
+
+
+class PrimeSequence
+
+ def initialize (limit)
+ @limit = limit
+ end
+
+ def to_a
+ (2..Float::INFINITY).
+ lazy.
+ select { |x| prime?(x) }.
+ first(@limit)
+ end
+end
+
+
+
+class RationalSequence
+
+ def initialize (limit)
+ @limit = limit
+ end
+
+ def to_a
+ sequence, count, denom, num = [], 0, 1, 1
+ while (@limit > count)
+ sequence << Rational(num,denom)
+ if(denom == 1 && num % 2 == 1)
+ num += 1
+ elsif(num == 1 && denom % 2 == 0)
+ denom += 1
+ elsif((num + denom) % 2 == 0)
+ num += 1
+ denom -= 1
+ else
+ num -= 1
+ denom += 1
+ end
+ if(num.gcd(denom) == 1)
+ count += 1
+ end
+ end
+ sequence.uniq
+ end
+end
+
+class FibonacciSequence
+
+ def initialize (limit, first = { first: 1 }, second = { second: 1 } )
+ @limit, @first, @second = limit, first[:first], second[:second]
+ end
+
+ def to_a
+ count = 1
+ sequence = [@first]
+ while(count < @limit)
+ sequence << @second
+ @second, @first = @first + @second, @second
+ count += 1
+ end
+ sequence
+ end
+end
+
+module DrunkenMathematician
+ module_function
+
+ def meaningless(limit)
+ sequence = RationalSequence.new(limit).to_a
+ prime_sequence = sequence.select { |x| prime?(x.denominator) || prime?(x.numerator) }
+ prime_sequence << 1
+ compose_sequence = sequence - prime_sequence
+ prime_sequence.reduce(:*) / compose_sequence.reduce(:*)
+ end
+
+ def aimless(limit)
+ sequence = PrimeSequence.new(limit).to_a
+ count, new_sequence = 0, []
+ while (count < limit)
+ new_sequence << Rational(sequence.fetch(count), sequence.fetch(count + 1, 1))
+ count += 2
+ end
+ new_sequence.reduce(:+)
+ end
+
+ def worthless(limit)
+ max = FibonacciSequence.new(limit).to_a.last
+ puts max
+ sequence = RationalSequence.new(limit + 1).to_a
+ while (sequence.reduce(:+) > max)
+ sequence.delete_at(-1)
+ end
+ sequence
+ end
+end