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 resolve():
    N = int(input())
    ans = ""
    while N > 26:
        carry = N // 26
        rem = N % 26
        if rem == 0:
            rem = 26
        ans = chr(ord("a")-1+rem) + ans
        N = carry
    
    rem = N % 26
    if rem == 0:
        rem = 26
    ans = chr(ord("a")-1+rem) + ans
    print(ans)


if '__main__' == __name__:
    resolve()

Submission status: Wrong Answer

Solution code:
def resolve():
    N = int(input())
    ans = ""
    while N >= 27:
        carry = N // 27
        rem = N % 27
        ans = chr(ord("a")-1+rem) + ans
        N = carry
    rem = N % 27
    ans = chr(ord("a")-1+rem) + ans
    print(ans)


if '__main__' == __name__:
    resolve()

Submission status: Wrong Answer

Solution code:
def resolve():
    N = int(input())
    ans = ""
    while N > 26:
        carry = N // 26
        rem = N % 26
        ans = chr(ord("a")-1+rem) + ans
        N = carry
    rem = N % 26
    ans = chr(ord("a")-1+rem) + ans
    print(ans)


if '__main__' == __name__:
    resolve()

Submission status: Wrong Answer

Solution code:
n = int(input())
m = 1  # 文字数
while n > 26 ** m:
  m += 1
ans = ''
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']
for i in range(m):
  if n < 26:
    ans = abc[n - 1] + ans
    break
  q = n // 26
  r = n % 26
  n = q
  ans = abc[r - 1] + ans
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
alp = lambda c: chr(c+64)

def Base10to(n,k):
    if(int(n/k)):
        return Base10to(int(n/k),k)+str(alp(n%k))
    return str(alp(n%k))

n = int(input())
k = 26

ans = Base10to(n,k)
print(ans.lower())

Submission status: Wrong Answer

Solution code:
alp = lambda c: chr(c+64)

def Base10to(n,k):
    if(int(n/k)):
        print(alp(n%k))
        return Base10to(int(n/k),k)+str(alp(n%k))
    return str(alp(n%k))

n = int(input())
k = 26

ans = Base10to(n,k)
print(ans.lower())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = []
while(n > 0):
    x = n %  26
    n = n // 26
    if(x == 0):
        ans.append("z")
    else:
        ans.append(chr(x + ord('a') -1))

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

Submission status: Wrong Answer

Solution code:
k = 27**11
basenum = [k]
for i in range(11):
    k/=27
    basenum.append(int(k))

n = int(input())
ans = []
f = 0
for i in range(1,12):
    if(basenum[i-1] > n >= basenum[i]):
        f = 1
        c = n//basenum[i]
        ans.append(chr(c+ord("a")-1))
        n = n-c*basenum[i]
    elif(f == 1):
        ans.append("a")
print("".join(ans))

Submission status: Wrong Answer

Solution code:
n = int(input())
k = 3670344486987776
keta = [3670344486987776]
while(k>1):
    k/= 26
    keta.append(int(k))
    # print(k)
# print(keta)
sin26 = []
f = 0
for i in range(1,12):
    # print(keta[i-1],n,keta[i],i)
    if(keta[i-1] > n and n >= keta[i]):
        f = 0
        c = n//keta[i]
        sin26.append(chr(c+ord("a")-1))
        n %= keta[i]
    elif(f == 1):
        sin26.append("a")

print("".join(sin26))

Submission status: Wrong Answer

Solution code:
n = int(input())

abc = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
while n:
    n, m = divmod(n, 26)
    ans = abc[m-1] + ans
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

sub = []
while n > 0:
    sub.append(chr(97 + ((n % 26) - 1)))
    n = n // 26

for i in range(len(sub)):
    print(sub[len(sub)-i - 1],end="")

Submission status: Wrong Answer

Solution code:
N = int(input())
ls = []
while N > 0:
    a = N % 26
    N //= 26
    ls.append(a+96)
print("".join(map(chr, reversed(ls))))

Submission status: Wrong Answer

Solution code:
def findNum(n):
    num = []
    while n > 0:
        num.append(n % 26 - 1)
        n //= 26
    return num

n = int(input())
l = [chr(i) for i in range(97, 97+26)]
array = findNum(n)
ans = ""
for i in array:
    ans += l[i]
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

while True:
    tmp.append(N%26)
    N = N // 26
    if N == 0:
        break

ans = ""
for i in range(len(tmp)):
    ans = az[tmp[i] - 1] + ans

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
eList = ['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 = N
mod = N
numList = []

while n > 0:
  n, mod = divmod(n,26)
  if mod != 0:
    numList.insert(0, mod - 1)
  else:
    numList.insert(0, 25)
    n -= 1
print(numList)

Submission status: Wrong Answer

Solution code:
N = int(input())
eList = ['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 = N
mod = N
numList = []

while n > 26:
  n, mod = divmod(n,26)
  if mod != 0:
    numList.insert(0, mod)
  else:
    numList.insert(0, 26)
  

if n != 0:
  if mod == 0:
    numList.insert(0, n-1)
  else:
    numList.insert(0, n)
ans = ''
for num in numList:
  ans += eList[num - 1]
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
eList = ['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 = N
mod = 0
numList = []

while n > 26:
  n, mod = divmod(n,26)
  if mod != 0:
    numList.insert(0, mod)
if n != 0:
  numList.insert(0, n)

ans = ''
for num in numList:
  ans += eList[num - 1]
print(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']
n=int(input())
ans=''
while n!=0:
    ans=alpha[n%26-1]+ans
    n//=26
print(ans)

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

a = []

s = ''
while(N>0):
    N=N-1
    s+=ALPHABET[N%26]
    N = N//26

print(s)

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

a = []

s = ''
while(N>0):
    s+=ALPHABET[N%26-1]
    N = N//26

print(s)

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

a = []
count=0
while N>0:
    amari = N%26
    a.append(amari)
    N = N//26
    count+=1

s = ''
for i in range(count):
    s+=ALPHABET[a[i-1]-1]

print(s)

Submission status: Wrong Answer

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

l = ['z']+[c for c in string.ascii_lowercase]
def f(N: int):
    if N // 26:
        return f(N//26) + l[N%26]
    else:
        return l[N%26]

def solve(N):
    print(f(N))

# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

    lb, ub = 0, 0
    for n_digit in range(1, 100):
        lb = ub + 1
        ub = (ub + 1) * 26
        if lb <= N <= ub:
            off = N - lb
            res = []
            while off > 0:
                off, r = divmod(off, 26)
                res.append(r)
            res.reverse()
            res = [chr(ord('a') + x) for x in res]
            res = ''.join(res).ljust(n_digit, 'a')
            return res
    
print(solve())

Submission status: Wrong Answer

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

#名前の桁数を求める （p:桁数）
p=1
while N-1>26**p-1:
  p += 1

A = [0]*p

for i in range(p):
  q = (p-1)-i
  A[q]=N // 26**q
  N = N%26**q

txt = ""
for i in range(p):
  q = (p-1)-i
  if A[q] == 0:
    txt += 'z'
  else:
    txt += chr(ord('a')+A[q]-1)
print(txt)

Submission status: Wrong Answer

Solution code:
n = int(input())
pVal = 1
idx = 0
res = []
total = 0

while(26 * pVal + total < n):
  n -= pVal
  total += 26 * pVal
  pVal *= 26
  res.append('a')

res.append('a')
n -= pVal

while(n > 0):
  put = n//pVal
  if(put > 0):
    res[idx] = chr(put + 97)

  idx += 1
  n -= put * pVal
  pVal /= 26
  pVal = int(pVal)

print(str.join('', res))

Submission status: Wrong Answer

Solution code:
n = int(input())
pVal = 1
idx = 0
res = []


while(26 * pVal < n):
  n -= pVal
  pVal *= 26
  res.append('a')

res.append('a')
n -= pVal

while(n > 0):
  put = n//pVal
  if(put > 0):
    res[idx] = chr(put + 97)
  idx += 1
  n -= put * pVal
  pVal /= 26
  pVal = int(pVal)

print(str.join('', res))

Submission status: Wrong Answer

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

while n > 0:
  r_list.append(n % 26)
  n //= 26

for i in range(len(r_list)):
  p = r_list.pop()
  ans += chr(p + 96)
  
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input().rstrip())
A = [""]*11
B = [""]*11
txt = ""

for i in range(11):
  y = 10-i
  A[i] = int(N/26**y)%26
  
p = 11
while A[11-p] == 0:
  p -= 1

for i in range(p):
  B[10-i] = chr(A[10-i]+96)
  
for i in range(11):
  txt += B[i]


#print(A)
#print(B)
print(txt)
#print(p)

"""
a = 97
z = 122
"""

Submission status: Wrong Answer

Solution code:
def sol():
    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']
    n = int(input())
    ans = ''
    for i in range(100000):
        if n // 26 >= 1:
            ans = alphabet[int(n % 26 - 1)] + ans
            n = n / 26
            continue
        else:
            ans = alphabet[int(n % 26 - 1)] + ans
            break
    print(ans)

if __name__ == "__main__":
    sol()

Submission status: Wrong Answer

Solution code:
N = int(input())

i = 1
T = 26
ans = ""
while True:
    if N < T ** i:
        N -= 1
        while i > 0:
            N, r = divmod(N, T)
            ans += chr(r + ord('a'))
            i -= 1
        break
    else:
        N -= T ** i
        i += 1
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())

tmp = 0
for ll in range(1,15):
  tmp+=26**ll
  if n <= tmp:
    break

ans = ""
for l in range(1,ll+1):
  n-=1
  ans+=chr(n%26+ord('a'))
  n //= 26**l
print(ans[::-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
p=0
q=1
li=[0]
while p<1000000000000001:
    p+=26**q
    li.append(p)
    q+=1
ok=0
ng=12
n=int(input())
while abs(ok-ng)>1:
    mid=(ok+ng)//2
    if n<=li[mid]:
        ng=mid
    else:
        ok=mid
keta=ok
ans=""
while keta>=0:
    x=n//(26**keta)
    n%=26**keta
    ans+=chr(x+96)
    keta-=1
print(ans)

Submission status: Wrong Answer

Solution code:
alphabet = 'zabcdefghijklmnopqrstuvwxy'
num_2_alpha = {i:alphabet[i] for i in range(26)}

def named(N):
  _ = ''
  while N > 0:
    a = N % 26
    N //= 26
    _ += num_2_alpha[a]
  return _[-1::-1]

N = int(input())
print(named(N))

Submission status: Wrong Answer

Solution code:
import math

n = int(input())

'''
(26**(m+1) - 26) / 25 <= n
26**(m+1) <= 25n + 26
m <= log(25n+26, 26) - 1
'''

m = int(math.log(25*n+26, 26) - 1)

d = n - (26**(m+1) - 26) // 25

alphabetTable = ['z']
alphabetTable.extend(chr(i) for i in range(97,123))

print(alphabetTable)

if d == 0:
  print('z' * m)

else:
  dd = []
  cnt = 0
  for i in range(1, m+2):
    cnt += 1
    amari = d % 26
    d = d//26 + 1
    if amari == 0:
      d -= 1
    dd.append(amari)
    if d <= 0:
      break
  
  print(cnt)


  alpha = [alphabetTable[dd[i]] for i in range(cnt)]
  alpha.extend(['a' * (m+1-cnt)])
  alpha.reverse()
  print(''.join(alpha))

Submission status: Wrong Answer

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

flag = True

while flag == True:
  s = n % 26
  shinsu.append(s)
  if n <= 26:
    flag = False
  n //= 26

alphabetTable = ['z']
alphabetTable.extend(chr(i) for i in range(97,123))

shinsu.reverse()
name = [alphabetTable[i] for i in shinsu]
print(''.join(name))

Submission status: Wrong Answer

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

flag = True

while flag == True:
  s = n % 26
  shinsu.append(s)
  n //= 26
  if n <= 26:
    flag = False

alphabetTable = ['z']
alphabetTable.extend(chr(i) for i in range(97,123))

shinsu.reverse()
name = [alphabetTable[i] for i in shinsu]
print(''.join(name))

Submission status: Wrong Answer

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

flag = True

while flag == True:
  s = n % 26
  shinsu.append(s)
  n //= 26
  if n == 0:
    flag = False

alphabetTable = ['z']
alphabetTable.extend(chr(i) for i in range(97,123))

shinsu.reverse()
name = [alphabetTable[i] for i in shinsu]
print(''.join(name))

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = ''

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

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


n = int(input())
print(Base_10_to_n(n, 26))

Submission status: Wrong Answer

Solution code:
n = int(input())

alp = 'zabcdefghijklmnopqrstuvwxy'

name = []

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

name.reverse()

print(*name,sep='')

Submission status: Wrong Answer

Solution code:
n = int(input())

alp = 'zabcdefghijklmnopqrstuvwxy'

name = []

while n > 0:
    name.append(alp[n % 26])
    n //= 26 

name.reverse()

print(*name,sep='')

Submission status: Wrong Answer

Solution code:
n = int(input())
m = 1
while n > 26 ** m:
  m += 1
ans = ''
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']
for j in range(m):
  for i in range(26):
    if 26 ** (m - 1) * (i + 1) > n:
      ans += abc[i - 1]
      break
  n -= 26 ** (m - 1) * i
  m -= 1
print(ans)

Submission status: Wrong Answer

Solution code:
import string
N = int(input())
L = string.ascii_lowercase
ans = []

while 1 < N//26 :
    ans.append(L[(N%26)-1])
    N //= 26
else :
    ans.append(L[(N%26)-1])

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

Submission status: Wrong Answer

Solution code:
import string
N = int(input())
L = string.ascii_lowercase
ans = []

while 1 <= N//26 :
    ans.append(L[(N%26)-1])
    N //= 26
else :
    ans.append(L[(N%26)-1])

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

Submission status: Wrong Answer

Solution code:
N = int(input())

digit = 0
max = 0
while True:
    if N <= max:
        break
    digit += 1
    max += 26 ** digit
under_digit = 0

for i in range(1, digit):
    under_digit += 26 ** i

order = N - under_digit - 1 #0_index
# print("order:", order)

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

remain = order
now = digit - 1

# print("digit:", digit)
ans = ""
# print(ans)
# counter = 0
if remain == 0:
    ans = "a" * digit
while True:
    # print("---------------")
    # counter += 1
    # print("counter", counter)
    # if counter >= 10:
    #     break

    ans = ans + letter[remain // (26 ** now)]
    remain %= 26 ** now
    now -= 1
    # print("ans:", ans, "remain:", remain, "now:", now)
    if remain == 0:
        ans = ans + "a" * (now + 1)
        break

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

digit = 0
max = 0
while True:
    if N <= max:
        break
    digit += 1
    max += 26 ** digit
under_digit = 0

for i in range(1, digit):
    under_digit += 26 ** i

order = N - under_digit - 1 #0_index
# print("order:", order)

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

remain = order
now = digit - 1

# print("digit:", digit)
ans = ""
# print(ans)
# counter = 0
if remain == 0:
    ans = "a" * digit
while True:
    # print("---------------")
    # counter += 1
    # print("counter", counter)
    # if counter >= 10:
    #     break

    ans = ans + letter[remain // (26 ** now)]
    remain %= 26 ** now
    now -= 1
    # print("ans:", ans, "remain:", remain, "now:", now)
    if remain == 0:
        ans += "a"
        break

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

digit = 0
max = 0
while True:
    if N <= max:
        break
    digit += 1
    max += 26 ** digit
under_digit = 0

for i in range(1, digit):
    under_digit += 26 ** i

order = N - under_digit - 1 #0_index
# print("order:", order)

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

remain = order
now = digit - 1

# print("digit:", digit)
ans = ""
# print(ans)
# counter = 0
if remain == 0:
    ans = "a" * digit
while True:
    # print("---------------")
    # counter += 1
    # print("counter", counter)
    # if counter >= 10:
    #     break

    ans = ans + letter[remain // (26 ** now)]
    remain %= 26 ** now
    now -= 1
    # print("ans:", ans, "remain:", remain, "now:", now)
    if remain == 0:
        ans = ans + "a"
        break

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

digit = 0
max = 0
while True:
    if N <= max:
        break
    digit += 1
    max += 26 ** digit
under_digit = 0

for i in range(1, digit):
    under_digit += 26 ** i

order = N - under_digit - 1 #0_index
# print("order:", order)

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

remain = order
now = digit - 1

# print("digit:", digit)
ans = ""
# print(ans)
# counter = 0
if remain == 0:
    ans = "a" * digit
while remain != 0:
    # print("---------------")
    # counter += 1
    # print("counter", counter)
    # if counter >= 10:
    #     break

    ans = ans + letter[remain // (26 ** now)]
    remain %= 26 ** now
    now -= 1
    # print("ans:", ans, "remain:", remain, "now:", now)

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

digit = 0
max = 0
while True:
    if N <= max:
        break
    digit += 1
    max += 26 ** digit
under_digit = 0

for i in range(1, digit):
    under_digit += 26 ** i

order = N - under_digit - 1 #0_index
# print("order:", order)

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

remain = order
now = digit - 1

# print("digit:", digit)
ans = ""
# print(ans)
counter = 0
while remain != 0:
    # print("---------------")
    counter += 1
    # print("counter", counter)
    # if counter >= 10:
    #     break

    ans = ans + letter[remain // (26 ** now)]
    remain %= 26 ** now
    now -= 1
    # print("ans:", ans, "remain:", remain, "now:", now)

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

digit = 0
max = 0
while True:
    if N <= max:
        break
    digit += 1
    max += 26 ** digit
under_digit = 0

for i in range(1, digit):
    under_digit += 26 ** i

order = N - under_digit - 1 #0_index
# print("order:", order)

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

remain = order
now = digit - 1

# print("digit:", digit)
ans = ""
# print(ans)
counter = 0
while remain != 0:
    # print("---------------")
    counter += 1
    # print("counter", counter)
    if counter >= 10:
        break

    ans = ans + letter[remain // (26 ** now)]
    remain %= 26 ** now
    now -= 1
    # print("ans:", ans, "remain:", remain, "now:", now)

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
alp = 'abcdefghijklmnopqrstuvwxyz'
for i in range(0,12):
    if 26**i <= n < 26**(i+1):
        j = i
        break
x = n-(26**j)
w = ""
for h in range(j,-1,-1):
    if h == j:
        w += alp[x//(26**h)]
        x = x%(26**h)
    else:
        w += alp[x//(26**h)-1]
    x = x%(26**h)
print(w)

Submission status: Wrong Answer

Solution code:
#C
N=int(input())
a='abcdefghijklmnopqrstuvwxyz'
alp=list(a)
Name=[]
for i in reversed(range(11)):
    if N/(26**i) >=1:
        alp_index=N//(26**i)-1 if N//(26**(i-1))!=26 else 25
        Name.append(alp[alp_index])
    N=N%(26**i)
print(''.join(Name))

Submission status: Wrong Answer

Solution code:
N = int(input())
letters = 'zabcdefghijklmnopqrstuvwxy'

def solve(N):
    md = N%26
    l = letters[md]
    if md==0: md=26
    if N>26:
        return solve((N-md)//26) + l
    else:
        return l

Submission status: Wrong Answer

Solution code:
#C
N=int(input())
alp=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
Name=[]
for i in reversed(range(11)):
    if N/(26**i) >=1:
        alp_index=N//(26**i)-1 if N//(26**(i-1))!=26 else 25
        Name.append(alp[alp_index])
    N=N%(26**i)
print(''.join(Name))

Submission status: Wrong Answer

Solution code:
#C
N=int(input())
alp=['_','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
Name=[]
for i in reversed(range(11)):
    if N/(26**i) >1:
        alp_index=N//(26**i)
        Name.append(alp[alp_index])
    N=N%(26**i)
print(''.join(Name))

Submission status: Wrong Answer

Solution code:
#C
N=int(input())
alp=['_','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
Name=[]
for i in reversed(range(11)):
    if N/(26**i) >=1:
        alp_index=N//(26**i)
        Name.append(alp[alp_index])
    N=N%(26**i)
print(''.join(Name))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


def d_to_n(x, n):
    if (int(x/n)):
        return d_to_n(int(x/n), n) + alphabet[x%n-1]
    return alphabet[x%n-1]


print(d_to_n(N, 26))

Submission status: Wrong Answer

Solution code:
#N, K = map(int, input().split( ))
#L = list(map(int, input().split( )))
N = int(input())
i = 0
ans = []
#26^{i}がNを越えるまで以下の操作を繰り返す
while N != 0:
  s = N%26
  N = N//26
  ans.append(chr(s + 96))

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

Submission status: Wrong Answer

Solution code:
#N, K = map(int, input().split( ))
#L = list(map(int, input().split( )))
N = int(input())
i = 0
ans = []
#26^{i}がNを越えるまで以下の操作を繰り返す
while N >= 1:
  s = N%26
  N = N//26
  ans.append(chr(s + 96))

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

Submission status: Wrong Answer

Solution code:
n = int(input())
str1 = ""

while n > 0:
    m = n % 26
    if m == 0:
      m = 26
    n = n // 26
    str1 += chr(m+96)
ans = str1[::-1]
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
str1 = ""

while n > 0:
    m = n % 26
    n = n // 26
    str1 += chr(m+96)
ans = str1[::-1]
print(ans)

Submission status: Wrong Answer

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

r = q % 26
q = int(q / 26)
a.append(r)
while q >= 26:
    r = q % 26
    q = int(q / 26)
    a.append(r)
    if q < 26:
        a.append(q)
a.reverse()
for i in range(len(a)):
    print(alp[a[i]-1], end='')

Submission status: Wrong Answer

Solution code:
N = int(input())
q = N
alp = [chr(i) for i in range(97,97+26)]
a = []
r = q % 26
q = int(q / 26)
a.append(r)
while q >= 26:
    r = q % 26
    q = int(q / 26)
    a.append(r)
    if q < 26:
        a.append(q)
a.reverse()
str = ''
for i in range(len(a)):
    str += alp[a[i]-1] 
print(str)

Submission status: Wrong Answer

Solution code:
N = int(input())
q = N
alp = [chr(i) for i in range(97,97+26)]
a = []
while q >= 26:
    r = q % 26
    q = int(q / 26)
    a.append(r)
    if q < 26:
        a.append(q)
a.reverse()
str = ''
for i in range(len(a)):
    str += alp[a[i]-1] 
print(str)

Submission status: Wrong Answer

Solution code:
N = int(input())
q = N
alp = [chr(i) for i in range(97,97+26)]
a = []
while q >= 26:
    r = q % 26
    q = int(q / 26)
    a.append(r)
    if q < 26:
        a.append(q)
a.reverse()
for i in range(len(a)):
    print(alp[a[i]-1], end='')

Submission status: Wrong Answer

Solution code:
n = int(input())
k = 0
num_list = [0] * 11

for i in range(11):
    num_list[i] = 26**(i+1)
    if n <= sum(num_list[:i]):
        k = i
        break
'print(num_list)'
'''print('k=' , k)'''
diff = n - (sum(num_list[:k-1]) + 1)
'''print(diff)'''
ans = ['a']*(k)
arr = [0] * (k)

for i in range(len(ans)):
    
    arr[i] = diff // 26**(len(ans)-1-i)%26

    '''print('arr = ',i,' ', arr[i])'''
    '''print('ans = ',i,' ', ord(ans[i]))'''
    ans[i] = (chr((ord(ans[i]) + arr[i])))
    

print(''.join(ans))

Submission status: Wrong Answer

Solution code:
N = int(input())
l = 'abcdefghijklmnopqrstuvwxyz'
s = ''
a = N % 27
s += l[a-1]
N //= 26
while(N!=0):
  a = N % 27
  s += l[a-1]
  N //= 26
print(s[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
l = 'abcdefghijklmnopqrstuvwxyz'
s = ''
a = N % 26
s += l[a-1]
N //= 26
while(N!=0):
  N -= 1
  a = N % 27
  s += l[a-1]
  N //= 26
print(s[::-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

l = 'abcdefghijklmnopqrstuvwxyz'
s = ''
n = 1

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

Submission status: Wrong Answer

Solution code:
N = int(input())

l = 'abcdefghijklmnopqrstuvwxyz'
s = ''
n = 1

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

Submission status: Wrong Answer

Solution code:
N = int(input())

l = 'abcdefghijklmnopqrstuvwxyz'
s = ''
n = 1

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

Submission status: Wrong Answer

Solution code:
N = int(input())

l = 'abcdefghijklmnopqrstuvwxyz'
s = ''
n = 1

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

Submission status: Wrong Answer

Solution code:
N = int(input())

l = 'abcdefghijklmnopqrstuvwxyz'
s = ''
n = 1

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

Submission status: Wrong Answer

Solution code:
from math import log

n = float(input())

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



alpha = []
def Base_10_to_n(X, n):
    global alpha
    if (int(X/n)):
        alpha = Base_10_to_n(int(X/n), n) + [X%n]
        return alpha
    return [X%n]

a = Base_10_to_n(n,26)
out = []
for i in range(len(a)):
    out.append(alphabet[int(a[i])])
print(''.join(out))

Submission status: Wrong Answer

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

while N!=0:
	ans+=check[(N-1)%26]
	N=N//26

print(ans[::-1])
"""
while N>0:
	N-=1
	ans+=chr(ord("a")+ N%26)
	N//=26
print(ans[::-1])
"""

Submission status: Wrong Answer

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

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

print(ans[::-1])
"""
while N>0:
	N-=1
	ans+=chr(ord("a")+ N%26)
	N//=26
print(ans[::-1])
"""