Problem:


Score : 300 points

Problem Statement

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

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

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

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

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

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

and so on.

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

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

Now, Roger asks you:

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

Constraints

N is an integer.

 1 \leq N \leq 1000000000000001

Input

Input is given from Standard Input in the following format:

N

Output

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

Sample Input 1

2

Sample Output 1

b

Sample Input 2

27

Sample Output 2

aa

Sample Input 3

123456789

Sample Output 3

jjddja



Sample input:
2


Sample output:
b

Submission status: Wrong Answer

Solution code:
import re
n = int(input())
########関数部分##############
ANS = []
def Base_10_to_n(X, n):
    if (int(X/n)):
        ANS.append(X%n)
        return Base_10_to_n(int(X/n), n)+str(X%n)
    ANS.append(X%n)
    return str(X%n)
############################

#####関数をつかってみる．#####
######今回は二進数に変換######)
ans = Base_10_to_n(n, 26)

ans = [str(n) for n in ANS]
kore = ''
for i in ans:
    if i == '26':
        kore += 'z'
    elif i == '25':
        kore += 'y'
    elif i == '24':
        kore += 'X'
    elif i == '23':
        kore += 'w'
    elif i == '22':
        kore += 'v'
    elif i == '21':
        kore += 'u'
    elif i == '20':
        kore += 't'
    elif i == '19':
        kore += 's'
    elif i == '18':
        kore += 'r'
    elif i == '17':
        kore += 'q'
    elif i == '16':
        kore += 'p'
    elif i == '15':
        kore += 'o'
    elif i == '14':
        kore += 'n'
    elif i == '13':
        kore += 'm'
    elif i == '12':
        kore += 'l'
    elif i == '11':
        kore += 'k'
    elif i == '10':
        kore += 'j'
    elif i == '9':
        kore += 'i'
    elif i == '8':
        kore += 'h'
    elif i == '7':
        kore += 'g'
    elif i == '6':
        kore += 'f'
    elif i == '5':
        kore += 'e'
    elif i == '4':
        kore += 'd'
    elif i == '3':
        kore += 'c'
    elif i == '2':
        kore += 'b'
    elif i == '1':
        kore += 'a'

print( kore[::-1] )

Submission status: Wrong Answer

Solution code:
N = int(input())


keta_num = 1
tmp_num = 0
while True:
    if N <= (tmp_num + (26 ** keta_num)):
        break
    else:
        tmp_num += 26 ** keta_num
        keta_num += 1


# print(keta_num, tmp_num)
# print('=========')
names = []

alphabets = list('abcdefghijklmnopqrstuvwxyz')


for keta in range(keta_num, 0, -1):
    # print(N, tmp_num)
    name = (N - tmp_num) % 26
    # print(name)
    names.append(alphabets[name - 1])
    N -= tmp_num
    tmp_num = tmp_num - (26**(keta - 1))
# print(names)
print(''.join(names))

Submission status: Wrong Answer

Solution code:
N=int(input())
abclist=[]
for a in 'abcdefghijklmnopqrstuvwxyz':
    abclist.append(a)
k=0
n=N
alist=[]
while n>0:
    amari=n%26
    if amari==0:
        n=n//26-1
    else:
        n=n//26
    alist.append(amari)
print(alist)
name=''

for a in alist:
    name=abclist[a-1]+name
print(name)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = 26
c = 1
res =""
t = ""
n2 = n

num2alpha = lambda c: chr(c+64)

while True:
    if n2 == a:
        t = num2alpha(int(n2 % a))
    else:
        t = num2alpha(int(n % 26))
        print(n % 26)

    if t == "@":
        t = "z"
    res = t + res
    n = int(n / 26)
    if n2 <= a:
        break
    c += 1
    a = a + (26**c)

print(str.lower(res))

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# 日本語を入力できるようにするために上記一文が必要


x = int(input())

remainder_list = []
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".split()
while x/26 > 0:
        remainder_list.append( x % 26)
        x = x // 26


remainder_list.reverse()
ans =""
for i in remainder_list:
        ans += alphabet_list[i-1]

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
s=1
while pow(26,s)<N:
    N-=pow(26,s)
    s+=1


ans=["a"]*s
print(N)
print(s)

N-=1
for i in range(s):
    r = N%26
    ans[-i] = chr(ord(ans[-i])+r)
    N//=26

#if ans[0]=="a":
#    ans[0]="z"
#else:
#    ans[0] = chr(ord(ans[0])+1)
print("".join(reversed(ans)))

Submission status: Wrong Answer

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

l=[26**i for i in range(13)]

k=[sum(l[0:i+1]) for i in range(13)]
l.reverse()
e=0
for i in range(13):
  if n<k[i]:
    e=e
  else:
    e=e+1

list=[]
for i in range(13):
  m=int(n//l[i])
  list.append(m)
  n=n-l[i]*m
list.reverse()
for i in range(12):
  if list[i]==0:
    list[i]=26
    list[i+1]-=1

s=''
for i in range(e):
    s+=chr(ord('a')+list[i]-1)
print(s)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = ""
while N >= 1:
    if N%26 == 0:
        ans = chr(26+96) + ans
        N = int(N/26)
    else:
        ans = chr(N%26+96) + ans
        N = int(N/26)
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = list()
while n>0:
    ans.append(n % 26)
    n =int(n / 26)

str_ans = ""
for x in ans[::-1]:
    str_ans += chr(x+96)

print(str_ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

Z = []
a = []
i = 0
n = 100
Ans = []


while i == 0 :
    n = int(N/26)
    Z.append(n)
    a.append(N%26) 
    if n <= 26:
        break
    N = n
    
mozi = ["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.append(mozi[n-1])
for i in reversed(a):
    Ans.append(mozi[i-1])
    
    
Ans = "".join(Ans)
print(Ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
m = ['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']

s = ''

while (n > 26) :
    a = n % 26
    n = n // 26

    s = m[a-1] + s


a = n % 27
s = m[a-1] + s

print(s)

Submission status: Wrong Answer

Solution code:
import bisect
# import heapq
# from collections import deque
# from collections import Counter
# from fractions import gcd # >=Python3.5 # lcm（最小公倍数） = (a*b)//gcd(a,b)
# from fractions import Fraction
# from math import gcd # <Python3.5
# from math import sqrt

#input = sys.stdin.readline
#def main():

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

n = int(input())

tmp = 0
li1 = []
li2 = []

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

for i in range(100):
    tmp += 26**i
    li1.append(tmp)
    if tmp > 10**16:
        break

keta = bisect.bisect_left(li1,n)

m = n-li1[keta-1]

for i in range(100):
    a = m//26
    b = m%26
    li2.append(chr(97+b))
    if a==0:
        break
    if a<26:
        if n==1:
            pass
        elif n==27:
            li2.append(chr(97+a-1))
        else:
            li2.append(chr(97+a))
        break
    m -= b
    m = m//26

li2.reverse()
l = len(li2)

for i in range(keta):
    if l < keta:
        li2.insert(0,'a')
        l+=1
    else:
        break

print(*li2, sep='')

Submission status: Wrong Answer

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    N = I()
    s = 'abcdefghijklmnopqrstuvwxyz'
    ans = []
    for i in range(12):
        if math.pow(26, i) > N:
            break
    if i == 0:
        print('a')
        return
    if N % 26 == 0:
        i -= 1
    N -= 1
    for j in range(0, i)[::-1]:
        c = math.pow(26, j)
        shou = int(N // c)
        amari = N % int(c)
        if j == 0:
            shou += 1
        if shou == 27:
            shou = 26
        ans.append(s[shou - 1])
        N -= shou * c
    print(''.join(ans))
main()

Submission status: Wrong Answer

Solution code:
n = int(input())
NUM = []
while n != 0:
    NUM.append(n % 26)
    n = n // 26
NUM.reverse()
print(NUM)

dict = {
    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 = []
for i in NUM:
    ANS.append(dict[i])
print(''.join(ANS))

Submission status: Wrong Answer

Solution code:
N = int(input())

D = 26
lst = []
while N > 0:
    # c = N%26
    # if c == 0:
    #     ans += 'z'
    # else:
    #     ans += chr(ord('a') + (N%26) - 1)

    lst.append(N%D)
    N //= D

# print(lst)
ans = ""
z = False
for i in range(len(lst)):
    # print(i)
    if i == len(lst)-1 and lst[i] == 0:
        break

    if lst[i] == 0:
        ans += 'z'
        lst[i+1] -= 1
    else:
        ans += chr(ord('a') - 1 + lst[i])


# for c in enulst:
#     if c == 0:
#         z=True
#     else:
#         if z:
#             ans += chr(ord('z') + 1 - c)
#         else:
#             ans += chr(ord('a') - 1 + c)

# print(lst)
# print("rev:", list(reversed(lst)))
# print(ans)
print("".join(list(reversed(ans))))

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 > 0:
            if c ==27:
                c=26
                a+=26**(count-i-1)
            if c == 26:
                ans+=chr(122)
            else:
                ans+=chr(96+c)
        else:
            ans+="a"

    print(ans)

Submission status: Wrong Answer

Solution code:
import math
import string
l = list(string.ascii_lowercase)
a = int(input())
n = 26
f = False
def numalpha(num,s=''):
   if num < n:
       return l[num - 1] + s
   elif num % n == 0:
       return 'z' + s
   else:
        return numalpha(num // n, l[num % n - 1] + s)
print(numalpha(a))

Submission status: Wrong Answer

Solution code:
n = int(input())

modl = []

while n > 26:
    n, mod = divmod(n,26)
    if mod == 0:
        mod = 26
        n = n-1
    modl.append(mod)

print( *[chr(i+96) for i in modl],chr(n+96) ,sep="")

Submission status: Wrong Answer

Solution code:
N =int(input())
num2alpha = lambda c: chr(c+64)
a=[]
while N >>0:
    if N%26 != 0:
        a.append(num2alpha(int(N%26)).lower())
    N=int(N/26)
a.reverse()
print(''.join(a))

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)

Submission status: Wrong Answer

Solution code:
#n = int(input())
n =18277
alp =  ["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","z"]
name = ""
for i in range (30):
    name = alp[n%26]+name
    if n <=26:
        break
    if i >=1 and n ==27:
        name = "z"+ name[1:]
        break

    n //= 26

print(name)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import deque
n = int(input())
stack = deque()
ans =[]
while n > 0:
    if 1<= n <= 26:
        stack.append(n)
        break
    mod = n%26
    if mod == 0:
        mod = 26
    stack.append(mod)
    n = n//26
while stack:
    tmp = stack.pop()
    alp = chr(tmp+96)
    ans.append(alp)
anss = ''.join(ans)
print(anss)

Submission status: Wrong Answer

Solution code:
from collections import deque

N = int(input())
amari = []

if N <= 26:
    print(chr(96+N))

else:
    while True: 
        am = N % 26
        N = N // 26 
        amari.append(am)
        if N == 0:
            break

    for i in reversed(range(len(amari))):
        if amari[i] == 0:
            amari[i+1] -= 1
    answer = deque()
    for i in amari:
        if i == 0:
            answer.appendleft(chr(96+26))
        else:
            answer.appendleft(chr(96+i))

    for i in answer:
        print(i, end='')

Submission status: Wrong Answer

Solution code:
n = int(input())

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

k = 1
n1 = n

while n1-26**k>0:
	n1 = n1-26**k
	k+=1

ans = ''

ans = c[n1%26]+ans

for i in range(k-1):
	n1 = n1//26+1
	ans = c[n1%26]+ans

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = []
alphabet = 'abcdefghijklmnopqrstuvwxyz'
def f(n):
  ans.append(alphabet[n%26-1])
  if n > 26:
    f(n//26-1)
    
f(n)

for i in range(len(ans)):
  if i == len(ans)-1:
    print(ans[-i-1])
  else:
    print(ans[-i-1], end = '')

Submission status: Wrong Answer

Solution code:
n = int(input())
st =[chr(ord("a") + i) for i in range(26)]
ans = []
while True :
     a = n % 26
     n = n//26
     ans.append(a)
     if n <= 0 :
         break
ans.reverse()
ans.remove(ans[0])
l =[]
for i in ans:
    ls = st[i-1]
    l.append(ls)
print("".join(l))

Submission status: Wrong Answer

Solution code:
N = int(input())
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']
nList = []
while True:
  if N % 26 != 0:
    nList.append(List[(N % 26)])
    N = N // 26
  else:
    break
nList.reverse()
print(''.join(nList))

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())
M = N
v = 1
while True:
    if(M<26**v):
        break
    v += 1
if(N<=26):
    anss = al[N%26-1]
else:
  for i in range(v):
      N -= 26**i  
  ans = []
  for i in range(v-1):
      ans.append("a")
  for i in range(v-1):
      ans[-i-1]=al[N%26]
      N = N//26
  ans.reverse()
  anss = ""
  for i in range(len(ans)):
      anss += ans[-i-1]
print(anss)

Submission status: Wrong Answer

Solution code:
n = int(input())
count = []
temp = 0

while True:
  if n <= 26:
    break
  
  temp = n % 26
  count.append(int(temp))
  n = (n - temp) / 26
  


count.append(int(n))

count =[n + 96 for n in count]
count =[chr(n) for n in count]
count.reverse()

print(''.join(count))

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9

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

    a = int(math.log(n,26))
    a2 = n - 26**a
    ans = ''
    b = n
    for i in range(a+1):
        if b == 0:
            ans += chr(ord('a')+int(b//(26**(a-i))))
        else:
            ans += chr(ord('a')-1+int(b//(26**(a-i))))
        b -= 26**(a-i)*(b//(26**(a-i)))
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def resolve():
    '''
    code here
    '''
    N = int(input())

    res_list = []
    while N >= 1:
        res_list.append(N%26)
        N //= 26

    # print(res_list)
    abc = 'abcdefghijklmnopqrstuvwxyz'
    res = ''
    next_op = 0

    for item in res_list[:-1]:
        if item == 0:
            res += abc[item-1+next_op]
            next_op = -1
        else:
            res += abc[item-1+next_op]

    if next_op == -1:
        pass
    else:
        res += abc[res_list[-1]-1]


    print(res[::-1])

if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

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

a_list = []
while N // 26 >= 26:
    a_list.append(alphabet_list[N % 26 -1])
    N = N // 26

a_list.append(alphabet_list[N % 26-1])
if N // 26 != 0 and N % 26 != 0:
    a_list.append(alphabet_list[N // 26-1])
print(''.join(list(reversed(a_list))))

Submission status: Wrong Answer

Solution code:
n=int(input())

def change(a): #ここに数字からアルファベットを1体1で対応させれば終わり
  if a == 0:
    return chr(122)  #z
  else:
    return(chr(a+96))
  
p=[]
a=int(n%26)
p.append(a)
n=n/26
while n>1:
  a=int(n%26)
  p.append(a)
  n=n/26

for i in range(len(p)):
  p[i]=change(p[i])

p.reverse()  

b=''

for i in range(len(p)):
  b += p[i]
  
print(b)

Submission status: Wrong Answer

Solution code:
import math
#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 =""
z = [26**i for i in range(1,20)]

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

Submission status: Wrong Answer

Solution code:
n= int(input())
ans=''

while n>0:
    if n>26:
        x = n % 26
        if x==0:
            x=26
        ans += chr(96 + x)
        n//=26
    else:
        n-=1
        x = n % 26
        ans += chr(97 + x)
        break

print(ans[::-1])

Submission status: Wrong Answer

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

quo = n
rem = 0

while True:
    rem = quo%26
    quo = quo//26
    if quo == 26 and rem == 0:
        ans.insert(0, 'a')
    elif rem == 0:
        ans.insert(0, 'z')
        if quo < 2:
            break
    else:
        if ans[0] == 'z' and rem == 1:
            ans.insert(0, 'z')
            if quo < 2:
                break
        else:
            ans.insert(0, chr(rem+96))
    if quo == 0:
        break

print(*ans, sep="")

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    num = n
    name = []
    cap = [chr(i) for i in range(97, 97+26)]
    cap.insert(0, 'z')
    del cap[-1]

    while n >= 27:
        last = n % 26 
        n = n // 26
        name.insert(0, cap[last])
    if num % 26 == 0:
        last = (n % 26)-1
    else:
        last = n % 26
    if last == -1:
        last = 0
    name.insert(0, cap[last])
    ans = "".join(name)
    return ans
print(main())

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
check = "abcdefghijklmnopqrstuvwxyz"

if N <= 26:
  print(check[N-1])
  exit(0)
i = 1
keta = 26**i 
while keta < N:
  i += 1
  keta = 26**i +keta
if keta == N:
  print("z"*(i))
  exit(0)

if N%26**i ==0:
  print("y"+"z"*(i-1))
  exit(0)
ans = ""
for j in range(i):
  checker = math.floor(N / 26**(i - j-1 ))
  if checker > 26:
    cheker = 26
  N = N - checker*(26**(i-j-1))
  s = check[checker-1]
  ans = ans + s
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
import math

N = int(input())
count = 0
count2 = 0

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

thresh = [26**i for i in range(1,12)]
for i in range(1,len(thresh)):
 thresh[i] = thresh[i] + thresh[i-1]

for i in range(len(thresh)):
    if thresh[i] <= N:
        continue
    else:
        char_num = i+1#何文字
        name_str = ['a' for i in range(char_num)]
        if char_num > 1:
            count = N-thresh[i-1]#char_numの何個目か
            #print('char_num', char_num)
            for i in range(char_num):
                count2 = int(count/(26**(char_num-i-1)))
                if (count2 > 0)&(i!=(char_num-1)):
                    #print(count2)
                    name_str[i] = al[count2]
                    count = count - ((26**(char_num-i-1))*count2)
        else:
            count = N
        if count > 0:
            name_str[-1] = al[count-1]
        break
    
    
out = ""
for i in name_str:
    out = out + i
print(out)

Submission status: Wrong Answer

Solution code:
n = int(input())
num2alpha = lambda c: chr(c+64)
def g(x):
    L = []
    while x > 0:
        amari = x%26
        L.append(amari)
        x = x//26
    L.reverse()
    answer = ''
    for i in L:
        answer += num2alpha(i).lower()
    return print(answer)
g(n)

Submission status: Wrong Answer

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

for i in range(20):
  if N>=26:
    ans.append(chr(N%26+96))
    N = N//26
  else:
    ans.append(chr(N%26+96))
    print(*ans[::-1],sep="")
    exit()

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=""
for i in range(N):
  name+=alpha[int(N%26)]
  N/=26
print(name)

Submission status: Wrong Answer

Solution code:
N = int(input())
N -= 1
arr = []
while 0 < N:
    d, m = divmod(N, 26)
    if d == 1 and m == 0:
        arr.append(0)
        arr.append(0)
        break
    arr.append(N % 26)
    N = N // 26
ans = ''
if arr:
    for a in reversed(arr):
        ans += chr(ord('a')+a)
else:
    ans = 'a'
print(ans)

Submission status: Wrong Answer

Solution code:
import math
import string
l = list(string.ascii_lowercase)
a = int(input())
n = 26
f = False
def numalpha(num,s=''):
   if num < n:
       return l[num - 1] + s
   elif num == n:
       return 'z' + s
   else:
        return numalpha(num // n, l[num % n - 1] + s)
print(numalpha(a))

Submission status: Wrong Answer

Solution code:
import string
N = int(input())
result = []
#tmp = []
while N > 0:
    result.append(N%26)
    N = int(N / 26)
#print(result)
alpha = string.ascii_lowercase
#print(alpha)
n = len(result)
#print(result)
for i in range(n-1,-1,-1):
    #print(i)
    for j in range(26):
        if j == int(result[i]-1):
            print(alpha[j],end="")
            break

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
N1 = N
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"]
s = 0
for i in range(100):
    N /= 26
    s += 1
    A,B = math.modf(N)
    if B == 0:
        break
ans = []
for i in range(s):
    a,b = divmod(N1,26)
    ans.append(alp[b-1])
    N1 //= 26
    if a == 0:
    	break
new_ans = "".join(list(reversed(ans)))
print(new_ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
a_l=""
i=1
while i:
    if N<26:
        i=0
        l=chr(97+N-1)
    else:
        m = N % 26
        N=N//26
        if m==0:
            i=0
            l_0="z"
            if N==1:
                l=l_0
            if 1<N<=27:
                l_1 = chr(97+N-2)
                l=l_1+l_0
            if N>27:
                m1=N%26
                N=N//26
                l_1=chr(97+m1-2)
                l=l_1+l_0

        else:
            l=chr(97+m-1)
    a_l=l+a_l
print(a_l)

Submission status: Wrong Answer

Solution code:
n = int(input())

    
string = []
count = 0
info = []
while n > 26**count:
    count += 1
count -= 1
while count >= 0:
    tem = n // 26**count
    info.append(tem)
    n -= 26**count * tem
    count -= 1
    

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

print("".join(string))

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = []
cnt = 1
while N > 26:
    ans.append(N % 26)
    N = N // 26
    cnt += 1
ans.append(N)
moji = ''
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)
for a in ans[::-1]:
    moji += num2alpha(a)
print(moji.lower().replace('@', 'a'))

Submission status: Wrong Answer

Solution code:
a=int(input())

ei=[chr(i) for i in range(ord('a'), ord('z')+1)]

name_list=[]

name=""
q=int(a/26)
r=int(a%26)

if q==0:
	name_list.append(r)

while q>0:
	q=int(a/26)
	r=int(a%26)
	a=q
	name_list.append(r)

for i in range(len(name_list)):
	name+=ei[name_list[-(i+1)]-1]

print(name)

Submission status: Wrong Answer

Solution code:
import math

n = int(input())

length = 1
num = 26
l = [26]

while True:
    if num > n:
        break
    length += 1
    num = 26 ** length + num
    l.append(num)

ans = []
for i in range(length-1)[::-1]:
    if n < l[i]:
        ans.append('a')
        continue
    num = n - l[i]
    tmp = 26 ** (i+1)
    ans.append(chr(num // tmp + 97))
    n = (num+l[i]) % tmp

ans.append(chr(96 + n))

print(''.join(ans))

Submission status: Wrong Answer

Solution code:
n=int(input())

def change(a): #ここに数字からアルファベットを1体1で対応させれば終わり
  if a == 0:
    return chr(122)  #z
  else:
    return(chr(a+96))
  
p=[]
a=int(n%26)
p.append(a)
n=n/26
while n>1:
  a=int(n%26)
  p.append(a)
  n=int(n/26)

for i in range(len(p)):
  p[i]=change(p[i])

p.reverse()  

b=''

for i in range(len(p)):
  b += p[i]
  
print(b)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = ''
# ans = lambda c: chr(c+64)

# chr(ord(str))
# 26進数計算
 
'''
while True:
  if N <= 26:
    print(ans(N).lower())
    exit()
'''

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=[]
while n>0:
    a=n%26
    ans.append(chr(a+96))
    n=n//26

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

Submission status: Wrong Answer

Solution code:
import string

characters = '0' + string.ascii_lowercase
base_number = 26


def get_result(tmp, result):
    idx = (tmp % base_number)
    return characters[int(idx)] + result


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

    result = ''
    while tmp >= base_number:
        result = get_result(tmp, result)
        tmp = tmp / base_number

    print(get_result(tmp, result))


resolve()

Submission status: Wrong Answer

Solution code:
N = int(input())
if 1<= N <= 1000000000000001:
    list = 'abcdefghijklmnopqrstuvwxyz'
    amari = N
    syo = 0
    kai = ""
    for i in range(12,0,-1):
        syo = amari // 26 ** i
        amari = amari % 26 ** i
        if syo >0:
            kai += list[syo - 1]
    kai += list[amari - 1]
    print(kai)

Submission status: Wrong Answer

Solution code:
N = int(input())

alphabet = ['a', 'b', 'c','d','e','f','g', 'h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
mm = 1
name = ''
while True:
    if N > 26 ** mm:
        N = N - 26 ** mm
        mm += 1
    else:
        break
#mmけた

for i in range(mm):
    
    

    if N< 1:
        name =  'a' +name
    else:
            if N%26 == 0:
                name = alphabet[25] + name
            else:
                name = alphabet[N%26-1] + name
                N = N//26 +1
print(name)

Submission status: Wrong Answer

Solution code:
import string

n=int(input())
k = n
a = list(string.ascii_lowercase)
ans = []
tmp = 0
for i in range(1000000):
    if k < pow(26,i):
        tmp = i
        break
    else:
        k -= pow(26,i)
for v in range(tmp):
    tmp2 = n % 26 -1
    n = n//26
    if tmp2 == -1:
        tmp2 = 25
    ans.append(a[tmp2])
ans.reverse()
anss = "".join(ans)
print(anss)

Submission status: Wrong Answer

Solution code:
import math

n = int(input())
keta = int(math.log(n)/math.log(26)) + 1
name = [0]*keta

for i in range(keta):
    name[i] = n % 26
    n = n // 26

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

ans = ''

for j in range(keta):
    if name[j] != 0:
        ans = alp[name[j]-1] + ans
    elif j != keta-1:
        name[j] = 26
        name[j+1] -= 1
        ans = alp[name[j]-1] + ans

#print(name)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

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

print(ans[::-1])

Submission status: Wrong Answer

Solution code:

def main():
    N = int(input())
    ans = ''
    while N > 0:
        cnt = N % 26
        cnt -= 1
        ans = chr(97+cnt) + ans
        N //= 26
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
s = N
num = 0
ar = []
mod = s
while (s > 25):
    q, mod = divmod(s, 26)
    ar.append(mod)
    s = q
    num += 1
ar.append(mod)
ar.reverse()
for i in ar:
    print(chr(i+96), end='')

Submission status: Wrong Answer

Solution code:
n = int(input())
n_list = []
num_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']
ans = ''
while n >= 26:
    m = n % 26
    n = n // 26
    n_list.append(m)
n_list.append(n)
n_list.reverse()
for i in range(len(n_list)):
    n_list[i]= num_list[n_list[i] - 1]
    ans = ans + n_list[i]
print(str(ans))

Submission status: Wrong Answer

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