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())
s = "abcdefghijklmnopqrstuvwxyz"

l = [26]
for i in range(2, 14):
    a = 26 ** (i) + l[i-2]
    l.append(a)

idx = 0
while True:
    if n <= l[idx]:
        break
    idx += 1

if idx == 0:
    print(s[idx-1])
    exit()

q = n - l[idx-1] - 1

ll = []
for j in range(idx+1):
    q, mod = divmod(q, 26)
    ll.append(mod)

ll.reverse()
ans = ""
for e in ll:
    ans += s[e]

print(ans)

Submission status: Wrong Answer

Solution code:
a=int(input())
s=0
d=1
si=[]
while a>0:
    b=a%26
    si.append(b)
    a=a//26
    if b==0:
      a-=1
    
    
 
c=""
for i in si:
  if i==0:
    i=26
  c+=chr(i+96)
c=c[::-1]
print(c)
print(si)

Submission status: Wrong Answer

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
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()
ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
for i in range(15, -1, -1):
    if N > 26**i-1:
        if N == 26**i and not N == 1:
            ans += 'z'
        else:
            ans += ascii_lowercase[(N // (26**i))-1]
        N = N%(26**i)
print(ans)

Submission status: Wrong Answer

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

while 1:
  l = N%26
  N = N//26
  if l==0:
    ans+='a'
  else:
    ans+=alf[l-1]
  if N==0:
    break
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())

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

ls = []
c = 0
while(N//26>0):
    if (N%26==0):
        ls.append(26)
    else:
        ls.append((N%26))
    N = N//26

ls.append(N)
ls.reverse()
s = ""
for i in range(0,len(ls)):
    s = s + ch[ls[i]-1]

print(s)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = list()
while n>0:
    x = n % 26
    ans.append(x)
    n = int(n / 26)

str_ans = ""
for x in ans[::-1]:
    str_ans += chr(x+96)

print(str_ans.replace("a`", "z"))

Submission status: Wrong Answer

Solution code:
n = int(input())
count = []
temp = 0

while True:
  if n <= 26:
    break
  
  temp = n % 26
  count.append(temp)
  n = n // 26
  
count.append(n)

count =[n + 96 for n in count]
count =[chr(n) for n in count]
count.reverse()

print(''.join(count))

Submission status: Wrong Answer

Solution code:
N = int(input())
if 1<= N <= 1000000000000001:
    moji = 'abcdefghijklmnopqrstuvwxyz'
    amari = N
    syo = 0
    kai = ""
    lis = []
    for i in range(12,0,-1):
        syo = amari // 26 ** i
        amari = amari % 26 ** i
        if syo >0:
            kai += moji[syo - 1]
            
    kai += moji[amari - 1]
    print(kai)

Submission status: Wrong Answer

Solution code:
import string


def main():
  alpha = string.ascii_lowercase

  def to_n(X, n, list_=[]):
    X_dumy = X
    while X_dumy > 0:
      list_.insert(0, X_dumy % n)
      X_dumy = int(X_dumy/n)
    return list_

  N = int(input())
  res = N
  counter = 0
  while res > 0:
    counter += 1
    res -= 26**counter

  res += 26**counter
  res -= 1
  idx = to_n(res, 26)
  if len(idx) < counter:
    idx.insert(0, 0)
  # print(res)
  # print(idx)
  print('{:<}'.format(''.join(list(map(lambda i: alpha[i], idx)))))

if(__name__ == '__main__'):
  main()

Submission status: Wrong Answer

Solution code:
n = int(input())
c = 0
n1 = n 
for i in range(1,12):
    a = n1 - 26**(i)
    c += 1
    if a <= 0:
        break
    n1 = n1 - 26**(i)
a = ""
for i in range(c):
    if n // 26**(c-i-1) >= 26:
        alpha = 26
        n = n - 26**(c-i-1)
    else:
        alpha = n // 26**(c-i-1)
        n = n % 26**(c-i-1)
    a += chr(96 + alpha)
print(a)

Submission status: Wrong Answer

Solution code:
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"]

N = int(input())

for i in range(1,12):
    s = N/(26**i)
    if s<=1:
        degit = i
        break


name=""
while (degit > 0):
    num = N//(26**(degit-1))
    N -= num*(26**(degit-1))
    name += Alphabet[num-1]
    
    degit -= 1

print(name)

Submission status: Wrong Answer

Solution code:
N = int(input())

keta = 0
max = 0
while True <= N:
    keta += 1
    max += 26 ** keta
    if max >= N:
        break

# print(keta)

result = []
while keta >= 1:
    if N // 26 ** (keta-1) > 26:
        v = 26
    else:
        v = N // (26 ** (keta-1))

    N = N - (26 ** (keta-1)) * v
    # print(v, N)
    result.append(v)

    keta -= 1

# print(result)

a_z_list = [chr(i) for i in range(97, 97+26)]
for value in result:
    value -= 1
    print(a_z_list[value], end='')

print('')

Submission status: Wrong Answer

Solution code:
import string

eng = ["",'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']

n = int(input())

ans = n
modulo = 0
solve=[]
while ans != 0:
    modulo = ans%26
    ans = ans//26
    if modulo == 0:
        solve.insert(0,26)
    else:
        solve.insert(0,modulo)
    
transform = ""
if solve[-1]!=26:
    for i in solve:
        transform += eng[i]
else:
    for i in solve:
        if i != 26:
            transform += eng[i-1]
        else:
            transform += eng[i]

print(transform)

Submission status: Wrong Answer

Solution code:

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

    while N > 26:
        tmp = N % 26
        # if tmp == 0:
        #     ans += "z"
        ans += chr(tmp + 96)
        N //= 26
        # print(N)
    else:
        ans += chr(N + 96)

    print(ans[::-1])


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
num = int(input())

def rec_get_k(n, current_under, current_k):
  next_k = current_k + 1
  curremt_upper = current_under + 26 ** next_k
  if n < curremt_upper and n >= current_under:
    return next_k
  else:
    return rec_get_k(n, curremt_upper, next_k)

use_k = rec_get_k(num, 1, 0)
use_num = num
res_list = []
tmp_k = use_k
for i in range(use_k):
  tmp_k -= 1
  use_div = 26 ** tmp_k
  tmp_num = use_num // use_div
  if tmp_num > 26:
    tmp_num = 26
    use_num = use_num - use_div * 26
  elif use_num  == use_div * 26 and tmp_k > 0:
    tmp_num = 25
    use_num = use_num - use_div * 25
  else:
    use_num = use_num % use_div
  res_list.append(chr(96 + (tmp_num)))
  
print("".join(res_list))

Submission status: Wrong Answer

Solution code:
n = int(input())
i = 1
ssum = 0
while n > ssum + 26**i:
    ssum += 26**i
    i += 1
alp = ['z'] + [chr(i) for i in range(97,97+26)]
ans = ''
import math
for j in range(1,i):
    n -= 26**j
for j in range(i):
    
    
    ans +=alp[n%26]
    n -= n%26
    n //= 26
    n += 1
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
import math
#26進法
N = int(input())
A=list('abcdefghijklmnopqrstuvwxyz')
if N > 26:
    N -= 1
    #print(math.log(N,len(A)))
    n = int(float(str(math.log(N,len(A)))))
    #print('n',n)
    Ans = ''
    while n >= 0 :
        v = N//(len(A)**n)
        #print('v',v)
        if v >=1:
            Ans += A[v-1]
        else:
            Ans += A[v]
        N -=  (len(A)**n)*v
        n -= 1
    print(Ans)
else:
    print(A[N-1])

Submission status: Wrong Answer

Solution code:
a = int(input())
tmp = list('abcdefghijklmnopqrstuvwxyz')
ans = ''

ttt = [676, 17576, 456976, 11881376, 308915776, 8031810176, 208827064576, 5429503678976, 141167095653376, 3670344486987776]
wari_lis = [26]
for kk in ttt:
    xxx = wari_lis[-1]
    wari_lis.append(kk+xxx)
#print(wari_lis)
#print(3817158266467286)
#print(1000000000000001)
if a in wari_lis:
    ll = wari_lis.index(a)+1
    ans += 'z'*ll
    print(ans)
    exit()

import bisect
keta = bisect.bisect_left(wari_lis, a) + 1
if keta >= 2:
    a -= wari_lis[keta-2]
#print(keta,'keta')
n=a
k=26
bi=[]
while n!=0:
    bi.append(str(n%abs(k)))
    if k<0:n=-(-n//k)
    else:n=n//k
lis = bi[::-1]
#print(lis)
for i,l in enumerate(lis):
    if i == len(lis)-1:
        ans += tmp[int(l)-1]
    else:
        ans += tmp[int(l)]
if len(ans)<keta:
    ans = 'a'*(keta-len(ans))+ans
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
n = int(input())
m = n

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

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

for i in range(keta-1, -1, -1):
    have = min(m // (26 ** i),26)
    if not have == 0:
        ans += alphabet[have-1]
    m -= 26 ** i * have
    
print(ans)

Submission status: Wrong Answer

Solution code:
import string

# 1千兆 + 1
N = int(input())
n_digits = len(str(1000000000000001))
letters = string.ascii_lowercase
map_letters = { i-1:v for i,v in enumerate(string.ascii_lowercase)}

x = N - 1
ans = []
for d in range(n_digits):
    if x <= 0:
        break
    mod = x % 26
    ans = [ mod ] + ans
    x = x // 26 - 1

# print(ans)
# fa = []
# for i in range(len(ans)-1):
#     fa.append(ans[i]-1)
# fa.append(ans[-1])
print(
    ''.join(map(lambda d: letters[d], ans))
)

Submission status: Wrong Answer

Solution code:
n = int(input())
l = [0]
ans = []
a = 0
cur = 1
while a < 1000000000000001:
  a += 26**cur
  cur += 1
  l.append(a)
l = list(reversed(l))
for i in range(len(l)-1):
  if l[i] >= n:
    ans.append(0)
  else:
    div = (n-1)//(l[i]-l[i+1])
    n = n-div*(l[i]-l[i+1])
    ans.append(div)
ans.append(n)
ans =list(map(lambda x:x+96, ans))
for i in range(len(ans)):
  if ans[i] > 96:
    ans2 = ans[i:]
    break
ans2 = "".join([chr(i) for i in ans2])
print(ans2)

Submission status: Wrong Answer

Solution code:
num = int(input())

num2alpha = lambda c: chr(c+96)
ans = []
newans = []
string = ''

while num > 0:
    if num % 26 == 0:
        ans.append(26)
    else:
        ans.append(num%26)
    if num < 27:
        break
    num =  int(int(num) / 26)
    

for item in ans:
    newans.append(num2alpha(item))

for item in reversed(newans):
    string = string + item

print(string)

Submission status: Wrong Answer

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    N = I()
    s = 'abcdefghijklmnopqrstuvwxyz'
    ans = []
    for i in range(12):
        if math.pow(26, i) > N:
            break
    if i == 0:
        print('a')
        return
    if N % 26 == 0:
        i -= 1
    for j in range(0, i)[::-1]:
        c = math.pow(26, j)
        shou = int(N // c)
        amari = N % int(c)
        # print('N: ', N)
        # print('amari: ', amari)
        # print('j: ', j)
        if amari == 0:
            if j == 0:
                pass
            else:
                shou -= 1
        else:
            if shou == 27:
                shou -= 1

        ans.append(s[shou-1])
        N -= shou * c
    print(''.join(ans))
main()

Submission status: Wrong Answer

Solution code:
from collections import deque
n = int(input())

a = 0
b = 0
tm = 0
while a < n:
    tm += 1
    b = a
    a += 26 ** tm

def base_10_to_n(x, n, tm):
    A = deque([])
    if x == 0:
        A = deque([0 for i in range(tm)])
    else:
        while x > 0:
            A.appendleft(x%n)
            x = int(x/n)
    return A
    
L = base_10_to_n(n - b - 1, 26, tm)

#print(a)
#print(L)
ans = ''
for i in L:
    ans += chr(i + 97)
print(ans)

Submission status: Wrong Answer

Solution code:
MAX = 200
def Excel(n): 
    string = ["\0"] * MAX
    i = 0
    while n > 0: 
        rem = n % 26
        if rem == 0: 
            string[i] = 'z'
            i += 1
            n = (n //26) - 1
        else: 
            string[i] = chr(int(rem - 1 + 97))
            i += 1
            n = n // 26
    string[i] = '\0'
    string = string[::-1] 
    return "".join(string) 
n=int(input())
print(Excel(n))

Submission status: Wrong Answer

Solution code:
n = int(input())
c = 0
n1 = n 
for i in range(1,11):
    a = n1 - 26**(i)
    c += 1
    if a <= 0:
        break
    n1 = n1 - 26**(i)
a = ""
for i in range(c):
    if n // 26**(c-i-1) >= 26:
        alpha = 26
        n = n - 26**(c-i-1)
    else:
        alpha = n // 26**(c-i-1)
        n = n % 26**(c-i-1)
    a += chr(96 + alpha)
print(a)

Submission status: Wrong Answer

Solution code:
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
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)
import string
def convert(n):
    return string.ascii_lowercase[n]
#======================================================#
def main():
    n = II()
    idx = base_10_to_n(n-1,26)
    idx = list(map(int, idx.split(',')))[::-1]
    ans = ''
    if len(idx) == 1:
        print(convert(idx[0]))
    else:
        ans += convert(idx[0])
        for i in idx[1:]:
            ans += convert(i-1)
        print(ans[::-1])

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def Base_10_to_n(X, n):
    X_dumy = X
    out = []
    while X_dumy > 0:
        out.append(X_dumy % n)
        X_dumy = int(X_dumy/n)
    return out


def resolve():
    n = int(input())
    ans = Base_10_to_n(n, 26)

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

    ans.reverse()

    for i in range(len(ans)):
        if ans[i] == 0:
            pass
        else:
            print(chr(96+ans[i]), end='')
    print()

resolve()

Submission status: Wrong Answer

Solution code:
N=int(input())
S=''
while N!=0:
    S=chr(N%26+96)+S
    N=N//26
print(S)

Submission status: Wrong Answer

Solution code:
in1 = input()
ind = int(in1)

alpha = "abcdefghijklmnopqrstuvwxyz"

twosix = []

while True:
  if (ind == 26):
    twosix.append(26)
    break
  if (ind < 26):
    twosix.append(ind)
    break
  twosix.append(ind % 26)
  ind //= 26
  
#print(twosix)
ans = ""
twosix.reverse()
#print(twosix)
for i in twosix:
  ans += alpha[i-1]

print(ans)

Submission status: Wrong Answer

Solution code:
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
if len(s) > 1 and sum(s) == 1:
    word = ["z"] * (len(s)-1)
else:
    for m in s:
        if m == 0:
            word.append("z")
        else:
            word.append(alp[m - 1])
    word.reverse()
print("".join(word))

Submission status: Wrong Answer

Solution code:
n=int(input())
num=n
ans=[0]*10
flag=0
flag2=0
for i in reversed(range(1,11)):
  if(flag2):
    ans[10-i]=1
  if(num//(26**i)>0):
    if(num/(26**i)==1):
      flag=1
      ans[10-i]=26
      flag2=1
    else:
      ans[9-i]=num//(26**i)
      flag2=1
  num=num%(26**i)
  if(i==1)and(flag==0):
    ans[9]=num
#print(ans)
for i in ans:
  if i==0:
    continue
  print(chr(96+i),end='')
print('')

Submission status: Wrong Answer

Solution code:
word_lst = ['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']
n = int(input())
w_lst = []
x = n
p = 1
q = 0
while x >= 0:
    s = n % 26
    w_lst.append(s)
    q += 26**p
    x = n - q
    n = x
    p += 1

ans_lst = []
for d in w_lst:
    ans_lst.append(word_lst[d-1])
print("".join(ans_lst))

Submission status: Wrong Answer

Solution code:
n = int(input())
m = n
if n == 1:
    print("a")
    exit()
for i in range(20):
    tmp = 0
    for j in range(1, i):
        tmp += 26 ** j
    if 26 ** (i - 2) < n <= tmp:
        digit = i - 1
        break
ans = []
"""
for i in range(digit)[::-1]:
    ans += chr(96 + n // (26 ** i))
    print(n // (26 ** i))
    n = n % (26 ** i)
print(ans)
"""
for i in range(digit)[::-1]:
    m = n // (26 ** i)
    if m == 27:
        n -= (m - 1) * 26 ** i
        ans += chr(96 + (m - 1))
    else:
        n -= m * 26 ** i
        ans += chr(96 + m)
    if m == 0:
        ans[-2] = chr(ord(ans[-2]) - 1)
        ans[-1] = "z"

print(*ans, sep="")

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 = ''
prev = 'a'
for i in range(alpLen):
    #alpNum = N % 27
    alpNum = N % 26 if N % 26 != 0 else 26
    # print(alpNum)
    #print(chr(alpNum + 96))
    # print("prev")
    # print(prev)
    # print()
    cur = chr(alpNum + 96)
    if prev == 'z' and chr(alpNum + 96) == 'a':
        cur = 'z'
        ansStr = 'z' + ansStr
    else:
        cur = chr(alpNum + 96)
        ansStr = chr(alpNum + 96) + ansStr
    N = N//26
    # print(N)
    prev = cur

print(ansStr)

Submission status: Wrong Answer

Solution code:
a=int(input())
keta=0
for i in range(1,12):
    if a<=26**i:
        keta=i
        break
    
#print(keta)

ans=""

for j in range(keta-1,-1,-1):
    #print(j,"j")
    hiku=26**j
    for i in range(1,27):
       # print(hiku*i)
        if a<=hiku*i:
           # print(a,i,"a")
            
            if a==hiku*i:
                a-=hiku*(i-1)

                ans+=chr(i+97-1)
            else:
                a-=hiku*(i-1)
                ans+=chr(i+96-1)
            break
print(ans)
"""
        hiku*i
    print(a%(26**i))
    a-=a%(26**i)
    print(a)
"""

Submission status: Wrong Answer

Solution code:
n=int(input())
N=0
N+=n
k=n
ddd=[]
for i in range(1,15):
  ddd.append((26**i)//25-1)
keta=0
syo=0
kou=0
for i in range(1,15):
  if (26**i-1)//25 == n:
    keta=i
    break
  if (26**i-1)//25 < n < (26**(i+1)-1)//25:
    keta=i
    break
ans=[]
for i in range(keta):
  ans.append(n%27)
  n=n//26
ans.reverse()
alf="zabcdefghijklmnopqrstuvwxyz"
anss=""
if not N in ddd:
  for i in ans:
    anss+=alf[i]
  print(anss)
else:
  print("z"*keta)

Submission status: Wrong Answer

Solution code:
al = ["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"]
N = int(input())
M = N
v = 1
while True:
    if(M<26**v):
        break
    M -= 26**v
    v += 1
if(N<=26):
    anss = al[N%26-1]
else:
  for i in range(v):
      N -= 26**i  
  ans = []
  for i in range(v):
      ans.append("a")
  for i in range(v):
      ans[-i-1]=al[N%26]
      N = N//26
  ans.reverse()
  if(ans[0]=="z")and(len(ans)>1):
      del ans[0]
  anss = ""
  for i in range(len(ans)):
      anss += ans[-i-1]
print(anss)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans_num=[]
while(n>0):
  ans_num.append(n%26)
  n = n //26
ans_num.reverse()
num_alpha = {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",0:"z"}
ans = ""
for i in ans_num:
  ans +=num_alpha[i]
print(ans)

Submission status: Wrong Answer

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

l=[26**i for i in range(13)]

k=[sum(l[0:i+1]) for i in range(13)]

e=0
for i in range(13):
  if n<k[i]:
    e=e
  else:
    e=e+1
l=l[0:e]
l.reverse()
list=[]
for i in range(e):
  m=int(n//l[i])
  list.append(m)
  n=n-l[i]*m
list.reverse()
for i in range(e):
  if list[i]==0:
    list[i]=26
    list[i+1]-=1

s=''
for i in range(e):
    s=chr(ord('a')+list[i]-1)+s
print(s)

Submission status: Wrong Answer

Solution code:
N = int(input())
q = N // 26
mod = N % 26
A = []
B = []
def num2alpha(c):
    if(c>0):
        return chr(c+96)
    else:
        return 'z'
while(True):
    A.append(mod)
    if(q<27):
        if(q != 0 and mod != 0):
            A.append(q)
        break
    mod = q % 26
    q = q // 26
A.reverse()
for x in A:
    B.append(num2alpha(x))
B="".join(B)
print(B)

Submission status: Wrong Answer

Solution code:
ans = ""

N = int(input())
res = 1
ns = 1
for i in range(10000):
    if 26*res >= N:
        break
    else:
        res *= 26
        ns += 1

for i in range(ns):
    tmp = N%26
    if tmp == 0:
        ans += "z"
    else:
        ans += chr(96+tmp)
    N //= 26

    if N <= 0:
        break

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
def Base_10_to_n(X, n):
    alphabet = list(chr(i)for i in range(97, 123))
    X_dumy = X
    out_temp = ''
    ans = ''
    while X_dumy > 0:
        out_temp = str(X_dumy % n)+out_temp
        if X_dumy % n == 0:
            ans = 'a' + ans
        else:
            ans = alphabet[X_dumy % n-1] + ans
        X_dumy = int(X_dumy/n)
    return ans


def main():
    n = int(input())
    print(Base_10_to_n(n, 27))


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
k = 1
m = 0
abc_list = list("abcdefghijklmnopqrstuvwxyz")

for i in range(1, 11):
    m = n
    n = n - 26 ** i
    if n > 0:
        k += 1
    else:
        break
    
l =[]

for j in range(k - 1, 0, -1):
    l.append((m - 1)// (26 ** j))
    m = m % (26 ** j)

l.append(m - 1)

answer = []

for i in l:
    if i == 26:
        i = 25
    answer.append(abc_list[i])

print("".join(answer))

Submission status: Wrong Answer

Solution code:
n = int(input())
num2alpha = lambda c: chr(c+64)
def g(x):
    L = []
    while x > 0:
        amari = x%26
        x = x//26
        if amari > 0:
            L.append(amari)
    L.reverse()
    answer = ''
    for i in L:
        answer += num2alpha(i).lower()
    return print(answer)
g(n)

Submission status: Wrong Answer

Solution code:
N = int(input())
p = 1
cnt = 26
while (cnt <= N):
    p += 1
    cnt += 26 ** p

mod = (N - cnt + 26 ** p) % 26 ** p

# str : p
alphabet = "abcdefghijklmnopqrstuvwxyz"

st = ['a'] * p

for i in reversed(list(range(p))):
    if i == p-1:
        st[i] = alphabet[(mod % 26)-1]
    else:
        st[i] = alphabet[(mod % 26)]
    mod = mod // 26

print(*st, sep='')

Submission status: Wrong Answer

Solution code:
n=int(input())
N=0
N+=n
k=n
ddd=[]
for i in range(1,15):
  ddd.append((26**i)//25-1)
keta=0
syo=0
kou=0
for i in range(1,15):
  if (26**i-1)//25 == n:
    keta=i
    break
  if (26**i-1)//25 < n < (26**(i+1)-1)//25:
    keta=i
    break
ans=[]
for i in range(keta):
  ans.append(n%27)
  n=n//26
ans.reverse()
alf="zabcdefghijklmnopqrstuvwxyz"
anss=""
print(ans)
if not N in ddd:
  for i in ans:
    anss+=alf[i]
  print(anss)
else:
  print("z"*keta)

Submission status: Wrong Answer

Solution code:
import string

N = int(input())
ans = []
S =""

while N != 0:
    a = N % 26
    b = N // 26
    N = b
    ans.append(a)
ans = reversed(ans)

for s in ans:
    S += string.ascii_lowercase[int(s)-1]

print(S)

Submission status: Wrong Answer

Solution code:
s=int(input())
d=[]
while s>0:
  d.append(chr(s%26+97))
  s//=26
t=''
for i in reversed(d):
  t+=i
print(t)

Submission status: Wrong Answer

Solution code:
num = int(input())

num2alpha = lambda c: chr(c+96)
ans = []
newans = []
string = ''

while num > 0:
    if num % 26 == 0:
        ans.append(26)
    else:
        ans.append(num%26)
    if num < 27:
        break
    num =  int(int(num) / 26)
    
print(ans)

for item in ans:
    newans.append(num2alpha(item))

for item in reversed(newans):
    string = string + item

print(string)

Submission status: Wrong Answer

Solution code:
N = int(input())
if 1<= N <= 1000000000000001:
    moji = 'abcdefghijklmnopqrstuvwxyz'
    for i in range(12):
        if N // 26 **i == 0:
            max_i = i-1
            break
    amari = N
    syo = 0
    kai = ""
    p = 0
    for j in range(1,max_i+1):
        p = max_i +1 -j
        syo = amari // 26 ** p
        amari = amari % 26 ** p
        kai += moji[syo - 1]
    kai += moji[amari - 1]
    print(kai)

Submission status: Wrong Answer

Solution code:
import sys
len_list = list()
len_list.append(1)
l1 = 26
len_list.append(l1)
l2 = l1*26
len_list.append(l2)
l3 = l2*26
len_list.append(l3)
l4 = l3*26
len_list.append(l4)
l5 = l4*26
len_list.append(l5)
l6 = l5*26
len_list.append(l6)
l7 = l6*26
len_list.append(l7)
l8 = l7*26
len_list.append(l8)
l9 = l8*26
len_list.append(l9)
l10 = l9*26
len_list.append(l10)


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']

N = int(input())

name = ''
len = 0
if N > l10:
    len=10
elif N > l9:
    len=9
elif N > l8:
    len=8
elif N > l7:
    len=7
elif N > l6:
    len=6
elif N > l5:
    len=5
elif N > l4:
    len=4
elif N > l3:
    len=3
elif N > l2:
    len=2
elif N > l1:
    len=1
#elif N == l1:
#    print('z')
#    sys.exit()
else:
    len=0

while len >= 0:
    if N // len_list[len] > 0:
        if N % len_list[len] == 0 and len > 0:
            name += alpha[(N // len_list[len]) -2]
            for l in range(len):
                name += 'z'
            break
        else:
            name += alpha[(N // len_list[len]) -1]
            N = N % len_list[len]
    else:
        name += 'a'
    len -= 1
print(name)

Submission status: Wrong Answer

Solution code:
import itertools
L=[chr(i) for i in range(97, 97+26)]
N=int(input())
P=N
i=1
cnt=1
while True:
  tmp=26*i
  if N-26*i<=0:
    break
  N-=tmp
  i*=26
  cnt+=1

A=[]
for i in range(cnt):
  P,V=divmod(P,26)
  A.append(L[V-1])
B=A[::-1]

ans=''.join(B)
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
count = 0
ans =""
k_list =[]
for i in range(1,15):
    count += 1
    if N - 26**i > 0:
        N = N - 26**i
    else:
        break
for i in reversed(range(1,count)):
    k = N // (26**i)
    k_list.append(int(k))
    if k != 0:
        N = N - 26**i * k

if N ==0:
    for i in range(len(k_list)):
        if k_list[i] == 0:
            ans = ans + "z"
        else:
            ans = ans + chr(96 + k_list[i])
    ans = ans + "z"
else:
    for i in range(len(k_list)):
        ans = ans + chr(97 + k_list[i])
    ans = ans + chr(96 + N)

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
ab = ['null','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']
op = ''
startCount = False
for i in [11,10,9,8,7,6,5,4,3,2,1,0]:
    if not startCount:
        upLim = 0
        for j in range(1,i+1):
            upLim += 26**j
    if n >= upLim and not startCount:
        startCount = True
    if startCount:
        op += ab[n//26**i]
        n -= (n//26**i)*26**i
print(op)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
from decimal import *

input = sys.stdin.readline

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	N = inputInt()

	ans = ""
	listss = '0abcdefghijklmnopqrstuvwxyz'

	if N > 27:
		ama = N % 27
		ans = listss[ama]
		tmp = N
		cnt = 1
		while True:
			if N // (27**cnt) == 0:
				break
			ama = N % (27**cnt)
			for i in range(cnt):
				ama %= 27
			ans = listss[ama] + ans
			cnt += 1
	else:
		ans = listss[N-1]

	print(ans)



#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
N = int(input())

a = N % 26
b = N - a
c = 0
while(b >= 1):
    b = b/26
    c += 1
    a = b % 26
    b = b - a
ans = []
for d in range(c,-1,-1):
    dit = int(N/26**d)
    if N%26**d == 0 and d == c:
        continue
    if dit == 0:
        ans.append(chr(122))
    else:
        ans.append(chr(96+dit))
        N = N%26**d
print(''.join(ans))

Submission status: Wrong Answer

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


n = int(input());
this = dict();
while(n > 0):
    x = 1; c = 1;
    while(n >= x):
        c += 1;
        x *= 26;
    n -= (x // 26);
    # print(n);
    this[c] = this.get(c, 0) + 1;
ans = ['']*50;
for i in this:
    ans[i] = chr(97 + this[i] - 1);
ans = ''.join(ans[::-1]);
print(ans);

Submission status: Wrong Answer

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

K = True
ans = []
while K: 
  if n//26>0:
    ans.append(n%26-1)
    n = n//26 
  elif n//26==0:
    ans.append(n%26-1)
    K = False

print(ans)  
ans_al = []
for i in ans:
  ans_al.append(lowl[i])

Submission status: Wrong Answer

Solution code:
def cal_digit(n):
  n2 = 26
  n2_l = [26]
  digit = 1
  while n/sum(n2_l)>=26:
    n2*=26
    n2_l.append(n2)
    digit+=1
  return n2_l
alpa = ['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']
n = int(input())

l = []

n_l = cal_digit(n)
digit = len(n_l)
if n>sum(n_l):
  digit+=1

x = n
dif = n - n_l[-1]
for i in range(digit):
  if i == 0:
    l.append(alpa[dif%26 - 1])
  elif dif != 0:
    l.append(alpa[dif%26 - 1])
  else:
    l.append('a')
  dif = dif//26
l.reverse()

ans = ''.join(l)
print(ans)