Problem:


Score : 300 points

Problem Statement

1000000000000001 dogs suddenly appeared under the roof of Roger's house, all of which he decided to keep. The dogs had been numbered 1 through 1000000000000001, but he gave them new names, as follows:

the dogs numbered 1,2,\cdots,26 were respectively given the names a, b, ..., z;

the dogs numbered 27,28,29,\cdots,701,702  were respectively given the names aa, ab, ac, ..., zy, zz;

the dogs numbered 703,704,705,\cdots,18277,18278  were respectively given the names aaa, aab, aac, ..., zzy, zzz;

the dogs numbered 18279,18280,18281,\cdots,475253,475254  were respectively given the names aaaa, aaab, aaac, ..., zzzy, zzzz;

the dogs numbered 475255,475256,\cdots  were respectively given the names aaaaa, aaaab, ...;

and so on.

To sum it up, the dogs numbered 1, 2, \cdots were respectively given the following names:

a, b, ..., z, aa, ab, ..., az, ba, bb, ..., bz, ..., za, zb, ..., zz, aaa, aab, ..., aaz, aba, abb, ..., abz, ..., zzz, aaaa, ...

Now, Roger asks you:

"What is the name for the dog numbered N?"

Constraints

N is an integer.

 1 \leq N \leq 1000000000000001

Input

Input is given from Standard Input in the following format:

N

Output

Print the answer to Roger's question as a string consisting of lowercase English letters.

Sample Input 1

2

Sample Output 1

b

Sample Input 2

27

Sample Output 2

aa

Sample Input 3

123456789

Sample Output 3

jjddja



Sample input:
2


Sample output:
b

Submission status: Wrong Answer

Solution code:
n = int(input())
maxx = 1000000000000001
leng = 1
while True:
	if pow(26,leng) >= n: break
	leng+=1
s = ""
for i in range(leng):
	#print(i)
	x = n%26
	if x == 0: s += "z"
	else: s += chr(x+ord('a')-1)
	#print(chr(n%26+ord('a')-1))
	#n = n%pow(26,i)
	#print(n)
	n = n//26
for i in range(leng-1,-1,-1):
	print(s[i],end="")
print()

Submission status: Wrong Answer

Solution code:
n = int(input())
n_temp = n
index_pochi = []
eiji_list = ['z']+[chr(ord('a') + i) for i in range(25)]
while(True):
    eiji = eiji_list[n_temp%26]
    index_pochi = [eiji] + index_pochi
    n_temp = int(n_temp/26)
    if n_temp == 0:
        break
print("".join(index_pochi))

Submission status: Wrong Answer

Solution code:
N = int(input())

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

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

Submission status: Wrong Answer

Solution code:
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)
		m = n%26
		if m == 0:
			s += 'z'
		else:
			s += chr(97+(n % 26)-1)
		if n == 26:
			break
		n = n//26
	print(s[::-1])
		


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

Submission status: Wrong Answer

Solution code:
N = int(input())
Ans = []
while N > 0:
  x = N % 26
  Ans.append(chr(ord("a") + x - 1))
  N = N // 26
  
y = Ans[::-1]
print("".join(y))

Submission status: Wrong Answer

Solution code:
N = int(input())
S = "abcdefghijklmnopqrstuvwxyz"
D = [11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
ans = ""
for d in D:
    s = N // (26**d)
    if s != 0:
        ans += S[s-1]
    N %= 26**d
    
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

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()) - 1
result = ""
while n != 0:
    result = chr(ord('a') + n % 26) + result
    n = n // 26
print(result)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N = int(input())
li = list('abcdefghijklmnopqrstuvwxyz')
ans = []
while N > 0:
    div, mod = divmod(N, 26)
    ans.append(li[mod-1])
    N = div

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

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())
print(num2alpha(n))

Submission status: Wrong Answer

Solution code:
# i番目は26 ^ i個
# i番目までの個数は 26 * (26 ^ i - 1) / 25

n = int(input())
_ = 96

# 桁数
ans = ''
while True:
  a, b = divmod(n, 26)
  #print(a, b)
  ans += str(chr(b + _))
  if a == 0:
    break
  n = a
  
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
import string
a2z = string.ascii_lowercase

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

print(routine(int(input()), 26))

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(1, 10):
    if n > pow(26, i):
        n -= pow(26, i)
    else:
        ans = ''
        n -= 1
        for j in range(1,i+1):
            idx = n // pow(26, i-j)
            ans += chr(0x61 + idx)
            n -= idx * pow(26, i-j)
        print(ans)
        break

Submission status: Wrong Answer

Solution code:
N = int(input())

buf = []
while N > 0:
    c = N % 26
    if c == 0:
        c = 26
    buf.append(chr(ord('a') + c - 1))
    N //= 26

print(''.join(reversed(buf)))

Submission status: Wrong Answer

Solution code:
n = int(input())
dic_items = {0:'a',1:'b',2:'c',3:'d',4:'e',5:'f',6:'g',7:'h',8:'i',9:'j',10:'k'\
             ,11:'l',12:'m',13:'n',14:'o',15:'p',16:'q',17:'r',18:'s'
             ,19:'t',20:'u',21:'v',22:'w',23:'x',24:'y',25:'z'}
ans = []
print(n)
while n != 0:
  ans.append(n%26)
  n = n//26
print(ans)
for i in range(len(ans)):
  print(dic_items[(ans[len(ans)-1-i]-1)%26],end='')

Submission status: Wrong Answer

Solution code:
N = int(input())
al = "abcdefghijklmnopqrstuvwxyz"
name = ""
for i in range(1,12):
    b = N%26
    name = al[b-1] + name
    N -= b
    if N == 0:
        print(name)
        exit()
    N //= 26

Submission status: Wrong Answer

Solution code:
N = int(input())
L = list('0abcdefghijklmnopqrstuvwxyz')
ans_l = []


while (True):
    syou = N // 26
    amari = N % 26
    if syou == 0:
        ans_l.append(L[amari])
        break

    ans_l.append(L[amari])
    N = syou
ans_l = ans_l[::-1]
print(*ans_l, sep="")

Submission status: Wrong Answer

Solution code:
n = int(input())
s = "abcdefghijklmnopqrstuvwxyz"
t = ""
while n > 0:
  tmp = n % 26
  n //= 26
  t = s[tmp-1] + t
  
print(t)

Submission status: Wrong Answer

Solution code:
import sys
#sys.exit()
#sorted( ,reverse=True)
N = int(input())
#S,T = map(int, input().split())
#A = list(map(int, input().split()))
#A = [int(input()) for _ in range(N)]

#cnt = 0
#cnt += 1


d=""
dchar ="abcdefghijklmnopqrstuvwxyz"

while N > 0:
    d += dchar[N%26-1]
    N//=26
    
print(d[::-1])


#print(N)
#print(S,T)
#print(A)
#print('Yes')
#print('No')
#print(cnt)

Submission status: Wrong Answer

Solution code:
n = int(input())
name = ""
while(n > 0):
	r = n % 26
	n = n // 26
	if r == 0:
		name = '0' + name
	else:
		name = chr(r+96) + name
print(name)

Submission status: Wrong Answer

Solution code:
import math
import sys
n=int(input())
b=0
p=int(math.log(n,26))
s=""
if n<27:
  print(chr(n+96))
  sys.exit()
for i in reversed(range(1,p+1)):
  a=n//(26**i)
  b=n%(26**i)
  s+=chr(a+96)
  n=b
s+=chr(b+96)
print(s)

Submission status: Wrong Answer

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

n = ni()

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

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

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

print(ans)

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

print( "".join( reversed( 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) if n%26>0 else 'z'
	n//=26
print(ans[:][::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
name = []
eng = 'abcdefghijklmnopqrstuvwxyz'
while n:
  name.append(eng[n % 26 - 1])
  n //= 26
print(''.join(reversed(name)))

Submission status: Wrong Answer

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

while N > 26:
    m = N % 26
    if m == 0:
        m = 26
    ans = chr(96 + m) + ans
    N //= 26
# print(ans, N)
print(chr(96 + N) + ans)

Submission status: Wrong Answer

Solution code:
import sys, collections, bisect, itertools, heapq, math, copy, string
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    N = I()

    ans = ''
    while N > 0:
        ans += string.ascii_lowercase[N%26-1]
        N //= 26

    print(ans[::-1])

if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

Solution code:
# import sys
# import math #sqrt,gcd,pi
# import decimal
# import queue # queue
# import bisect
# import heapq # priolity-queue
# import time
# from itertools import product,permutations,\
#     combinations,combinations_with_replacement
# 重複あり順列、順列、組み合わせ、重複あり組み合わせ
# import collections # deque
# from operator import itemgetter,mul
# from fractions import Fraction
# from functools import reduce

mod = int(1e9+7)
# mod = 998244353
INF = 1<<50

def readInt():
    return list(map(int,input().split()))

def main():
    n = int(input())
    s = []
    while n!=0:
        s.append(n%26)
        n //= 26
    t = []
    for i in range(len(s)-1,-1,-1):
        t.append(chr(s[i]+96))
    print(''.join(t))
    return

if __name__=='__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
l = []
while n != 0:
    amari = n % 26
    n = n // 26
    l.append(amari)
l2 = []
for i in range(len(l)-1,-1,-1):
    l2.append(l[i]+96)
l3 = []
for i in l2:
    l3.append(chr(i))

print("".join(l3))

Submission status: Wrong Answer

Solution code:
n=int(input())-1
lst=[]
if not n:lst=[0]
while n:
    lst.append(n%26)
    n//=26
for i in range(1,len(lst)):
    lst[i]=(lst[i]-1)%26
print(lst)
print(''.join([chr(i+97) for i in lst][::-1]))

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    ans = []
    while n>26:
        p = n//26
        k = n-26*p
        ans.append(k)
        n = p
    ans.append(n)
    ans = ans[::-1]
    b = []
    for a in ans:
        b.append(chr(96+int(a)))
    print(''.join(b))

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
st=["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())
k=n
co=1
while True:
    if k<=26**co:
        break
    k-=26**co
    co+=1
ans =[]
ans1=[]
for i in range(co):
    ans.append(n%26)
    n=n//26
    
ans.reverse()
for i in ans:
    ans1.append(st[i-1])

print("".join(ans1))

Submission status: Wrong Answer

Solution code:
N = int(input())
alphabets = 'abcdefghijklmnopqrstuvwxyz'
def to_26(x):
    if (int(x/26)):
        return to_26(int(x/26))+alphabets[x%26-1]
    return alphabets[x%26-1]
print(to_26(N))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

l= "zabcdefghijklmnopqrstuvwxy"
n=int(input())
a=[0,26]
b=[0,26]
ans=[]
for i in range(13):
    a.append(a[-1]*26)
    b.append(b[-1]+a[-1])
for i in range(15):
    if n<=b[i]:
        c=i
        m=n
        break
for i in range(c):
    m,ind=divmod(m,26)
    ans.append(l[ind])
ans=reversed(ans)
print(*ans,sep="")

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
while n:a+=chr(n%26+96),;n//=26
print(''.join(a[::-1]))

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = ''
for i in range(100):
    ans = chr(ord('a') + (N-1) % 26) + ans
    if N <= 26:
        break
    N //= 26
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
l = 'zabcdefghijklmnopqrstuvwxyz'
ans = ''
while N > 26:
    d = N%26
    ans = l[d] + ans
    N //=26
ans = l[N] + ans

print(ans)

Submission status: Wrong Answer

Solution code:
def main():
    alpha = 'zabcdefghijklmnopqrstuvwxy'
    N = int(input())
    name = ''

    while True:
        a = N%26
        name = alpha[a] + name
        N //=26
        if N == 0:
            break
    print(name)





if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
m = n
digit = 0
while m > 0:
    m //= 26
    digit += 1

ans = ""
for i in range(digit)[::-1]:
    ans += chr(96 + n // (26 ** i))
    n = n % (26 ** i)

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import deque
def main():
    n = int(input())
    n26 = deque()
    a = 26
    while a <= n:
        n26.appendleft(a)
        a = a*26
    c = []
    for ae in n26:
        ct = n // ae
        c.append(ct)
        n = n - ae * ct
    c.append(n)
    cs = []
    for ce in c:
        ce += 96
        cec = chr(ce)
        cs.append(cec)
    print("".join(cs))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def resolve():
    n = int(input())
    ans = []
    while n > 0:
        n, mod = divmod(n, 26)
        ans.append(chr(96+mod))

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

resolve()

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 = ""
s = True
while s:
  a = N % 26
  N = N // 26
  name = A[a-1] + name
  if N == 0:
    s = False
print(name)

Submission status: Wrong Answer

Solution code:
N = int(input())

a = 141167095653376
ans = []
flag = False
while True:
    if N < 26:
        flag = True
    b = N//a
    if b != 0:
        ans.append(b)
        N -= a*b
    
    if flag == True:
        break
    a //=26
ans2 = []
list1 = "0abcdefghijklmnopqrstuvwxyz"
for i in ans:
    ans2.append(list1[i])
if N != 0:
    ans2.append(list1[N])

print("".join(ans2))

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=str()
i=1
m=["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:
    x=n%26
    ans=m[x]+ans
    n//=26
print(ans)

Submission status: Wrong Answer

Solution code:
def Base_10_to_n(X, n):
    if (int(X/n)):
        return Base_10_to_n(int(X/n), n)+str(X%n)
    return str(X%n)

N=int(input())
S='abcdefghijklmnopqrstuvwxyz'
t=Base_10_to_n(N, 26)
for i in t:
    print(S[int(i)-1],end='')

Submission status: Wrong Answer

Solution code:
n = int(input())
alpha = "abcdefghijklmnopqrstuvwxyz"
tmp = [26 ** i for i in range(1, 12)]
lst = [0]
for num in tmp:
    lst.append(lst[-1] + num)
for i, num in enumerate(lst):
    if num >= n:
        p = i
        break
ans = ""

for i in range(p):
    ans += alpha[(n - 1) % 26]
    n //= 26
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input().strip())
ans=""
while n>0:
    n,mod=divmod(n,26)
    ans+=chr(ord("a")+mod-1)
print(ans[::-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

out = ''
tmp = n
while tmp>0:
    out = s[tmp%26-1]+out 
    tmp = int(tmp/26)
print(out)

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
char = [chr(i) for i in range(97, 97+26)]
K = math.floor(math.log(N , 26))
s = ''
mod = 26**K
for i in range(K+1):
  a = N//(mod)
  N = N % mod
  mod = int(mod/26)
  s += char[a-1]
print(s)

Submission status: Wrong Answer

Solution code:
N = int(input())

a = ord('a')
M = 1000000000000001
ans = ''
while N != 0:
    ans = chr(a + N % 26 - 1) + ans
    N //= 26

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

alps = 'abcdefghijklmnopqrstuvwxyz'

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

ans = cnv(N, 26)
print(''.join(list(map(lambda x: alps[x - 1], ans))))

Submission status: Wrong Answer

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

while n > 0:
    result = alphabet[n % 26 - 1] + result
    n //= 26

print(result)

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

n = int(input())

ans = []

def Base_10_to_n(X, n, ans):
    if (int(X/n)):
        ans.append(chr(ord('a')-1+(X%n)))
        return Base_10_to_n(int(X/n), n, ans)+str(X%n)
    ans.append(chr(ord('a')-1+(X%n)))
    return str(X%n)

num  = Base_10_to_n(n,26, ans)

ans.reverse()

print(*ans,sep='')

Submission status: Wrong Answer

Solution code:
base = ord('a') - 1

N = int(input())

data = []

while N:
    next, mod = divmod(N, 26)
    data.append(mod)
    N = next

data.reverse()

for i in data:
    print(chr(base + i), end="")

Submission status: Wrong Answer

Solution code:
n = int(input()) - 1
a = "abcdefghijklmnopqrstuvwxyz"
s = ""
while n:
    k = n % 26
    s += a[k - 1 + (s == "")]
    n //= 26
print(s[::-1])

Submission status: Wrong Answer

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


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


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


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


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


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


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

    kazu = len(ascii_lowercase)

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

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

    return ans


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

Submission status: Wrong Answer

Solution code:
from collections import Counter, defaultdict
# for use in beginner level contests where speed is key

a = int(input())

abc = "abcdefghijklmnopqrstuvwxyz"

cnt = 0
arr = [0]
back = None

for i in range(1,12):
    cnt += 26**i
    arr.append(cnt)
    if cnt > a:
        break

b = a - arr[i-1] - 1

res = ""
for j in range(i-1, -1, -1):
    res += abc[b//26**j]
    b = b%26**j

print(res)

Submission status: Wrong Answer

Solution code:
n = int(input())
rev = []
while n > 26:
    r = n % 26
    rev.append(r)
    n //= 26
rev.append(n)
sl = list('abcdefghijklmnopqrstuvwxyz')
name = []
l = len(rev)
for i in range(len(rev)):
    d = sl[rev[l - 1 - i] - 1]
    name.append(d)
dogname = ''.join(name)
print(dogname)

Submission status: Wrong Answer

Solution code:
def f(n):
	for p in range(15,-1,-1):
		if 26**p <= n:
			return n//(26**p),p
		

n=int(input())

c=n
t=[]
while c:
	x,p =f(c)
	t+=[x]
	c-=(x*(26**p))
a=""
for j in t:
	a+=chr(j+97-1)
print(a)

Submission status: Wrong Answer

Solution code:
alpha = {1:"a",2:"b",3:"c",4:"d",5:"e",6:"f",7:"g",8:"h",9:"i",10:"j",11:"k",12:"l",13:"n",14:"m",15:"o",16:"p",17:"q",18:"r",19:"s",20:"t",21:"u",22:"v",23:"w",24:"x",25:"y",0:"z"}

S = int(input())
S_str = ""
while S > 0:
  a = S%26
  S = S // 26
  S_str = S_str + alpha[a]
  
print(S_str[::-1])

Submission status: Wrong Answer

Solution code:
n=int(input())
ans,div="",26
while n > 0:
  s = n % div
  ans += chr(96+s)
  n //= div
print(ans[::-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
data = input()
num = int(data)
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"]
list = []
while num > 26:
    a = num % 26
    list.append(a)
    num = math.floor(num/26)
list.append(num)
list.reverse()
ans = "a"
for i in list:
    ans = ans + alp[i-1]
print(ans[1:])

Submission status: Wrong Answer

Solution code:
n = int(input())

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

print(''.join(map(lambda x: chr(ord('a')+x-1), ans[::-1])))

Submission status: Wrong Answer

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


for i in range(1000):
    if 26*(26**i-1)//25+1 <= n <= 26*(26**(i+1)-1)//25:
        t=i+1
        break



ans=[]
for i in range(t):
    for g in range(1,27):
        if g*26**(t-i-1)<=n<(g+1)*26**(t-i-1):
            ans.append(alphabet[g-1])
            n-=g*26**(t-i-1)
            break

print(''.join(ans))

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A))
import string

N = ii()
alpha = [chr(i) for i in range(97, 97+26)]
'''
alpha = [chr(i) for i in range(97, 97+26)]
if 0 <= N <= 25:
    print(alpha[i])
elif 26<= N <= 702:
'''
ans = ''
#N -= 1
a = float('inf')
flag = False
while N>0:
    #flag = True
    N, a = N//26, N%26
    if flag == False:
        ans += alpha[a-1]
    else:
        ans += alpha[a-2]
        flag = False
    if a == 0:
        flag = True
    #flag = True

print(ans[::-1])

Submission status: Wrong Answer

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

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
        if m==0:
            continue
        res = alp[m] + res
    else:
        # print(alp[N])
        res = alp[N] + res
        N = 0

print(res)

Submission status: Wrong Answer

Solution code:
string = "abcdefghijklmnopqrstuvwxyz"

num = int(input())
ans = ""
while num != 0:
    num, m = divmod(num, 26)
    
    if m:
        ans = string[m-1] + ans

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
al = 'abcdefghijklmnopqrstuvwxyz'
num = []
while True:
    if n//26 == 0:
        num.append(n)
        break
    else:
        amari = n%26
        n = n//26
        num.append(amari)
num.reverse()
for nums in num:
    print(al[nums-1],end = "")

Submission status: Wrong Answer

Solution code:
########関数部分##############
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)
############################

import numpy as np

n = int(input())

print (n)
x = num2alpha(n).lower()
print (x)

Submission status: Wrong Answer

Solution code:
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

l= "zabcdefghijklmnopqrstuvwxy"
n=int(input())
a=[0,26]
b=[0,26]
ans=[]
for i in range(13):
    a.append(a[-1]*26)
    b.append(b[-1]+a[-1])
for i in range(15):
    if n<b[i]:
        c=i
        m=n
        break
for i in range(c):
    m,ind=divmod(m,26)
    ans.append(l[ind])
ans=reversed(ans)
print(*ans,sep="")

Submission status: Wrong Answer

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

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=""
while 1:
    b=int(n%26)
    ans+=a[b-1]
    n=n/26
    if n<1:
        break
new_str = ''.join(list(reversed(ans)))
print(new_str)

Submission status: Wrong Answer

Solution code:
N = int(input())
wordlist = [chr(i) for i in range(97, 97+26)]
ans=[]

while True:
    tmp = N % 26
    N = N // 26

    ans.insert(0, wordlist[tmp-1])

    if N == 0:
        break

print(*ans, sep='')

Submission status: Wrong Answer

Solution code:
import string
d = string.ascii_lowercase


N = int(input())

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

c = base10ton(N, 26)
res = [d[i-1] for i in c]
print(*res, sep='')

Submission status: Wrong Answer

Solution code:
n = int(input())

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

while n != 0:
  tmp = n % 26
  s += alphabet[tmp - 1]
  n = n // 27
print(s[::-1])

Submission status: Wrong Answer

Solution code:
## coding: UTF-8
N = int(input())

alphabet = 'abcdefghijklmnopqrstuvwxyz'

ans = []


#N = 123456789


while N > 0:
    if(N > 26):
        ans.append(N % 26)
        N -= N % 26
        N = N//26
        #print(ans, N)
    else:
        ans.append(N)
        N -= N

#print(ans, N)
#print(ans[::-1])
ans = ans[::-1]

ret = []
for i in range(len(ans)):
    ret.append(alphabet[ans[i]-1])

print(''.join(ret))


'''
for i in range(12, 0, -1):
    #print(i)
    if(N // 26**i > 0)



if(N // 26**1 > 0):
    ans.append(alphabet[N//26**1 - 1])
    N -= 26**1 * (N//26**1)
ans.append(alphabet[N-1])
'''
#print(''.join(ans))

Submission status: Wrong Answer

Solution code:
n = int(input())
word = []
mod = 26
wordindex = []
while True:
    if n <= 26:
        wordindex.append(n+96)
        break
    wordindex.append(int(n%26)+96)
    n = int(n//26)

wordlist = map(chr,reversed(wordindex))
ans = ''
for word in wordlist:
    ans += word
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import math
import collections
import decimal
import itertools
from collections import deque
from functools import reduce
import heapq
n = int(input())
#n, k = map(int, sys.stdin.readline().split())
#s = input()
#p = list(map(int, sys.stdin.readline().split()))

x = [chr(ord('a') + i) for i in range(26)]
ans = []
while (n != 0):
    p = n // 26
    q = n % 26
    ans.append(x[q-1])
    n = p


for i in range(len(ans)):
    print(ans[-i-1], end="")
sys.exit()

Submission status: Wrong Answer

Solution code:
n = int(input())
l = []
for i in range(n):
    l.append(n % 26 + 1)
    if n <= 26:
        break
    n //= 26
l.reverse()
ans = ""
for i in range(len(l)):
    ans += chr(95 + l[i])
print(ans)

Submission status: Wrong Answer

Solution code:
#                           जय श्री राम

import sys; import math; from collections import *
# sys.setrecursionlimit(10**6)

def get_ints(): return map(int, input().split())
def get_list(): return list(get_ints())
def printspx(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")

UGLYMOD = int(1e9+7); SEXYMOD = 998244353; MAXN = int(1e5)

# sys.stdin  = open("input.txt","r"); sys.stdout = open("output.txt","w")

# for _testcases_ in range(int(input())):
start =  26
n = int(input())
ans = []
while n:
    ans.append(n%26)
    n //= 26
# print(ans)
ans = ans[::-1]
for i in ans:
    if i == 0:
        i = 26
    printspx(chr(i+ord('a')-1))



'''
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
THE LOGIC AND APPROACH IS MINE @luctivud ( UDIT GUPTA )
Link may be copy-pasted here if it's taken from other source.
DO NOT PLAGIARISE.
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
'''

Submission status: Wrong Answer

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

N_dumy = N
out = ''
while N_dumy>0:
    out = alphabet[(N_dumy%26)-1]+out
    N_dumy = int(N_dumy/26)
print(out)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    import sys
    sys.setrecursionlimit(10**9)
    input = sys.stdin.readline

    N = int(input())
    a = "zabcdefghijklmnopqrstuvwxy"
    ans = []
    while N != 0:
        ans.append(a[N % 26])
        if N <= 26:
            break
        N //= 26
    
    ans.reverse()
    print(''.join(ans))

main()

Submission status: Wrong Answer

Solution code:
n = int(input())
result = ""
while n > 0:
    x = n%26
    if x==0:
        result = result+"w"
        n -= 26
    else:
        result = result + chr(96+x)
    n -= x
    n //= 26
print(result[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
alf = []
while 1 < N:
    if N % 26 == 0:
        alf.append('z')
    else:
        alf.append(chr((N % 26)+96))
    N //= 26
alf.reverse()
alf = ''.join(alf)
print(alf)