Problem:


Score : 300 points

Problem Statement

1000000000000001 dogs suddenly appeared under the roof of Roger's house, all of which he decided to keep. The dogs had been numbered 1 through 1000000000000001, but he gave them new names, as follows:

the dogs numbered 1,2,\cdots,26 were respectively given the names a, b, ..., z;

the dogs numbered 27,28,29,\cdots,701,702  were respectively given the names aa, ab, ac, ..., zy, zz;

the dogs numbered 703,704,705,\cdots,18277,18278  were respectively given the names aaa, aab, aac, ..., zzy, zzz;

the dogs numbered 18279,18280,18281,\cdots,475253,475254  were respectively given the names aaaa, aaab, aaac, ..., zzzy, zzzz;

the dogs numbered 475255,475256,\cdots  were respectively given the names aaaaa, aaaab, ...;

and so on.

To sum it up, the dogs numbered 1, 2, \cdots were respectively given the following names:

a, b, ..., z, aa, ab, ..., az, ba, bb, ..., bz, ..., za, zb, ..., zz, aaa, aab, ..., aaz, aba, abb, ..., abz, ..., zzz, aaaa, ...

Now, Roger asks you:

"What is the name for the dog numbered N?"

Constraints

N is an integer.

 1 \leq N \leq 1000000000000001

Input

Input is given from Standard Input in the following format:

N

Output

Print the answer to Roger's question as a string consisting of lowercase English letters.

Sample Input 1

2

Sample Output 1

b

Sample Input 2

27

Sample Output 2

aa

Sample Input 3

123456789

Sample Output 3

jjddja



Sample input:
2


Sample output:
b

Submission status: Wrong Answer

Solution code:
n=int(input())
m=1
a=[]
while n>26:
  n,mod=divmod(n,26)
  a.append(mod)
  m+=1
a.append(n)
s="abcdefghijklmnopqrstuvwxyz"
ans=""
for i in range(m-1,-1,-1):
  ans+=s[a[i]-1]
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = []

while N>0:
  amari=N%26
  shou = N//26
  A.insert(0,amari)
  N=shou

alphabet = [chr(ord('a') + i) for i in range(26)]

name = ''
for i in range(len(A)):
  name += str(alphabet[A[i]-1])

print(name)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = ''
for i in range(1, 99):
    if N <= 26 ** i:
        N -= 1
        for j in range(i):
            ans += chr(ord('a') + N % 26)
            N //= 26
            break
    else:
       N -= 26 ** i
       print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())

num2alpha = lambda c : chr(c+96)

name = num2alpha(n%26)

while n > 26:
  n = n//26
  name = num2alpha(n%26) + name

print(name)

Submission status: Wrong Answer

Solution code:
# import itertools
# import math
# import sys
# import numpy as np

N = int(input())
# S = input()
# n, *a = map(int, open(0))
# X, N = map(int, input().split())
# P = list(map(int, input().split()))
# Q = list(map(int, input().split()))
# S = input()

# d = sorted(d.items(), key=lambda x:x[0]) # keyでsort
# all_cases = list(itertools.permutations(P))
# a = list(itertools.combinations_with_replacement([i for i in range(1, M + 1)], N))
# print(a[0][0])
# print(conditions[0])

abcs = "abcdefghijklmnopqrstuvwxyz"
ans = ""
while(N > 0):
    # if N == 26:
    #     ans += "z"
    #     break
    N -= 1
    _ = N % 26
    # print(N % 26)
    N //= 26
    print(N)
    ans += abcs[_]
    # print()

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
# import itertools
# import math
# import sys
# import numpy as np

N = int(input())
# S = input()
# n, *a = map(int, open(0))
# X, N = map(int, input().split())
# P = list(map(int, input().split()))
# Q = list(map(int, input().split()))
# S = input()

# d = sorted(d.items(), key=lambda x:x[0]) # keyでsort
# all_cases = list(itertools.permutations(P))
# a = list(itertools.combinations_with_replacement([i for i in range(1, M + 1)], N))
# print(a[0][0])
# print(conditions[0])

abcs = "abcdefghijklmnopqrstuvwxyz"
ans = ""
while(N > 0):
    _ = N % 26
    # print(N % 26)
    N //= 26
    # print(N)
    ans += abcs[_ - 1]
    # print()

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
# import itertools
# import math
# import sys
# import numpy as np

N = int(input())
# S = input()
# n, *a = map(int, open(0))
# X, N = map(int, input().split())
# P = list(map(int, input().split()))
# Q = list(map(int, input().split()))
# S = input()

# d = sorted(d.items(), key=lambda x:x[0]) # keyでsort
# all_cases = list(itertools.permutations(P))
# a = list(itertools.combinations_with_replacement([i for i in range(1, M + 1)], N))
# print(a[0][0])
# print(conditions[0])

abcs = "abcdefghijklmnopqrstuvwxyz"
ans = ""
while(N > 0):
    _ = N % 26
    print(N % 26)
    N //= 26
    print(N)
    ans += abcs[_ - 1]
    print()

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
ALPHA_BASE = 26
alpha = [chr(ord('a')+i) for i in range(26)]
digit = []
while n >= ALPHA_BASE:
    digit.append(n%ALPHA_BASE)
    n = n // ALPHA_BASE
digit.append(n)

ans = ''
for d in digit[::-1]:
    ans += alpha[d-1]
print(ans)

Submission status: Wrong Answer

Solution code:
from collections import deque
alphabet = [chr(i) for i in range(97, 97+26)]
n = int(input())
ans = deque()
while True:
    if n == 0:
        break
    else:
        ans.appendleft(alphabet[(n-1)%26])
    n //= 26
ans = list(map(str,ans))
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
from collections import deque
alphabet = [chr(i) for i in range(97, 97+26)]
n = int(input())
ans = deque()
ans.appendleft(alphabet[(n-1) % 26])
while True:
    n //= 26
    if n == 0:
        break
    else:
        ans.appendleft(alphabet[(n-1)%26])
ans = list(map(str,ans))
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
from collections import deque
import sys
alphabet = [chr(i) for i in range(97, 97+26)]
n = int(input())
if n <= 26:
    print(alphabet[n-1])
    sys.exit()
ans = deque()
tobe_devided = n
while True:
    q,r = divmod(tobe_devided,26)
    if q < 26:
        ans.appendleft(alphabet[r-1])
        if q != 0:
            ans.appendleft(alphabet[q-1])
        break
    ans.appendleft(alphabet[r-1])
    tobe_devided = q
ans = map(str,ans)
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
from collections import deque
import sys
alphabet = [chr(i) for i in range(97, 97+26)]
n = int(input())
if n <= 26:
    print(alphabet[n-1])
    sys.exit()
ans = deque()
tobe_devided = n
while True:
    q,r = divmod(tobe_devided,26)
    if q < 26:
        ans.appendleft(alphabet[r-1])
        ans.appendleft(alphabet[q-1])
        break
    ans.appendleft(alphabet[r-1])
    tobe_devided = q
ans = map(str,ans)
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
n = int(input())

A = 'abcdefghijklmnopqrstuvwsyz'

ans = ''

while(n > 0):    
    if n%26 == 0:
        ans = ans + A[25]
        n = n - 26
    else:
        ans = ans + A[n%26-1]
    n = n // 26
    
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())

A = 'abcdefghijklmnopqrstuvwsyz'

ans = ''

while(n > 0):    
    if n%26 == 0:
        ans = ans + A[25]
        n = n - 26
    else:
        ans = ans + A[n%26-1]
        print(ans)
    n = n // 26
    
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
s = ""

while n > 0:
    s += chr( n % 26 + ord('a') -1 )
    n //= 26
        
print(s[::-1])

Submission status: Wrong Answer

Solution code:
from math import log

n = int(input())
s = ""

for i in range(int(log(n,26))+1):
    n -= 1
    s += chr( n % 26 + ord('a') )
    n //= 26
        
print(s[::-1])

Submission status: Wrong Answer

Solution code:
from math import log

n = int(input())
s = ""

for i in range(int(log(n,26))+1):
    s += chr( n % 26 + ord('a') - 1 )
    n //= 26
        
print(s[::-1])

Submission status: Wrong Answer

Solution code:
alps = 'abcdefghijklmnopqrstuvwxyz'

n = int(input())
ansl = []
curr_n = n
for i in range(15, -1, -1):
    if n <= pow(26,i):
        continue
    val = curr_n//pow(26,i)
    ansl.append(val)
    curr_n -= val*pow(26,i)


for j in range(100):
    for i in range(len(ansl)-1):
        if ansl[i+1] == 0:
            ansl[i+1] = 26
            ansl[i] -= 1

ans = ''
for a in ansl:
    if a == 0: continue
    ans += alps[a-1]

print(ans)

Submission status: Wrong Answer

Solution code:
d = {chr(i):i-96 for i in range(97,123)}
D = {val:key for key,val in d.items()}
N = int(input())
x = ""
while N>0:
    a = N%26
    if a!=0:
        x += D[a]
        N = N//26
    else:
        k = 0
        while N%26==0:
            N = N//26
            k += 1
        x += "z"+"y"*(k-1)
print(x[::-1])

Submission status: Wrong Answer

Solution code:
import string
Al = string.ascii_lowercase
N = int(input())
S = 0
for i in range(1,16):
    S += 26**i
    if N < S:
        maxi = i
        break
Answer = []
for i in range(maxi):
    j = maxi - (i+1)
    mo = N//(26**j)
    Answer.append(mo)
    N = N-(26**j)*mo
A = str()
for k in range(len(Answer)):
    A = A + (Al[Answer[k]-1])
print(A)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env pypy3
N = int(input())
ans = ''
while N>0:
    ans = chr(N%26+96) + ans
    N = N // 26
print(ans)

Submission status: Wrong Answer

Solution code:
def I(): return int(input())
def LI(): return list(map(int,input().split()))
def MI(): return map(int,input().split())
def LLI(n): return [list(map(int, input().split())) for _ in range(n)]
import copy
#bisect.bisect_left(list,key)はlistのなかでkey未満の数字がいくつあるかを返す
#つまりlist[i] < x となる i の個数
#bisect.bisect_right(list, key)はlistのなかでkey以下の数字がいくつあるかを返す
#つまりlist[i] <= x となる i の個数
#これを応用することで
#len(list) - bisect.bisect_left(list,key)はlistのなかでkey以上の数字がいくつあるかを返す
#len(list) - bisect.bisect_right(list,key)はlistのなかでkeyより大きい数字がいくつあるかを返す
#これらを使うときはあらかじめlistをソートしておくこと！

n = I()
alphabet = [chr(i) for i in range(97, 97+26)]
ans = ""
k = 26
i = 1
while n > k:
    i += 1
    k += 26**i
    
#nに対応するアルファベットはi桁
num = n - k + 26**i - 1
while num >= 26:
  r = num%26
  num = num//26
  ans += alphabet[r]
ans += alphabet[num]
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
def base_10_to_n(x, n):
    x_dummy = x
    out = []
    while x_dummy > 0:
        out.append(str(x_dummy % n))
        x_dummy = int(x_dummy / n)
    return out[::-1]


a = base_10_to_n(int(input()), 26)
aa = []
for i in a:
    aa.append(chr(ord('a') + int(i) - 1))

print(''.join(aa))

Submission status: Wrong Answer

Solution code:
n = int(input())
alphabet = 'abcdefghijklmnopqrstuvwxyz'
ans = ''

while n != 0:
    n,mod = divmod(n, 26)
    ans += alphabet[mod-1]
reverse_ans = ''.join(list(reversed(ans)))
print(reverse_ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
alphabet = 'abcdefghijklmnopqrstuvwxyz'
ans = ''

while n >= 26:
    n,mod = divmod(n, 26)
    ans += alphabet[mod-1]
ans += alphabet[n-1]
reverse_ans = ''.join(list(reversed(ans)))
print(reverse_ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
alpha = "abcdefghijklmnopqrstuvwxyx"
ans = ""
counter = 0
while n!=0:
    n -= 1
    ans += alpha[n%26]
    n //= 26
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
AL = [chr(ord('a') + i) for i in range(26)]

def number_to_alphabet(n):
    N = n-1
    a = ''
    while True:
        d = N % 26
        a = AL[d]+ a
        N = N//26-1
        if N <= 0 : break
    return a

print(number_to_alphabet(n))

Submission status: Wrong Answer

Solution code:
n = int(input())
AL = [chr(ord('a') + i) for i in range(26)]

def number_to_alphabet(n):
    N = n-1
    a = ''
    while True:
        d = N % 26
        a = AL[d]+ a
        if N < 0 : break
        N = N//26-1
    return a

print(number_to_alphabet(n))

Submission status: Wrong Answer

Solution code:
n = int(input())
AL = [chr(ord('a') + i) for i in range(26)]

def number_to_alphabet(n):
    a = ''
    while 1 < n:
        if n%26 ==0:
            d = 25
        else:
            d = n % 26 - 1
        a = AL[d] + a
        n = n//26
    return a

print(number_to_alphabet(n))

Submission status: Wrong Answer

Solution code:
N_MAX = 1 ** 15
letters=list("abcdefghijklmnopqrstuvwxyz")
A_TO_Z = len(letters)
N = int(input())

q = N
r = []
while q > A_TO_Z:
  r.insert(0, q % A_TO_Z)
  q = q // A_TO_Z
r.insert(0, q)
for i in r:
  print(letters[i-1],end="")

Submission status: Wrong Answer

Solution code:
n = int(input())
AL = [chr(ord('a') + i) for i in range(26)]

def number_to_alphabet(n):
    a = ''
    while 0 < n:
        d = n % 26 - 1
        a = AL[d] + a
        n = n//26
    return a

print(number_to_alphabet(n))

Submission status: Wrong Answer

Solution code:
n = int(input())
AL = [chr(ord('a') + i) for i in range(26)]

def number_to_alphabet(n):
    a = ''
    while 0 < n:
        d = n % 26 - 1
        a = AL[d] + a
        n = n//26
    return a

print(number_to_alphabet(n))

Submission status: Wrong Answer

Solution code:
N_MAX = 1 ** 15
letters=list("abcdefghijklmnopqrstuvwxyz")
A_TO_Z = len(letters)
N = int(input())

q = N
r = []
while q != 0:
  r.insert(0, q % A_TO_Z)
  q = q // A_TO_Z
for i in r:
  print(letters[i-1],end="")

Submission status: Wrong Answer

Solution code:
N_MAX = 1 ** 15
letters=list("abcdefghijklmnopqrstuvwxyz")
A_TO_Z = len(letters)
N = int(input())

q = N
r = []
while q != 0:
  r.insert(0, q % A_TO_Z)
  q = q // A_TO_Z
print(r)
for i in r:
  print(letters[i-1],end="")

Submission status: Wrong Answer

Solution code:
N_MAX = 1 ** 15
letters=list("abcdefghijklmnopqrstuvwxyz")
A_TO_Z = len(letters)
N = int(input())

q = N
r = []
while q != 0:
  r.insert(0, q % A_TO_Z)
  q = q // A_TO_Z

for i in r:
  print(letters[i],end="")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
import bisect
import heapq
import itertools
import math
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from math import gcd
from operator import add, itemgetter, mul, xor
def cmb(n,r,mod):
  bunshi=1
  bunbo=1
  for i in range(r):
    bunbo = bunbo*(i+1)%mod
    bunshi = bunshi*(n-i)%mod
  return (bunshi*pow(bunbo,mod-2,mod))%mod
mod = 10**9+7

def I(): return int(input())
def LI(): return list(map(int,input().split()))
def MI(): return map(int,input().split())
def LLI(n): return [list(map(int, input().split())) for _ in range(n)]
import copy
#bisect.bisect_left(list,key)はlistのなかでkey未満の数字がいくつあるかを返す
#つまりlist[i] < x となる i の個数
#bisect.bisect_right(list, key)はlistのなかでkey以下の数字がいくつあるかを返す
#つまりlist[i] <= x となる i の個数
#これを応用することで
#len(list) - bisect.bisect_left(list,key)はlistのなかでkey以上の数字がいくつあるかを返す
#len(list) - bisect.bisect_right(list,key)はlistのなかでkeyより大きい数字がいくつあるかを返す
#これらを使うときはあらかじめlistをソートしておくこと！

n = I()
alphabet = [chr(i) for i in range(97, 97+26)]
li = []
q = copy.deepcopy(n)
while q >= 26:
  r = q%26
  q = q//26
  li.append(r)
li.append(q)
new_li = li[::-1]
ans = []
for i in new_li:
  ans.append(alphabet[i-1])
print("".join(ans))

Submission status: Wrong Answer

Solution code:
n = int(input())

def base_10_to_n(N, x):
    out = ''
    while N>0:
        if N%x == 0:
            N+=1
        out = chr(96+N%x)+out
        if N%x == 0:
            N -= 1
        N = int(N/x)
        
    print(out)
    
base_10_to_n(n, 26)

Submission status: Wrong Answer

Solution code:
n = int(input())

def base_10_to_n(N, x):
    out = ''
    while N>0:
        if N%x == 0:
            N+=1
        out = chr(96+N%x)+out
        N = int(N/x)
        
    print(out)
    
base_10_to_n(n, 26)

Submission status: Wrong Answer

Solution code:
n = int(input())

def base_10_to_n(N, x):
    out = ''
    while N>0:
        out = chr(96+N%x)+out
        N = int(N/x)
        
    print(out)
    
base_10_to_n(n, 26)

Submission status: Wrong Answer

Solution code:
n=int(input())
c=""
while n:
    c=chr(n%26+96)+c
    n//=26
print(c)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = ""
while(N > 0):
  tmp = N % 26
  tmp2 = chr(tmp+96)
  ans = ans + tmp2
  N //= 26

ans = ans[::-1]
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
chars = 'Xabcdefghijklmnopqrstuvwxyz'
res = ''
while True:
    x = n%26
    if x == 0:
        x = 26
    res += chars[x]
    n -= x
    if n == 0 :
        break
    #n //= 26
print(res[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = ''

for i in range(1,99):
    if 26**i >= N:
        N -= 1
        for s in range(i):
            ans += chr(ord('a') + N%26)
            N //= 26
        break
    else:
        N -= 26**i

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

n = 0
X = []

while True:
    if n == 0:
        X.append(26**n)
        if N <= 26:  
            break
    if n >= 1:
        X.append(26**n)
        if sum(X) > N :
            n -= 1
            break
    n += 1

l = []

for i in range(n, -1, -1):
    for s in range(26, 0, -1):
        if 26**i * s <= N:
            l.append(s)
            N -= 26**i * s
            break

def conv(x):
        y = chr(x + 96)
        return y
    
ans = map(conv, l)
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
N = int(input())

n = 0

while True:
    if n == 0:
        if N <= 26:  
            break
    if n >= 1:        
        if N/n < 26**(n-1):
            n -= 1
            break
    n += 1

l = []

for i in range(n, -1, -1):
    for s in range(26, 0, -1):
        if 26**i * s <= N:
            l.append(s)
            N -= 26**i * s
            break

def conv(x):
        y = chr(x + 96)
        return y
    
ans = map(conv, l)
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=""

for i in range(10**5):
	tmp=n%26
	if tmp==0:
		tmp=26
	ans=chr(tmp+96)+ans
	if n<=26:
		break
	n=n//26

print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=""

for i in range(10**5):
	tmp=n%26
	ans=chr(tmp+96)+ans
	if n<=26:
		break
	n=n//26

print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=""

for i in range(10**5):
	tmp=n%26
	ans+=chr(tmp+96)
	if n<=26:
		break
	n=n//26

print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
q=n//26
r=n%26
if r==0:
    a.append(26)
    for k in range(20):
        if q==1:
            a.insert(0,0)
        else:
            a.insert(0,26)
            q=q//26
else:
    for i in range(21):
        if q==1 and r==0:
            a.insert(0,26)
            q=0
        else:
            a.insert(0,r)
            r=q%2647
            q=q//26
b=[]
for j in range(21):
    x=int(a[j])
    if x==0:
        continue
    else:
        x=chr(x+96)
        b.append(x)
c="".join(b)
print(c)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
q=n//26
r=n%26
if r==0:
    a.append(26)
    for k in range(20):
        if q==1:
            a.insert(0,0)
        else:
            a.insert(0,25)
            q=q//26
else:
    for i in range(21):
        if q==1 and r==0:
            a.insert(0,26)
            q=0
        else:
            a.insert(0,r)
            r=q%26
            q=q//26
b=[]
for j in range(21):
    x=int(a[j])
    if x==0:
        continue
    else:
        x=chr(x+96)
        b.append(x)
c="".join(b)
print(c)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
q=n//26
r=n%26
if r==0:
    a.append(26)
    for k in range(20):
        if q==1:
            a.insert(0,0)
        else:
            a.insert(0,25)
            q=q//26
else:
    for i in range(21):
        if q==1:
            a.insert(0,26)
            q=0
        else:
            a.insert(0,r)
            r=q%26
            q=q//26
b=[]
for j in range(21):
    x=int(a[j])
    if x==0:
        continue
    else:
        x=chr(x+96)
        b.append(x)
c="".join(b)
print(c)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
q=n//26
r=n%26
if r==0:
    a.append(26)
    for k in range(14):
        if q==1:
            a.insert(0,0)
        else:
            a.insert(0,25)
            q=q//26
else:
    for i in range(15):
        if q==1:
            a.insert(0,26)
            q=0
        else:
            a.insert(0,r)
            r=q%26
            q=q//26
b=[]
for j in range(15):
    x=int(a[j])
    if x==0:
        continue
    else:
        x=chr(x+96)
        b.append(x)
c="".join(b)
print(c)

Submission status: Wrong Answer

Solution code:
N = int(input())

N -= 1

n = 0

while True:
    if n == 0:
        if N < 26:  
            break
    if n >= 1:        
        if N/n < 26**(n-1):
            n -= 1
            break
    n += 1

l = []

for i in range(n, -1, -1):
    for s in range(25, -1, -1):
        if 26**i * s <= N:
            l.append(s)
            N -= 26**i * s
            break
def conv(x):
    if x == 26:
        return 'z'
    else:
        y = chr(x + 97)
        return y
    
ans = map(conv, l)
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
N = int(input())

n = 0

while True:
    if N < 26**n:
        n -= 1
        break
    n += 1

l = []

for i in range(n, -1, -1):
    for s in range(25, -1, -1):
        if 26**i * s <= N:
            l.append(s)
            N -= 26**i * s
            break

ans = map(lambda x: chr(x + 96), l)

print(''.join(ans))

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
q=n//26
r=n%26
for i in range(20):
    a.insert(0,r)
    r=q%26
    q=q//26
b=[]
for j in range(20):
    x=int(a[j])
    if x==0:
        continue
    else:
        x=chr(x+96)
        b.append(x)
c="".join(b)
c.replace("0","")
print(c)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
q=n//26
r=n%26
for i in range(15):
    a.insert(0,r)
    r=q%26
    q=q//26
b=[]
for j in range(15):
    x=int(a[j])
    if x==0:
        continue
    else:
        x=chr(x+96)
        b.append(x)
c="".join(b)
c.replace("0","")
print(c)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
q=n//26
r=n%26
for i in range(15):
    a.insert(0,r)
    r=q%26
    q=q//26
b=[]
for j in range(15):
    x=int(a[j])
    if x==0:
        continue
    else:
        x=chr(x+96)
        b.append(x)
c="".join(b)
print(c)

Submission status: Wrong Answer

Solution code:
X = int(input())
d = {0: 'z'}
for i in range(0, 25):
    d[i+1] = chr(97+i)
a = []
while X > 0:
    a.append(d[(X % 26)])
    X //= 26
for i in a[::-1]:
    print(i, end='')
print()

Submission status: Wrong Answer

Solution code:
N = int(input())
alpha = 'abcdefghijklmnopqrstuvwxyz'
ans = ''

while N > 0:
	ans = alpha[N%26] + ans
	N = N//26

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
alpha = 'abcdefghijklmnopqrstuvwxyz'
ans = ''

while N > 0:
	ans = alpha[N%26-1] + ans
	N = N//26

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
alpha = 'abcdefghijklmnopqrstuvwxyz'
ans = ''

while N > 0:
	ans += alpha[N%26-1]
	N = N//26

print(ans)

Submission status: Wrong Answer

Solution code:
alphabet = [chr(i) for i in range(97, 97+26)]
n = int(input())
keta = 0
while True:
    if n <= 26 ** keta:
        break
    keta += 1
ans = ''
for i in range(keta-1,-1,-1):
    num = 1
    while (num+1) * 26**(i) <= n:
        num+= 1
    # この時点でnumは、26**iをいくつまで含むことができるか？という数
    ans += alphabet[num-1]
    n -= num * 26**i

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
lis1 = []
lis2 = []
while n >= 27:
    lis1.append(n%26)
    n = n//26
lis1.append(n)
lis1.reverse()
for i in range(len(lis1)):
    lis2.append(chr(lis1[i]+96))

print(''.join(map(str,lis2)))

Submission status: Wrong Answer

Solution code:
n = int(input())
x = n

l=0
while True:
  l+=1
  if x <=27:
    break
  else:
    x /=26

x = n
s = []
for i in range(l):
  x-=1
  s.append(chr((x%26)+ord('a')))
  x //=26

print("".join(s[::-1]))

Submission status: Wrong Answer

Solution code:
n = int(input())
x = n

l=0
while True:
  l+=1
  if x <=26:
    break
  else:
    x /=26

x = n
s = []
for i in range(l):
  s.append(chr(((x-1)%26)+ord('a')))
  x //=26
print("".join(s[::-1]))

Submission status: Wrong Answer

Solution code:
n = int(input())
x = n

l=0
while True:
  l+=1
  if x <=26:
    break
  else:
    x /=26

x = n
s = []
for i in range(l):
  s.append(chr((x%26-1)+ord('a')))
  x //=26
print("".join(s[::-1]))

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = ""
alphabet = {i+1:chr(ord("a") + i) for i in range(25)}
alphabet[0] = "z"
while N != 0:

    a, r = N//26, N%26
    # print(a,r)
    ans = alphabet[r] + ans
    N = N//26

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = ""
while N != 0:

    a, r = N//26, N%26
    # print(a,r)
    ans = chr(ord("a") + r-1) + ans
    N = N//26

print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
n=N
listm=[]
while n!=0:
  m=n%26
  n=n//26
  listm.append(m)
list_ans=[]
l=0
for i in range(N):
  try:
    ans=chr(listm[i]+96)
    list_ans.append(ans)
    l+=1
  except IndexError:
    break

ans=''
for i in range(l):
  ans=ans+list_ans[l-i-1]
print (ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
n -= 1
for i in range(1, 15):
    if n >= 26**i :
        n -= 26**i
        continue 
    ans = ""
    for j in range(i):
        d = n % 26
        ans += chr(ord("a")+d)
        n //= 26
    ans = ans[::-1]
print(ans)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
N = int(input())
A = []
alp = [chr(i) for i in range(97, 97+26)]
for i in range(100,-1,-1):
    A.append(N//26**i)
    N %= 26**i

for i in range(101):
    if A[i] != 0:
        k = i
        #print(k)
        break
A = A[k:]
#print(A)
ans = ""
if A[-1]==0:
    ans = "z" * (len(A)-1)
else:
    for a in A:
        ans += alp[a-1]
print(ans)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

N = int(input())
alp = [chr(i) for i in range(97, 97+26)]
S = 0
for i in range(1,100):
    S += 26**i
    if S >= N:
        keta = i
        break
#print(keta)
ans = ""
for i in range(keta-1, -1, -1):
    #print(N, N//(26**i))
    ans += alp[min(N//(26**i)-1,25)]
    N %= 26**i

print(ans)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

N = int(input())
alp = [chr(i) for i in range(97, 97+26)]
for i in range(1,100):
    if 26**i >= N:
        keta = i
        break
#print(keta)
ans = ""
for i in range(keta-1, -1, -1):
    ans += alp[N//(26**i)-1]
    N %= 26**i

print(ans)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

N = int(input())
alp = [chr(i) for i in range(97, 97+26)]
for i in range(1,100):
    if 26**i >= N:
        keta = i
        break
print(keta)
ans = ""
for i in range(keta-1, -1, -1):
    ans += alp[N//(26**i)-1]
    N %= 26**i

print(ans)

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    ans = ''
    while N > 0:
        ans = chr(ord('a') + N % 26 - 1) + ans
        N //= 26
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
# coding: utf-8

N = int(input())
alp = [chr(i) for i in range(97, 97+26)]
for i in range(100):
    if 26**i >= N:
        keta = i
        break
#print(keta)
ans = ""
for i in range(keta-1, -1, -1):
    ans += alp[N//(26**i)-1]
    N %= 26**i

print(ans)

Submission status: Wrong Answer

Solution code:
#Nをnum変数に代入
num = int(input())
#a~zをリスト化
word = ["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"]

extra_n = num % 26
'''Nを26で割ったあまりをextra変数に代入
word[extra - 1]が下一桁の文字となる
'''
leave = num - extra_n
'''leave変数は26の倍数
'''
#leave = 26k
k = int(leave / 26)
#kが0なら名前は一文字
if k == 0:
  print(word[extra_n - 1])
else:
  #余りのリスト
  extra = [extra_n]
  '''小さいものほど桁が少ない
  '''
  #count変数は26で割った回数
  count = 1
  while k != 0:
    extra_n = k % 26
    extra.append(extra_n)
    k -= extra_n
    if k == 0:
      break
    else:
      count += 1
  name = extra[0]
  for i in range(count - 1):
    name += extra[i + 1]
  print(name)

Submission status: Wrong Answer

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import numpy as np
from numba import njit
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

N = I()
# q, mod = divmod(N, 26)

def Base_10_to_n(X, n):
    if (int(X/n)):
        return Base_10_to_n(int(X/n), n)+str(X%n)
    return str(X%n)

def Base_10_to_n_custom(X, n):
    # print(X)
    if (int(X/n)):
        return Base_10_to_n_custom(int(X/n), n) + chr((X%n)+96)
    return chr((X%n)+96)

ans = Base_10_to_n_custom(N,26)
print(ans)

# a26 = Base_10_to_n(N,26)
# print(a26)
# ans =''
# for i in range(len(a26)):
#     ans += chr(int(a26[i])+96)

# print(ans)

# ans = ''
# for i in range(q):
#     ans += 'a' 
# ans += chr(ord('a')+mod-1)
# print(ans)

# print(chr(ord(C)+1))

Submission status: Wrong Answer

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import numpy as np
from numba import njit
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

N = I()
# q, mod = divmod(N, 26)

def Base_10_to_n(X, n):
    if (int(X/n)):
        return Base_10_to_n(int(X/n), n)+str(X%n)
    return str(X%n)

a26 = Base_10_to_n(N,26)
ans =''
for i in range(len(a26)):
    ans += chr(int(a26[i])+96)

print(ans)

# ans = ''
# for i in range(q):
#     ans += 'a' 
# ans += chr(ord('a')+mod-1)
# print(ans)

# print(chr(ord(C)+1))

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np
from math import ceil as C, floor as F
from collections import defaultdict as D

def S(): return sys.stdin.readline().rstrip().split(' ')
def Ss(): return list(S())
def I(): return _I(S())
def Is(): return list(I())
def _I(ss): return map(int, ss) if len(ss) > 1 else int(ss[0])

N = I()
alp = '-abcdefghijklmnopqrstuvwxyz'

def get_name(n, name):
  if n <= 26:
    return '{}{}'.format(alp[n], name)
  
  q = F(n / 26)
  r = n % 26
  return get_name(q, '{}{}'.format(alp[r], name))

print(get_name(N, ''))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

n = int(input())

r = ''

def to_moji(x: int):
    return chr(96 + x)

def devide(x, moji):
    a = x // 26
    b = x % 26
    if a < 1:
        moji = to_moji(b) + moji
        return moji
    elif 1 <= a and a <= 26:
        moji = to_moji(b) + moji
        moji = to_moji(a) + moji
        return moji
    else:
        moji = to_moji(b) + moji
        return devide(a, moji)

print(devide(n, r))

Submission status: Wrong Answer

Solution code:
N=int(input())

ans=[]
while(1):
    if N==0:
        break
    ans.append(str(N%26))
    N//=26

new_ans= ans[::-1]
#print(chr(97)) #97→a

ANS=""
for i in new_ans:
    ANS+=chr((96+int(i)))
#print(new_ans)
print(ANS)

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = []

i = 1

while n > 0:
  k = n % 26
  n = n // 26
  ans.append(chr(ord('a') + k - 1))

for i in reversed(range(len(ans))):
  print(ans[i], end = '')

Submission status: Wrong Answer

Solution code:
import math

N=int(input())
N=N-1
#pは桁数

if N==0:
    p=1
else:
    p=int((math.log(N,26))//1)+1

if p>1:
     for i in range(1,p):
         N=N-26**i

ans=str()
for i in range(p):
    num=N%26
    alp=chr(num+97)
    N=N//26
    ans=alp+ans

print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
n=N
P=[]
A=["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"]
for i in range(26**50):
    P.append(n%26)
    if n//26==0:
        break
    else:
        n=n//26
Q=[]
for i in range(len(P)):
    Q.append(P[-i-1])
P=Q    
d=A[P[0]-1]
for i in range(1,len(P)):
    d+=A[P[i]-1]
print(d)