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
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
else:
    len=0

while len >= 0:
    if N // len_list[len] > 0:
        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 numpy as np
def resolver(N):
    N = N -1
    digits = "abcdefghijklmnopqrstuvwxyz"
    number = []
    if N < 26:
        return digits[N]
    while True:
        tmp = N % 26
        number.append(tmp)
        N = N // 26
        if N == 0:
            break
    
    
    number = np.array(number)
    #print(number)
    number[1:] -= 1
    #print(number)
    
    ans = "".join([digits[i] for i in reversed(number)])
    return ans

def test():
    for i in range(25, 30):
        ans = resolver(i)
        print(f"i={i} ans={ans}")
def main():
    #test()
    N = int(input())
    ans = resolver(N)

    print(ans)

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, 0, 0)
use_num = num
res_list = []
tmp_k = use_k
for i in range(use_k):
  tmp_k -= 1
  use_div = 26 ** tmp_k
  res_list.append(chr(96 + (use_num // use_div)))
  use_num = use_num % use_div

print("".join(res_list))

Submission status: Wrong Answer

Solution code:
N=int(input())
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"]
b=N%26
ans = a[b-1]
N=N//26
while N>=26:
  b=N%26
  ans=a[b-1]+ans
  N=N//26
if N<26:
  ans=a[N-1]+ans 
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

print(num2alpha(N))

Submission status: Wrong Answer

Solution code:
import string
import math
alf = string.ascii_lowercase
x = int(input())

def nencode(num, chars = alf):
  str = ""
  while num != 0:
    str = chars[int(num % len(chars))-1] + str
    num = num - num % len(chars)
    num = num / len(chars)
  return str

print(nencode(int(x)))

Submission status: Wrong Answer

Solution code:
N = int(input())
if N == 26:
    print('z')
    exit()
elif N == 702:
    print('zz')
    exit()
elif N == 18278:
    print('zzz')
    exit()
elif N == 475254:
    print('zzzz')
    exit()
elif N == 12356630:
    print('zzzzz')
    exit()
elif N == 321272406:
    print('zzzzzz')
    exit()
elif N == 8353082582:
    print('zzzzzzz')
    exit()
elif N == 217180147158:
    print('zzzzzzzz')
    exit()
elif N == 5646683826134:
    print('zzzzzzzzz')
    exit()
elif N == 146813779479510:
    print('zzzzzzzzzz')
    exit()
L = [26**i for i in range(0,12)]
for i in range(1,11):
    L[i] += L[i-1]
a = 0
while N // L[a] >= 1:
    a += 1
A = []
for i in range(a):
    A.append(N % 26)
    N = N // 26
d = {}
d[0] = 'z'
for i in range(1,27):
    d[i] = chr(96+i)
ans = ''
for i in range(-1,-len(A)-1,-1):
    ans += d[A[i]]
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
from io import StringIO
import unittest
import math

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

    alphabets = [chr(ord('a') + x) for x in range(26)]

    ans = []
    h = 0
    tmp = 0

    while 1:
        tmp += 26 ** h
        if n >= tmp:
            h += 1
        else:
            break

    for hh in range(h - 1, -1, -1):
        tmp = n // (26 ** hh)
        if tmp > 26:
            tmp = 26
        ans.append(alphabets[tmp - 1])
        n -= tmp * (26 ** hh)

    print(''.join(ans))


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """2"""
        output = """b"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """27"""
        output = """aa"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """123456789"""
        output = """jjddja"""
        self.assertIO(input, output)


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Wrong Answer

Solution code:
alpha='zabcdefghijklmnopqrstuvwxy'

n = int(input())

a = list()
for i in range(11,0,-1):
  k = n // 26**i
  a.append(k)
  m = n %  26**i  
  n = m
  
a.append(n)

flg = False
for j in a:
  if j != 0:
    flg = True
  if flg :
    print(alpha[j],end='')
print()

Submission status: Wrong Answer

Solution code:
def Base_10_to(Xn, n):
    x = Xn
    li = []
    while x > 0:
            ans = x % n
            li.append(ans)
            x = int(x / n)
    li.reverse
    return li

a = int(input())
cli = [chr(i) for i in range(97, 97+26)]
ili = []

ans = []
str = ''
ili = Base_10_to(a, 26)
for i in range(len(ili)):
    str += cli[ili[i] - 1]
rstr = str[::-1]
print(rstr)

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

while True:
    b = n % 26
    ln.append(alphabet[b-1])

    if n <= 26:
        break

    a = n // 26
    n = a

ln.reverse()
ln=''.join(ln)
print(ln)

Submission status: Wrong Answer

Solution code:
N=int(input())

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

name=[]

for i in range (20):
    _=N%26
    name.insert(0,a[_])
    N=N//26
    if N==0:
        break

print(''.join(name))

Submission status: Wrong Answer

Solution code:
import string

def main():
    N=int(input())
    alphabet = string.ascii_lowercase
    a = [26**(12-i) for i in range(12)]
    ans = []
    print(a)
    for i in range(12):
        if N > a[i]:
            if N // a[i] == 0:
                continue
            tmp = N // a[i]
            N -= (a[i]*tmp)
            ans.append(alphabet[tmp-1])
    ans.append(alphabet[N-1])
    print(''.join(ans))

main()

Submission status: Wrong Answer

Solution code:
n= int(input())

azlist = list('abcdefghijklmnopqrstuvwxyz')
ans = ''
for i in range(10000):
  ans = azlist[n%26 - 1] + ans
  n = n//26
  if n ==0:
    break

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
res = n % 26

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

ans = []
while n//26 > 0 :
  res = n % 26
  if res != 0:
    ans.append(A[res-1])
  elif res == 0:
    ans .append(A[25])
  n = n // 26

#print(n)
if n != 0:
  ans.append(A[n-1])

  
print(*ans[::-1], sep='')

Submission status: Wrong Answer

Solution code:
N = int(input())
m = 0
for i in range(1,15):
    if N <= 26**i:
        keta = i
        break


Ans = []
m = 0
for j in range(keta-1,-1,-1):
    for k in range(1,28):
        if N < m + k*26**(j):
            Ans.append(chr(96+k-1))
            m += (k-1)*26**(j)
            break

print(''.join(Ans))

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=""
while n>26:
    rem=n%26
    if rem==0:
        ans+="z"
        div=1
        while div<n:
            div*=26
        div//=26
        n-=div
        continue
    n//=26
    ans+=chr(rem+96)
ans+=chr(n+96)
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n = int( input() )
 
l = []
a = 97
alp = 26
k = 1
n2 = n
while n >= k + 1:
  l.append( ( n2 - 1 ) % alp  )
  n2 = ( n2 - n2 % alp ) // alp
  k *= alp
print(l)
ret = ""
for c in reversed( l ):
  ret += chr( a + c )
print( ret )

Submission status: Wrong Answer

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

count = 0
for i in range(1,100):
    if n >= 26 ** i:
        n = n - 26 ** i
        count += 1
    else:
        break

a = []
b = list('abcdefghijklmnopqrstuvwxyz')
#print(n,count,n // (26 ** A5))
count2 = 0


while 1:
    #print(n)
    #print(n,count,a)
    if count == 0:
        a.append(n-1)
        break
    count2 = n // (26 ** count)
    n = n % 26 ** count
    a.append(count2)
    count -= 1

#print(n)
x = [b[a[i]]for i in range(len(a))]
print("".join(x))

Submission status: Wrong Answer

Solution code:
n = int(input())
res = ''
while n > 1:
    res='zabcdefghijklmnopqrstuvwxy'[n%26]+res
    n=n//26
print(res)

Submission status: Wrong Answer

Solution code:
# 26^2 = 676
# 702 - 26 = 676

# 1,000,000,000,000,001

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

def main():
    n = int(input())
    result = ""

    i = 11
    while n > BASE:        
        quotient = n // (BASE ** i)
        remain = n % (BASE ** i)

        if quotient >= 1:
            result = result + ALPHABETS[quotient-1]

        n = remain
        i -= 1

    result = result + ALPHABETS[n-1]
    
    print(result)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
word = ''
while n:
    a ,b = divmod(n, 26)
    word += (chr(96 + b))
    n = a
print(word[::-1])

Submission status: Wrong Answer

Solution code:
from decimal import Decimal
abc=['','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=""
n=Decimal(input())
for i in reversed(range(0, 11)):
    S+=abc[int(n//26**i)]
    n-=(n//26**i)*(26**i)
print(S)

Submission status: Wrong Answer

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

n = int(input())
t = 0
i = 1

if n <= 26:
    s = n
else:
    while True:
        if t+26**i > n:
            break
        t += 26**i
        i += 1

    s = n-t

res = []
ans = ''

if s == 0:
    i -= 1
    s = 26**i
    ans = 'z'*i
else:
    while True:
        if i == 0:
            break
        if i != 1:
            res.append(s//(26**(i-1)))
        elif i == 1 and s != 0:
            res.append(s//(26**(i-1))-1)
        s = s%(26**(i-1))
        i -= 1

    for i in range(len(res)):
        ans += chr(97+(res[i]))

print(ans)

Submission status: Wrong Answer

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

def f(N, l):
    l.append(N % 26)
    if N // 26:
        return f(N // 26, l)
    return l[::-1]

l1 = f(N, l1)
ans = ""
for c in l1:
    if c:
        ans += chr(96 + c)
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
h = []
na = ["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 = ""

if n < 26:
    h.append(n)
else:
    while n >= 27:
        tmp = n%26
        n //= 26
        h.append(tmp)
    if n != 0:
        h.append(n)

h = h[::-1]
if h[-1] == 0:
    h.pop(-1)
    for i in h:
        name += na[-i]
else:
    for i in h:
        name += na[i-1]

print(name)

Submission status: Wrong Answer

Solution code:

import glob
import os

bn = os.path.basename(__file__).split('.')[0]
dn = os.path.dirname(__file__).split('/')

# 問題ごとのディレクトリのトップからの相対パス
REL_PATH = dn[len(dn)-2] + '\\' + dn[len(dn)-1] + '\\' + bn

# テスト用ファイル置き場のトップ
TOP_PATH = 'C:\\AtCoder'

class Common:

    problem = []
    index = 0

    def __init__(self, rel_path):
        self.rel_path = rel_path

    def initialize(self, path):
        file = open(path)
        self.problem = file.readlines()
        self.index = 0
        return

    def input_data(self):
        try:
            IS_TEST
            self.index += 1
            return self.problem[self.index-1]

        except NameError:
            return input()

    def resolve(self):
        pass

    def exec_resolve(self):
        try:
            IS_TEST
            for path in glob.glob(TOP_PATH + '\\' + self.rel_path + '/*.txt'):
                print("Test: " + path)
                self.initialize(path)
                self.resolve()
                print("\n\n")
        except NameError:
            self.resolve()


class Solver(Common):

    def resolve(self):

        N = int(self.input_data())
        dog_num = 1000000000000001
        alp = 'abcdefghijklmnopqrstuvwxyz'

        name = ''
        for i in range(12, -1, -1):
            n = N // (26 ** i)
            if n != 0:
                name = name + alp[n-1]
            elif name != '':
                name = name + 'a'
            N = N % (26 ** i)

        print(name)

solver = Solver(REL_PATH)
solver.exec_resolve()

Submission status: Wrong Answer

Solution code:
import string

def run(n):
    '''
    '''
    _base_array = string.ascii_lowercase
    results = []
    while n > 0:
        results.append(_base_array[n%26 - 1])
        n = n//26

    print(''.join(results[::-1]))



if __name__ == '__main__':
    n = int(input())
    run(n)

Submission status: Wrong Answer

Solution code:
li = list("aabcdefghijklmnopqrstuvwxyz")
ans = ""

N = int(input())

for i in range(11):
    mm = N%26
    N = N//26
    ans = li[mm]+ans
    # print(ans,mm)
    if N==0:
        break
print(ans)

Submission status: Wrong Answer

Solution code:
import string
characters = string.ascii_letters
 
def base_cvt(value, n=2):
    try:
        tmp = int(value)
    except:
        raise ValueError('Invalid value:', value)
 
    if n < 2 or n > len(characters):
        raise ValueError('Invalid n:', value)
 
    result = ''
    tmp = int(value)
    while tmp >= n:
        idx = tmp%n
        result = characters[idx] + result
        tmp = int(tmp / n)
    idx = tmp%n
    result = characters[idx] + result
    return result

def rot_n(s, n):
    answer = ''
    for letter in s:
        answer += chr(ord('A') + (ord(letter)-ord('A')+n) % 26)

    return answer

N = int(input())

tmp = base_cvt(N-1,26)
tmp = rot_n(tmp.upper(),-1)
tmp = tmp[:-1]+rot_n(tmp[-1],1)
print(tmp.lower())

Submission status: Wrong Answer

Solution code:
alpha='zabcdefghijklmnopqrstuvwxy'

n = int(input())

a = list()
for i in range(10,0,-1):
  k = n // 26**i
  a.append(k)
  m = n %  26**i  
  n = m
  
a.append(n)

flg = False
for j in a:
  if j != 0:
    flg = True
  if flg :
    print(alpha[j],end='')
print()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
alphabetlist=['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 ind(b,n):
    if n==0:
        return 0
    res=0
    while n>=b**res:
        res+=1
    return res-1

N=int(input())
if N==1:
    print("a")
    exit()
ans=[]
L=-1
a=ind(26,N)
if N==26**a:
    L=a
else:
    L=a+1

for i in range(L):
    N-=26**i

ans=[]
for i in range(L-1,-1,-1):
    q=N//(26**i)
    ans.append(alphabetlist[q])
    N=N-q*(26**i)

print("".join(ans))

Submission status: Wrong Answer

Solution code:
# @author 

import sys

class COneQuadrillionAndOneDalmatians:
    def solve(self, tc=0):
        n = int(input()) - 1
        sz = 1
        while 26 ** sz <= n:
            sz += 1

        # relative = n - 26 ** (sz - 1)
        relative = n
        ans = ""
        ind = sz
        while ind > 0:
            # print(relative, ind)
            ind -= 1
            relative = relative - (26 ** (ind) if ind > 0 else 0)
            k = (relative // (26 ** ind))
            # print(k)
            ans += chr(ord('a') + k)
            relative %= 26 ** ind
            # relative -= 26 ** ind

        print(ans)

solver = COneQuadrillionAndOneDalmatians()
input = sys.stdin.readline

solver.solve()

Submission status: Wrong Answer

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

wari_lis = [26**i for i in range(1,12)]
#print(wari_lis)
if a in wari_lis:
    ll = wari_lis.index(a)+1
    ans += 'z'*ll
    print(ans)
    exit()

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 l in lis:
    ans += tmp[int(l)-1]
print(ans)

Submission status: Wrong Answer

Solution code:
import string

def numberToBase(n, b):
    if n == 0:
        return [0]
    digits = []
    while n:
        digits.append(int(n % b))
        n //= b
    return digits[::-1]

letters = {}
for x, y in zip(range(1, 27), string.ascii_lowercase):
    letters[x] = y

def toLetter(x):
    return letters[x]

print(''.join(list(map(toLetter, numberToBase(123456789, 26)))))

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:
N=int(input())
c=[]
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']
while N>=26:
  n=N%26
  N//=26
  c.insert(0,alpha[n-1])
  
if N!=0:
  c.insert(0,alpha[N-1])
  
c=''.join(c)
print(c)

Submission status: Wrong Answer

Solution code:
import sys
n=int(input())
p=n
a=[]
cnt=0

if n<=26:
    print(chr(n+96))
    sys.exit()
while p>0:
    p=p//26
    cnt+=1


#print(n)
for i in range(cnt-1):
    q,r=divmod(n,26**(cnt-i-1))
    a.append(q)
    n=r
if n<=25:
    a.append(n)
    
    
#print(cnt,a)
for i in range(len(a)-1,0,-1):
    if a[i]==0:
        a[i]+=26
        a[i-1]-=1
#print(a)
if a[0]==0:
    a=a[1:]
eigo=[chr(i) for i in range(97,123)]    
for i in a:
    print(eigo[i-1],end="")

Submission status: Wrong Answer

Solution code:
import string
numbers = "0123456789"
alphabets = string.ascii_letters  # a-z+A-Zをロード
characters = numbers + alphabets


def base_cvt(value, n=2):
    tmp = int(value)

    if n < 2 or n > len(characters):
        raise ValueError('Invalid n:', value)

    result = ''
    tmp = int(value)
    while tmp >= n:
        idx = tmp % n
        result = characters[idx] + result
        tmp = int(tmp / n)
    idx = tmp % n
    result = characters[idx] + result
    return result


N = int(input())

res = base_cvt(N, 26)
if res[-1] == "0":
    res = "q" * (len(res)-1)
for d in str(res):
    if ord(d) >= 96:
        d = 9 + ord(d) - 96
    print(chr(96 + int(d)), end="")
print()

Submission status: Wrong Answer

Solution code:
N = int(input())
alp = [chr(i) for i in range(97,97+26)]
digits = "0123456789abcdefghijklmnopqrstuvwxyz"

import string
numbers = "0123456789"
alphabets = string.ascii_letters # a-z+A-Zをロード
characters = numbers + alphabets
 
def base_cvt(value, n=2):
    try:
        tmp = int(value)
    except:
        raise ValueError('Invalid value:', value)
 
    if n < 2 or n > len(characters):
        raise ValueError('Invalid n:', value)
 
    result = ''
    tmp = int(value)
    while tmp >= n:
        idx = tmp%n
        result = characters[idx] + result
        tmp = int(tmp / n)
    idx = tmp%n
    result = characters[idx] + result
    return result

ans = []

for d in base_cvt(N,26):
    ans.append(alp[int(digits.index(d))-1])
    
print("".join(ans))

Submission status: Wrong Answer

Solution code:
N = int(input())
α = ['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 = []
while N > 26:
    n = N%26
    ans.append(α[n-1])
    N = N//26
else:
    ans.append(α[N-1])
new_ans = ans[::-1]
print(''.join(new_ans))

Submission status: Wrong Answer

Solution code:
def num2alpha(num):
    if num<=26:
        return chr(96+num)
    else:
        return num2alpha(num//26)+chr(96+num%26)

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

Submission status: Wrong Answer

Solution code:
n = int(input())
c = [chr(ord('a') + i) for i in range(26)]
word = ""
while(n != 0):
    q = n % 26 - 1
    word = c[q] + word
    if n == 26:
        break
    n = int(n / 26)
print(word)

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

text = ''
div = 0
for i in range(11, 0, -1):
    div = n//(26**i)
    n = n % (26**i)
    text += alphabet[div]
    if n < 26:
        text += alphabet[n]
        break
print(text)

Submission status: Wrong Answer

Solution code:
N = int(input())
resulter = "abcdefghijklmnopqrstuvwxyz"
# NS = str(N)

hoge = []
count = 10
while True:
    re = pow(26, count)
    if N > re:
        tmp = N // re
        hoge.append(resulter[tmp - 1])
        N = N - re * tmp
        # count = 10

    count = count - 1
    if count < 1:
        hoge.append(resulter[N - 1])
        break


print("".join(hoge))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
n_new = n
out = []
while n_new > 0:
  out.insert(0, str(n_new % 26))
  n_new = int(n_new / 26)
ans = ''
for i in out:
  ans = ans + chr(64 + int(i))
print(ans.lower())

Submission status: Wrong Answer

Solution code:
x = int(input())

alphbet = lambda c: chr(c+64)

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

out = Base_10_to_n(x, 26)
print( "".join(alphbet(i) for i in out).lower() )

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=""
l=[26,26**2,26**3,26**4,26**5,26**7,26**8,26**9,26**10]
s=[0]

tt=0
for i in range(9):
    tt+=l[i]
    s.append(tt)
s.sort(reverse=True)
l.sort(reverse=True)
tmp=n
for i in range(9):
    if n>s[i]:
        flg=False
        k=tmp//l[i]
        if k>26:
            k=26
            flg=True
        kk=chr(k+64).lower()
        tmp=tmp%l[i]
        if flg:
            tmp+=l[i]
        ans=ans+kk
ans=ans+chr(tmp+64).lower()
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]
            ans = ans[::-1]
            print(ans)
            break

Submission status: Wrong Answer

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

n = int(input())
t = 0
i = 1

if n <= 26:
    s = n
else:
    while True:
        if t+26**i > n:
            break
        t += 26**i
        i += 1

    s = n-t

res = []
ans = ''

if s == 0:
    s = 26**i
    ans = 'z'*i
else:
    while True:
        if i == 0:
            break
        if i != 1:
            res.append(s//(26**(i-1)))
        elif i == 1 and s != 0:
            res.append(s//(26**(i-1))-1)
        s = s%(26**(i-1))
        i -= 1

    for i in range(len(res)):
        ans += chr(97+(res[i]))

print(ans)

Submission status: Wrong Answer

Solution code:
def calc(num):
    if num % 26 != 0:
        res.append(num % 26)
    else:
        res.append(26)

    if num // 26 > 0 and num != 26:
        calc(num // 26)

def printres():
    for obj in reversed(res):
        print(dic[obj], end="")

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

res = []


N = int(input())

calc(N)

printres()
print()

Submission status: Wrong Answer

Solution code:
n = int(input())
alphabet = [chr(i) for i in range(97, 123)]
ans = list()
for i in reversed(range(12)):
    if (x := n // (26 ** i)) == 0:
        pass
    else:
        ans.append(alphabet[x - 1])
        n -= 26 ** i * x
print("".join(ans))

Submission status: Wrong Answer

Solution code:
import math as mt
import collections as cc
I=lambda:list(map(int,input().split()))
ans=[]
prev=0
for i in range(1,15):
    ans.append(26**i+prev)
    prev+=26**i
    
n,=I()
p=0
s='abcdefghijklmnopqrstuvwxyz'
f={}
for i in range(1,27):
    f[i]=s[i-1]
for i in range(len(ans)):
    p+=1
    if n<=ans[i]:
        break
an=''
f[0]='z'
for i in range(p):
    an+=f[n%26]
    n//=26
print(an[::-1])

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys
import math
import numpy as np
import functools
import operator
import collections
import itertools

N=int(input())
ban=N
ANS=[]
A=[chr(i) for i in range(97, 97+26)]
#print(A[25])
if N<=26:
    print(A[N-1])
    sys.exit()
for i in range(N):
    ban=N//26
    amari=N%26
    if amari==0:
        ANS.append(A[26-1])
    if amari>=1:
        ANS.append(A[amari-1])
    
    if ban<=27:
        if ban==27:
           ANS.append(A[26-1]) 
         
        if ban<27:
            ANS.append(A[ban-1])
            
        
        ANS.reverse()
        ans="".join(ANS)
        
        print(ans)
        sys.exit()
    N=ban
    
#print(A[25])