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

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

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

Решение на Трета задача от Малина Демирова

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

Към профила на Малина Демирова

Резултати

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

Код

module DrunkenMathematician
module_function
class RationalSequence
include Enumerable
end
class PrimeSequence
include Enumerable
def is_prime?(number)
if number<5
if number==2 || number==3
return true
else
return false
end
end
2.upto(Math.sqrt(number).to_i) do |x|
return false if number % x == 0
end
true
end
def next_prime(max)
arr = []
n = 2
(max * 2).times do
if is_prime?(n)
arr << n
end
n += 1
end
print arr
end
end
class FibonacciSequence
include Enumerable
def fibonacci(n)
n.times.each_with_object([0,1]) { |number, obj| obj << obj[-2] + obj[-1] }
end
def fibonacci_second(n, first: 0, second: 1)
number = second
number_second = second
print first.to_s + ", "
while number < n
yield number
number, number_second = number_second, number_second + number
end
end
fibonacci_second(7) { |m| print m, ", " }
end
def aimless(n)
array = next_prime(n)
new_array = []
if n%2 == 0
array.to_a.each do |m|
new_array << Rational(m, m+1)
m += 2
end
print new_array
else
array.push(1)
array.to_a.each do |m|
new_array.push(Rational(m, m+1))
m += 2
end
print new_array
end
end
end

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

/tmp/d20151111-27349-1odksot/solution.rb:59:in `<class:FibonacciSequence>': undefined method `fibonacci_second' for DrunkenMathematician::FibonacciSequence:Class (NoMethodError)
	from /tmp/d20151111-27349-1odksot/solution.rb:42:in `<module:DrunkenMathematician>'
	from /tmp/d20151111-27349-1odksot/solution.rb:1:in `<top (required)>'
	from /data/rails/evans-2015/shared/bundle/ruby/2.2.0/gems/rspec-core-2.99.2/lib/rspec/core/configuration.rb:1036:in `require'
	from /data/rails/evans-2015/shared/bundle/ruby/2.2.0/gems/rspec-core-2.99.2/lib/rspec/core/configuration.rb:1036:in `block in setup_load_path_and_require'
	from /data/rails/evans-2015/shared/bundle/ruby/2.2.0/gems/rspec-core-2.99.2/lib/rspec/core/configuration.rb:1036:in `each'
	from /data/rails/evans-2015/shared/bundle/ruby/2.2.0/gems/rspec-core-2.99.2/lib/rspec/core/configuration.rb:1036:in `setup_load_path_and_require'
	from /data/rails/evans-2015/shared/bundle/ruby/2.2.0/gems/rspec-core-2.99.2/lib/rspec/core/configuration_options.rb:25:in `configure'
	from /data/rails/evans-2015/shared/bundle/ruby/2.2.0/gems/rspec-core-2.99.2/lib/rspec/core/command_line.rb:17:in `run'
	from /data/rails/evans-2015/shared/bundle/ruby/2.2.0/gems/rspec-core-2.99.2/lib/rspec/core/runner.rb:103:in `run'
	from /data/rails/evans-2015/shared/bundle/ruby/2.2.0/gems/rspec-core-2.99.2/lib/rspec/core/runner.rb:17:in `block in autorun'

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

Малина обнови решението на 26.10.2015 11:29 (преди над 9 години)

+module DrunkenMathematician
+module_function
+
+class RationalSequence
+include Enumerable
+
+end
+
+class PrimeSequence
+include Enumerable
+def is_prime?(number)
+if number<5
+if number==2 || number==3
+return true
+else
+return false
+end
+end
+
+2.upto(Math.sqrt(number).to_i) do |x|
+return false if number % x == 0
+end
+true
+end
+
+def next_prime(max)
+arr = []
+n = 2
+(max * 2).times do
+if is_prime?(n)
+arr << n
+end
+n += 1
+end
+print arr
+end
+
+end
+
+
+
+class FibonacciSequence
+include Enumerable
+
+def fibonacci(n)
+n.times.each_with_object([0,1]) { |number, obj| obj << obj[-2] + obj[-1] }
+end
+
+def fibonacci_second(n, first: 0, second: 1)
+number = second
+number_second = second
+print first.to_s + ", "
+while number < n
+yield number
+number, number_second = number_second, number_second + number
+end
+
+end
+fibonacci_second(7) { |m| print m, ", " }
+end
+
+end

Малина обнови решението на 26.10.2015 15:20 (преди над 9 години)

module DrunkenMathematician
module_function
class RationalSequence
include Enumerable
end
class PrimeSequence
include Enumerable
def is_prime?(number)
if number<5
if number==2 || number==3
return true
else
return false
end
end
2.upto(Math.sqrt(number).to_i) do |x|
return false if number % x == 0
end
true
end
def next_prime(max)
arr = []
n = 2
(max * 2).times do
if is_prime?(n)
arr << n
end
n += 1
end
print arr
end
end
class FibonacciSequence
include Enumerable
def fibonacci(n)
n.times.each_with_object([0,1]) { |number, obj| obj << obj[-2] + obj[-1] }
end
def fibonacci_second(n, first: 0, second: 1)
number = second
number_second = second
print first.to_s + ", "
while number < n
yield number
number, number_second = number_second, number_second + number
end
end
fibonacci_second(7) { |m| print m, ", " }
end
+def aimless(n)
+array = next_prime(n)
+new_array = []
+if n%2 == 0
+array.to_a.each do |m|
+new_array << Rational(m, m+1)
+m += 2
+end
+print new_array
+
+else
+array.push(1)
+array.to_a.each do |m|
+new_array.push(Rational(m, m+1))
+m += 2
+end
+print new_array
+end
+end
end