Buggy python submission (verdict: Runtime Error):
n = int(input())
s=[]
alp = [chr(i) for i in range(97, 97+26)]
word = []
while n > 0:
    s.append(n % 26)
    n = n // 26
for m in s:
    if m == 0:
        word.append("z")
    else:
        word.append(alp[m - 1])
word.reverse()
if word[0] == "a" and word[1] == "z":
    word.pop(0)
print("".join(word))

Fixed submission:
from collections import deque
n = int(input())
st  = deque()
while n > 0:
    num = (n - 1) % 26
    n = (n - 1) // 26
    st.appendleft(chr(num + 97))
print(*st, sep = "")

Buggy python submission (verdict: Runtime Error):
n = int(input())
s=[]
alp = [chr(i) for i in range(97, 97+26)]
word = []
while n > 0:
    s.append(n % 26)
    n = n // 26
for m in s:
    if m == 0:
        word.append(z)
    else:
        word.append(alp[m - 1])
word.reverse()
print("".join(word))

Fixed submission:
from collections import deque
n = int(input())
st  = deque()
while n > 0:
    num = (n - 1) % 26
    n = (n - 1) // 26
    st.appendleft(chr(num + 97))
print(*st, sep = "")

Buggy python submission (verdict: Runtime Error):
n = int(input())
s=[]
alp = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
word = []
while n > 0:
    s.append(n % 26)
    n = n // 26
for m in s:
    if m == 0:
        word.append(z)
    else:
        word.append(alp[m-1])
word.reverse()
print("".join(word))

Fixed submission:
from collections import deque
n = int(input())
st  = deque()
while n > 0:
    num = (n - 1) % 26
    n = (n - 1) // 26
    st.appendleft(chr(num + 97))
print(*st, sep = "")

Buggy python submission (verdict: Runtime Error):
n = int(input())
s=[]
alp = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
word = []
while n > 0:
    s.append(n % 26)
    n = n // 26
for  m in s:
    if m == 0:
        word.append(z)
    else:
        word.append(alp[m-1])
word.reverse()
print("".join(word))

Fixed submission:
from collections import deque
n = int(input())
st  = deque()
while n > 0:
    num = (n - 1) % 26
    n = (n - 1) // 26
    st.appendleft(chr(num + 97))
print(*st, sep = "")

Buggy python submission (verdict: Runtime Error):
n = int(input())
s=[]
alp = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
word = []
while n > 0:
    s.append(n % 26)
    n = n // 26
for  m in s:
    if m == 0:
        word.append[z]
    else:
        word.append(alp[m-1])
word.reverse()
print("".join(word))

Fixed submission:
from collections import deque
n = int(input())
st  = deque()
while n > 0:
    num = (n - 1) % 26
    n = (n - 1) // 26
    st.appendleft(chr(num + 97))
print(*st, sep = "")

Buggy python submission (verdict: Runtime Error):
n = int(input())
s=[]
alp = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
word = []
while n > 0:
    s.append(n % 26)
    n = n // 26
for index, m in enumerate(s):
    if m == 0:
        word.append[z]
    else:
        word.append(alp[m-1])
word.reverse()
L = "".join(word)
print(L)




Fixed submission:
from collections import deque
n = int(input())
st  = deque()
while n > 0:
    num = (n - 1) % 26
    n = (n - 1) // 26
    st.appendleft(chr(num + 97))
print(*st, sep = "")