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:
def main():
    import sys
    input = sys.stdin.readline
    from bisect import bisect_left
    N = int(input())
    if N == 1:
        print("a")
        sys.exit()
    d = [chr(i) for i in range(97, 97+26)]
    X = [0, 26]
    y = 26
    while y < 10**15:
        y *= 26
        X.append(X[-1] + y)
    x = bisect_left(X, N) # 桁数
    a = N - X[x-1] - 1
    ans = []
    while a > 0:
        ans.append(a%26)
        a //= 26
    for a in reversed(ans):
        print(d[a], end="")
    print()

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
len_list = list()
len_list.append(1)
l1 = 26
len_list.append(l1)
l2 = l1*26
len_list.append(l2)
l3 = l2*26
len_list.append(l3)
l4 = l3*26
len_list.append(l4)
l5 = l4*26
len_list.append(l5)
l6 = l5*26
len_list.append(l6)
l7 = l6*26
len_list.append(l7)
l8 = l7*26
len_list.append(l8)
l9 = l8*26
len_list.append(l9)
l10 = l9*26
len_list.append(l10)


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

N = int(input())

name = ''
len = 0
if N > l10:
    len=10
elif N == l10:
    print('zzzzzzzzzz')
    sys.exit()
elif N > l9:
    len=9
elif N == l9:
    print('zzzzzzzzz')
    sys.exit()
elif N > l8:
    len=8
elif N == l8:
    print('zzzzzzzz')
    sys.exit()
elif N > l7:
    len=7
elif N == l7:
    print('zzzzzzz')
    sys.exit()
elif N > l6:
    len=6
elif N == l6:
    print('zzzzzz')
    sys.exit()
elif N > l5:
    len=5
elif N == l5:
    print('zzzzz')
    sys.exit()
elif N > l4:
    len=4
elif N == l4:
    print('zzzz')
    sys.exit()
elif N > l3:
    len=3
elif N == l3:
    print('zzz')
    sys.exit()
elif N > l2:
    len=2
elif N == l2:
    print('zz')
    sys.exit()
elif N > l1:
    len=1
elif N == l1:
    print('z')
    sys.exit()
else:
    len=0

while len >= 0:
    if N // len_list[len] > 0:
        name += alpha[(N // len_list[len]) -1]
        N = N % len_list[len]
    else:
        name += 'a'
    len -= 1
print(name)

Submission status: Wrong Answer

Solution code:
import string
N = int(input()) - 1
a = list(string.ascii_lowercase)
ans = ''
tmp = 0
while True:
    m, v = divmod(N, 26)
    if m == 0:
        N = m
    else:
        N = m - 1
    ans += a[v]
    if N <= 25:
        break
if N != 0:
    ans += a[N]
print(ans[::-1])

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"

if(s[-1]==0):
	print((len(s)-1)*"z")
else:
	for g in range(len(s)):

		print(ans[s[g]-1],end="")
	print()

Submission status: Wrong Answer

Solution code:
n=int(input())

alp='abcdefghijklmnopqrstuvwxyz'

########関数部分##############
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)
############################
l=list(Base_10_to_n(n,26).split())

ans=''

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

print(ans)

Submission status: Wrong Answer

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

while N != 0:
    sup = N % 26
    ans.append(chr(96 + sup))
    N = N // 26

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

Submission status: Wrong Answer

Solution code:
N = int(input())
char = [i for i in range(97, 97+26)]
a_n = 96
base = 26
base_list = []
ans = ''

while N > 0:
    add = N % 26
    if add==0:
        add=26
    ans += chr(a_n+add)
    N = N // 26
#     # base_list += [base]
#     # base = base + base*26

# base = 26
# # cumsum = 0
# for b in enumerate(base_list):
#     ans += chr(a_n+(N%base))
#     N = (N-base)
#     base = base*26
#     # print(N)
# ans += chr(a_n+N%base)
# print(base_list)
print(ans[::-1])
# if N <

Submission status: Wrong Answer

Solution code:
from math import floor
alphabets = ["_","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())
res = ""
i=10
while i>-1:
    divres = floor(n/(26**i))
    res += alphabets[divres]
    n-= divres * (26 ** i)
    i-=1
while res[0]=="_":
    res = res[1:]
i=len(res)-1
while i>-1:
    if res[i] == "_":
        if i == 0:
            res = res[1:]
        else:
            res = res[:i-1] + alphabets[alphabets.index(res[i-1])-1] + "z" + res[i+1:]
    i-=1
print(res)

Submission status: Wrong Answer

Solution code:
n = int(input())
res = ""
for i in range(1,100):
    a = n % 26

    if n <= 26:
        break

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

Submission status: Wrong Answer

Solution code:
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']

ans = []
def rec(n):
    #print(n)
    if n>26:
        ans.append(abc[int(n%26)])
        return rec(int(n/26))
        #ans.append(abc[int(n%26)])
        #print(n%26)
    else:
       ans.append(abc[int(n-1)])
       #print(n%26)
N = int(input())
rec(N)
for i in range(len(ans)-1,-1,-1):
    print(ans[i],end="")

Submission status: Wrong Answer

Solution code:
n=int(input())
import math
k=math.ceil(math.log(n,26)) # 名前の文字数
n=n-(26**k -26)//25-1
s=""
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"]
for i in range(k):
  s=al[n%26]+s
  n=n//26
print(s)

Submission status: Wrong Answer

Solution code:
import numpy as np
n= int(input())

digit = str(np.base_repr(n, 26))
if digit[0] == "1":
  target = digit[1:]
else:
  target = digit

ans = target.translate(str.maketrans({'1':'a','2':'b','3':'c','4':'d','5':'e','6':'f','7':'g','8':'h','9':'i','A':'j','B':'k','C':'l','D':'m','E':'n','F':'o','G':'p','H':'q','I':'r','J':'s','K':'t','L':'u','M':'v','N':'w','O':'x','P':'y','0':'z'}))
print(ans)

Submission status: Wrong Answer

Solution code:
#C
alphabet = "abcdefghijklmnopqrstuvwxyz"
n = int(input())
cnt = 0
amari = []
while n // 26 > 0:
    n_before = n
    amari.append(str(n%26))
    a = n % 26
    n = n // 26
    cnt += 1
#print(a)
#print(n)
#print(cnt)
amari.append(str(n))
amari.reverse()
#print(amari)
result = []
if "".join(amari) == "1"*cnt + "0":
    print('z'*cnt)
else:
    for i in range(len(amari)):
        result.append(alphabet[int(amari[i])-1])
    print("".join(result))

Submission status: Wrong Answer

Solution code:
N = int(input())
alpha = 'zabcdefghijklmnopqrstuvwxyz'
ans = []
digit = 1

while True:
    div = N // 26
    mod = N % 26
    ans.append(alpha[mod])
    N -= 26 ** digit
    if N <= 0:
        break
    else:
        digit += 1
ans = ans[::-1]

name = ''
for i in range(len(ans)):
    name += ans[i]
print(name)

Submission status: Wrong Answer

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

list_moji = []
n = int(N/26)
m = N%26
list_moji.append(m)
while n != 0:
    tmp = n
    n = int(tmp/26)
    m = tmp%26
    list_moji.append(m)

string = ""
if list_moji[0] == 0:
    print("z"*(len(list_moji)-1))
else:
    for i in reversed(list_moji):
        if i != 0:
            string += chr(96 + i)

print(string)

Submission status: Wrong Answer

Solution code:
import string
characters = string.ascii_lowercase
 
def base_cvt(value, n):
    try:
        tmp = int(value)
    except:
        raise ValueError('Invalid value:', value)
 
    if n < 2 or n > len(characters):
        raise ValueError('Invalid n:', value)
 
    result = ''
    tmp = int(value)
    while tmp >= n:
        idx = tmp%n
        result = characters[idx] + result
        tmp = int(tmp / n)
    idx = tmp%n
    result = characters[idx] + result
    return result
  
def test_base(self):
    self.assertEqual('0', n_ary.base_cvt('0'))
    self.assertEqual('1', n_ary.base_cvt('1'))
    self.assertEqual('101', n_ary.base_cvt('5'))
    self.assertEqual('1010', n_ary.base_cvt('10'))
    self.assertEqual('10000', n_ary.base_cvt('16'))
 
    value = '10000000'
 
    self.assertEqual('46113200', n_ary.base_cvt(value, 8))
    self.assertEqual('989680', n_ary.base_cvt(value, 16))
    self.assertEqual('5yc1s', n_ary.base_cvt(value, 36))
    self.assertEqual('FXsk', n_ary.base_cvt(value, 62))
     
    # エラー処理
    with self.assertRaises(ValueError):
        # 数字以外だとエラー
        v = n_ary.base_cvt('hoge')
    with self.assertRaises(ValueError):
        # 62進数以上を出そうとするとエラー
        v = n_ary.base_cvt('1000000', 63)
    with self.assertRaises(ValueError):
        # 1以下でもエラー
        v = n_ary.base_cvt('1000000', 1)
 
input = int(input()) -1
#print(input)

    # 一覧出力してみる
print(base_cvt(input, 26))

Submission status: Wrong Answer

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

while number != 0:
  number, a = divmod(number, 26)
  name_tag.append(a)
  
reverse_name_tag = reversed(name_tag)
for i in reverse_name_tag:
  print(alphabet[i-1], end="")

Submission status: Wrong Answer

Solution code:
n = int(input())
result = ""
while True:
    alpha = int(n % 26)
    if alpha == 0:
        result += "z"
    else:
        result += chr(alpha + 96)
    if n/26 <= 1:
        break
    n /= 26

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

Submission status: Wrong Answer

Solution code:
N = int(input())

ans=''
while True:
  n = (N-1)%26
  ans = chr(n+64+1) + ans
  N = N//26
  if N == 0: break

print(ans.lower())

Submission status: Wrong Answer

Solution code:
string = 'abcdefghijklmnopqrstuvwxyz'

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

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

alphabets = [chr(i) for i in range(97, 97+25)] 
alphabets.insert(0, 'z')

E = []
E.append( N%26 )

while N/26 > 1 :
  N = int(N/26)
  E.append( N%26 )

w = []
for ee in E:
  w.append(alphabets[ee])

print("".join(list(reversed(w))))

Submission status: Wrong Answer

Solution code:
n = int(input())


def Base_10_to_n(X, n):
    X_dumy = X
    out = ""
    ans = []
    while X_dumy>0:
        out = str(X_dumy%n)
        ans.append(int(out))
        X_dumy = int(X_dumy/n)
    return ans


alpha = "abcdefghijklmnopqrsyuvwxyz"
s = Base_10_to_n(n, 26)[::-1]

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

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
alp = list()
for ch in '-abcdefghijklmnopqrstuvwxyz':
    alp.append(ch)

def Base_10_to_n(X, n):
    X_dumy = X
    out = []
    while X_dumy > 0:
        out.append(X_dumy % n)
        X_dumy = int(X_dumy/n)
    return out
x = int()
s = str()
l = Base_10_to_n(n, 26)
#print(l)
for i in l:
    if alp[i]!='-':
        s = alp[i] + s
    elif x==len(l)-1:
        s = 'a' + s 
    x+=1 

print(s)

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)

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

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 count == 0:
        a.append(n-1)
        break
    
    count2 = n // (26 ** count)
    n = n % 26 ** count
    a.append(count2)
    count -= 1

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

Submission status: Wrong Answer

Solution code:
n = int(input())
def base(X, n):
    X_dumy = X
    out = []
    while X_dumy>0:
        out.append(str(X_dumy%n))
        X_dumy = int(X_dumy/n)
    return out[::-1]

ans = ''
bsd = base(n,26)
for i in range(1,len(bsd)):
  if bsd[i-1]==1 and bsd[i]==0:
    ans += 'z'
  else:
    ans += chr(96+int(bsd[i-1]))
if bsd[-1]!=0:
  ans += chr(96+int(bsd[-1]))
print(ans)

Submission status: Wrong Answer

Solution code:
def int2alphabet(N, I):
  s = ""
  tmp = sorted(list(range(I)), reverse=True)
  for i in tmp:
    q = N//(26**i)
    s = s + chr(q+96)
    N = N - q * (26**i)
  return s

def main():
  N = int(input())
  i = 1
  while(True):
    if N-26**i-1 < 0:
      print(int2alphabet(N, i))
      break
    else:
      i = i+1

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

N = int(input())
N -= 1

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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



X_dumy = N
ans=[]
m=1
while X_dumy>26**m:
    m+=1
m=m-1
while m>=0:
    ans.append(X_dumy//26**m)
    X_dumy=X_dumy%(26**m)
    m=m-1

for i in range(len(ans)):
    ans[i]=str(alph[ans[i]-1])    
    

print("".join(ans))

Submission status: Wrong Answer

Solution code:
import string


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

    characters = string.ascii_lowercase

    result = ''
    tmp = int(N)
    while tmp >= 26:
        idx = (tmp % 26) - 1
        result = characters[idx] + result
        tmp = int(tmp / 26)

    idx = (tmp % 26) - 1
    result = characters[idx] + result

    print(result)

resolve()

Submission status: Wrong Answer

Solution code:
n = int(input()) - 1

ans = ""

a = [chr(97 + i) for i in range(26)]  # 小文字リスト

if n == 0:
    print("a")
    exit()


# 1桁目だけ1~26
div = n // 26
amari = n % 26
ans = a[amari] + ans
n = div

# 2桁以降は0~25
while n > 0:
    div = n // 26
    amari = n % 26
    ans = a[amari - 1] + ans
    n = div

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
if N > 26:
    k = 1
    d = 0
    while N > k:
        d += 1
        k *= 26
    P = []
    for i in range(d-1):
        p, q = divmod(N, 26**(d-i-1))
        P.append(p)
        N = q 
    P.append(q)
    ans = ''
    for p in P:
        ans += chr(p+96)
    print(ans, P)
else:
    print(chr(96+N))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# import sys
# input = sys.stdin.readline
# import re
import itertools

def main():
    n = int(input())
    i = 0
    base = 26
    v = base
    s = 'abcdefghijklmnopqrstuvwxyz'
    a = ''
    borders = [27, 703, 18279, 475255, 12356631, 321272407, 8353082583, 217180147159, 5646683826135, 146813779479511]
    skip = False
    while True:
        if skip and n in borders:
            n -= 1
        i = n % 26
        n //= 26
        a += s[i-1]
        if n == 0:
            break
        skip = True
    print(a[::-1])


def count_tento(l, cur):
    count = 0
    for v in l:
        if v > cur:
            count += 1
    return count

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

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a=int(input())
s=0
si=[]
while a!=0:
    b=a%26
    si.append(b)
    a=a//26
 
c=""
for i in si:
    if i==0:
      i=26
    c+=chr(i+96)
c=c[::-1]
print(c)

Submission status: Wrong Answer

Solution code:
n = int(input())
alphalist = [".","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"] 
dogcode = []
dogstr = ""

ndiv,nmod = divmod(n,27)
dogcode.insert(0,alphalist[nmod])

while ndiv >= 27:
  ndiv,nmod = divmod(ndiv,27)
  dogcode.insert(0,alphalist[nmod])

if ndiv < 27 and ndiv != 0:
  dogcode.insert(0,alphalist[ndiv])

for i in dogcode:
  dogstr += i

print(dogstr)

Submission status: Wrong Answer

Solution code:
N = int(input())

amari = []
while(N>=1):
    if N%26 == 0:
        amari.append(chr(26+96))
        N = N//27
    else:
        amari.append(chr(N%26+96))
        N = N//26
amari.reverse()
for i in range(len(amari)):
    print(amari[i],end = "")

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 -1
  str += arfa[amari-1]
str += arfa[n-1]
print(str[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
# = map(int, input().split())
# = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
# = [list(map(int, input().split())) for i in range(N)]
alpha = [chr(ord('a') + i) for i in range(26)]
name = []
number = []
a = 1
count = 0

while N//a > 0:
    a = a*26
    count += 1

a = a/26

for i in range(count):
    num = int(N//a)
    number.append(num)
    N = N - num*a
    a = a//26

#print(number)


for i in number:
    name.append(alpha[i-1])

result = "".join(name)
print(result)

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())
bs = Base_10_to_n(N,26)
ans = ""
alphabet_list = ["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 b in bs:
  ans += alphabet_list[int(b)-1]
print(ans)

Submission status: Wrong Answer

Solution code:
def alpha2num(alpha):
    num=0
    for index, item in enumerate(list(alpha)):
        num += pow(26,len(alpha)-index-1)*(ord(item)-ord('a')+1)
    return num
  
N = input()
ans = alpha2num(N)
print(ans)

Submission status: Wrong Answer

Solution code:
w = int(input())
n = w
ans = ""


def letter(i):
    if i == 0:
        return "z"
    return chr(i+96)


cnt = 26**30
check = -1
flg = False
for t in range(31):
    if cnt > n:
        if not flg:
            cnt //= 26
            continue
    if not flg:
        check = 30-t
        flg = True
    y = n // cnt
    n -= y * cnt
    ans += letter(y)

if 26**check <= w < 26**(check+1):
    print(ans[1:])
else:
    print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

s = ""
a = "abcdefghijklmnopqrstuvwxyz"

while n > 0:
    s = a[n%26-1] + s
    n //= 26
    
print(s)

Submission status: Wrong Answer

Solution code:
import math
from typing import List, NoReturn, Tuple


def main() -> NoReturn:
    n: int = int(input())
    # 0.9615384615384616 == 25 / 26
    group: int = math.floor(math.log(0.9615384615384616 * n + 1, 26))
    in_group_index: int = n - (26 * (26 ** group - 1)) // 25

    if in_group_index == 0:
        print("z" * group)
        return
    else:
        alphabet_num: List[int] = []
        alphabet: str = "abcdefghijklmnopqrstuvwxyz"
        temp = in_group_index
        for i in range(group, -1, -1):
            alphabet_num.append(temp // 26 ** i)
            temp %= 26 ** i
        name_chars: List[str] = [alphabet[i] for i in alphabet_num]
        name_chars[-1] = alphabet[alphabet_num[-1] - 1]
        print("".join(name_chars))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

    ans = []


    while True:
        a,b = divmod(N, 26)
        ans.append(b)
        N = a
        if a==0:
            break

    trueans = []
    for i in ans:
        trueans.append(chr(96+i))


    print("".join(reversed(trueans)))




if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
a=int(input())
list=[]
for i in range(15,-1,-1):
  b = a // (26**i)
  a = a - b*(26**i)
  if b >0:
    list.append(b)
for i,k in zip(list,range(len(list))):
  list[k]=chr(i+96)
result=''.join(list)
print(result.replace("`",''))

Submission status: Wrong Answer

Solution code:
N = int(input())

#26の倍数の辞書を保持する
1000000000000001
141167095653376
a = 1
baisu = []
ruiseki = [26]

for i in range(11):
    a *= 26
    baisu.append(a)
    if i != 0:
        ruiseki.append(ruiseki[i-1]+a)

#何桁か  
length = 0
new_N = 0
for i,rui in enumerate(ruiseki):
    if N < rui:
        length = i+1
        if i!=0:
            new_N = N-ruiseki[i-1]
        else:
            new_N = N
        break

# print(new_N)
# print(length)
# print(baisu)

ans = []
for i in range(length):
    u = 0
    cnt = 0
    while(1):
        if new_N <= 26:
            ans.append(new_N-1)
            break
        pre_u = u
        u += baisu[length - i -2 ]
        if new_N < u:
            ans.append(cnt)
            new_N -= pre_u
            break
        cnt += 1

alp = [chr(ord('a') + i) for i in range(26)]
ans_c = ""

for an in ans:
    ans_c+=alp[an]
print(ans_c)




# while(1):
#     for bai in baisu:


# print(baisu)
# print(ruiseki)

Submission status: Wrong Answer

Solution code:
N = int(input())
lis = []
flg = True
while N > 26:
    if flg == True:
        if N % 26 == 0:
            lis.append(26)
            flg = False
        else:
            lis.append(N % 26)
    else:
        lis.append(26)
    N //= 26
if flg == True:
    lis.append(N)
else:
    lis.append(26)
#print(lis)
for i in range(len(lis)):
    lis[i] = chr(lis[i]+ord('a')-1)
lis.reverse()
print(''.join(lis))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = []
while n  >= 25:
    n,amari = divmod(n,26)
    s.append(amari)
s.append(n)
num2alpha = lambda c: chr(c+64)
ans = ''
s = list(reversed(s))

for i in range(len(s)):
    ans += num2alpha(s[i])
ans = ans.lower()
if '@' in ans:
    ans = ans.replace('a','z').replace('@','')
print(ans)

Submission status: Wrong Answer

Solution code:
ip = int(input())
alphabet = "abcdefghijklmnopqrstuvwxyz"
ans = ""
while ip >= 26:
    ans+=alphabet[ip%26-1]
    ip//=26

ans+=alphabet[ip%26-1]
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
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',]
name = ""
while N >= 26:
    mod = N % 26
    N = N // 26
    name += alpha[mod-1]
name +=alpha[N-1]
print(name[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
l = [0]
ans = []
a = 0
cur = 1
while a < 1000000000000001:
  a += 26**cur
  cur += 1
  l.append(a)
l = list(reversed(l))
for i in range(len(l)-1):
  if l[i] > n:
    ans.append(0)
  else:
    div = n//(l[i]-l[i+1])
    n = n%(l[i]-l[i+1])
    ans.append(div)
ans.append(n)
ans =list(map(lambda x:x+96, ans))
ans2 = []
for i in ans:
  if i > 96:
    ans2.append(chr(i))
ans2 = "".join(ans2)
print(ans2)

Submission status: Wrong Answer

Solution code:
n = int(input())
al = list('abcdefghijklmnopqrstuvwxyz')

amari = []

while n != 0:
  amari.append(n%26)
  n = n//26
  
amari.reverse()

ans = ''
for i in amari:
  ans += al[i-1]
  
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())

alp='0abcdefghijklmnopqrstuvwxyz'

########関数部分##############
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)
############################
l=list(Base_10_to_n(n,26).split())
ans=''

for i in range(len(l)):
    ans+=alp[int(l[i])]

print(ans)

Submission status: Wrong Answer

Solution code:
def A(x):
  if ord(x) - ord('a') >= 0:
    print('a')
  else:
    print('A')


def B(n, k, p_list):
  p_list = sorted(p_list)
  print(sum(p_list[:k]))


def _get_base_x(n, x):
  a = [
      'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o',
      'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'
  ]
  b = []
  while True:
    s = n // x
    y = n % x
    b = b + [y]
    if s == 0:
      break
    n = s
  b.reverse()
  ret = []
  for i in b:
    ret.append(a[i - 1])
  print(''.join(ret))


def C(x):
  _get_base_x(x, 26)


def main():
  # letter = input()
  # A(letter)
  # for x in ['A', 'Z', 'a', 'z']:
  #   A(x)

  # n, k = map(int, input().split())
  # p_list = map(int, input().split())
  # B(n, k, p_list)
  C(int(input()))
  # C(475256)


if __name__ == '__main__':
  main()

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)])
    print(ans.replace('`', 'z'))


resolve()

Submission status: Wrong Answer

Solution code:
if __name__ == "__main__":
    
    n = int(input())
    index = "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".split()

    s = ""
    while True:
        if n == 0: break
        m = n%26
        s = index[m] + s
        n = int(n/26)

    print(s)

Submission status: Wrong Answer

Solution code:
n = int(input())

b = n%26
ans = chr(b+96)
i = 2
while 1:
    c = chr(((n-b)%26**i)//26**(i-1)+96)
    if c != "`":   
        ans += c
        b += (n-b)%26**i
    else:
        break
    i += 1
print(ans[::-1])

Submission status: Wrong Answer

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

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


resolve()

Submission status: Wrong Answer

Solution code:
alphabet = [
    '0', '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())
dog = n
name = ''
keta = 0
while dog > 26:
    dog //= 26
    keta += 1

while keta > 0:
    if n % (26**keta) != 0:
        v = n // (26**keta)
        name += alphabet[v]
        n -= v * 26**keta
    else:
        v = n // (26**keta) - 1
        name += alphabet[v]
        n -= v * 26**keta
    keta -= 1

name += alphabet[n]

print(name)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = []
for i in range(26):
    a.append(chr(0x61 + i))

l = []
for i in range(20):
    x = N % 26
    l.append(a[x - 1])
    N = N // 26
    if N == 0:
        break

print("".join(reversed(l)))

Submission status: Wrong Answer

Solution code:
if __name__ == '__main__':
    a = int(input())
    list=[]
    b=0
    for i in range(11):
        b+=26**(i+1)
        list.append(b)

    count = 0
    for i in range(11):
        if a <= list[i]:
            count = i+1
            break
    ans=""
    for i in range(count):
        div = 26**(count-i-1)
        c = a// div
        a = a % div
        if c ==27:
            c=26
            a=26
        if c == 26:
            ans+=chr(122)
        else:
            ans+=chr(96+c)

    print(ans)

Submission status: Wrong Answer

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

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