This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# 1 task | |
first = [2,4,1,1,1] | |
second = [4,1,6,7,1] | |
for i in 0..first.length-1 do | |
puts "#{i+1} команда #{first.at(i)>second.at(i)? "победила":(first.at(i)<second.at(i)? "проиграла": "ничья")}" | |
end | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
first = [2,4,1,1,1] | |
second = [4,1,6,7,1] | |
for i in 0..first.length-1 do | |
puts "#{i+1} команда #{first.at(i)>second.at(i)? "победила":(first.at(i)<second.at(i)? "проиграла": "ничья")}" | |
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#В одном массиве записано количество мячей, забитых футбольной командой в | |
#каждой из 20 игр, в другом - количество пропущенных мячей в этой же игре. | |
#Для каждой игры определите словесный результат игры (выигрыш, проигрыш или ничью) | |
balls_missed = [1, 2, 3, 1, 1, 2] | |
balls_scored = [1, 4, 1, 1, 2, 1] | |
balls_missed.each_with_index do |i, index| | |
count_missed = balls_missed.at(i) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#В одном массиве записан рост некоторых студентов, | |
#а в другом (с тем же числом элементов) - их фамилии в том же порядке, в котором указан рост. | |
#Известно, что все студенты разного роста. | |
#Напечатайте фамилию самого высокого студента. | |
array_surname = ["Sidorov", "Petrov", "Ivanov", "Sokolov"] | |
array_rise = [180, 190, 185, 187] | |
puts "Highest boy is #{ array_surname.at( array_rise.index( array_rise.max ) ) } with rise a #{ array_rise.max } cm " |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Дан целочисленный массив. Заменить все положительные элементы на значение минимального. | |
number_array = [-1, 4, 5, -2, -5, 4] | |
min_value_from_array = number_array.min | |
number_array = number_array.map { |e| e > 0 ? e = min_value_from_array : e } | |
puts number_array |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Дан целочисленный массив. Осуществить циклический сдвиг элементов массива влево на одну позицию | |
number_array = [1, 2, 3, 4, 5] | |
puts "before : #{ array }" | |
puts "after shift : #{ array.push( array.shift ) }" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Дан целочисленный массив. Преобразовать его, вставив перед каждым положительным элементом нулевой элемент | |
number_array = [1, -2, -1, 4] | |
sort_array = number_array.each_with_object([]) do |item , sort_array | | |
sort_array << 0 if item.positive? | |
sort_array << item | |
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Дан целочисленный массив. Упорядочить его по возрастанию. | |
numbers = [4, 1, 5, 6, 2, 41, 23] | |
numbers = numbers.sort | |
puts numbers |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Дана строка в которой записаны слова через пробел. Необходимо упорядочить слова по количеству букв в каждом слове. | |
str = "Alexander Yan Dasha Mari 1 s 123 1231 2124" | |
array = str.split.sort_by(&:length).join " " | |
puts array |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#Дана строка в которой записаны слова через пробел. Необходимо посчитать количество слов. | |
str = "one two three four five" | |
puts str.split.size |
OlderNewer