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:
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print(*a, **kw, file=sys.stderr)

N = ini()


def solve():
    k = 26
    a = k
    l = 1
    while a < N:
        a = 26 * a + a
        l += 1
    b = 1
    x = N - 1
    name = [None] * l
    for i in range(l):
        c = x % 26
        name[l - 1 - i] = chr(ord("a") + c)
        x //= 26
        x -= 1
    return "".join(name)


print(solve())

Submission status: Wrong Answer

Solution code:
X = int(input())

def Base_10_to_n(X, n):
    alphabet = 'zabcdefghijklmnopqrstuvwxy'
    if (int((X-1)/n)):
        return Base_10_to_n(int(X/n), n)+alphabet[X%n]
    return alphabet[X%n]
print(Base_10_to_n(X, 26))

Submission status: Wrong Answer

Solution code:
from collections import deque
N=int(input())
r=ord("a")-1#ここからどれだけずれているか
d=deque()
while N>0:
  div=N%26
  N//=26
  if chr(div+r)=="`":
    d.appendleft("z")
  else:
    d.appendleft(chr(div+r))
print("".join(d))

Submission status: Wrong Answer

Solution code:
N = int(input())
res = []
while N:
    res.append(chr(ord('a') + (N-1) % 26))
    N //= 26
print(''.join(res[::-1]))

Submission status: Wrong Answer

Solution code:
n = int(input())
l = []

while(n > 0):
    l.append(n % 26)
    n = int(n / 26)

l.reverse()

ans = []
for i in l:
    ans.append(chr(i + ord('a') - 1))
    
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
n=int(input())
i=1
nn=n
while n>0:
    n-=26**i
    i+=1
k=i-1
s=[]
for j in range(k):
    k1=nn//26**(k-j-1)
    nn=nn%26**(k-j-1)
    s.append(chr(k1+96))
for i in s:
    print(i,end='')

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)


ans = ""
ls = ["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_26 = []
while n > 0:
    if len(ls_26):
        ls_26.append(n%26-1)
        n //= 26
    else:
        ls_26.append((n-1)%26)
        n -= 1
        n //= 26
for i in range(len(ls_26)-1,-1,-1):
    ans += ls[ls_26[i]]
print(ans)

Submission status: Wrong Answer

Solution code:
import math
i=int(input())
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"]
ans=""
for k in range (100):
    j=i%26-1
    ans=alphabet[j]+ans
    if i<26:
        break
    else:
        i=i//26
print(ans)

Submission status: Wrong Answer

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

while (n != 0):
    s = n // 26
    t = n % 26
    p = string.ascii_lowercase[t-1]
    ans = ans + p
    n = s
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = ""
lis = []
while n>0:
    lis.append(chr(97+n%26-1))
    n //= 26
for i in range(len(lis)):
  ans += lis[len(lis)-i-1]
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

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

if n == 26:
    ans += 'z'
else:
    ans += chr(ord('a') + n % 26 - 1)
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
import math
import string


def solve():
    ls=string.ascii_lowercase
    n=int(input())
    a=""

    while n>0:
        mod=n%26-1
        a+=ls[mod]
        n=n//26
    print(a[::-1])


if __name__ == '__main__':
    t=1
    for _ in range(t):
        solve()

Submission status: Wrong Answer

Solution code:
n = int(input())
if n==1:
    print('a')

i = 0
buf = 0
while 26**i+buf<=n:
    buf += 26**i
    i += 1
ans = ''
for j in range(i):
    ans += chr(ord('a')+(n//(26**j)-1)%26)
    n -= 26**j
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
import bisect, collections, copy, heapq, itertools, math, numpy, string
import sys
from bisect import bisect_left, bisect_right, insort
from collections import deque
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def MS(): return map(str, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
# N = I()
# A = [LI() for _ in range(N)]


n = I()
s = 0
while 26**s < n:
    s += 1
ans = ''
for i in range(s):
    k = n // 26**(s-i-1)
    ans = ans + chr(96 + k)
    n = n - k * 26**(s-i-1)
print(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

if N in MOJI:
  print("z"*C)
  exit()

ans = []
for i in range(C-1,-1,-1):
  tmp = N//(26**i)
  ans.append(chr(tmp+ord("a")-1))
  N = N%(26**i)

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

Submission status: Wrong Answer

Solution code:
import sys
import os
import itertools
import numpy as np
from collections import deque

def main():
    if os.getenv("ENV")=='LOCAL':
        sys.stdin = open(os.path.dirname(__file__)+'/input.txt', 'r')

    N=int(input())
    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"]

    name=[]

    while N >= 26:
        name.append(N%26)
        N=(N-N%26)//26
    name.append(N)

    # print(name)
    ans=""
    for n in name:
        ans+=alphabet[n-1]

    print(ans[::-1])

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
alphas = list("abcdefghijklmnopqrstuvwxyz")
ans = []

now = n
while True:
    d = now % 26
    if (d > 0):
        ans.append(alphas[d-1])
    elif (d == 0):
        ans.append(alphas[-1])

    if (now <= 26):
        break

    now = int(now / 26)

ans.reverse()
print("".join(ans))

Submission status: Wrong Answer

Solution code:
n = int(input())
mix = 11
ans = [0] * 12
while n > 26 and mix > 0:
  if n < 26 ** mix:
    mix -= 1
  else:
    n -= (26 ** mix)
    ans[mix] += 1
ans[0] = n  

ansstr = ''
for m in reversed(ans):
  if m > 0:
    ansstr += chr(0x40 | 0x20 + m)
print(ansstr)

Submission status: Wrong Answer

Solution code:

n = int(input())
strr = []
i = 0
while n > 0:
    rem = n % 26
    if rem == 0:
        strr.append('z')
        n = (n // 26) - 1
    else:
        strr.append(chr((rem - 1) + ord('a')))
        n = n // 26
strr.append('\0')
# strr = strr[::-1]
print("".join(strr))

Submission status: Wrong Answer

Solution code:
import sys

q = int(sys.stdin.readline())
chars = []
while q > 26:
    q, mod = divmod(q, 26)
    chars.append(chr(mod+96))
chars.reverse()
print("".join(chars))

Submission status: Wrong Answer

Solution code:
########関数部分##############
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)
############################
 
N = int(input())

alp = "abcdefghijklmnopqrstuvwxyz"

i = 1
ans = ''
while N > 0:
    j = N % (26**i)
    N = N // (26**i)
    if j == 0:
        j = 26
    ans += alp[j-1]

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())

# N -= 1

keta = 0
while 26**(keta+1) <= N:
    keta += 1

result = []
while keta >= 0:
    v = N // (26 ** keta)
    N = N % (26 ** keta)
    result.append(v)
    keta -= 1

# rint(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:
N = int(input())
Q = []
ans = []
while N != 0:
    Q.append(N%26)
    N = N//26

Q.reverse()
for i in Q:
    ans.append(chr(ord('a')-1+i))

print("".join(ans))

Submission status: Wrong Answer

Solution code:
import string
def resolve():
    N = int(input())-1
    lst = []
    while True:
        lst.append((N%26)-1)
        N //= 26
        if N == 0:
            break
    lst[0]+=1
    st = [string.ascii_lowercase[i] for i in reversed(lst)]
    print("".join(st))
resolve()

Submission status: Wrong Answer

Solution code:
N = int(input())
NAME = 'abcdefghijklmnopqrstuvwxyz'
D = 26
name = ''

while N > 0:
  i = N % 26
  name = NAME[i-1] + name
  N = int((N - i) / D)
  
print(name)

Submission status: Wrong Answer

Solution code:
def base10_to_n(a, n):
    if (int(a/n)):
        return base10_to_n(int(a/n), n) + str(a%n)
    return str(a%n)


N = int(input())

for c in base10_to_n(N, 26):
    print(chr(ord('a') + int(c) - 1), end='')
print()

Submission status: Wrong Answer

Solution code:
n=int(input())
al=[chr(97+ i) for i in range(26)]
ans=""
while n>0:
    ans+=str(al[n%26-1])
    n//=26
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())

ans=''
while N/26 > 0:
  n = N%26
  ans = chr(n+64) + ans
  N //= 26

print(ans.lower())

Submission status: Wrong Answer

Solution code:
def change(X,words):
    if (int(X/words)):
        return change(int(X/words), words)+str(X%words)
    return str(X%words)

str_list='abcdefghijklnmopqrstuvwxyz'
N=int(input())
after = change(N, 26)
ans=''
for i in range(len(after)):
    ans+=str_list[int(after[i])-1]
print(ans)

Submission status: Wrong Answer

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

while N != 0:
  e = N % 26
  ans += memo[e - 1]
  N = N // 26
  
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)


def main():
    N = int(input().strip())
    ans = ""
    while N > 0:
        m = N % 26
        N = N // 26
        if m == 0:
            ans = chr(0x7A) + ans
        else:
            ans = chr(0x60 + m) + ans

    return ans


if __name__ == "__main__":
    print(main())

Submission status: Wrong Answer

Solution code:
from collections import deque
N=int(input())
r=ord("a")-1#ここからどれだけずれているか
d=deque()
while N>1:
  div=N%26
  N//=26
  if chr(div+r)=="`":
    d.appendleft("z")
  else:
    d.appendleft(chr(div+r))
print("".join(d))

Submission status: Wrong Answer

Solution code:
N = int(input())
alphas = [ chr(i) for i in range(ord("a"), ord("z")+1)]

res = ""
while N != 0:
  ch = N % 26
  res += alphas[ch-1]
  N = N//26

print(res[::-1])

Submission status: Wrong Answer

Solution code:
n=int(input())
s=[]
while n!=0:
    x=n%26
    s.append(chr(96+x))
    n=n//26
m=len(s)
ans=s[m-1]
if m==1:
    print(ans)
    exit()

for i in range(m-1):
    ans+=s[m-2-i]
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
tmp = 1
SUM = 1
while SUM <= N:
    tmp *= 26
    SUM += tmp
tmp //= 26
ans = ''
while N != 0:
    ans += chr(96 + N // tmp)
    N %= tmp
    tmp //= 26

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = 26
c = 1
res =""

num2alpha = lambda c: chr(c+64)

while True:
    if n <= a:
        break
    a *= 26
    c += 1

for i in range(c):
    res = num2alpha(int(n % 26)) + res
    n = n / 26

print(str.lower(res))

Submission status: Wrong Answer

Solution code:
NUM = int(input())
R = ""
li = ['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 NUM >= 26:
    R = li[(NUM % 26)-1] + R
    NUM = int(NUM/26)
R = li[NUM-1] + R
print(R)

Submission status: Wrong Answer

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


# 入力を整数に変換して受け取る
def input_int():
    return int(input())


# マイナス1した値を返却
def int1(x):
    return int(x) - 1


# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
    return map(int, input().split())


# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
    return tuple(map(int, input().split()))


# 半角スペース区切り入力をIntに変換してマイナス1した値を受け取る
def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


ascii_lowercase = 'zabcdefghijklmnopqrstuvwxy'
import math
def main():
    n = input_int()

    kazu = len(ascii_lowercase)

    val = []
    temp = n
    while temp > kazu:
        val.append(temp % kazu)
        temp = math.floor(temp / kazu)

    val.append(temp % kazu)

    ans = ""
    for v in val[::-1]:
        ans += ascii_lowercase[v]

    return ans


if __name__ == "__main__":
    print(main())

Submission status: Wrong Answer

Solution code:

N=int(input())

n=26
result =""
characters='abcdefghijklmnopqrstuvwxyz'
while N >= n:
    idx = N%n
    result = characters[idx-1] + result
    N = N//n
idx = N%n
result = characters[idx-1]+result

print(result)

Submission status: Wrong Answer

Solution code:
alp=["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"]
N=int(input())
li=[]
while N>=0:
    na=N%26
    li.append(alp[na])
    if N<=26:
        break
    else:
        N=N//26
ans=""
for i in range(len(li)):
    ans+=li[i]
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
import sys
import string
#from collections import defaultdict, deque, Counter
#import bisect
#import heapq
#import math
#from itertools import accumulate
#from itertools import permutations as perm
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as combr
#from fractions import gcd
#import numpy as np

stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def main():
    n = int(stdin.readline().rstrip())
    #n,k = map(int, stdin.readline().rstrip().split())
    #p = list(map(int, stdin.readline().rstrip().split()))
    #numbers = [[int(c) for c in l.strip().split()] for l in sys.stdin]
    #word = [stdin.readline().rstrip() for _ in range(n)]
    #number = [[int(c) for c in stdin.readline().rstrip()] for _ in range(n)]
    #zeros = [[0] * w for i in range(h)]
    letter = string.ascii_lowercase
    print(letter)
    sho, amari = divmod(n,26)
    if sho == 0:
        print(letter[amari-1])
        exit()
    t = 11
    while True:
        if n > 26**t:
            break
        else:
            t -= 1
    for i in range(t,0,-1):
        sho, amari = divmod(n,26 ** i)
        print(letter[sho-1],end="")
        n = amari
    print(letter[amari-1])




main()

Submission status: Wrong Answer

Solution code:
if __name__ == "__main__":
    n = int(input().strip())

    chars = "abcdefghijklmnopqrstuvwxyz"
    ans = []

    while True:
        if n < 27:
            ans.append(chars[n - 1])
            break

        else:
            tmp = int(n % 26)
            ans.append(chars[tmp - 1])
            n = int(n / 26)

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

Submission status: Wrong Answer

Solution code:
import string
n = int(input())
k=n
co=1
while True:
    if k<=26**co:
        break
    k-=26**co
    co+=1
ans =[]
ans1=[]
for i in range(co):
    ans.append(n%26)
    n=n//26
    
ans.reverse()
for i in ans:
    ans1.append(string.ascii_lowercase[i-1])

print("".join(ans1))

Submission status: Wrong Answer

Solution code:
N=int(input())

ans=""

while True:
    B = N % 26
    A = N // 26
    

    if N<27:
        ans= chr(N+96) + ans
        break
    ans= chr(B+96) + ans

    N = N // 26


print(ans)

Submission status: Wrong Answer

Solution code:
import math

n = int(input())
keta = int(math.log(n)/math.log(26)) + 1
name = [0]*keta

for i in range(keta):
    name[i] = n % 26
    n = n // 26

alp = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']

ans = ''
for j in range(keta):
    if name[j] == 0:
        pass
    else:
        ans = alp[name[j]-1] + ans

#print(name)
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
letters = 'abcdefghijklmnopqrtsuvwxyz'

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

print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
alp=["a","b","c","d","e","f","g","h","i",
     "j","k","l","m","n","o","p","q","r",
     "s","t","u","v","w","x","y","z"]
S=""
while N>0:
  Q=N%26
  N=N//26
  S+=alp[Q-1]
print(S[::-1])

Submission status: Wrong Answer

Solution code:
import math

n = int(input())

su = list("abcdefghijklmnopqrstuvwxyz")

ans = ""
li = []
while True:
    if n <= 26:
        li.append(su[n - 1])
        break
    li.append(su[(n % 26) - 1])
    n = n // 26

print("".join(reversed(li)))

Submission status: Wrong Answer

Solution code:
from decimal import *
n = Decimal(input())
ans = ''
while True:
    q, mod = divmod(n, Decimal('26'))
    ans = (chr(ord('a') + mod-1)) + ans
    if q == 0:
        break
    else:
        n = Decimal(q)
print(ans)

Submission status: Wrong Answer

Solution code:
# import numpy as np  # Pythonのみ！
# from operator import xor
# import re
# from scipy.sparse.csgraph import connected_components  # Pythonのみ！
# ↑cf.  https://note.nkmk.me/python-scipy-connected-components/
# from scipy.sparse import csr_matrix
# import statistics # Pythonのみ
# import string
import unittest
from io import StringIO
import sys
sys.setrecursionlimit(10 ** 5 + 10)


def input(): return sys.stdin.readline().strip()


def resolve():


    def base(n, b, digits="?abcdefghijklmnopqrstuvwxyz"):
        if n==0:
            return 'a'
        
        s=[]
        p=abs(n)
        while p:
            s.append(digits[p%b])
            p//=b
        return ''.join(reversed(s))
    
    n=int(input())
    

    ans=base(n,26)
    print(ans.replace('?','a'))

resolve()

Submission status: Wrong Answer

Solution code:
N = int(input())
digit = 1
for i in range(1,11):
    if N > 26**i:
        digit += 1
        N -= 26**i
    else:
        break
ans = []
for i in reversed(range(digit)):
    ans.append(N//(26**i))
    N -= ans[-1]*(26**i)
ans[-1] -= 1
ans = [chr(i+97) for i in ans]
print("".join(ans))

Submission status: Wrong Answer

Solution code:
num = int(input())

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

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

name_nums = Base_10_to_n(num,26)
name_nums.reverse()

ans = ""
for name_num in name_nums:
    ans += alphabet[name_num-1]

print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
m=n%26 if n%26 !=0 else 26
a.append(m)

while n>26:
  n=n//26
  m=n%26
  a.append(m if m!=0 else 26)
for i in reversed(range(len(a))):
  print(chr(96+a[i]),end="")

Submission status: Wrong Answer

Solution code:
N = int(input())
res = ""

while N > 0:
    res = chr(N % 26 + 0x60) + res
    N //= 26

print(res)

Submission status: Wrong Answer

Solution code:
N = int(input())
D = ["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"]
A = []
while True:
    T = (N-1) % 26
    N = N // 26
    A.append(D[T])
    if N == 0:
        break
A = reversed(A)
print("".join(A))

Submission status: Wrong Answer

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10, gcd
from itertools import permutations, combinations, product, accumulate, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
#from fractions import gcd
from decimal import *
import heapq
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 1, 0, -1, 1, -1, -1, 1]
dy = [1, 0, -1, 0, 1, -1, 1, -1]
debugmode = True

def Base_10_to_n(X, n):
    X_dumy = X
    out = []
    while X_dumy>0:
        n_out = [X_dumy%n]
        n_out.extend(out)
        out = deepcopy(n_out)
        X_dumy = int(X_dumy/n)
    return out

n = INT()
n -= 1
m = Base_10_to_n(n, 26)
#print(m)
for i in range(len(m) - 1):
    m[i] -= 1
ans = ''
for i in m:
    ans += chr(ord('a') + i)
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

n = ni()

def f(k):
    return chr(97+k)

c = 0
i = 1
while True:
    d = c+pow(26,i)
    if c < n <= d:
        break
    c = d
    i+=1

m = n-c-1
ans = ''
while m > 26:
    ans = f(m%26) + ans
    m = m//26
ans = f(m%26) + ans

ans = 'a'*(i-len(ans)) + ans

print(ans)

Submission status: Wrong Answer

Solution code:
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']
N = int(input())
ans = []
while N != 0:
    ans.append(N%26)
    N = N//26
ans.reverse()
S = ''
for i in ans:
    S += A[i-1]
print(S)

Submission status: Wrong Answer

Solution code:
def resolve():
    n = int(input())

    ans = ''
    while n > 0:
        t = n % 26
        t = 26 if t == 0 else t
        ans = chr(t + 96) + ans
        n //= 26
    print(ans)


if 'unittest' not in globals():
    resolve()

Submission status: Wrong Answer

Solution code:
#c
M = int(input())
s=''
a=['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']
while M>26:
    s+=a[M%26]
    M=M-26
s+=a[M%26]
print(s)

Submission status: Wrong Answer

Solution code:
N = int(input())
check = "abcdefghijklmnopqrstuvwxyz"

if N <= 26:
  print(check[N])
  exit(0)
i = 0
keta = 26**i 
while keta < N:
  i += 1
  keta = 26**i
ans = ""
for j in range(i):
  checker = int(N / 26**(i - j -1))
  N = N - checker*26**(i-j-1)
  s = check[checker-1]
  ans = ans + s
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
alpha = "abcdefghijklmnopqrstuvwxyz"
ans = ''
while True:
    ans += alpha[n % 26 - 1]
    n = n // 26
    if n < 1:
        break

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    ans = ''
    while n>0:
        p,q = divmod(n,26)
        n = p
        ans = chr(96+q)+ans
    print(ans)

main()

Submission status: Wrong Answer

Solution code:
N = int(input())
name = []
while N > 26:
    name.append(N%26)
    N = int(N / 26)
name.append(N)

def swap(X):
    if X == 1:
        return "a"
    elif X == 2:
        return "b"
    elif X == 3:
        return "c"
    elif X == 4:
        return "d"
    elif X == 5:
        return "e"
    elif X == 6:
        return "f"
    elif X == 7:
        return "g"
    elif X == 8:
        return "h"
    elif X == 9:
        return "i"
    elif X == 10:
        return "j"
    elif X == 11:
        return "k"
    elif X == 12:
        return "l"
    elif X == 13:
        return "m"
    elif X == 14:
        return "n"
    elif X == 15:
        return "o"
    elif X == 16:
        return "p"
    elif X == 17:
        return "q"
    elif X == 18:
        return "r"
    elif X == 19:
        return "s"
    elif X == 20:
        return "t"
    elif X == 21:
        return "u"
    elif X == 22:
        return "v"
    elif X == 23:
        return "w"
    elif X == 24:
        return "x"
    elif X == 25:
        return "y"
    elif X == 26:
        return "z"

swap_name = []
for i in range(len(name)):
    swap_name.append(swap(name[len(name)-i-1]))
print(*swap_name, sep="")

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=""
while 0 < n:
  d=n%26
  ans=chr(int(d)+96) + ans
  n=(n-d)/26
  
print(ans)

Submission status: Wrong Answer

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def solve():
    N = int(rl())
    
    nums = [1]
    while nums[-1] <= 10 ** 16:
        nums.append(nums[-1] * 26)
    
    ans = []
    for num in reversed(nums):
        if not ans and N < num:
            continue
        div = N // num
        ans.append(chr(ord('a') + div - 1))
        N -= num * div
    print(''.join(ans))


if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
n = int(input())
dog = 1000000000000001
alph_size = 26
ans = []
ord_s = ord("a") -1
num = n
num2 = 0
while True:
  if num < alph_size:
    break
  num2 = num%alph_size
  num = num//alph_size
  alph = chr(ord_s+ num2)
  ans.append(alph)
alph = chr(ord_s+ num)
ans.append(alph)
print("".join(ans[::-1]))

Submission status: Wrong Answer

Solution code:
N = int(input())

a = list()
sho = N
alpha = [i for i in 'abcdefghijklmnopqrstuvwxyz']
if N <= 26:
    a.append(alpha[N-1])
else:
    while sho != 0:
        sho = N // 26
        amari = N % 26
        a.append(alpha[amari-1])
        N = N // 26

a.reverse()
print(''.join(a))

Submission status: Wrong Answer

Solution code:
N = int(input())
n = N
alp = 'zabcdefghijklmnopqrstuvwxyz'
record = []
while n / 26 > 1:
    record.append(n%26)
    n = n // 26
record.append(n%26)

rec = ''.join([ alp[record[r]] for r in range(len(record)-1, -1, -1)])
print(rec)

Submission status: Wrong Answer

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

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


print(dfs(N)[::-1])

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n):
    res = [None] * n
    for i in range(n):
        res[i] = II()
    return res
def LIR(n):
    res = [None] * n
    for i in range(n):
        res[i] = LI()
    return res
def FR(n):
    res = [None] * n
    for i in range(n):
        res[i] = IF()
    return res
def LFR(n):
    res = [None] * n
    for i in range(n):
        res[i] = IF()
    return res
def LIR_(n):
    res = [None] * n
    for i in range(n):
        res[i] = LI_()
    return res
def SR(n):
    res = [None] * n
    for i in range(n):
        res[i] = S()
    return res
def LSR(n):
    res = [None] * n
    for i in range(n):
        res[i] = LS()
    return res
mod = 1000000007
inf = float('INF')

#solve
def solve():
    n = II()
    ans = []
    while n:
        x = (n-1) % 26
        n //= 26
        ans.append(chr(x + ord("a")))
    print("".join(ans[::-1]))
    return


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

Submission status: Wrong Answer

Solution code:
n = int(input())
i = 1
a = []
b = pow(26,i)
while n // b > 0:
    a.append(n % b)
    n = n // b 
    i += 1
a.append(n)
a = list(reversed(a))
moji = ""
for i in range(len(a)):
    moji+= chr(a[i] + 96)
print(moji)

Submission status: Wrong Answer

Solution code:
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)
############################
n=int(input())
ans=[]
num2alpha = lambda c: chr(c+64).lower()
while True:
  ans.append(num2alpha(n%26))
  n=n//26
  if n==0:
    break
for i in range(len(ans)):
  print(ans[-1-i], end='')
print()

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
while n>0:
    b=n%26
    if b==0:
        b=26
    c=lambda b:chr(b+64)
    a.append(c(b))
    n//=26
d=len(a)
e=[]
for i in range(d):
    e.append(a[-1-i])
ans=''.join(e)
ans=ans.lower()
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = ''
while n > 0:
    if n % 26 == 0:
        ans = chr(ord('a') + 25) + ans
    else:
        ans = chr(ord('a') + (n % 26) - 1) + ans
    if n == 26:
        break
    n //= 26
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=''
while n:
  ans+=chr((n-1)%26+ord('a'))
  n//=26
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=[]
while n>26:
	ans.append(n%26)
	n=n//26
ans.append(n)
ans=ans[::-1]
for a in ans:
	print(chr(a+96),end="")

Submission status: Wrong Answer

Solution code:
n = int(input())

out = ""

from string import ascii_lowercase

while n:
    out = ascii_lowercase[n % 26 - 1] + out
    n //= 26

print(out)

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
    ans.append(alpha[n - 1])
# print(ans)
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
n = int(input())

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

ans = ''
idx = 1
while True:
    # print(n)
    # print(n % 26)
    ans += alphabet[n % 26 - 1]
    # n -= n % 26
    n -= 26 ** idx
    idx += 1
    if n <= 0:
        break

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input().strip()) 
s = ''
while n >= 26:
  s = chr(((n - 1) % 26) + 97) + s
  n = n // 26
s = chr(((n -1) % 26) + 97) + s
print(s)

Submission status: Wrong Answer

Solution code:
n = int(input())

t = n
ans = ''
while t > 26:
    num = t % 26
    ans += chr(t % 26 + 96)
    t = int(t / 26)

ans += chr(t + 96)
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
al = [chr(i) for i in range(97, 97+26)]
ans = ""
while True:
    temp = N % 26
    ans = al[temp-1] + ans
    if N // 26 == 0:
        break
    else:
        if N == 26:
            break
        N = N // 26

print(ans)