Submission #4034385
Source Code Expand
x, y = gets.chomp.split.map(&:to_i) arr = [x] n = y - x (0..(n - 2)).each do |i| break if y <= arr[i] arr[i + 1] = arr[i] * 2 end if arr.last == y puts arr.count else puts (arr.count - 1) end
Submission Info
Submission Time | |
---|---|
Task | C - Multiple Gift |
User | zettaittenani |
Language | Ruby (2.3.3) |
Score | 300 |
Code Size | 212 Byte |
Status | AC |
Exec Time | 8 ms |
Memory | 1788 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 8 ms | 1788 KB |
02.txt | AC | 7 ms | 1788 KB |
03.txt | AC | 7 ms | 1788 KB |
04.txt | AC | 7 ms | 1788 KB |
05.txt | AC | 7 ms | 1788 KB |
06.txt | AC | 8 ms | 1788 KB |
07.txt | AC | 7 ms | 1788 KB |
08.txt | AC | 7 ms | 1788 KB |
09.txt | AC | 7 ms | 1788 KB |
10.txt | AC | 8 ms | 1788 KB |
11.txt | AC | 7 ms | 1788 KB |
12.txt | AC | 7 ms | 1788 KB |
s1.txt | AC | 7 ms | 1788 KB |
s2.txt | AC | 7 ms | 1788 KB |
s3.txt | AC | 7 ms | 1788 KB |