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

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

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

Решение на Трета задача от Александрина Каракехайова

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

Към профила на Александрина Каракехайова

Резултати

  • 6 точки от тестове
  • 0 бонус точки
  • 6 точки общо
  • 19 успешни тест(а)
  • 1 неуспешни тест(а)

Код

class RationalSequence
include Enumerable
def initialize(limit)
@limit = limit
end
def each
count, numerator, denominator, direction = 0, 1, 1, false
while count < @limit
if numerator.gcd(denominator) == 1
element = numerator / denominator.to_r
count += 1
yield element
end
numerator, denominator, direction = next_values(numerator, denominator, direction)
end
end
def next_values(numerator, denominator, direction)
if direction && numerator > 1
numerator -= 1
denominator += 1
elsif direction && numerator <= 1
direction, numerator = false, 1
denominator += 1
elsif !direction && denominator > 1
numerator += 1
denominator -= 1
elsif !direction && denominator <= 1
direction, denominator = true, 1
numerator += 1
end
return numerator, denominator, direction
end
end
class PrimeSequence
include Enumerable
def initialize (limit)
@limit = limit
end
def each
count, current = 0, 2
while count < @limit
if prime?(current)
yield current
count += 1
end
current += 1
end
end
def prime?(number)
(2...number).each do |divisor|
return false if (number % divisor) == 0
end
true
end
end
class FibonacciSequence
include Enumerable
def initialize(limit, first:1, second:1)
@limit = limit
@first = first
@second = second
end
def each
count = 0
while count < @limit
yield @first
count += 1
@second, @first = @second + @first, @second
end
end
end
module DrunkenMathematician
module_function
def meaningless(n)
rational = RationalSequence.new(n).to_a
count_one, count_two, current = 0, 0, 0
group_one = Array.new
group_two = Array.new
while current != n
if is_prime?(rational[current].numerator) || is_prime?(rational[current].denominator)
group_one[count_one] = rational[current]
count_one += 1
else group_two[count_two] = rational[current]
count_two += 1
end
current += 1
end
product(group_one, group_two)
end
def product(group_one, group_two)
product_one = group_one.inject(:*).to_r
if product_one == 0
product_one = 1
end
product_two = group_two.inject(:*).to_r
product_one / product_two
end
def aimless(n)
prime_numbers = PrimeSequence.new(n).to_a
current, index = 0, 0
if n % 2 != 0
prime_numbers[n] = 1
end
length = prime_numbers.length
array = Array.new
while current != length
array[index] = prime_numbers[current] / prime_numbers[current+1].to_r
current += 2
index += 1
end
array.inject(:+).to_r
end
def worthless(n)
number = FibonacciSequence.new(n).to_a.last
sum, count = 0, 1
array = Array.new
while(sum <= number)
array = RationalSequence.new(count).to_a
sum = array.inject(:+)
count += 1
end
array.pop
array
end
end
def is_prime?(number)
return false if number <= 1
(2...number).each do |divisor|
return false if number % divisor == 0
end
true
end

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

...........F........

Failures:

  1) Fifth task DrunkenMathematician #meaningless can calculate for 0 and 1
     Failure/Error: expect(DrunkenMathematician.meaningless(0)).to eq 1
     ZeroDivisionError:
       divided by 0
     # /tmp/d20151111-27349-ng14dd/solution.rb:111:in `/'
     # /tmp/d20151111-27349-ng14dd/solution.rb:111:in `product'
     # /tmp/d20151111-27349-ng14dd/solution.rb:101:in `meaningless'
     # /tmp/d20151111-27349-ng14dd/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)>'

Finished in 0.11377 seconds
20 examples, 1 failure

Failed examples:

rspec /tmp/d20151111-27349-ng14dd/spec.rb:72 # Fifth task DrunkenMathematician #meaningless can calculate for 0 and 1

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

Александрина обнови решението на 25.10.2015 18:11 (преди над 9 години)

+class RationalSequence
+ include Enumerable
+
+ def initialize(limit)
+ @limit = limit
+ end
+
+ def each
+ count, numerator, denominator, direction = 0, 1, 1, false
+ while count < @limit
+ if(numerator.gcd(denominator) == 1)
+ element = numerator / denominator.to_r
+ count += 1
+ yield element
+ end
+ numerator, denominator, direction = next_values(numerator, denominator, direction)
+ end
+ end
+
+ def next_values(numerator, denominator, direction)
+ if direction && numerator > 1
+ numerator -= 1
+ denominator += 1
+ elsif direction && numerator <= 1
+ direction, numerator = false, 1
+ denominator += 1
+ elsif !direction && denominator > 1
+ numerator += 1
+ denominator -=1
+ elsif !direction && denominator <= 1
+ direction, denominator = true, 1
+ numerator += 1
+ end
+ return numerator, denominator, direction
+ end
+ end
+
+ class PrimeSequence
+ include Enumerable
+
+ def initialize (limit)
+ @limit = limit
+ end
+
+ def each
+ count, current = 0, 2
+ while count < @limit
+ if prime?(current)
+ yield current
+ count += 1
+ end
+ current += 1
+ end
+ end
+
+ def prime?(number)
+ (2...number).each do |divisor|
+ return false if (number % divisor) == 0
+ end
+ true
+ end
+end
+
+class FibonacciSequence
+ include Enumerable
+
+ def initialize(limit,first:1, second:1)
+ @limit = limit
+ @first = first
+ @second = second
+ end
+
+ def each
+ count = 0
+ while count < @limit
+ yield @first
+ count += 1
+ @second, @first = @second + @first, @second
+ end
+ end
+end
+
+module DrunkenMathematician
+ module_function
+
+
+ def meaningless(n)
+ rational = RationalSequence.new(n).to_a
+ count_one, count_two, current = 0, 0, 0
+ group_two = Array.new
+ group_one = Array.new
+ while current != n
+ if is_prime?(rational[current].numerator) || is_prime?(rational[current].denominator)
+ group_one[count_one] = rational[current]
+ count_one += 1
+ else group_two[count_two] = rational[current]
+ count_two += 1
+ end
+ current += 1
+ end
+ product(group_one, group_two)
+ end
+
+ def product(group_one, group_two)
+
+ product_one = group_one.inject(:*).to_r
+ if product_one == 0
+ product_one = 1
+ end
+ product_two = group_two.inject(:*).to_r
+ product_one / product_two
+ end
+
+ def aimless(n)
+ prime_numbers = PrimeSequence.new(n).to_a
+ current, index = 0, 0
+ if n % 2 != 0
+ prime_numbers[n] = 1
+ end
+ length = prime_numbers.length
+ array = Array.new
+ while current != length
+ array[index] = prime_numbers[current] / prime_numbers[current+1].to_r
+ current += 2
+ index += 1
+ end
+ array.inject(:+).to_r
+ end
+
+ def worthless(n)
+ number = FibonacciSequence.new(n).to_a.last
+ sum, count = 0, 1
+ array = Array.new
+ while(sum <= number)
+ array = RationalSequence.new(count).to_a
+ sum = array.inject(:+)
+ count += 1
+ end
+ array.pop
+ array
+ end
+
+end
+
+ def is_prime?(number)
+ return false if number <= 1
+ (2...number).each do |divisor|
+ return false if number % divisor == 0
+ end
+ true
+ end

Александрина обнови решението на 25.10.2015 18:16 (преди над 9 години)

class RationalSequence
include Enumerable
def initialize(limit)
@limit = limit
end
def each
count, numerator, denominator, direction = 0, 1, 1, false
while count < @limit
- if(numerator.gcd(denominator) == 1)
+ if numerator.gcd(denominator) == 1
element = numerator / denominator.to_r
count += 1
yield element
end
numerator, denominator, direction = next_values(numerator, denominator, direction)
end
end
def next_values(numerator, denominator, direction)
if direction && numerator > 1
numerator -= 1
denominator += 1
elsif direction && numerator <= 1
direction, numerator = false, 1
denominator += 1
elsif !direction && denominator > 1
numerator += 1
- denominator -=1
+ denominator -= 1
elsif !direction && denominator <= 1
direction, denominator = true, 1
numerator += 1
end
return numerator, denominator, direction
end
end
class PrimeSequence
include Enumerable
def initialize (limit)
@limit = limit
end
def each
count, current = 0, 2
while count < @limit
if prime?(current)
yield current
count += 1
end
current += 1
end
end
def prime?(number)
(2...number).each do |divisor|
return false if (number % divisor) == 0
end
true
end
end
class FibonacciSequence
include Enumerable
- def initialize(limit,first:1, second:1)
+ def initialize(limit, first:1, second:1)
@limit = limit
@first = first
@second = second
end
def each
count = 0
while count < @limit
yield @first
count += 1
@second, @first = @second + @first, @second
end
end
end
module DrunkenMathematician
module_function
def meaningless(n)
rational = RationalSequence.new(n).to_a
count_one, count_two, current = 0, 0, 0
- group_two = Array.new
group_one = Array.new
+ group_two = Array.new
while current != n
if is_prime?(rational[current].numerator) || is_prime?(rational[current].denominator)
group_one[count_one] = rational[current]
count_one += 1
else group_two[count_two] = rational[current]
count_two += 1
end
current += 1
end
product(group_one, group_two)
end
def product(group_one, group_two)
product_one = group_one.inject(:*).to_r
if product_one == 0
product_one = 1
end
product_two = group_two.inject(:*).to_r
product_one / product_two
end
def aimless(n)
prime_numbers = PrimeSequence.new(n).to_a
current, index = 0, 0
if n % 2 != 0
prime_numbers[n] = 1
end
length = prime_numbers.length
array = Array.new
while current != length
array[index] = prime_numbers[current] / prime_numbers[current+1].to_r
current += 2
index += 1
end
array.inject(:+).to_r
end
def worthless(n)
number = FibonacciSequence.new(n).to_a.last
sum, count = 0, 1
array = Array.new
while(sum <= number)
array = RationalSequence.new(count).to_a
sum = array.inject(:+)
count += 1
end
array.pop
array
end
end
def is_prime?(number)
return false if number <= 1
(2...number).each do |divisor|
return false if number % divisor == 0
end
true
end