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
from collections import defaultdict
readline = sys.stdin.buffer.readline
# sys.setrecursionlimit(10**8)


def geta(fn=lambda s: s.decode()):
    return map(fn, readline().split())


def gete(fn=lambda s: s.decode()):
    return fn(readline().rstrip())


def main():
    n = gete(int)
    ans = ""

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

    print(ans[::-1])


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
from decimal import Decimal
name = ""
tempN = Decimal(N)
while tempN > 0:
    name += chr(Decimal(tempN % 26) + 96)
    tempN = Decimal(tempN // 26)
print(name[::-1])

Submission status: Wrong Answer

Solution code:
num = int(input())
alpha = [chr(ord('a') + i) for i in range(26)]
ans = ''
val = num
while val >= 26:
    i = val % 26
    val //= 26
    ans += str(alpha[i - 1])
ans += alpha[val - 1]
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
alplha = ['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 = len(alplha)
ans = ""
ljou = [1]
a = 1
for k in range(10000):
    a = a*l
    if a > N:
        break
    ljou.append(a)
for k in range(1, len(ljou)+1):
    ans += alplha[(N//ljou[-k])-1]
    N = N%ljou[-k]
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
alpha = []
while N != 0:
    alpha.append(chr(N % 26 + 96))
    N = int(N / 26)
alpha.reverse()
print(''.join(alpha))

Submission status: Wrong Answer

Solution code:
n=int(input())
p=n
a=[]
cnt=0
while p>0:
    p=p//26
    cnt+=1

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [chr(ord('a') + i) for i in range(26)]
answer = ''
while N > 0:
    answer = A[N%26-1]+answer
    N = N//26
print(answer)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = []
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 N > 0:
  ans.append(A[N % 26])
  N //= 26 

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

Submission status: Wrong Answer

Solution code:
n = int(input())
num2alpha = lambda c: chr(c+96)
lis = []
li = []
while n>26:
    b = n%26
    n//=26
    li.append(num2alpha(b))

if n<=26:
    li.append(num2alpha(n))

li.reverse()
print("".join(li))

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)+chr(X % n + 96)
    return chr(X % n + 96)


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


main()

Submission status: Wrong Answer

Solution code:
n = int(input())


l = []

nc = n

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

ans = ''

for i in range(len(l)):
    ans += chr(l[-(1+i)] + 96)

print(ans)

Submission status: Wrong Answer

Solution code:
import string
N = int(input())

char = string.ascii_lowercase

name_rev = []

while 1:
    name_rev.append(char[N % 26-1])
    if N <= 26:
        break
    N = N // 26
print("".join(name_rev[::-1]))

Submission status: Wrong Answer

Solution code:
N=int(input())
x=0
while 26**x<N:
    x+=1
a=[0]*x
for i in range(x):
    a[i]=N//(26**(x-i-1))
    N%=(26**(x-i-1))
print(''.join([chr(c+ord('a')-1) for c in a]),sep='\n')

Submission status: Wrong Answer

Solution code:
def resolve():
    n=int(input())
    abcd = 'abcdefghijklmnopqrstuvwxyz'
    s=""
    while True:
        a=n%26
        s=abcd[a-1]+s
        n=int((n-a)/26)
        if n==0:
            break
    print(s)
resolve()

Submission status: Wrong Answer

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

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


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

Submission status: Wrong Answer

Solution code:
def res(n):
  s=''
  while n>0:
     x = n%26
     y = x + ord('a') - 1
     s += chr(y)
     n = n//26
  return s
  
n = int(input())
print(res(n)[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
l = [chr(ord('a') + i) for i in range(26)]

k = []

i = 0
while n != 0:
    y = n % 26
    if y == 0:
        y = 26
    k.append(l[y-1])
    n //= 26
print(''.join(reversed(k)))

Submission status: Wrong Answer

Solution code:
n = int(input())
alfabet = ["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>0:
    a = n%26
    n = n//26
    ans.append(alfabet[a-1])

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

Submission status: Wrong Answer

Solution code:
# ord('a'), chr(97)
N = int(input().rstrip())
ret = []
while N != 0:
    ret.append(chr(96+(N % 26)))
    N = N // 26
print(''.join(ret[::-1]))

Submission status: Wrong Answer

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

ans=num2alpha(N)

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
name = ""
alphabet = "zabcdefghijklmnopqrstuvwxy"
while N > 0:
    name += alphabet[N % 26]
    N //= 26
print(name[::-1])

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    lowercase = 'abcdefghijklmnopqrstuvwxyz'
    ans = ''
    for i in range(len(str(N))):
        j = N // 26**i % 26 - 1
        if j < 0:
            break
        ans = lowercase[j] + ans
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N=int(input())
out=''
while N>0:
    out=str(chr(ord('a')+N%26-1))+out
    N=N//26
print(out)

Submission status: Wrong Answer

Solution code:
import sys
N = int(input())

alphabet = "0abcdefghijklmnopqrstuvwxyz"
name = []
if N == 0:
    print("a")
    sys.exit()

while N > 0:
    name += alphabet[N % 26]
    N //= 26
name.reverse()
print("".join(name))

Submission status: Wrong Answer

Solution code:
N = int(input())


keta_num = 1
tmp_num = 1
while N >= 26 ** keta_num:
    keta_num += 1

# print(keta_num, tmp_num)

names = []

alphabets = list('abcdefghijklmnopqrstuvwxyz')
for i in range(keta_num - 1, -1, -1):
    # print(N, 26**i, i)
    name = N // (26**i)
    names.append(alphabets[name - 1])
    N -= 26**i * name
print(''.join(names))

Submission status: Wrong Answer

Solution code:
N = int(input())

name = ""

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

name += chr(ord('a') + (N % 26) - 1)

print(name[::-1])

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと


def read_a_int(): return int(read())


def read_ints(): return list(map(int, read().split()))


def read_col(H):
    '''H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_tuple(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_matrix(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right
from math import gcd
# 文字の順番を扱うとき


def ord_from_a(char):
    return ord(char) - ord('a')


def chr_from_a(n: int):
    # nはaから何番あとかを示す
    return chr(n - 1 + ord('a'))


N = read_a_int()
# 26進数のときにN番目の犬の名前は？
ans = ''
while N >= 26:
    # print(N)
    N, r = divmod(N, 26)
    ans += chr_from_a(r)

ans += chr_from_a(N)
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
nam = ""
flag = True
while(flag):
    k = n % 26
    if n <= 26: flag = False
    if k == 0: k = 26
    nam = chr(96 + k) + nam
    n = n // 26
print(nam)

Submission status: Wrong Answer

Solution code:
# C
n = int(input())
ans = []
while n > 26:
    ans.append(n % 26)
    n = n // 26
ans.append(n)
#print(ans)
ans.reverse()
for i in ans:
    print(chr(i + 96),end='')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import string
import numpy as np

f = "123456789" + string.ascii_lowercase
t = string.ascii_lowercase

N = int(input())
a = np.base_repr(N, 26)
a = a.lower()


ans = ''
for c in a:
    idx = f.find(c)
    ans += t[idx]

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

S = str()

import math

while N > 0:
	if N > 26:
		D = math.floor(math.log(N, 26))
		K = 26**math.floor(math.log(N, 26))
		P = N//K
		N = N-P*K
		S=S+chr(96+P)
	else:
		K = N
		S=S+chr(96+K)
		N = 0

print(S)

Submission status: Wrong Answer

Solution code:
N = int(input())

count = 0
N_copy = N
while N_copy != 0:
    N_copy //= 26
    count += 1

ans = ""
alpha = "abcdefghijklmnopqrstuvwxyz"
for i in range(count):
    ans = alpha[N%26-1] + ans
    N //= 26

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

s = ''
while (n > 0):
    r = n % 26
    n //= 26
    if r == 0:
        s = 'z' + s
    else:
        c = chr((r - 1) + ord('a'))
        s = c + s

print(s)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
N = int(input()) - 1
a = []
i = 0
while N:
  t = N % 26
  if i: t = (N - 1) % 26
  a.append(t)
  N //= 26
  i += 1
a.reverse()
#print(a)
res = ""
for x in a: res += chr(x + ord("a"))
print(res)

Submission status: Wrong Answer

Solution code:
import sys
from collections import defaultdict

input = sys.stdin.readline


def print_result(l): return print(' '.join(map(str, l)))


def timer(function):
	import time

	def wrapper(*args, **kwargs):
		t1 = time.time()
		val = function()
		t2 = time.time()
		print("Executed \{}\ in {:.2f} seconds.".format(function.__name__, t2-t1))
		return val
	return wrapper


# @timer
def solve():
	n = int(input())
	s = ''
	while n != 0:
		# print(n)
		s += chr(97+(n % 26)-1)
		n = n//26
	print(s[::-1])
		


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

Submission status: Wrong Answer

Solution code:
import numpy as np
import math
def num2alpha(num):
    if num<=26:
        return chr(96+num)
    elif num%26==0:
        return num2alpha(num//26-1)+chr(90)
    else:
        return num2alpha(num//26)+chr(96+num%26)
N = int(input())
print(num2alpha(N))

Submission status: Wrong Answer

Solution code:
n=int(input())
i=0
b=""
k=[]

while True:
    k.append(chr(n%26+96))
    n=n//26
    if n<26:
        k.append(chr(n+96))
        break
    i+=1
for j in range(len(k)):
    b+=str(k[len(k)-j-1])
print(b)

Submission status: Wrong Answer

Solution code:
def mi():
    return map(int, input().split())

def ii():
    return int(input())

def main():
    N = ii()-1
    l = ''
    while N > 0:
        l += chr(N%26+97)
        N //= 26
    print(l[::-1])


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
alphabets = [""] + [s for s in "abcdefghijklmnopqrstuvwxyz"]

s = int(input())

nums = []

while s > 0:
  nums.append(s % 26)
  s = s // 26

res = ""
  
for _ in range(len(nums)):
  res = res + alphabets[nums.pop()]

print(res)

Submission status: Wrong Answer

Solution code:
n = int(input())
d, m = divmod(n, 26)
# ans = chr(m+96)
ans = ""
while(not d==0):
    ans += chr(m+96)
    d, m = divmod(d, 26)
ans += chr(m+96)
# ans += tmp
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())

name = ""

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

name += chr(ord('a') + (N % 26) - 1)

print(name[::-1])

Submission status: Wrong Answer

Solution code:
# ABC171 C 

from collections import deque

num2alpha = lambda c: chr(c+64)

n = int(input())
ans_dq = deque()

for i in range(1,12):
    _tmp = n%26
    if _tmp == 0:
        _tmp = 26
    ans_dq.appendleft(num2alpha(_tmp).lower())
    n = n//26
    if n == 0:
        break
    
print(*ans_dq, sep="")

Submission status: Wrong Answer

Solution code:
N = int(input())
abc = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
while N > 0:
    ans = abc[(N%26)-1] + ans
    N //= 26
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

def solve(n):
    if 1 <= n <= 26:
        return chr(ord('a') + (n-1) % 26)
    else:
        q, r = divmod(n, 26)
        return solve(q) + chr(ord('a') + (r-1) % 26)

print(solve(N))

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import math
import decimal

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

N = int(input())

alphabet = "zabcdefghijklmnopqrstuvwxy"
name = ""

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


print(name)

Submission status: Wrong Answer

Solution code:
n = int(input())
num2alpha = lambda c: chr(c+96)
lis = []
li = []
while n>26:
    b = n%26
    n//=26
    li.append(num2alpha(b))

if n<26:
    li.append(num2alpha(n))

li.reverse()
print("".join(li))

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = []
while(True):
  m = N % 26
  N = N // 26
  if N == 0 and m == 0:
    break
  ans.append(m)
  if N == 0:
    break

ans.reverse()
print(''.join(map(lambda i: chr(96 + i), ans)))

Submission status: Wrong Answer

Solution code:
ans = []
n = int(input())
while n!= 0:
    i = n%26+96
    if i == 0:
        i += 26
    ans.append(chr(n%26+96))
    n //= 26
ans.reverse()
print("".join(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in reversed(range(len(a))):
  print(chr(96+a[i]),end="")

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']
name = ''
while(True):
    m = n%26
    if(m == 0):
        m = 26
    name = alp[m-1] + name
    n = n//26
    if(n==0):
        break

print(name)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

string = 'abcdefghijklmnopqrstuvwxyz'
print(Base_10_to_n(N, 26))

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal

N = int(input())

res = ""

alp = "0abcdefghijklmnopqrstuvwxyz"

while N > 0:
    if N > 26:
        
        NN = N//26
        m = N - NN*26
        N = N//26
        # print(alp[m])
        res = alp[m] + res
    else:
        # print(alp[N])
        res = alp[N] + res
        N = 0

print(res)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# C
n = int(input())
ans = []
while n > 26:
    ans.append(n % 26)
    n = n // 26
ans.append(n)
print(ans)
ans.reverse()
for i in ans:
    print(chr(i + 96),end='')

Submission status: Wrong Answer

Solution code:
n = int(input())
alfabet = 'abcdefghijklmnopqrstuvwxyz'
name = ''
while True:
  if n <= 26:
    name = alfabet[n-1] + name
    break
  else:
    num = n % 26
    name = alfabet[num-1] + name
    n = n//26
print(name)

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
N = int(input())

def num2alpha(n):
    ret = chr(n+ord('a')-1)
    if n==26:
        ret = 'z'
    return ret

ans = ['']
while N>0:
    t = N%26
    ans.append(num2alpha(t))
    N //= 26
ans.reverse()
ans = ''.join(ans)
print(ans)

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=1
num=26

while N>num:
    if N<num:
        break
    l+=1
    N-=num
    num*=26
ans=[]
for i in range(l):
    ans.append(N%26)
    N//=26
ans[0]-=1

for j in ans[::-1]:
    print(a[j],end="")
print()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def resolve():
    n=int(input())
    a=list('abcdefghijklmnopqrstuvwxyz')
    ans=[]
    while n>0:
        ans.append(a[((n-1)%26)])
        n//=26
    print(''.join(map(str,ans[::-1])))


if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

Solution code:
# 2020/06/21
# AtCoder Beginner Contest 171 - C

# Input
n = int(input())

# Calc
wkval = n

str = ''
while(wkval > 0):
    div = wkval // 26
    rem = wkval % 26
    str = chr(96 + rem) + str
    wkval = div

# Output
print(str)

Submission status: Wrong Answer

Solution code:
N = int(input())

AlList = {0:'Z', 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'}

result = ''

while N > 0:
    tmp = N % 26
    result = AlList[tmp] + result
    N //= 26

print(result.swapcase())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
import math
import scipy as sp
import queue
import collections

MOD = 10 ** 9 + 7
INF = 10 ** 9

def main(kwargs):
    n = kwargs["n"]
    tmp = base(n, 26)
    res = ""

    for t in tmp:
        res += chr(96 + int(t))

    return res

def base(x, n):
    if x // n:
        return base(x // n, n) + [x % n]

    return [x % n]

if __name__ == "__main__":
    kwargs = {}

    cin = input().split()
    kwargs["n"] = [int(i) for i in cin][0]

    cout = main(kwargs)
    print(cout)

Submission status: Wrong Answer

Solution code:
n=int(input())
k=[]
def a(i):
    if i==0:
        return 26
    else:
        return i
while n>26:
    k+=[chr(96+a(n%26))]
    n//=26
k+=[chr(96+a(n))]
print("".join(k[::-1]))

Submission status: Wrong Answer

Solution code:
def conv(X, n):
    if (int(X/n)):
        return conv(int(X/n), n)+[X%n]
    return [X%n]

c = conv(int(input()), 26)
ret = ""
for i in c:
    if i == 0:
        continue
    ret += chr(i+ord("a")-1)
print(ret)

Submission status: Wrong Answer

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

conv = []
k = n
while k > 0:
    conv.append( k % 26 )
    k = k // 26

ans = []
for c in conv:
    ans.append( alphabet[ c - 1 ] )

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

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%26 == 0: continue
    else:
        ans += a[res%26-1]
print(ans)

Submission status: Wrong Answer

Solution code:
from string import ascii_lowercase

n = int(input())
s = ascii_lowercase
ans =''
while True:
    ans = s[n%26 - 1] + ans
    n //= 26
    if n == 0:
        break
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
def Base_10_to_26(X):
    alphabet = list(chr(i)for i in range(97, 123))
    X_dumy = X
    out = ''
    while X_dumy > 0:
        out = alphabet[X_dumy % 26 - 1]+out
        X_dumy = int(X_dumy/26)
    return out


def main():
    n = int(input())
    ans = Base_10_to_26(n)
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    digits = list()
    while N > 0:
        digits.append(N % 26)
        N //= 26
    digits.reverse()
    ans = ''
    for d in digits:
        ans += chr(d - 1 + ord('a'))
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
name = []
while N > 0:
    name.append(chr((N % 26) + 96))
    N //= 26
name.reverse()
print(''.join(name))

Submission status: Wrong Answer

Solution code:
n=int(input())
al=[chr(ord('a') + i) for i in range(26)]
ans=[]
while n>25:
  ans.append(al[n%26-1])
  n=n//26
ans.append(al[n-1])
ans=ans[::-1]
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = ""
while True:
    t = n % 26
    if t == 0:
        t = 26
    if n <= 26:
        ans += chr(t+96)
        break
    n //= 26
    ans += chr(t+96)

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
def Base_10_to_n(X, n):
   #print(X)
   if (int(X/n)):
      return Base_10_to_n(int(X/n), n)+' '+str(X%n)
   return str(X%n)
n = int(input())
an = Base_10_to_n(n,26)
ans = [chr(int(i)+96) for i in an.split()]
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
def main():
    import sys
    N = int(sys.stdin.readline())
    #s = sys.stdin.readline().rstrip()
    #N, K = map(int, sys.stdin.readline().split())
    #P = list(map(int, sys.stdin.readline().split()))
    #P.sort()
    #print(N)
    al = 'abcdefghijklmnopqrstuvwxyz'
    ans =''
    while True:
        ans +=al[(N %26)-1]
        N = N//26
        if N==0:
            break
    print(ans[::-1])



if __name__=='__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
abc = 'abcdefghijklmnopqrstuvwxyz'
ans = []

while n > 0:
    ans.append(abc[(n-1)%26])
    n //= 26

ans.reverse()
print(*ans, sep='')

Submission status: Wrong Answer

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

q = n

while True:
    q, mod = divmod(q, 26)
    l.append(mod)
    if q == 0:
        break

l.reverse()

s = "abcdefghijklmnopqrstuvwxyz"

ans = ""

for i in l:
    ans += s[i-1]

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import math
import itertools

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']
ans=[]
while n>=1:
    ans.append(alp[n%26-1])
    n//=26
a=''
ans.reverse()
for i in ans:
    a+=i
print(a)

Submission status: Wrong Answer

Solution code:

N = int(input())

ans = ""

alp = "zabcdefghijklmnopqrstuvwxyz"

for i in range(100):

    ans = alp[N%(26**(i+1)) // (26**i)] + ans

    if N <= 26**(i+1):
        break
        


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())

    print(base(n,26))

resolve()

Submission status: Wrong Answer

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

def converter(n):
    L ="zabcdefghijklmnopqrstuvwxy"
    return L[n]

def solve(N: int):
    ans = ""
    num = N
    while True:
        p = num // 26
        q = num % 26
        ans = converter(q) + ans
        if p <= 0:
            break
        num = p

    print(ans)

    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:
def resolve():
    n = int(input())
    flag = 0
    name = []
    if n < 27:
        print(chr(n + 96))
        return
    while n > 0:
        c = n % 26
        name.append(c)
        n //= 26
        if n == 1:
            flag = 1

    print(''.join([chr(i + 96) for i in reversed(name)]))

resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
l = []
s = ''

while N > 26:
    l.append(N%26)
    N = N//26
l.append(N)
l.reverse()
for i in l:
    s += chr(i+96)

print(s)

Submission status: Wrong Answer

Solution code:
n=int(input())
s=""
while(n):
    a=n//26
    b=n-(a*26)
    s+=chr(96+b)
    n=n//26
s=s[::-1]
print(s)

Submission status: Wrong Answer

Solution code:
n = int(input())
h = []
tmp = ["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-1)
else:
    while n > 26:
        h.append((n%26)-1)
        n //= 26
    h.append(n-1)

for i in range(1, len(h)+1):
    name += tmp[h[-i]]
print(name)

Submission status: Wrong Answer

Solution code:
N = int(input())

dic= ['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']
K = 0
while N > 26**K:
    K+=1

K-=1
idx = []
ans = ''
for n in range(K):
    base = 26**(K-n)
    a = N // base
    N -= a * base
    ans += dic[a-1]
    
ans += dic[N-1]
print(ans)

Submission status: Wrong Answer

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

while N != 0:
  N,mod=divmod(N,26)
  ans=alp[mod-1]+ans
print(ans)
#27 -> aa  26 + 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 == 0:
            break
        N = N // 26

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
l = []
while n > 0:
    x = n%26
    l.append(chr(96+x))
    n = n//26
l.reverse()
print(''.join(l))

Submission status: Wrong Answer

Solution code:


import sys
import math
import itertools
import collections

def solve(N):
    ans = ""
    while True:
        target = N % 26
        if target == 0:
            ans += "z"
        else:
            ans+=chr(ord("a") - 1 + target)
        N //= 26
        if N == 0:
            break
    return ans[::-1]
def main():
    N = int(input())
    # solve()
    print(solve(N))

if __name__ == "__main__":
    main()

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
    name = [None] * l
    for i in range(l):
        c = (x - 1) % 26
        name[l - 1 - i] = chr(ord("a") + c)
        x //= 26
    return "".join(name)


print(solve())

Submission status: Wrong Answer

Solution code:
N = int(input())
final = ""
digits = []
temp = N

while temp > 0:
    res = temp%26
    temp //= 26
    digits.append(res)
    
chars = "abcdefghijklmnopqrstuvwxyz"
dic = {i+1: chars[i] for i in range(25)}
dic[0] = "z"
for j in range(len(digits)):
    char = dic[digits[j]]
    final = char + final
print(final)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import sys
# from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
#from heapq import heappop, heappush
#from collections import OrderedDict, defaultdict
#import math
#from itertools import product, accumulate, combinations, product
#import bisect# lower_bound etc
#import numpy as np
# from copy import deepcopy
#from collections import deque
#import numba

def run():
    dict = 'zabcdefghijklmnopqrstuvwxy'
    ret = ''
    N = int(input())
    while N:
        tmp = N % 26
        N = N // 26
        ret = dict[tmp] + ret
        if N == 1 and tmp == 0:break
    print(ret)
if __name__ == "__main__":
    run()