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

ans = ''
while n > 26:
    n, mod = divmod(n, 26)
    if mod == 0:
        ans += 'z'
    else:
        ans += chr(ord('a') + mod)
    n -= 1

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

k = list()
while(N > 26):
  a = int(N%26)
  k.insert(0,a)
  N = (N-a)/26

k.insert(0,int(N))
ans = str()
for i in range(len(k)):
  x = k[i] + 64 +32
  ans = ans + str(chr(x))

print(ans)

Submission status: Wrong Answer

Solution code:
import sys

N=int(sys.stdin.readline())

s=[]
while(N>0):
	s.append(N%26)
	N//=26

s.reverse()

ans="abcdefghijklmnopqrstuvwxyz"

for g in range(len(s)):
	print(ans[s[g]-1],end="")
print()

Submission status: Wrong Answer

Solution code:
n = int(input())

letters = []
num = 0
for i in range(1, 20):
    num += 26**i
    if num > n:
        kakeru = i-1
        break
    elif num == n:
        print('z'*i)
        exit()

if kakeru == 0:
    print(chr(n+96))
    exit()

for i in range(kakeru, -1, -1):
    if i == 0:
        letters.append(chr(n+96))
    else:
        a = n // 26**i
        if a == 0:
            letters.append('z'*i)
            break
        char = a + 96
        letters.append(chr(char))
    n -= 26 ** i * a

ans = ''.join(letters)
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())


b = 26

c = n
count = 0
while True:
    count += 1
    if n < b:
        break
    else:
        c -= b
        b*=26

if c == 0:
    for i in range(count-1):
        print('z',end='')
    print()
else:
    b = b/26
    while True:
        t = int(n/b) + 96
        print(chr(t),end='')
        n = n%b
        b = b/26
        if b < 1:
            print()
            break

Submission status: Wrong Answer

Solution code:
N = int(input())
abc = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
flg = True
ans = []
ans_char = []

while flg:
    q = N // 26
    r = N % 26
    ans.append(r)
    N = q
    if N == 0:
        flg = False

for i in ans:
    ans_char.append(abc[i-1])

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

Submission status: Wrong Answer

Solution code:
n = int(input())
arfa = ['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']
str = ''
while n > 26:
  amari = n % 26
  n = n // 26
  str += arfa[amari-1]
str += arfa[n-1]
print(str[::-1])

Submission status: Wrong Answer

Solution code:
# import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)


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

    alf = [chr(ord('a') + i) for i in range(26)]

    maxdigit = 1

    while N > 26 ** maxdigit:
        maxdigit += 1

    c = 26 ** (maxdigit - 1)

    res = ''

    for d in range(1,maxdigit+1):
        if d == maxdigit:
            res += alf[N-1]
            break
        for i in range(26):
            if N <= c * (i+1):
                res += alf[i-1]
                N -= c * i
                c //= 26
                break

    print(res)



main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
in1 = input()
ind = int(in1)

alpha = "abcdefghijklmnopqrstuvwxyz"

leng = 26
twosix = []

while True:
  twosix.append(ind % 26)
  ind //= 26
  if (ind < 26):
    twosix.append(ind % 26)
    break

ans = ""
twosix.reverse()
for i in twosix:
  ans += alpha[i-1]
  
print(ans)

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    m = []
    k = 1000000000000001
    x = 1
    while x * 26 <= k:
        x *= 26
        m.append(x)

    r = []
    while m:
        p = m.pop()
        i, j = divmod(n, p)
        r.append(i)
        n = j

    r.append(n)

    ans = ""
    f = False
    for i in r:
        if not f and i > 0:
            f = True
        if not f:
            continue
        ans += chr(i + 96)

    print(ans)



if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from decimal import Decimal
n=Decimal(input())
a='abcdefghijklmnopqrstuvwxyz'
ans=''
while 1:
    m=Decimal(n%26)
    n=n//26
    ans+=a[int(m)-1]
    if int(n)==0:
        break
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())

moji = ""
for i in range(10):
    if N > 26**(10-i):
        p = N // 26**(10-i)
        moji += str(chr(p+96))
        N = N % 26**(10-i)

moji += str(chr(N+96))
print(moji)

Submission status: Wrong Answer

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

if N <= 26:
    print(L_2[N - 1])
    exit()



while (N >= 26):
    syou = N // 26
    amari = N % 26
    ans_l.append(L[amari])
    if amari == 0:
        N = syou - 1
    else:
        N = syou

if amari != 0: ans_l.append(L[amari])

ans_l = ans_l[::-1]
print(*ans_l, sep="")

Submission status: Wrong Answer

Solution code:
#26**11
num = int(input())
d = {"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":26}
op_d = {}
for i,j in d.items():
    op_d[j] = i

ans =""

for i in list(range(0,12))[::-1]:
    if(int(num/(26**i)) == 0 ):
        pass
    else:
        ans += op_d[int(num/(26**i))]
        num = num % 26**i;
print(ans)

Submission status: Wrong Answer

Solution code:
import math

import numpy

n = int(input())

x = list(numpy.base_repr(n,26))

s = list("abcdefghijklmnopqrstuvwxyz")

t = list("0123456789")

for i in range(16):
    t.append(s[i].upper())
    
q = 0

cnt = 0

while n>1:
    n = n/26
    if n == 1:
        q = 1
    cnt += 1

if q == 0:
    for i in x:
        print(s[t.index(i)-1],end = "")
else:
    for i in range(cnt):
        print("z",end = "")

Submission status: Wrong Answer

Solution code:
x = int(input())

ys = []

while(True):
    x, y = x // 26, x % 26
    ys.append(y)
    if x < 26: break

ys.append(x)
ys.reverse()

chars = 'abcdefghijklmnopqrstuvwxyz'
print(''.join(chars[i-1] for i in ys))

Submission status: Wrong Answer

Solution code:
alpha = "abcdefghijklmnopqrstuvwxyz"

N = int(input())

dog_name = ""

while N > 0:
    dog_name += alpha[N%26-1]
    N = N // 26

dog_name = dog_name[::-1]

print(dog_name)

Submission status: Wrong Answer

Solution code:
N = int(input())

pow = 1
while True:
  if N <= 26**pow:
    break
  pow += 1

n = N - 26**(pow-1)
s = []
for i in range(pow-1, -1, -1):
    print(i)
    q = n // (26**i)
    s.append(q)
    n = n % (26**i) 

name = ''
for i in range(len(s)):
    if i == 0:
        name = name + 'abcdefghijklmnopqrstuvwxyz'[s[i]]
    else:
        name = name + 'abcdefghijklmnopqrstuvwxyz'[s[i]-1]

print(name)

Submission status: Wrong Answer

Solution code:
N =int(input())

def digits(n):
    digits = "abcdefghijklmnopqrstuvwxyz"
    return digits[n%26-1]

def alph(X):
    if int(X/27) >= 1:
        return alph(int(X/26)) + digits(X)
    else:
        return digits(X)
print(alph(N))

Submission status: Wrong Answer

Solution code:
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
ans=Base_10_to_n(N,26)
l=list(ans.split(","))
for i in range(len(l)-1):
  if int(l[i])==1:
    print("a",end="")
  if int(l[i])==2:
    print("b",end="")
  if int(l[i])==3:
    print("c",end="")
  if int(l[i])==4:
    print("d",end="")
  if int(l[i])==5:
    print("e",end="")
  if int(l[i])==6:
    print("f",end="")
  if int(l[i])==7:
    print("g",end="")
  if int(l[i])==8:
    print("h",end="")
  if int(l[i])==9:
    print("i",end="")
  if int(l[i])==10:
    print("j",end="")
  if int(l[i])==11:
    print("k",end="")
  if int(l[i])==12:
    print("l",end="")
  if int(l[i])==13:
    print("m",end="")
  if int(l[i])==14:
    print("n",end="")
  if int(l[i])==15:
    print("o",end="")
  if int(l[i])==16:
    print("p",end="")
  if int(l[i])==17:
    print("q",end="")
  if int(l[i])==18:
    print("r",end="")
  if int(l[i])==19:
    print("s",end="")
  if int(l[i])==20:
    print("t",end="")
  if int(l[i])==21:
    print("u",end="")
  if int(l[i])==22:
    print("v",end="")
  if int(l[i])==23:
    print("w",end="")
  if int(l[i])==24:
    print("x",end="")
  if int(l[i])==25:
    print("y",end="")
  if int(l[i])==0 or int(l[i])==26:
    print("z",end="")

Submission status: Wrong Answer

Solution code:
n = int(input())
answer = ""
al="zabcdefghijklmnopqrstuvwxy"
while n > 26: 
    answer += al[n%26]
    n = n//26
else:
    #answer.apend(al[n%26])
    answer += al[n%26]
    
print(answer[::-1])

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

Submission status: Wrong Answer

Solution code:
num = int(input())
line = []
while num >= 1:
  amari = num%26
  num = num//26
  line.append(amari)
alpha = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
line.reverse()
for k in line:
  print(alpha[int(k)-1], end = "")

Submission status: Wrong Answer

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

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

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

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

res = []



if __name__ == "__main__":
    N = int(input())

    calc(N)

    printres()

Submission status: Wrong Answer

Solution code:
n=int(input())
alpha=[chr(i) for i in range(97, 97+26)]
def calc(x):
  if int(x//26):
    return calc(int(x//26)) + str(x%26).zfill(2)
  return str(x%26).zfill(2)
wk=calc(n)
ans=""
for i in range(0,len(wk),2):
  ans+=alpha[int(wk[i:i+2])-1]
print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
alpha='zabcdefghijklmnopqrstuvwxy'
def mod26(n):
  mods=[]
  m=n
  c=0
  while m>0:
    mods+=[alpha[m%26]]
    m=m//26
    c+=1  
  return ''.join([mods[i] for i in range(c-1,-1,-1)])

print(mod26(N))

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    A = list("abcdefghijklmnopqrstuvwxyz")

    t = ['']*12
    for i in range(12)[::-1]:
        d,m = divmod(n,26)
        t[i] = A[m-1]
        n = d
        if d == 0 or m == 0:
            break
    print(''.join(t))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N=int(input())
S='abcdefghijklmnopqrstuvwxyz'

n=1
c=-1
while(n<=N):
    n*=26
    c+=1

for i in range(c):
    t=c-i
    if N%26==0:
        print('z', end='')
    else:
        print(S[N//(26**t)-1],end='')
    N=N%26**t
if N!=0:
    print(S[N-1],end='')

Submission status: Wrong Answer

Solution code:
n = int(input())

l = []

for i in range(100000):
  if n > 26:
    l.append(n%26)
    n -= n%26
    n = int(n/26)
  if n <= 26:
    l.append(n)
    break

l = list(reversed(l))

ans = []
for i in l:
  ans.append(chr(i+96))
  
print(''.join(ans))

Submission status: Wrong Answer

Solution code:


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

num = int(input())
dum = num
cnt = 0

while dum > 26:
    dum /= 26
    cnt += 1
# print(cnt)
    
while cnt > 0:
    ind = int(num/26**cnt)
    # print(ind, num)
    num = num - ind*26**cnt
    # print(num)
    cnt -= 1
    print(alpha[ind], end='')
print(alpha[num])

Submission status: Wrong Answer

Solution code:
n = int(input())

# n // 26  # 答え
# n % 26 # あまり

res = []
amari = 0
while n > 0:
  res.append(n % 26)
  n = n // 26
  
key = ["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", "g"]
for i in res[::-1]:
  print(key[i - 1], end="")

Submission status: Wrong Answer

Solution code:
def itoa(i):
    return chr(97 + i - 1)


N = int(input())

ans = ""
while N:
    i = N % 26
    N = (N - 1) // 26
    ans += itoa(i)

print(ans[::-1])

Submission status: Wrong Answer

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


while n > 0:
    s = (n % 26)-1
    ans.append(s)
    n = int(n / 26)

ans2 = []
for i in ans:
    ans2.append(asc[i])

ans2[0], ans2[-1] = ans2[-1], ans2[0]
test = ''.join(ans2)
print(test)

Submission status: Wrong Answer

Solution code:
check_alf = [chr(ord('a') + i) for i in range(26)]

n=int(input())

check_num = 0

keta = 0

while check_num+26**(keta+1) <= n:
    keta += 1
    check_num += 26**keta
sa = n - check_num

ans = []

while keta > 0:
    ans.append(check_alf[sa//(26**keta)])
    sa -= (sa//(26**keta))*(26**keta)
    keta -= 1
ans.append(check_alf[sa-1])

print(''.join(map(str,ans)))

Submission status: Wrong Answer

Solution code:
N = int(input())

n = 26
m = 1

while N > n:
    n = n + n * 26
    m += 1

e = n
result = ''

for i in range(m):
    a = N % 26
    if a == 0:
        a = 26
    result = chr(a + 96) + result
    N = (N - a) // 26

print(result)

Submission status: Wrong Answer

Solution code:
N = int(input())
T = N
k = 26
c = 0
while(T - k > 0):
    T -= k
    k *= 26
    c += 1

alph = {}
p = 1
for i in range(97, 97+26):
    alph[str(p%26)] = chr(i)
    p += 1

ans = ""
for i in range(c, -1, -1):
    t = N // (26**i)
    if t > 26:
        t = 26
    ans += alph[str((t%26))]
    N -= t*(26**i)
print("".join(ans))

Submission status: Wrong Answer

Solution code:
s = 'abcdefghijklmnopqrstuvwxyz'
n = int(input())
num = n

cnt = 0

while(num > 26):
    cnt += 1
    num //= 26

ans = ""
while(cnt >= 0):
    b = n // pow(26,cnt)
    n -= (pow(26,cnt)*b)
    cnt -= 1
    ans = ans + s[b-1]
print(ans)

Submission status: Wrong Answer

Solution code:
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

n = ii()

al = [1]
nc = 0

def ntow(x):
    if x == 0:
        return 'z'
    v = chr(ord('a')+x-1)
    # print(x,v)
    return v

for i in range(1,15):
    nc += 26 ** i
    al.append(nc+1)
    if nc > 1000000000000001:
        break

# print(al)

for i in range(15):
    if n < al[i]:
        keta = i
        break

print('keta',keta)
ans = ''

for i in range(keta):
    tmp = 26**(i+1)
    # print('tmp',tmp)
    nk = n%tmp
    if nk == 0:
        ans =  'z' + ans
        n -= tmp
    else:
        # print(nk//(26**i))
        ans =  ntow(nk//(26**i)) + ans
        n -= nk

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)
s = list(map(int,input().split()))
n=s[0]

dic={}
for i in range(97, 97+26):dic[i-96]=chr(i)
dic[0] = 'z'
a = Base_10_to_n(n, 26)
a=a.split(' ')
ans=''
for i in a:
    ans+=dic[int(i)]
print(ans)

Submission status: Wrong Answer

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

ans2=list(reversed(ans))
for i in range(len(ans2)):
    print(ans2[i], end="")

Submission status: Wrong Answer

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

Q = [N]
R = [ ]

i = 1
while (26**i <= N ):
    Q.append(Q[i-1] // 26)
    R.append(Q[i-1] % 26) 
    i += 1
# print(Q)
# print(R)
R.reverse()
L = [i for i in "abcdefghijklmnopqrstuvwxyz"]

for i in R:
    if (i != R[-1]):
        print(L[i-1],end='')
    else:
        print(L[i-1])

Submission status: Wrong Answer

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

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

a = []
b = list('abcdefghijklmnopqrstuvwxyz')
#print(n,count,n // (26 ** A5))
count2 = 0
if n < 26 and count > 0:
    a.append(n-1)

while 1:
    #print(n)
    if n < 26:
        a.append(n-1)
        break
        
    count2 = n // (26 ** count)
    n = n % 26 ** count
    if n < 26 ** count:
        a.append(count2)
    count -= 1
    if count == 0:
        a.append(n-1)
        break
#print(n)
x = [b[a[i]]for i in range(len(a))]
print("".join(x))

Submission status: Wrong Answer

Solution code:
n = int(input())
def base10to(n, b):
    if (int(n/b)):
        return base10to(int(n/b), b) + str(n%b)
    return str(n%b)


ans = ""
ls = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
ls_26 = []
while n > 0:
    if len(ls_26):
        ls_26.append((n-1)%26)
        n //= 26
    else:
        ls_26.append((n-1)%26)
        n -= 1
        n //= 26
for i in range(len(ls_26)-1,-1,-1):
    ans += ls[ls_26[i]]
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input().strip())

name = ''
next_N = N
for i in range(11):
    m = next_N % 26
    next_N //= 26

    name = chr(0x60 + m) + name

    if next_N <= 0:
        break

print(name)

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)
 
alphabet = [chr(i) for i in range(97, 97+26)]
x10 = 2
x2 = Base_10_to_n(x10, 26)
l = [int(x) for x in list(str(x2))]
s = ""
for i in l:
    s+=alphabet[i-1]
print(s)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = "abcdefghijklmnopqrstuvwxyz"
s = []
while n >= 26:
    s.append(a[n%26 - 1])
    n = int(n / 26)
s.append(a[n%26 - 1])
print(''.join(s[::-1]))

Submission status: Wrong Answer

Solution code:
import string
if __name__ == "__main__":
    N = int(input())
    alphabets = string.ascii_lowercase
    ans = []
    while(N != 0):
        ans.append(alphabets[N%26-1])
        N = N//26
    print(''.join(ans[::-1]))

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
import string
def main():
    N = int(input())
    a, b = divmod(N, 26)
    ans = []
    while True:
        if N < 27:
            ans.append(string.ascii_lowercase[N-1])
            break
        a, b = divmod(N, 26)
        ans.append(string.ascii_lowercase[b-1])
        N = a
    print("".join(ans[::-1]))
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
A = int(input())
B = 'abcdefghijklmnopqrstuvwxyz'
a1 = 26
a2 = 26**2
a3 = 26**3
a4 = 26**4
a5 = 26**5
a6 = 26**6
a7 = 26**7
a8 = 26**8
a9 = 26**9
a10 = 26**10
a11 = 26**11

b11 = A // a11
b10 = (A - b11*a11)// a10
b9 = (A  - b11*a11 - b10*a10) // a9
b8 = (A  - b11*a11 - b10*a10 - b9*a9) // a8
b7 = (A - b11*a11 - b10* a10 - b9*a9 - b8*a8) // a7
b6 = (A - b11*a11 - b10* a10 - b9*a9 - b8*a8 - b7*a7) // a6
b5 = (A - b11*a11 - b10* a10 - b9*a9 - b8*a8 - b7*a7 - b6*a6) // a5
b4  =(A - b11*a11 - b10* a10 - b9*a9 - b8*a8 - b7*a7 - b6*a6 - a5*b5) // a4
b3 = (A - b11*a11 - b10* a10 - b9*a9 - b8*a8 - b7*a7 - b6*a6 - a5*b5 - b4*a4)//a3
b2 = (A - b11*a11 - b10* a10 - b9*a9 - b8*a8 - b7*a7 - b6*a6 - a5*b5 - b4*a4 - b3*a3)//a2
b1 = (A - b11*a11 - b10* a10 - b9*a9 - b8*a8 - b7*a7 - b6*a6 - a5*b5 - b4*a4 - b3*a3 - b2*a2)//a1
b0 = (A - b11*a11 - b10* a10 - b9*a9 - b8*a8 - b7*a7 - b6*a6 - a5*b5 - b4*a4 - b3*a3- b3*a3- b2*a2)%a1

if b11 != 0:
  print(B[b11-1],end = '')
if b6 != 0:
  print(B[b6-1],end = '')
if b10 != 0:
  print(B[b10-1],end = '')
if b9 != 0:
  print(B[b9-1],end = '')
if b8 != 0:
  print(B[b8-1],end = '')
if b7 != 0:
  print(B[b7-1],end = '')
if b6 != 0:
  print(B[b6-1],end = '')
if b5 != 0:
  print(B[b5-1],end = '')
if b4 != 0:
  print(B[b4-1],end = '')
if b3 != 0:
  print(B[b3-1],end = '')
if b2 != 0:
  print(B[b2-1],end = '')
if b1 != 0:
  print(B[b1-1],end = '')
if b0 != 0:
  print(B[b0-1],end = '\n')
else:
  print(end = '\n')

Submission status: Wrong Answer

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

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

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

if res != 0:
  ans.append(A[res-1])
elif res == 0:
  ans.append(A[25])
print(*ans[::-1], sep='')

Submission status: Wrong Answer

Solution code:
import sys
from collections import deque
def input(): return sys.stdin.readline().strip()


def main():
    n = int(input())
    ans = deque([])
    while n > 0:
        ans.appendleft(chr(96 + n % 26))
        n = (n - (n % 26)) // 26
    print("".join(ans))



if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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

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

    s = n-t

res = []
ans = ''

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

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

print(ans)

Submission status: Wrong Answer

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

    alphabet = list('-abcdefghijklmnopqrstuvwxyz')
    name = []

    while True:
        res = N % 26
        name.append(alphabet[res])

        if N - res == 0:
            break
        else:
            N = (N - res) // 26
    
    print(''.join(name[::-1]))

if __name__ == '__main__':
    main()

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-b[i-1]
        break
for i in range(c,0,-1):
    m,ind=divmod(m,26)
    ans.append(l[ind])
ans=reversed(ans)
print(*ans,sep="")

Submission status: Wrong Answer

Solution code:
N = int(input())
num = []
while N > 26:
    num.append(N%26)
    N //= 26
num.append(N)
num.reverse()
kekka = ""
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"]
for i in range(len(num)):
    kekka += alphabet[num[i]]
print(kekka)

Submission status: Wrong Answer

Solution code:
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
INF = 1000000000000

n = I()
s = "abcdefghijklmnopqrstuvwxyz"

val = [-1]*100

i = 0
tmp = n - 1
while(True):
    val[i] = tmp % 26
    tmp = tmp // 26
    tmp = tmp - 1
    i += 1
    if(tmp < 0):
        break

print(val)
result = ''
i = 0
while(val[i] >= 0):
    if(i == 0):
        result += s[val[i]]
    else:
        result += s[val[i]]
    i += 1

result = result[::-1]
print(result)

Submission status: Wrong Answer

Solution code:
import string

asc = string.ascii_lowercase
print(asc,len(asc))
N = int(input())
name = ""
tmp = N - 1
div = 1
while div > 0:
  div = tmp // 26
  mod = tmp % 26
  tmp = div - 1
  name += asc[mod]

print(name)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# import statistics # Pythonのみ
# import string
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    
    n=int(input())
    alp=list(chr(ord('a')+i) for i in range(26))
    ans=[]
    
    while n>0:
        a,b=divmod(n,26)
        n//=26
        ans.append(alp[b])
    ans2=''
    for i in ans[::-1]:
        ans2+=chr(ord(i)-1)
    
    print(ans2.replace('a`','z'))
        

    
resolve()

Submission status: Wrong Answer

Solution code:
def resolve():
    n = int(input())
    flag = 0
    name = []
    while n > 0:
        c = n % 26
        name.append(c)
        n //= 26
        if n == 1:
            flag = 1

    ans = ''.join([chr(i + 96) for i in reversed(name)])
    ans.replace('`', 'z')
    print(ans)

resolve()

Submission status: Wrong Answer

Solution code:
n = int(input())
digits = [int(26/25*(pow(26, i) - 1)) for i in range(15)]
digit = 0

for i in range(15):
    if n <= digits[i]:
        digit = i
        break
s = ''
for i in range(digit):
    m = n // pow(26, digit-i-1)
    # print("m=",m)
    s += chr(97+m-1)
    # print("s=",s)
    n -= m * pow(26, (digit-i-1))
    
print(s)

Submission status: Wrong Answer

Solution code:
N = int(input())

alp = 'abcdefghijklmnopqrstuvwxyz'

num = [26**i for i in range(1, 15)]

n1 = 0
n2 = 0

for i, n in enumerate(num):
    n1 += n
    if n >= N:
        n3 = N - n2
        k = i + 1
        break
    n2 = n1

ans = ''

for i in range(k):
    i = k-i-1
    if i == 0:
        ans += alp[n3-1]
        break
    n = n3 // 26**i
    n3 %= 26**i
    ans += alp[n]

print(ans)

Submission status: Wrong Answer

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

for i in reversed(range(0, 11)):
    if 26**i <= n:
        a.append(n//26**i)
        n = n % 26**i
if n != 0:
    a.append(n)

print(a)

for i in range(len(a)):
    ans_l.append(al[a[i]-1])

ans = ''.join(ans_l)

print(ans)

Submission status: Wrong Answer

Solution code:
import string

asc = string.ascii_lowercase
print(asc,len(asc))
N = int(input())
name = ""
tmp = N - 1
div = 1
while div > 0:
  div = tmp // 26
  mod = tmp % 26
  tmp = div - 1
  name += asc[mod]

  print(name)

Submission status: Wrong Answer

Solution code:
n = int(input())

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

cnt = 0
while True:
    cnt += 1
    if cnt == 1:
        temp = (n-1) // 26
    else:
        temp = n - 26**(cnt-1)
        temp = (temp-1) // 26**cnt
        
    if temp == 0:
        break

for i in range(1, cnt):
    n -= 26**i

ans = []

for i in range(1, cnt+1):
    temp = (n-1) // 26**(cnt-i)
    ans.append(li[temp])
    n -= temp*26**(cnt-i)

print("".join(ans))

Submission status: Wrong Answer

Solution code:
n = int(input())

i = int(1)
j = int(0)
ls = list('zabcdefghijklmnopqrstyvwxyz')
ans = ''

post = 0
while(True):
    i = pow(26, j)
    ans += ls[(n//i) % 26]
    j += 1
    if int(i*26) >= n:
        break

print(''.join(reversed(ans)))

Submission status: Wrong Answer

Solution code:

def base_convert(nl, ibase, obase):
    o = []
    while any(nl):
        c = 0
        for i in range(len(nl)):
            c = c * ibase + nl[i]
            nl[i],c = divmod(c,obase)
        o.append(c)
    o.reverse()
    return o

n = input()
list_n = [int(x) for x in list(str(n))]
ans_num = base_convert(list_n,10,26)



num2alpha = lambda c: chr(c+64)
for i in range(len(ans_num)):
    ans_num[i] = num2alpha(ans_num[i]).lower()
print(''.join(ans_num))

Submission status: Wrong Answer

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


x = int(input())

lis = [26**n for n in range(0,11)]
#print(lis)

lis_m = []
for k in range(11, -1, -1):
    m = x//(26**k)
    lis_m.append(m)
    #print(lis_m)

count = 11
for temp in lis_m:
    if temp != 0:
        #print("決定"+str(count))
        break
    else:
        count -= 1

#print(count)
ans = []
while(True):
    #何回割れるか決定
    m = x//(26**count)
    ans.append(m)
    
    #引く　新しいあまりx
    x = x - (26**count)*m
    count -= 1

    #繰り返す
    if count < 0:
        break

#print(ans)
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)

finalAns = []
for num in ans:
    finalAns.append(num2alpha(num))

#print(finalAns)
print("".join(finalAns).lower())

Submission status: Wrong Answer

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