Submission #58370095

Source Code Expand

s = input()
t = input()
n = len(s)
x = []
for i in range(n):
  if s[i] > t[i]:
    s = s[:i] + t[i] + s[i + 1:]
    x.append(s)
for j in range(n):
  i = n - 1 - j
  if s[i] < t[i]:
    s = s[:i] + t[i] + s[i + 1:]
    x.append(s)

print(len(x))
for p in x:
  print(p)

Submission Info

Submission Time
Task C - Word Ladder
User TangentDay
Language Python (CPython 3.11.4)
Score 300
Code Size 283 Byte
Status AC
Exec Time 10 ms
Memory 8652 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 26
Set Name Test Cases
Sample sample00.txt, sample01.txt, sample02.txt
All sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt
Case Name Status Exec Time Memory
sample00.txt AC 9 ms 8652 KiB
sample01.txt AC 9 ms 8544 KiB
sample02.txt AC 9 ms 8628 KiB
testcase00.txt AC 9 ms 8436 KiB
testcase01.txt AC 10 ms 8556 KiB
testcase02.txt AC 9 ms 8584 KiB
testcase03.txt AC 9 ms 8516 KiB
testcase04.txt AC 10 ms 8528 KiB
testcase05.txt AC 9 ms 8568 KiB
testcase06.txt AC 9 ms 8524 KiB
testcase07.txt AC 10 ms 8544 KiB
testcase08.txt AC 10 ms 8484 KiB
testcase09.txt AC 10 ms 8580 KiB
testcase10.txt AC 9 ms 8544 KiB
testcase11.txt AC 10 ms 8524 KiB
testcase12.txt AC 9 ms 8500 KiB
testcase13.txt AC 9 ms 8620 KiB
testcase14.txt AC 9 ms 8488 KiB
testcase15.txt AC 9 ms 8580 KiB
testcase16.txt AC 10 ms 8516 KiB
testcase17.txt AC 10 ms 8480 KiB
testcase18.txt AC 9 ms 8448 KiB
testcase19.txt AC 9 ms 8572 KiB
testcase20.txt AC 9 ms 8560 KiB
testcase21.txt AC 9 ms 8500 KiB
testcase22.txt AC 9 ms 8436 KiB