Submission #818591
Source Code Expand
s,x=gets.split;l=s.size-1;a=[*?0..?9]-gets.split (puts s;exit)if !j=(0..l).find{|i|!a.find{|e|e==s[i]}} k=j.downto(0).find{|i|x=a.find{|e|e>s[i]}}||-1 puts (k<0?a[0]>?0?a[0]:a[1]:s[0...k]+x)+a[0]*(l-k)
Submission Info
Submission Time | |
---|---|
Task | C - Iroha's Obsession |
User | leafmoon |
Language | Ruby (2.3.3) |
Score | 300 |
Code Size | 204 Byte |
Status | AC |
Exec Time | 21 ms |
Memory | 1788 KB |
Judge Result
Set Name | Sample | All | ||
---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||
Status | AC |
|
Set Name | Test Cases |
---|---|
Sample | |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_X_01.txt, subtask1_X_02.txt, subtask1_X_03.txt, subtask1_X_04.txt, subtask1_X_05.txt, subtask1_X_06.txt, subtask1_X_07.txt, subtask1_X_08.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 16 ms | 1788 KB |
subtask0_sample_02.txt | AC | 17 ms | 1788 KB |
subtask1_X_01.txt | AC | 17 ms | 1788 KB |
subtask1_X_02.txt | AC | 21 ms | 1788 KB |
subtask1_X_03.txt | AC | 17 ms | 1788 KB |
subtask1_X_04.txt | AC | 17 ms | 1788 KB |
subtask1_X_05.txt | AC | 17 ms | 1788 KB |
subtask1_X_06.txt | AC | 17 ms | 1788 KB |
subtask1_X_07.txt | AC | 17 ms | 1788 KB |
subtask1_X_08.txt | AC | 17 ms | 1788 KB |