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())
N -= 1
s = 'abcdefghijklmnopqrstuvwxyz'
ans = s[N%26]
for i in range(25):
    if N <= 26:
        break
    N = N//26
    ans = s[(N-1)%26] + ans

print(ans)

Submission status: Wrong Answer

Solution code:
from sys import stdin

N = int(stdin.readline().rstrip())
alphabets = "abcdefghijklmnopqrstuvwxyz"

index = 1
tot = 0
while(True):
    tot += pow(26,index)
    if(N<=tot):
        break
    index = index+1

output_str = ""

aaaa = 26

for i in range(1,index+1,1):
    temp = N%aaaa
    temp2 = int(temp/(aaaa/26))

    
    output_str = alphabets[temp2-1] + output_str
    aaaa = aaaa*26

print(output_str)

Submission status: Wrong Answer

Solution code:
import string
N = int(input()) - 1
a = list(string.ascii_lowercase)
ans = ''
tmp = 0
while True:
    m, v = divmod(N, 26)
    N = m - 1
    ans += a[v]
    if N <= 25:
        break
if N != 0:
    ans += a[N]
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n=int(input(''))
a=1
t=[]
l=['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']

while(1):
    b=n%26**a
    if b>=26**(a-1):
        t.append(int(b/(26**(a-1))))
        n=n-b
    else:
        t.append(0)
    
    a+=1

    if n<=0:
        break
t.reverse()

s=''
for a in range(len(t)):
    s=s+l[t[a]-1]
print(s)

Submission status: Wrong Answer

Solution code:
N = int(input())

def base10to(n, b):
    if int(n/b):
        return base10to(int(n/b), b) + ',' + str(n%b)
    return str(n%b)

res_26 = base10to(N, 26)

res = []
for s in res_26.split(','):
    res.append(chr(96+int(s)))

print(''.join(res))

Submission status: Wrong Answer

Solution code:
n = int(input())
eigo = 'abcdefghijklmnopqrstuvwxyz'

keta = 1
j = 1
while n > 26**j:
    n -= 26**j
    keta += 1
    j += 1





########関数部分##############
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)


############################

ans = ''
#####関数をつかってみる．#####
######今回は二進数に変換######
x2 = Base_10_to_n(n-1, 26)
for i in x2:
    ans += eigo[int(i)]
if len(ans) != keta:
    ans = (keta-len(ans))*'a'+ans
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
n = N
l = []
while True:
    a = n%26 if n % 26 != 0 else 26
    n = n // 26 if n != 26 else 0
    l.append(a)
    if n == 0:
        break
l.reverse()
print(*[chr(ans+96) for ans in l], sep='')

Submission status: Wrong Answer

Solution code:
n =int(input())
ans = []
s = ["0","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"]
while n >= 27 :
  ans.append(n%26)
  n //= 26
ans.append(n)

S = "0"
for _ in range(len(ans)):
  N =ans[-_-1]
  S +=s[N]
S
print(S.lstrip("0"))

Submission status: Wrong Answer

Solution code:
a=int(input())
list=[]
for i in range(11,-1,-1):
  b = a // (26**i)
  a = a - b*(26**i)
  if b >0:
    list.append(b)
for i,k in zip(list,range(len(list))):
  list[k]=chr(i+96)
result=''.join(list)
print(result.replace("`",''))

Submission status: Wrong Answer

Solution code:
n = int(input().strip())
dic = {
    1:  'a',
    2:  'b',
    3:  'c',
    4:  'd',
    5:  'e',
    6:  'f',
    7:  'g',
    8:  'h',
    9:  'i',
    10: 'j',
    11: 'k',
    12: 'l',
    13: 'm',
    14: 'n',
    15: 'o',
    16: 'p',
    17: 'q',
    18: 'r',
    19: 's',
    20: 't',
    21: 'u',
    22: 'v',
    23: 'w',
    24: 'x',
    25: 'y',
    26: 'z'
       }

ans = ''

keta = 15

while True:
    if (26 ** keta) <= n:
        break
    keta -= 1

for i in range(keta, -1, -1):
    sho = n // (26 ** i)
    amari = n % (26 ** i)
    if (1 <= i and sho == 1 and amari == 0):
        continue
    else:
        if sho == 0:
            continue
        else:
            ans += dic[sho]
            n %= 26 ** i
print(ans)

Submission status: Wrong Answer

Solution code:

import math

alphabets = [chr(i) for i in range(97, 97+26)]

N = int(input())

a = 0
for i in range(1, 12):
    if math.pow(26, i) >= N:
        break
    N -= int(math.pow(26, i))

ans = ''
for j in range(i):
    b = N // int(math.pow(26, i-j-1))
    if b == 26:
        ans = 'z' * i
        break
    if i-j != 1:
        ans += alphabets[b]
    else:
        ans += alphabets[b-1]
    N = N % int(math.pow(26, i-j-1))
print(ans)

Submission status: Wrong Answer

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


def dfs(n):
    global ans
    if n <= 26:
        ans += alpha[n%26]
        return ans[::-1]
    else:
        ans += alpha[n % 26]
        return dfs(n // 26)

print(dfs(N))

Submission status: Wrong Answer

Solution code:
N = int(input())
cnt = ['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']
ans2 = ''
for i in range(10**1000):
  ans1 = cnt[N%26-1]
  ans2 = ans1 + ans2
  if N < 26:
    break
  N = N//26
print(ans2)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = []
for i in range(200):
    n = N%26
    if n == 0:
        n=26
    ans.insert(0,chr(n+96))
    N_ = (N-1)//26
    N = N//26
    if N==0 or N_ == 0:
        break
print("".join(ans))

Submission status: Wrong Answer

Solution code:
import string
if __name__ == "__main__":
    N = int(input())
    alphabets = string.ascii_lowercase
    alphabets = alphabets[-1]+alphabets[:-1]
    ans = []
    while(N != 0):
        ans.append(alphabets[N%26])
        N = N//26
    print(''.join(ans[::-1]))

Submission status: Wrong Answer

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

while N // 26 > 0:
    if N // 26 > 0:
        k.insert(0,N%26)
        N = N // 26
k.insert(0,N)

for i in k:
    print(chr(i+96),end="")

Submission status: Wrong Answer

Solution code:
import sys
N=int(input())
if N<=26:
  l=[]
  l.append(N)
  i=0
  if int(l[i])==1:
    print("a",end="")
  if int(l[i])==2:
    print("b",end="")
  if int(l[i])==3:
    print("c",end="")
  if int(l[i])==4:
    print("d",end="")
  if int(l[i])==5:
    print("e",end="")
  if int(l[i])==6:
    print("f",end="")
  if int(l[i])==7:
    print("g",end="")
  if int(l[i])==8:
    print("h",end="")
  if int(l[i])==9:
    print("i",end="")
  if int(l[i])==10:
    print("j",end="")
  if int(l[i])==11:
    print("k",end="")
  if int(l[i])==12:
    print("l",end="")
  if int(l[i])==13:
    print("m",end="")
  if int(l[i])==14:
    print("n",end="")
  if int(l[i])==15:
    print("o",end="")
  if int(l[i])==16:
    print("p",end="")
  if int(l[i])==17:
    print("q",end="")
  if int(l[i])==18:
    print("r",end="")
  if int(l[i])==19:
    print("s",end="")
  if int(l[i])==20:
    print("t",end="")
  if int(l[i])==21:
    print("u",end="")
  if int(l[i])==22:
    print("v",end="")
  if int(l[i])==23:
    print("w",end="")
  if int(l[i])==24:
    print("x",end="")
  if int(l[i])==25:
    print("y",end="")
  if int(l[i])==0 or int(l[i])==26:
    print("z",end="")
  sys.exit()

def Base_10_to_n(X, n):
    X_dumy = X
    out = ''
    while X_dumy>0:
        out = str(X_dumy%n)+','+out
        X_dumy = int(X_dumy/n)
    return out
ans=Base_10_to_n(N,26)
l=list(ans.split(","))
for i in range(len(l)-1):
  if int(l[i])==1:
    print("a",end="")
  if int(l[i])==2:
    print("b",end="")
  if int(l[i])==3:
    print("c",end="")
  if int(l[i])==4:
    print("d",end="")
  if int(l[i])==5:
    print("e",end="")
  if int(l[i])==6:
    print("f",end="")
  if int(l[i])==7:
    print("g",end="")
  if int(l[i])==8:
    print("h",end="")
  if int(l[i])==9:
    print("i",end="")
  if int(l[i])==10:
    print("j",end="")
  if int(l[i])==11:
    print("k",end="")
  if int(l[i])==12:
    print("l",end="")
  if int(l[i])==13:
    print("m",end="")
  if int(l[i])==14:
    print("n",end="")
  if int(l[i])==15:
    print("o",end="")
  if int(l[i])==16:
    print("p",end="")
  if int(l[i])==17:
    print("q",end="")
  if int(l[i])==18:
    print("r",end="")
  if int(l[i])==19:
    print("s",end="")
  if int(l[i])==20:
    print("t",end="")
  if int(l[i])==21:
    print("u",end="")
  if int(l[i])==22:
    print("v",end="")
  if int(l[i])==23:
    print("w",end="")
  if int(l[i])==24:
    print("x",end="")
  if int(l[i])==25:
    print("y",end="")
  if int(l[i])==0 or int(l[i])==26:
    print("z",end="")

Submission status: Wrong Answer

Solution code:
def num2alpha(num):
    if num<=26:
        return chr(97+num)
    elif num%26==0:
        return num2alpha(num//26-1)+chr(90)
    else:
        return num2alpha(num//26)+chr(97+num%26)

if __name__ == '__main__':
  n = int(input())
  print(num2alpha(n), end = "\n")

Submission status: Wrong Answer

Solution code:
N = int(input())

amalist = []

while True:
    num = N % 26
    amalist.append(num)
    N = N // 26
    if N == 0:
        break

amalist.reverse()

alphalist = [chr(i) for i in range(97,97+26)]

result = []
for i in amalist:
    result.append(alphalist[i-1])

print(''.join(result))

Submission status: Wrong Answer

Solution code:
N=int(input())-1
ans=''
while N>0:
  n=N%26
  N=N//26
  if len(ans)==0:
    ans=chr(n+97)+ans
  else:
    ans=chr(n+97-1)+ans
  if N==0:
    break
print(ans)

Submission status: Wrong Answer

Solution code:
i = int(input())
temp = i
moji_list = ['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']
ans = []

sep = 26
counter = 1
sep_list = [0]
while(sep < 1000000000000001):
    sep_list.append(sep)
    counter += 1
    sep += 26**counter

for j in sep_list:
    if i >= j:
        index_i = sep_list.index(j)+1

for k in range(index_i):
    t = temp//(26**(index_i - k - 1)) - 1
    ans.append(moji_list[t])
    temp = temp % (26**(index_i - k - 1))

print(''.join(ans))

Submission status: Wrong Answer

Solution code:
import sys, re
import math
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul	# 
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd	# 最大公約数
from heapq import heappush, heappop

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.maxsize = 10 ** 15
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

# -*- coding: utf-8 -*-

n = int(input())
alphabet = "abcdefghijklmnopqrstuvwxyz"
ans = ""

def A(value):
    global alphabet, ans
    if value < 26:
        ans += alphabet[value - 1]
        print(ans[::-1])
    else:
        ans += alphabet[value % 26 - 1]
        A(math.floor(value / 26))
A(n)

Submission status: Wrong Answer

Solution code:
n=int(input())
alpha=['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']
lst=[]
def Base_10_to_n(X, n):
    X_dumy = X
    while X_dumy>0:
        lst.append(X_dumy%n)
        X_dumy = int(X_dumy/n)
    return lst
lst=Base_10_to_n(n,26)
lst.reverse()
t=''
for i in range(len(lst)):
  t+=alpha[lst[i]-1]
print(t)

Submission status: Wrong Answer

Solution code:
n=int(input())
a='abcdefghijklmnopqrstuvwxyz'
ans=''
while 1:
    m=n%26
    n=n//26
    ans+='' if m==0 else a[m-1]
    if n==0:
        break
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N=int(input())
list=[chr(ord('a') + i) for i in range(26)]
def base10to(n, b):
  if (n//b!=0):
    return base10to(n//b, b) + list[n%b-1]
  return list[n%b-1]
print(base10to(N,26))

Submission status: Wrong Answer

Solution code:
N=int(input())
ans=[]
ch=[chr(i) for i in range(97, 97+26)]
anlist=[]
num2alpha = lambda c: chr(c+64)
while N>26:
  num=N%26
  ans.append(num)
  N=int((N-num)/26)
ans.append(N)
for i in ans:
  anlist.append(ch[i-1])
ans2=anlist[::-1]
print("".join(ans2))

Submission status: Wrong Answer

Solution code:
import string
a = int(input())
n = 0
while(True):
  if (a == 1 or 26**n < a <= 26**(n+1)):
      break
  else:
      n+=1
res = []
for i in reversed(range(n+1)):
  if i == 0:
    b = a
  else:
    b = a//(26**i)
  res.append(string.ascii_lowercase[b-1])
  a -= b*(26**i)
print(''.join(res))

Submission status: Wrong Answer

Solution code:
import math
import string
l = list(string.ascii_lowercase)
a = int(input())
n = 26
def numalpha(num,s=''):
    if num < n:
        return l[num] + s
    else:
        return numalpha(num // n, l[num % n] + s)
print(numalpha(a))

Submission status: Wrong Answer

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

N = int(input().strip())
#-----

d = int( math.log(N, 26) )
ans = ""

for i in range(d, -1, -1):
    digit_int = N // 26**i
    digit_str = chr( ord("a") - 1 + digit_int )
    
    ans += digit_str
    N = N % 26**i

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = ""
alphabet = ["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"]
if n <= 26:
    print(alphabet[n - 1])
else:
    a = 0
    while True:
        a = n%26
        n = n // 26
        ans += alphabet[a - 1]
        if n <= 26:
            ans += alphabet[n - 1]
            print(ans)
            break

Submission status: Wrong Answer

Solution code:
import sys

def input():
    return sys.stdin.readline()[:-1]

N = int(input())

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

name = ""

for i in range(10000):
    if N <= 26:
        q = N // 26
        mod = N % 26
        name = alphabet[mod] + name
        break
    else:
        q = N // 26
        mod = N % 26
        name = alphabet[mod] + name
        N = q - 1

    #print(q, mod)


print(name)

Submission status: Wrong Answer

Solution code:
N = int(input())
Norigin = N
alphabet = "abcdefghijklmnopqrstuvwxyz"
j = 0
start = 0
end = 0
while 1:
    if N <= 0:
        end = start + 26**(j)
        break
    else:
        start += 26**j
        j += 1
        N -= 26**j
ans = []

for i in range(j):
    ans.append(alphabet[Norigin % 26-1])
    Norigin = Norigin//26
# print(j, start, end)
ans.reverse()
print("".join(ans))

Submission status: Wrong Answer

Solution code:
N = int(input())
i = 10
ans = ''
if N > 26**10 + 26**9 + 26**8 + 26**7 +26**6 + 26**5 + 26**4 + 26**3 + 26**2 + 26:
    while i >= 0:
        a = int(N / 26**i)
        if a > 26:
            a = 26
        ans += chr(96+a)
        N -= a*26**i
        i -= 1
    print(ans)
elif N > 26**9 + 26**8 + 26**7 +26**6 + 26**5 + 26**4 + 26**3 + 26**2 + 26:
    i = 9
    while i >= 0:
        a = int(N / 26**i)
        if a > 26:
            a = 26
        ans += chr(96+a)
        N -= a*26**i
        i -= 1
    print(ans)
elif N > 26**8 + 26**7 +26**6 + 26**5 + 26**4 + 26**3 + 26**2 + 26:
    i = 8
    while i >= 0:
        a = int(N / 26**i)
        if a > 26:
            a = 26
        ans += chr(96+a)
        N -= a*26**i
        i -= 1
    print(ans)
elif N > 26**7 +26**6 + 26**5 + 26**4 + 26**3 + 26**2 + 26 :
    i = 7
    while i >= 0:
        a = int(N / 26**i)
        if a > 26:
            a = 26
        ans += chr(96+a)
        N -= a*26**i
        i -= 1
    print(ans)
elif N > 26**6 + 26**5 + 26**4 + 26**3 + 26**2 + 26:
    i = 6
    while i >= 0:
        a = int(N / 26**i)
        if a > 26:
            a = 26
        ans += chr(96+a)
        N -= a*26**i
        i -= 1
    print(ans)
elif N > 26**5 + 26**4 + 26**3 + 26**2 + 26:
    i = 5
    while i >= 0:
        a = int(N / 26**i)
        if a > 26:
            a = 26
        ans += chr(96+a)
        N -= a*26**i
        i -= 1
    print(ans)
elif N > 26**4 + 26**3 + 26**2 + 26:
    i = 4
    while i >= 0:
        a = int(N / 26**i)
        if a > 26:
            a = 26
        ans += chr(96+a)
        N -= a*26**i
        i -= 1
    print(ans)
elif N > 26**3 + 26**2 + 26:
    i = 3
    while i >= 0:
        a = int(N / 26**i)
        if a > 26:
            a = 26
        ans += chr(96+a)
        N -= a*26**i
        i -= 1
    print(ans)
elif N > 26**2 + 26:
    i = 2
    while i >= 0:
        a = int(N / 26**i)
        if a > 26:
            a = 26
        ans += chr(96+a)
        N -= a*26**i
        i -= 1
    print(ans)
elif N > 26**1:
    i = 1
    while i >= 0:
        a = int(N / 26**i) 
        if a > 26:
            a = 26
        ans += chr(96+a)
        N -= a*26**i
        i -= 1
    print(ans)
elif N > 26*0:
    i = 0
    while i >= 0:
        a = int(N / 26**i)
        ans += chr(96+a)
        N -= a*26**i
        i -= 1
    print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())


########関数部分##############
def Base_10_to_n(X, n):
    if (int(X/n)):
        return Base_10_to_n(int(X/n), n) + str(X%n).zfill(2)
    return str(X%n).zfill(2)
############################
 
 
#####関数をつかってみる．#####
x10 = n
x2 = Base_10_to_n(x10, 26)


l = list()
while x2:
    l.append(chr(96 + int(x2[-2:])))
    x2 = x2[:-2]


ans = ''
for i in (reversed(l)):
    ans += i

    
print(ans)

Submission status: Wrong Answer

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

while N>0:
    N, d = N//26, N%26
    ans.append(alpha[d-1])
    print(N, d)
ans = list(reversed(ans))
ans = "".join(ans)
print(ans)

Submission status: Wrong Answer

Solution code:
import math
N=int(input())
alfa=[chr(i) for i in range(97,97+26)]
ans=[]
while True:
    ans.append(N%26)
    if N<26:
        break
    N=N//26
for i in range(len(ans)):
    ans[i]=alfa[ans[i]-1]
ans.reverse()
print("".join(ans))

Submission status: Wrong Answer

Solution code:
A="abcdefghijklmnopqrstuvwxyz"
n=int(input())
i=1
while True:
    if n-26**i<=0: break
    n-=26**i
    i+=1
name=[]
for j in range(i):
    if j==0:
        name.append(A[n%26-1])
        n//=26
    elif n!=0:
        name.append(A[n%26])
        n//=26
    else: name.append("a")

for j in range(i):
    print(name[i-j-1],end="")

Submission status: Wrong Answer

Solution code:
N = int(input())
nanjo = -1
a = 1
while a <= N:
    a*=26
    nanjo += 1
A = [0]*(nanjo+1)
L = nanjo
for i in range(nanjo+1):
    A[i] = N//26**(nanjo)
    N -= A[i]*26**(nanjo)
    nanjo -= 1
for i in reversed(range(L+1)):
    if i != 0:
        if A[i] == 0:
            A[i] = 26
            A[i-1] -= 1       
for i in range(L+1):
    if A[i] != 0:
        print(chr(A[i]+96), end = "")
    else:
        if i == 0:
            continue

Submission status: Wrong Answer

Solution code:
N = int(input())
def translate(s):
    if s == 0:
        t = "z"
    elif s == 1:
        t = "a"
    elif s == 2:
        t = "b"
    elif s == 3:
        t = "c"
    elif s == 4:
        t = "d"
    elif s == 5:
        t = "e"
    elif s == 6:
        t = "f"
    elif s == 7:
        t = "g"
    elif s == 8:
        t = "h"
    elif s == 9:
        t = "i"
    elif s == 10:
        t = "j"
    elif s == 11:
        t = "k"
    elif s == 12:
        t = "l"
    elif s == 13:
        t = "m"
    elif s == 14:
        t = "n"
    elif s == 15:
        t = "o"
    elif s == 16:
        t = "p"
    elif s == 17:
        t = "q"
    elif s == 18:
        t = "r"
    elif s == 19:
        t = "s"
    elif s == 20:
        t = "t"
    elif s == 21:
        t = "u"
    elif s == 22:
        t = "v"
    elif s == 23:
        t = "w"
    elif s == 24:
        t = "x"
    else:
        t = "y"
    return t
ans = ""
while True:
    a  = N%26
    s = translate(a)
    N = N//26
    ans = s + ans
    if N == 0 or (N <= 25 and a == 0):
        break
        
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

N -= 1
res = chr(ord('a') + N % 26)
N //= 26
while N > 0:
    a = N % 26
    N //= 26
    res = chr(ord('a') + a - 1) + res
    if N == 0:
        break

print(res)

Submission status: Wrong Answer

Solution code:
from sys import stdin
input = stdin.readline

N = int(input())

k = 1
ans = []

while N // k > 26:
    k *= 26

while N > 0:
    tmp = N // k
    N -= tmp * k
    if tmp == 1:
        tmp = 26
    c = chr(ord("a") + (tmp - 1))
    ans.append(c)
    k //= 26


print("".join(ans))

Submission status: Wrong Answer

Solution code:
N=int(input())
alph=[chr(i) for i in range(97, 97+26)]



X_dumy = N
ans=[]
m=1
while X_dumy>26**m:
    m+=1
m=m-1
while m>=0:
    ans.append(X_dumy//26**m)
    X_dumy=X_dumy%(26**m)
    m=m-1

for i in range(len(ans)):
    ans[i]=alph[ans[i]-1]    


print(ans)

Submission status: Wrong Answer

Solution code:
# import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)


def main():
    N = int(input())

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

    maxdigit = 1

    while N > 26 ** maxdigit:
        maxdigit += 1

    c = 26 ** (maxdigit - 1)

    res = ''

    for d in range(1,maxdigit+1):
        if N == 0:
            res += 'a'
            if d == maxdigit:
                break
            continue
        if d == maxdigit:
            res += alf[N-1]
            break
        for i in range(26):
            if N <= c * (i+1):
                res += alf[i-1]
                N -= c * i
                c //= 26
                break

    print(res)



main()

Submission status: Wrong Answer

Solution code:
n = int(input())
a = "abcdefghijklmnopqrstuvwxyz"
s = ""
k = 1
while n > 26**k:
    k += 1
for i in range(k - 1, -1, -1):
    t = n // 26**i
    s += a[t - 1]
    n -= t * 26**i
print(s)

Submission status: Wrong Answer

Solution code:
n=int(input())
import math
k=math.ceil(math.log(n,26)) # 名前の文字数
n=n-(26**k -26)//25
s=""
al=["z",'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']
for i in range(k):
  s=al[n%26]+s
  n=(n+25)//26
print(s)

Submission status: Wrong Answer

Solution code:
def num2alpha(num):
    if num<=26:
        return chr(97+num)
    elif num%26==0:
        return num2alpha(num//26-1)+chr(90)
    else:
        return num2alpha(num//26)+chr(97+num%26)

if __name__ == '__main__':
  n = int(input())
  print(num2alpha(n))

Submission status: Wrong Answer

Solution code:
n=int(input())
name=['a','b','c','d','e','f','g','h','i','j','k','l','n','m','o','p','q','r','s','t','u','v','w','x','y','z']
result=''
if n<27:
    print(name[n-1])
else:
    while n>26:
        a=n%26
        result+=name[a-1]
        n//=26
    result+=name[n-1]
    print(result[::-1])

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

N = int(input())


characters = 'abcdefghijklmlopqrstuvwxyz'

def base_cvt(value, n=26):
    result = ''
    tmp = int(value)
    while tmp >= n:
        idx = tmp%n
        result = characters[(idx-1+n)%n] + result
        tmp = int(tmp / n)
    idx = tmp%n
    result = characters[(idx-1+n)%n] + result
    return result

print(base_cvt(N))

Submission status: Wrong Answer

Solution code:
def resolve():
  N = int(input())
  N_to_str = ""
  alphabet_list = "zabcdefghijklmnopqrstuvwxy"
  # N -= 1
  while N > 0:
    N_to_str=alphabet_list[N%26]+N_to_str
    if N==26:
      break
    N = (N-N%26)//26
  print(N_to_str)

if __name__ == "__main__":
  resolve()

Submission status: Wrong Answer

Solution code:
N=int(input())
alphabet=list('abcdefghijklmnopqrstuvwxyz')
result = []
while N > 0:
  num, N = N%26, N//26
  result.append(alphabet[num-1])
print(''.join(result)[::-1])

Submission status: Wrong Answer

Solution code:
# import sys
# input = sys.stdin.readline
# import re
import itertools

def main():
    n = int(input())
    i = 0
    base = 26
    v = base
    s = 'abcdefghijklmnopqrstuvwxyz'
    a = ''
    borders = [27, 703, 18279, 475255, 12356631, 321272407, 8353082583, 217180147159, 5646683826135, 146813779479511]
    while True:
        if n in borders:
            n -= 1
        i = n % 26
        n //= 26
        a += s[i-1]
        if n == 1 or n == 0:
            break
    print(a[::-1])


def count_tento(l, cur):
    count = 0
    for v in l:
        if v > cur:
            count += 1
    return count

def input_list():
    return list(map(int, input().split()))

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

def input():
    return sys.stdin.readline()[:-1]

N = int(input())

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

name = ""

for i in range(10000):
    if N <= 26:
        q = N // 26
        mod = N % 26
        name = alphabet[mod] + name
        break
    else:
        q = N // 26
        mod = N % 26
        name = alphabet[mod] + name
        N = q - 1

    print(q, mod)


print(name)

Submission status: Wrong Answer

Solution code:
a=int(input())
list=[]
for i in range(12,-1,-1):
  b = a // (26**i)
  a = a - b*(26**i)
  list.append(b)
for i,k in zip(list,range(len(list))):
  list[k]=chr(i+96)
result=''.join(list)
print(result.replace("`",''))

Submission status: Wrong Answer

Solution code:
N = int(input())
namelist = []
num2alpha = lambda c: chr(c+64)
for i in range(20):
    if N <= 26:
        namelist.append(num2alpha(N))
        break
    q = N//26
    mod = N%26
    N = q
    namelist.append(num2alpha(mod))
    

namelist.reverse()
ans = ''.join(namelist)

print(ans.lower())

Submission status: Wrong Answer

Solution code:

N = int(input())

c_ls = []

for n in range(0, 11):
    a = sum([26 ** i for i in range(1, n + 1)])
    if not n:
        a = 1
    s = N - a
    if s >= 0:
        m = (s % (26 ** (n + 1))) // (26 ** (n)) + 1
        c_ls.append(chr(m + 96))

print("".join(reversed(c_ls)))

Submission status: Wrong Answer

Solution code:
N = int(input())
lenJudgeNum = [26, 702, 18278, 475254, 12356630, 321272406, 8353082582,
               217180147158, 5646683826134, 146813779479510, 3817158266467286]
alpLen = 0
tmp = N
for i in range(len(lenJudgeNum)):
    if N <= lenJudgeNum[i]:
        alpLen = i + 1
        break
ansStr = ''
for i in range(alpLen):
    alpNum = N % 26 if N % 26 != 0 else 26
    # print(alpNum)
    #print(chr(alpNum + 96))
    ansStr = chr(alpNum + 96) + ansStr
    N = N // 26
print(ansStr)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = ""
while True:
    rm = N % 26
    if N != 0:
        if rm == 1:
            letter = "a"
        elif rm == 2:
            letter = "b"
        elif rm == 3:
            letter = "c"
        elif rm == 4:
            letter = "d"
        elif rm == 5:
            letter = "e"
        elif rm == 6:
            letter = "f"
        elif rm == 7:
            letter = "g"
        elif rm == 8:
            letter = "h"
        elif rm == 9:
            letter = "i"
        elif rm == 10:
            letter = "j"
        elif rm == 11:
            letter = "k"
        elif rm == 12:
            letter = "l"
        elif rm == 13:
            letter = "m"
        elif rm == 14:
            letter = "n"
        elif rm == 15:
            letter = "o"
        elif rm == 16:
            letter = "p"
        elif rm == 17:
            letter = "q"
        elif rm == 18:
            letter = "r"
        elif rm == 19:
            letter = "s"
        elif rm == 20:
            letter = "t"
        elif rm == 21:
            letter = "u"
        elif rm == 22:
            letter = "v"
        elif rm == 23:
            letter = "w"
        elif rm == 24:
            letter = "x"
        elif rm == 25:
            letter = "y"
        elif rm == 0:
            letter = "z"
        ans = f"{letter}{ans}"
    else:
        break
    N //= 26
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

def get_alphabet(x):
    l = 'abcdefghijklmnopqrstuvwxyz'
    return l[x-1]

ans = ''
while n > 26:
    n, m = divmod(n, 26)
    ans = get_alphabet(m) + ans

ans = get_alphabet(n) + ans
print(ans)

Submission status: Wrong Answer

Solution code:

def main():
    N = int(input()) - 1
    alp = "abcdefghijklmnopqrstuvwxyz"
    reslist = []
    q, r = divmod(N, 26)
    reslist.append(r)

    while q > 0:
        q, r = divmod(q, 26)
        reslist.append(r)
    
    name = [alp[s] for s in reslist]
    name = reversed(name)

    print(''.join(name))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = ''
while n>0:
    ans = chr(96+n%26)+ans
    n = int(n/26)
print(ans)

Submission status: Wrong Answer

Solution code:
import sys

N = int(input())

alpha = ['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']

ans = []
for i in range(11):
    n = N // (26 ** (10 - i))
    # print(f'n: {n}')
    N = N - 26 ** (10 - i) * n
    if (not ans) and n == 0:
        continue
    elif n == 0:
        ans.append('a')
    else:
        ans.append(alpha[n - 1])
# print(ans)
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
from bisect import bisect_left, bisect_right
N = int(input())

MOJI = [26]
for i in range(2,12):
  MOJI.append(MOJI[i-2]+26**i)

#print(MOJI)

C = bisect_left(MOJI, N)+1

ans = []
N -= 1
for i in range(C-1,0,-1):
  tmp = N//(26**i)
  if tmp >= 27:
    tmp = 26
  #print(tmp)
  ans.append(chr(tmp+ord("a")-1))
  N = N-tmp*(26**i)
  #print(N)


tmp = N+1
ans.append(chr(tmp+ord("a")-1))

L=[str(a) for a in ans]
L="".join(L)
print(L)

Submission status: Wrong Answer

Solution code:
n=int(input())
result=[]
ans=''
n1=n%26
l=['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']
while n>=26:
    n//=26
    result.append(l[n%26-1])
result.reverse()
for i in result:
    ans+=i
print(ans+l[n1-1])

Submission status: Wrong Answer

Solution code:
a=int(input())
list=[]
for i in range(10,-1,-1):
  b = a // (26**i)
  a = a - b*(26**i)
  list.append(b)
for i,k in zip(list,range(len(list))):
  list[k]=chr(i+96)
result=''.join(list)
print(result.replace("`",''))