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:
from string import ascii_lowercase

n = int(input())
name = ''

while n // 26 != 0:
    name = ascii_lowercase[(n % 26) - 1] + name
    n //= 26
else:
    name = ascii_lowercase[(n % 26) - 1] + name

print(name)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = []
while n != 0:
    o = chr(n%26 +96)
    ans.append(o)
    n //= 26
ans = reversed(ans)
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
N = int(input())

res = []
while N != 0:
    p = N % 26
    N = N // 26
    res.append(chr(p + 96))

res.reverse()
result = ''.join(res)
print(result)

Submission status: Wrong Answer

Solution code:
n = int(input())

c = ord("a")
l = ""
while not n < 26:
    b = n//26
    a = n-26*b
    n = b
    l = l+chr(c+a-1)
l = l+chr(c+n-1)
print(l[::-1])

Submission status: Wrong Answer

Solution code:
n= (int)(input())
ans = ""
for i in range(11, 0, -1):
  if n // (26 ** i) != 0:
    ans += chr(n // (26 ** i) + 96)
    n -= n // (26 ** i) * (26 ** i)
ans += chr(n % 26 + 96)
print(ans)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

import sys
import pprint

sys.setrecursionlimit(10 ** 6)

class Logger:
	def __init__(self, debug):
		self.debug = debug
	def print(self, *args):
		if self.debug:
			pprint.pprint(args)


def main():
	log = Logger(0)
	n = int(sys.stdin.readline())
	d = "abcdefghijklmnopqrstuvwxyz"
	s = ""
	while n != 0:
		log.print(n % 26, n // 26)
		s += d[n % 26 - 1]
		n //= 26
	print(s[::-1])


main()

Submission status: Wrong Answer

Solution code:
from collections import deque

N = int(input())
mod = 26
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']
num = deque([])

while N // 26 != 0:
    num.appendleft(N % 26)
    N = N // 26

num.appendleft(N)
num_lis = list(num)

for i in range(len(num_lis)):
    num_lis[i] = alphabet[num_lis[i] - 1]

print(''.join(num_lis))

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

L = []

while n > 26:
    L.append(n%26-1)
    n =n//26

L.append(n-1)

ans = ""
for l in L:
    ans = A[l] + ans

print(ans)

Submission status: Wrong Answer

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

#n = int(input())
#l = list(map(int, input().split()))

'''
a=[]
b=[]
for i in range():
    A, B = map(int, input().split())
    a.append(A)
    b.append(B)'''
"""
n=int(input())
aa=n%26
n//=26
cnt=0
while aa>1:
    n//=26
    cnt+=1
"""
n=int(input())
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

n26=Base_10_to_n(n,26)
aa=n26.split()
ax=[]
for i in range(len(aa)):
    ax.append(chr(int(aa[i])+96))
print("".join(ax))

Submission status: Wrong Answer

Solution code:
To_Acill = 96

N = int(input())

ans = []

jou26 = 1
while N > 0:
    tmp = N % (jou26*26)
    ans.append(chr(To_Acill + tmp//jou26))
    N = N-tmp
    jou26 = jou26*26

print("".join(reversed(ans)))

Submission status: Wrong Answer

Solution code:
N=int(input())

orig=96

ch=[]

while(True):
    if N<1:
        break
    else:
        num=N%26
        ch.append(num)
        N=N//26

string=""
for i in ch[::-1]:
    if i!=0:
        string=string+chr(i+orig)

print(string)

Submission status: Wrong Answer

Solution code:
import re
def main():
    n = int(input())
    ans = []
    while n // 26 > 0:
        ans.append(chr(96 + n%26))
        n = n // 26
    ans.append(chr(96 + n%26))
    ans.reverse()
    print("".join(ans))
    return 

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = ""

digit_count = 0
n = N - 1

while n > 0:
    digit_count += 1
    n //= 26

n = N

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

print(ans)

Submission status: Wrong Answer

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

ans=""
while N>=26:
  a=N%26
  N=N//26
  ans=alpha[a-1]+ans
ans=alpha[N-1]+ans
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())

def Base_10_to_n(X, n):
    list_26 = []
    X_dumy = X
    out = ''
    while X_dumy>0:
        list_26.append(X_dumy%n)
        out = str(X_dumy%n)+out
        X_dumy = int(X_dumy/n)
    list_26.reverse()
    return list_26

x10 = n
list_26 = Base_10_to_n(x10, 26)

num2alpha = lambda c: chr(c+64)

ans = ''
for i in range(len(list_26)):
    ans += str(num2alpha(list_26[i]))

print(ans.lower())

Submission status: Wrong Answer

Solution code:
n = int(input())
cnt = 1
now = 0
while now < n:
    now += 26 ** cnt
    cnt += 1
cnt -= 1
ans = ""
for i in range(cnt):
    ans += str(chr(ord("a")+n%26-1))
    n -= n%26
    n //= 26
anss = ""
for i in range(len(ans)):
    if ord(ans[i]) < ord("a"):
        anss += chr(ord(ans[i])+26)
    else:
        anss += ans[i]
print(anss[::-1])

Submission status: Wrong Answer

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

a = int(input())

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

l = Base_10_to_n(a,26)

l2 = [chr(x + 96) for x in l]

print("".join(l2))

Submission status: Wrong Answer

Solution code:
n=int(input())
hoge=[]
alf="abcdefghijklmnopqrstuvwxyz"
for i in range(15):
  hoge.append(n%26)
  n=n//26
hoge=hoge[::-1]
for i in range(len(hoge)):
  if(hoge[i]!=0):
    print(alf[hoge[i]-1],end="")

Submission status: Wrong Answer

Solution code:
n = int(input())
a = "abcdefghijklmnopqrstuvwxyz"
now = 0
tnp = 0
for i in range(1,1000):
    x = now + 26**i
    if (n<=x):
        tnp = i
        break
    now = x
x = n - now
ans = ""
for i in range(i):
    if i==0:
        ans = a[(x-1)%26] + ans
    else:
        ans = a[x%26] + ans
    x //= 26
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
alp = [chr(i) for i in range(97,97+26)]
ans = ''
while N:
    B = N%26-1
    ans += alp[B]
    N //=26
print(''.join(ans[::-1]))

Submission status: Wrong Answer

Solution code:
import string


N = int(input())
S = string.ascii_lowercase

ans = ''
if N <= 26:
    ans = S[N - 1]

while N > 26:
    N, b = divmod(N, 26)
    ans = S[b - 1] + ans

    if N <= 26:
        ans = S[N - 1] + ans
        break

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

a = (N-1)//26
b = N%26
ans = ''
while a!=0:
  ans = chr(b+96) + ans
  b = a%26
  a = (a-1)//26

  
ans = chr(b+96) + ans
print(ans)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import Fraction               # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79e+308
    # inf = 2 ** 63 - 1             # (for fast JIT compile in PyPy) 9.22e+18
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def isp():   return input().split()
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())

    def convert_to_alpha(num):
        if num == 26:
            return 'z'
        return chr(ord('a') + (num-1))
    
    
    n = ii()    # 0 start
    L = []
    while n:
        res = n % 26
        L.append(convert_to_alpha(res))
        n //= 26
    L.reverse()
    print(''.join(L))



if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
alpha = "zabcdefghijklmnopqrstuvwxy"
ans = ""
while N > 0:
    ans = alpha[N%26] + ans
    N = N // 26
print(ans)

Submission status: Wrong Answer

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

N=int(input().rstrip('\n'))
alpha = [chr(i) for i in range(ord('a'), ord('z')+1)]
res = []
rest = N
for i in range(N):
  N1 = rest % 26
  rest = rest//26
  res.append(alpha[N1-1])
  if rest == 0:
    break
print(''.join(res[::-1]))

Submission status: Wrong Answer

Solution code:
N = int(input())

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

print(res)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = []
while N > 0:
    ans.append(N%26)
    N //= 26
#if N > 0: ans.append(N)
print("".join([chr(ord('a') + x-1) for x in reversed(ans)]))

Submission status: Wrong Answer

Solution code:
N = int(input())

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

print(base10to(N, 26))

Submission status: Wrong Answer

Solution code:
n=int(input())
dict={}
s='zabcdefghijklmnopqrstuvwxy'
for i in range(len(s)):
    dict[i]=s[i]

cnt=0
ans=""
while True:
    ans=dict[(n%26)*(26**cnt)]+ans
    n//=26
    if n==0:
        break
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

name_len = 1

index = 1
while pow(26,index) < N:
    name_len+=1
    index += 1

ans = []
for i in range(name_len):
    ans.append(chr((N%26) + ord('a') - 1))
    N = N//26

ans.reverse()
print(''.join(list(ans)))

Submission status: Wrong Answer

Solution code:
N = int(input())
chars = "abcdefghijklmnopqrstuvwxyz"
result = []

while N != 0:
    temp = N % 26

    result.append(chars[temp - 1])
    N = N // 26

print("".join(reversed(result)))

Submission status: Wrong Answer

Solution code:
N = int(input())
def change(x):
    return chr(ord('a')+int(x)-1)
def helper(N,x):
    if (int(N/x)):
        return helper(int(N/x),x)+change(N%x)
    return change(N%x)
print(helper(N,26))

Submission status: Wrong Answer

Solution code:
N = int(input())


def Base_10_to_n(X, n):
    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']
    X_dumy = X
    out = ''
    while X_dumy>0:
        num_26 = X_dumy % n
        out = str(alphabet[num_26-1]) + out
        X_dumy = int(X_dumy/n)
    return out


print(Base_10_to_n(N, 26))

Submission status: Wrong Answer

Solution code:
def resolve():
    # 1000000000000001
    S = "abcdefghijklmnopqrstuvwxyz"
    N = int(input())
    A = []
    while True:
        N, a = divmod(N, 26)
        A.append(a)
        if N <= 1:
            break
    if N > 0:
        A.append(N)
    for a in reversed(A):
        print(S[a - 1], end="")
    print()

resolve()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys

al = "abcdefghijklmnopqrstuvwxyz"

def solve(N: int):
    i = 1
    n = ""
    while(N>0):
        n = al[N % 26 -1] + n
        N = N //26
    print(n)

    

    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 19
MOD = 10 ** 9 + 7
EPS = 10 ** -10

N = INT()

ans = ''
while N > 0:
    d, m = divmod(N, 26)
    ans += chr(m+96)
    N = d
ans = ans[::-1]
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())

niroku=[]
for i in range(100):
    if(n==0):
        break
    niroku.append(n%26)
    n//=26

ans=""
for ni in niroku:
    ans=chr(96+ni)+ans
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
A = 'abcdefghijklmnopqrstuvwxyz'
ANS = []

while n > 0:
    r = n % 26
    ANS.append(r)
    n = n // 26

ANS = reversed(ANS)

for a in ANS:
    print(A[a-1], end="")

Submission status: Wrong Answer

Solution code:
To_Acill = 96

N = int(input())

ans = []

jou26 = 1
while N > 0:
    tmp = N % (jou26*26)
    print(tmp)
    ans.append(chr(To_Acill + tmp//jou26))
    N = N-tmp
    jou26 = jou26*26

print("".join(reversed(ans)))

Submission status: Wrong Answer

Solution code:
N = int(input())
abc = ["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"]
result = []
while N > 0:
    result += [abc[N % 26]]
    N = N // 26
print("".join(result[::-1]))

Submission status: Wrong Answer

Solution code:
import bisect
import copy
import heapq
import sys
import itertools
import math
import queue
from functools import lru_cache
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 998244353

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]


def to_char(a):
    return chr(a - 1 + ord("a"))

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

    res = ""
    while N > 26:
        res = to_char(N % 26) + res
        N //= 26

    print(to_char(N) + res)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
st = []
while not N == 0:
    m=N%26
    N=N//26
    st.append(chr(ord('a')+m-1))

print(''.join(reversed(st)))

Submission status: Wrong Answer

Solution code:
def main():
    suu="abcdefghijklmnopqrstuvwxyz"#26
    n=int(input())
    puts=""
    if n<27:#その数より小さい
        print(suu[n-1])
        return
    while True:
        puts=suu[n%26-1]+puts
        n//=26
        if n<27:
            puts=suu[n-1]+puts
            break
    print(puts)
if __name__ == "__main__":
    main()

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

name = ''
while N != 0:
    name += alphabet[(N-1) % 26]
    N //= 26
print(name[::-1])

Submission status: Wrong Answer

Solution code:
import os
import sys
from io import BytesIO, IOBase
# region fastio

BUFSIZE = 8192

class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

# ------------------------------

from math import factorial
from collections import Counter, defaultdict, deque
from heapq import heapify, heappop, heappush

def RL(): return map(int, sys.stdin.readline().rstrip().split())
def RLL(): return list(map(int, sys.stdin.readline().rstrip().split()))
def N(): return int(input())
def comb(n, m): return factorial(n) / (factorial(m) * factorial(n - m)) if n >= m else 0
def perm(n, m): return factorial(n) // (factorial(n - m)) if n >= m else 0
def mdis(x1, y1, x2, y2): return abs(x1 - x2) + abs(y1 - y2)
mod = 998244353
INF = float('inf')

# ------------------------------
# f = open('../input.txt')
# sys.stdin = f

def main():
    n = N()

    c = [chr(i+ord('a')) for i in range(26)]
    res = ""
    while n>0:
        now = n%26
        n//=26
        res+=c[now-1]
    print(res[::-1])




if __name__ == "__main__":
    main()

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']
ans = ""
for i in range(11, -1, -1):
    if i==0: res=n
    else: res = n//(26**i)
    if res == 0: continue
    else:
        ans += a[res%26-1]
print(ans)

Submission status: Wrong Answer

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

    ans = ''
    while n != 0:
        ans = chr(n % 26 + 96) + ans
        n //= 26

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

n = int(input())

ans = []
while n > 0:
    c = n%26
    ans.append(chr(c+96))
    n = n//26

ans = ''.join(ans[::-1])
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
li = []
while(1):
    i = N % 26
    li.append(chr(96 + i))
    N = N // 26
    if N == 0:
        break

li.reverse()
for i in range(len(li)):
    print(li[i], end="")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = ""
div = 26**10
for i in range(11):
    
    a = n//div
    b = n%div
    
    if b==0 and div>1:
        ans += "z"*(10-a)
        break
    elif a>0:
        ans += chr(96+a)
    
    n = b
    div //= 26

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

code = ""
while n>0:
  code = chr(ord("a")+n%26-1) + code
  n = n // 26
  
print(code)

Submission status: Wrong Answer

Solution code:
import math
#map(int,input().split())
#int(x) for x in input().split()
#for _ in range(int(input())):
n=int(input())
s=''
while n!=0:
	x=n//26
	d=n-x*26
	s+=chr(96+int(d))
	n=x
print(s[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())

str = ""
while n > 0:
    chr_n = (int(n % 26) + 96)
    str = chr(chr_n) + str
    n = int(n / 26)

print(str)

Submission status: Wrong Answer

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

while True:
  ans.append(chr(N%26+96))
  N = N//26
  if N == 0:
    break
ans.reverse()
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
N = int(input())
lis = [''] + list('abcdefghijklmnopqrstuvwxyz')
s = ''
for n in range(10, 0, -1):
    idx, N = divmod(N, 26**n)
    s = s + lis[idx]
print(s + lis[N])

Submission status: Wrong Answer

Solution code:
N = int(input())

tmp = 'abcdefghijklmnopqrstuvwxyz'
num = 26
ans = []
while N != 0:
    ans.append(tmp[N%num-1])
    N = N//num
new_list = list(reversed(ans))
print(''.join(new_list))

Submission status: Wrong Answer

Solution code:
import string

def convert(x, n):
    if x // n == 0:
        return [x % n]
    return convert(x // n, n) + [x % n]

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

print("".join([string.ascii_lowercase[i-1] for i in convert(N, 26)]))

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=""
s="abcdeghijklmnopqrstuvwxyz"
while n:
  use=n%26
  ans=s[use-1]+ans
  n//=26
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import math
def II():
	return int(sys.stdin.readline())

def LI():
	return list(map(int, sys.stdin.readline().split()))

def MI():
	return map(int, sys.stdin.readline().split())

def SI():
	return sys.stdin.readline().strip()
n = II()
ans = ""
while(n!=0):
	ans+=chr(96+n%26)
	n//=26
print(ans[:][::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
name_num = []
while n > 0:
    name_num.append(n % 26)
    n //= 26
name_num = name_num[::-1]
name = ''
for i in name_num:
    name += chr(ord('a') + i - 1)
print(name)

Submission status: Wrong Answer

Solution code:
import string

N = int(input())
ss = string.ascii_lowercase

ans = ""

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

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
import string

N = int(input())


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


def get_dog_name(N):
    N -= 1
    for i in range(1, 14):
        num = 26 ** i
        if N >= num:
            N -= num
            continue
        base26 = number_to_base(N, 26)
        return "".join([string.ascii_lowercase[i] for i in base26])


print(get_dog_name(N))

Submission status: Wrong Answer

Solution code:
n = int(input())
result = ""
while n != 0:
    result = chr(ord('a') + n % 26 - 1) + result
    n = n // 26
print(result)

Submission status: Wrong Answer

Solution code:
N = int(input())

len = 1
while pow(26, len) < N:
    len += 1

for i in range(len):
    N -= pow(26, i)

ans = ""
for i in range(len-1, -1, -1):
    ans += chr(N//pow(26, i)+97)
    N %= pow(26, i)
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
A = []
for i in range(10, -1, -1):
    A.append(n // 26**i)
    n = n % 26**i
B = ''
for a in A:
    if a == 0:
        continue
    B += chr(a + 96)
print(B)

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:
        N = N // 26
        if N == 1:
            break

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
al=[chr(ord('a') + i) for i in range(26)]
A = 26
t = 1
while A<N:
    A += 26**(t+1)
    t+=1

A -= 26**t

B = N

Q = 26
out = ["a"]*t

while t>0:
    X = B%26
    out[t-1] = al[X-1]
    B = B//26
    t += -1
print("".join(out))

Submission status: Wrong Answer

Solution code:
MAX = 500
  
# Function to print Excel column name  
# for a given column number 
def printString(n): 
  
    # To store result (Excel column name) 
    string = ["\0"] * MAX
  
    # To store current index in str which is result 
    i = 0
  
    while n > 0: 
        # Find remainder 
        rem = n % 26
  
        # if remainder is 0, then a  
        # 'Z' must be there in output 
        if rem == 0: 
            string[i] = 'z'
            i += 1
            n = (n // 26) - 1
        else: 
            string[i] = chr((rem - 1) + ord('a')) 
            i += 1
            n = n // 26
    string[i] = '\0'
  
    # Reverse the string and print result 
    string = string[::-1] 
    print("".join(string))

printString(int(input()))

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
A =[chr(i) for i in range(97, 97+26)]
# print(A)
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
# while N:
# while N:
#     a = N % 26
#     N = N // 26
#     print(a)
ans = Base_10_to_n(N, 26)
l = ans.split(",")
# print(l)
ans = ""
for a in l:
    if len(a) != 0:
        a = int(a)
        tmp = A[a-1]
        ans += tmp

print(ans)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import collections
import itertools as it
import math
#import numpy as np
 
#  = input()
n  = int(input())
#  = map(int, input().split())
#  = list(map(int, input().split()))
#  = [int(input()) for i in range(N)]
#
# c = collections.Counter()

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

s = ''
for i in range(int(math.ceil(math.log(n, 26)))):
    #print(L[n % 26])
    s = L[n % 26] + s
    n = n // 26

print(s)

Submission status: Wrong Answer

Solution code:
import math
import sys
# N, K = [int(_) for _ in input().split()]
N = int(input())
digit = math.log(N, 26)
name = ''
if N == 1:
  print('a')
  sys.exit(0)
for i in range(int(digit) + math.ceil(digit-int(digit))):
  if N % 26 == 0:
    c = 'z'
  else:
    c = chr(96+N % 26)
  name += c
  N //= 26
print(name[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())

i = 1
ans = []
while n > 0:
   v = n % (26 ** i) // (26 ** (i-1))
   ans.append(chr(ord('a') + v - 1))
   n -= n % (26 ** i)
   i += 1
print("".join(reversed(ans)))

Submission status: Wrong Answer

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


n =int(input())
x = aa(n)
print(x)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

mojisu = 1
tmp = 1
while True:
    tmp += 26**mojisu
    if tmp > N:
        break
    mojisu += 1

ans = ""
for i in range(1,mojisu+1):
    Namari = N%26
    N = N//26
    ans += alp[Namari-1]
    
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=[]
data=["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):
    ans.append(n%26)
    n=n//26
ans.append(n)
for i in range(len(ans)-1,-1,-1):
    print(data[ans[i]-1],end="")