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

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

Решение на Първа задача от Михаил Господинов

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

Към профила на Михаил Господинов

Резултати

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

Код

class Integer
def prime?
if self <= 1 then return false end
counter = 2
while counter < Math.sqrt(self) do
if self % counter == 0 then return false else counter = counter + 1 end
end
return true
end
def next_prime
prime = self + 1
while not prime.prime? do prime = prime + 1 end
return prime
end
def absolute
self < 0 ? -self : self
end
def prime_factors
prime , current , result = 2 , self , []
while (current > 1) or (current < -1) do
if current % prime == 0 then
current=current/result.push(prime)[-1] else prime = prime.next_prime
end
end
return result
end
def harmonic
if self <= 0 then return 0 else return 1.to_r/self + (self-1).harmonic end
end
def digits
self.absolute.to_s.split('').map { |digit| digit.to_i }
end
end
class Array
def frequencies
hash = {}
self.map{ |element| if hash[element] == nil
then
hash[element] = 1
else
hash[element] = hash[element] + 1
end}
return hash
end
def average
sum = 0
self.map{ |number| sum=sum + number}
sum.to_f / self.length
end
def drop_every step
count , result = 1 , []
self.map{ |element| if not (count == step) then
count = count + 1
result.push(element)
else count = 1 end }
return result
end
def combine_with(other)
if self == [] then return other end
if other == [] then return self end
[self[0]] + other.combine_with(self.drop(1))
end
end

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

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

Failures:

  1) Integer#prime? checks if a number is prime
     Failure/Error: 4.prime?.should   eq false
       
       expected: false
            got: true
       
       (compared using ==)
     # /tmp/d20131023-4395-1vnqun5/spec.rb:7:in `block (2 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.01849 seconds
14 examples, 1 failure

Failed examples:

rspec /tmp/d20131023-4395-1vnqun5/spec.rb:2 # Integer#prime? checks if a number is prime

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

Михаил обнови решението на 14.10.2013 23:48 (преди около 12 години)

+class Integer
+ def prime?
+ if self <= 1 then return false end
+ counter = 2
+ while counter < Math.sqrt(self) do
+ if self % counter == 0 then return false else counter = counter + 1 end
+ end
+ return true
+ end
+ def next_prime
+ prime = self + 1
+ while not prime.prime? do prime = prime + 1 end
+ return prime
+ end
+ def prime_factors
+ prime , current , result = 2 , self , []
+ while (current > 1) or (current < -1) do
+ if current % prime == 0 then
+ current=current/result.push(prime)[-1] else prime = prime.next_prime
+ end
+ end
+ return result
+ end
+ def harmonic
+ if self <= 0 then return 0 else return 1.to_r/self + (self-1).harmonic end
+ end
+ def digits
+ self.to_s.split('').map { |digit| digit.to_i }
+ end
+end
+
+class Array
+ def frequencies
+ hash = {}
+ self.map{ |element| if hash[element] == nil
+ then
+ hash[element] = 1
+ else
+ hash[element] = hash[element] + 1
+ end}
+ return hash
+ end
+ def average
+ sum = 0
+ self.map{ |number| sum=sum + number}
+ sum.to_f / self.length
+ end
+ def drop_every step
+ count , result = 1 , []
+ self.map{ |element| if not (count == step) then
+ count = count + 1
+ result.push(element)
+ else count = 1 end }
+ return result
+ end
+ def combine_with(other)
+ if self == [] then return other end
+ if other == [] then return self end
+ [self[0]] + other.combine_with(self.drop(1))
+ end
+end

Михаил обнови решението на 16.10.2013 00:01 (преди около 12 години)

class Integer
def prime?
if self <= 1 then return false end
counter = 2
while counter < Math.sqrt(self) do
if self % counter == 0 then return false else counter = counter + 1 end
end
return true
end
def next_prime
prime = self + 1
while not prime.prime? do prime = prime + 1 end
return prime
end
+ def absolute
+ self < 0 ? -self : self
+ end
def prime_factors
prime , current , result = 2 , self , []
while (current > 1) or (current < -1) do
if current % prime == 0 then
current=current/result.push(prime)[-1] else prime = prime.next_prime
end
end
return result
end
def harmonic
if self <= 0 then return 0 else return 1.to_r/self + (self-1).harmonic end
end
def digits
- self.to_s.split('').map { |digit| digit.to_i }
+ self.absolute.to_s.split('').map { |digit| digit.to_i }
end
end
class Array
def frequencies
hash = {}
self.map{ |element| if hash[element] == nil
then
hash[element] = 1
else
hash[element] = hash[element] + 1
end}
return hash
end
def average
sum = 0
self.map{ |number| sum=sum + number}
sum.to_f / self.length
end
def drop_every step
count , result = 1 , []
self.map{ |element| if not (count == step) then
count = count + 1
result.push(element)
else count = 1 end }
return result
end
def combine_with(other)
if self == [] then return other end
if other == [] then return self end
[self[0]] + other.combine_with(self.drop(1))
end
end