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

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

Решение на Първа задача от Иван Капукаранов

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

Към профила на Иван Капукаранов

Резултати

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

Код

class Integer
def prime?
gcds = []
(2..self+1).each { |number| gcds << self.gcd(number) }
is_prime = gcds.uniq.length == 2 ? true : false
end
def prime_factors
number = self < 0 ? -self : self
pos = 2
factors = []
while pos <= number
number, pos, factors = prime_factors_help(number, pos, factors)
end
factors
end
def prime_factors_help(number, pos, factors)
if number%pos == 0
factors << pos
number /= pos
pos = 2
else
pos += 1
end
return number, pos, factors
end
def harmonic
k, sum = 1, 0
while k <= self
sum += Rational(1, k)
k += 1
end
sum.to_r
end
def digits
number = self < 0 ? -self : self
splitet_number = number.to_s.split(//)
digits_list = []
splitet_number.each { |digit| digits_list << digit.to_i }
digits_list
end
end
class Array
def frequencies
result = {}
self.each { |n| if result[n] then result[n] += 1 else result[n] = 1 end }
result
end
def average
sum = 0
length = self.each { |element| sum += element }.length
average_number = sum.to_f / length.to_f
end
def drop_every(position)
new_list = []
position_to_deleat = position - 1
while self.length >= position_to_deleat
new_list << self[position_to_deleat]
position_to_deleat += position
end
self - new_list
end
def combine_with(other)
i, combined = 0, []
while i < [self.length, other.length].min
combined << self[i] << other[i]
i += 1
end
larger_list = self[i] ? self : other
combined + larger_list[i..larger_list.length-1]
end
end

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

..............

Finished in 0.01825 seconds
14 examples, 0 failures

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

Иван обнови решението на 15.10.2013 02:44 (преди около 12 години)

+class Integer
+ def prime?
+ gcds = []
+ is_prime = false
+ (2..self+1).each{ |number| gcds << self.gcd(number) }
+ if gcds.uniq.length == 2 then is_prime = true end
+ return is_prime
+ end
+
+ def prime_factors
+ if self < 0 then number = -self else number = self end
+ pos = 2
+ factors = []
+ while pos <= number
+ number, pos, factors = self.prime_factors_help(number, pos, factors)
+ end
+ return factors
+ end
+
+ def prime_factors_help(number, pos, factors)
+ if number%pos == 0
+ factors << pos
+ number /= pos
+ pos = 2
+ else
+ pos += 1
+ end
+ return number, pos, factors
+ end
+
+ def harmonic
+ #if self < 0 then number = -self else number = self end
+ k, sum = 1, 0
+ while k <= self
+ sum += Rational(1, k)
+ k += 1
+ end
+ return sum.to_r
+ end
+
+ def digits
+ if self < 0 then number = -self else number = self end
+ degree = number.to_s.split(//)
+ digits_list = []
+ degree.each{ |digit| digits_list << digit.to_i }
+ digits_list
+ end
+end
+
+
+class Array
+ def frequencies
+ result = {}
+ self.each{ |n| if result[n] then result[n] += 1 else result[n] = 1 end }
+ result
+ end
+
+ def average
+ sum = 0
+ length = self.each{ |element| sum += element }.length
+ average_number = sum.to_f / length.to_f
+ end
+
+ def drop_every(position)
+ new_list = []
+ position_to_deleat = position - 1
+ while self.length >= position_to_deleat
+ new_list << self[position_to_deleat]
+ position_to_deleat += position
+ end
+ self - new_list
+ end
+
+ def combine_with(other)
+ i, combined = 0, []
+ while i < [self.length, other.length].min
+ combined << self[i] << other[i]
+ i += 1
+ end
+ if self[i] then larger_list = self else larger_list = other end
+ combined + larger_list[i..larger_list.length-1]
+ end
+end

Иван обнови решението на 15.10.2013 12:35 (преди около 12 години)

class Integer
def prime?
gcds = []
- is_prime = false
- (2..self+1).each{ |number| gcds << self.gcd(number) }
- if gcds.uniq.length == 2 then is_prime = true end
- return is_prime
+ (2..self+1).each { |number| gcds << self.gcd(number) }
+ is_prime = gcds.uniq.length == 2 ? true : false
end
def prime_factors
- if self < 0 then number = -self else number = self end
+ number = self < 0 ? -self : self
pos = 2
factors = []
while pos <= number
- number, pos, factors = self.prime_factors_help(number, pos, factors)
+ number, pos, factors = prime_factors_help(number, pos, factors)
end
- return factors
+ factors
end
def prime_factors_help(number, pos, factors)
if number%pos == 0
factors << pos
number /= pos
pos = 2
else
pos += 1
end
return number, pos, factors
end
def harmonic
- #if self < 0 then number = -self else number = self end
k, sum = 1, 0
while k <= self
sum += Rational(1, k)
k += 1
end
- return sum.to_r
+ sum.to_r
end
def digits
- if self < 0 then number = -self else number = self end
- degree = number.to_s.split(//)
+ number = self < 0 ? -self : self
+ splitet_number = number.to_s.split(//)
digits_list = []
- degree.each{ |digit| digits_list << digit.to_i }
+ splitet_number.each { |digit| digits_list << digit.to_i }
digits_list
end
end
class Array
def frequencies
result = {}
- self.each{ |n| if result[n] then result[n] += 1 else result[n] = 1 end }
+ self.each { |n| if result[n] then result[n] += 1 else result[n] = 1 end }
result
end
def average
sum = 0
- length = self.each{ |element| sum += element }.length
+ length = self.each { |element| sum += element }.length
average_number = sum.to_f / length.to_f
end
def drop_every(position)
new_list = []
position_to_deleat = position - 1
while self.length >= position_to_deleat
new_list << self[position_to_deleat]
position_to_deleat += position
end
self - new_list
end
def combine_with(other)
i, combined = 0, []
while i < [self.length, other.length].min
combined << self[i] << other[i]
i += 1
end
- if self[i] then larger_list = self else larger_list = other end
+ larger_list = self[i] ? self : other
combined + larger_list[i..larger_list.length-1]
end
end