Submission #2319268

Source Code Expand

a, b, k = gets.chomp.split.map(&:to_i)
array = []
a.upto([a + k - 1, b].min) {|i| array << i }
b.downto([b - k + 1, a].max) {|i| array << i }
array = array.uniq.sort
array.each {|i| puts i }

Submission Info

Submission Time
Task B - Small and Large Integers
User rankey55
Language Ruby (2.3.3)
Score 200
Code Size 195 Byte
Status AC
Exec Time 7 ms
Memory 1788 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 16
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 7 ms 1788 KiB
02.txt AC 7 ms 1788 KiB
03.txt AC 7 ms 1788 KiB
04.txt AC 7 ms 1788 KiB
05.txt AC 7 ms 1788 KiB
06.txt AC 7 ms 1788 KiB
07.txt AC 7 ms 1788 KiB
08.txt AC 7 ms 1788 KiB
09.txt AC 7 ms 1788 KiB
10.txt AC 7 ms 1788 KiB
11.txt AC 7 ms 1788 KiB
12.txt AC 7 ms 1788 KiB
13.txt AC 7 ms 1788 KiB
s1.txt AC 7 ms 1788 KiB
s2.txt AC 7 ms 1788 KiB
s3.txt AC 7 ms 1788 KiB