Submission #5068331
Source Code Expand
# coding: utf-8 # Your code here! N = input() p = list("abcdefghijklmnopqrstuvwxyz") if len(N) != 26: for i in N: p.pop(p.index(i)) if p == []: print(-1) exit() print(N+p[0]) else: tmp = 0 a = list("zyxwvutsrqponmlkjihgfedcba") if a == list(N): print("-1") exit() for i in range(24,-1,-1): for c in p: if c not in N[:i] and c > N[i]: print(N[:i]+c) exit()
Submission Info
Submission Time | |
---|---|
Task | A - Diverse Word |
User | pyu666 |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 500 Byte |
Status | AC |
Exec Time | 18 ms |
Memory | 3064 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, s4.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, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, s1.txt, s2.txt, s3.txt, s4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 17 ms | 3064 KB |
02.txt | AC | 17 ms | 3064 KB |
03.txt | AC | 17 ms | 3060 KB |
04.txt | AC | 17 ms | 3064 KB |
05.txt | AC | 17 ms | 3064 KB |
06.txt | AC | 17 ms | 3064 KB |
07.txt | AC | 17 ms | 3064 KB |
08.txt | AC | 17 ms | 3064 KB |
09.txt | AC | 17 ms | 3064 KB |
10.txt | AC | 17 ms | 3064 KB |
11.txt | AC | 17 ms | 3064 KB |
12.txt | AC | 17 ms | 3064 KB |
13.txt | AC | 17 ms | 3064 KB |
14.txt | AC | 17 ms | 3064 KB |
15.txt | AC | 18 ms | 3064 KB |
16.txt | AC | 17 ms | 3064 KB |
17.txt | AC | 17 ms | 3064 KB |
18.txt | AC | 17 ms | 3064 KB |
19.txt | AC | 17 ms | 3064 KB |
s1.txt | AC | 17 ms | 3064 KB |
s2.txt | AC | 17 ms | 3064 KB |
s3.txt | AC | 17 ms | 3064 KB |
s4.txt | AC | 17 ms | 3064 KB |