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 sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
L = [chr(i) for i in range(97, 97 + 26)]


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

    res = ""
    while n:
        n, r = divmod(n, 26)
        res += L[r - 1]
    print(res[::-1])


if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
def conv(a): #convert the num to character 
  a += 96
  return chr(a)

# 整数の入力
n = int(input())
name = ''

while n>26:
  name += conv(n%26)
  n = n//26
  
name += conv(n%26)
name = name[::-1]
# 出力
print(name)

Submission status: Wrong Answer

Solution code:
def gen_col_name(col_num: int) -> str:
    alphabet = list("abcdefghijklmnopqrstuvwxyz")
    col_name = ""
    while col_num != 0:
        col_num, mod = divmod(col_num, len(alphabet))
        col_name += alphabet[mod-1]
    return col_name[::-1]

print(gen_col_name(int(input())))

Submission status: Wrong Answer

Solution code:
import string

N = int(input())
answer = []
alpha = string.ascii_lowercase
while True:
    yo = N % 26
    answer.append(alpha[yo-1])
    wari = N // 26
    if wari < 26:
        if wari > 0 and not yo == 0:
            answer.append(alpha[wari-1])
        break
    N = wari

print(''.join(reversed(answer)))

Submission status: Wrong Answer

Solution code:
n = int(input())
keta = 0
n1 = 0

while n1 < n:
	keta += 1
	n1 += 26**keta

chr_l = []
for i in range(26):
	s = chr(ord('a')+i)
	chr_l.append(s)

ans = ''
for i in range(1,keta+1):
	keta1 = keta-i
	idx = min(26,n//(26**keta1))
	ans += chr_l[idx-1]
	n -= idx*(26**keta1)

print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())

ans=""

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

Submission status: Wrong Answer

Solution code:
n=int(input())

ans=""

while n!=0:
    a=n%26
    ans+=chr(96+a)
    n//=26
    
print(ans[::-1])

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)
    else:
        return ''
############################

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

ans = [str(n) for n in ANS][::-1]
kore = ''
for i in ans:
    if 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'
    elif i == '0':
        kore += 'z'
print( kore )

Submission status: Wrong Answer

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

start = int(math.log(n, 26))
answer = list()
for i in range(start + 1)[::-1]:
    wk = (n // (26 ** i))
    answer.append(wk)
    n = n - ((26 ** i) * wk)


if answer[-1] == 0:
    answer[-1] += 1
    answer[-2] -= 1

print(''.join([chr(a + 96) for a in answer if a != 0]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import string
s = string.ascii_lowercase


def f(x, tmp):
    if x == 0:
        return ""
    if x <= 26:
        return s[x - 1] + tmp
    else:
        return f(x // 26, s[x % 26 - 1] + tmp)


n = int(input())
r = f(n, "")
print(r)

Submission status: Wrong Answer

Solution code:
N=int(input())
N1=N
cnt=1
while True:
  N1=N1//26
  if N1>=1:
    cnt+=1
  else:
    break
import itertools
abc=[chr(i) for i in range(97, 97+26)]
name=list(itertools.combinations(abc,cnt))
L=[]
for i in range(cnt):
  N, mod = divmod(N, 26)
  tmp=abc[mod-1]
  L.append(tmp)
L=L[::-1]
ans=''.join(L)
print(ans)

Submission status: Wrong Answer

Solution code:
#10進数から26進数への変換の問題
#与えられた数を26で割った余りがa~zに対応する
st="Xabcdefghijklmnopqrstuvwxyz"
ans=""
kazu=int(input())
while(True):
    add=kazu%26
    if(add==0):#0の時zにするため
        add=26
    ans=st[add]+ans#アルファベットを後ろから加えてく
    if(kazu<=26):#割った商が0になったら終わり
        break
    kazu=kazu//26#26で割って切り捨て

print(ans)

Submission status: Wrong Answer

Solution code:
#10進数から26進数への変換の問題
#与えられた数を26で割った余りがa~zに対応する
st="Xabcdefghijklmnopqrstuvwxyz"
ans=""
kazu=int(input())
while(True):
    add=kazu%26
    if(add==0):#0の時zにするため
        add=26
    ans=st[add]+ans#アルファベットを後ろから加えてく
    kazu=kazu//26#26で割って切り捨て
    if(kazu==0):#割った商が0になったら終わり
        break
print(ans)

Submission status: Wrong Answer

Solution code:
#10進数から26進数への変換の問題
#与えられた数を26で割った余りがa~zに対応する
import string
st=string.ascii_lowercase#abc…
ans=""
kazu=int(input())
while(True):
    add=kazu%26
    if(add==0):#0の時zにするため
        add=26
    ans=st[add-1]+ans#アルファベットを後ろから加えてく
    kazu=kazu//26#26で割って切り捨て
    if(kazu==0):#割った商が0になったら終わり
        break
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
 
an =[]
while n!=0:
    n,q=divmod(n,26)
    an.append(chr(q+96))
an.reverse()    
print(''.join(an))

Submission status: Wrong Answer

Solution code:
n = int(input())
 
an =[]
i=0
while i <11:
    i+=1
    if 26**(11-i)<=n:
        wk = n//26**(11-i)
        if wk==1 and n//27**(11-i)<1:
            an.append('z')
            i+=1
            continue
#        print(wk,n,i)
        an.append(chr(wk%26+96))
        n -= wk*26**(11-i)

print(''.join(an))

Submission status: Wrong Answer

Solution code:
n = int(input())
 
an =[]
i=0
while i <11:
    i+=1
    if 26**(11-i)<=n:
        wk = n//26**(11-i)
        if wk==1 and n//27**(11-i)<1:
            an.append('z')
            i+=1
            continue
        print(wk,n,i)
        an.append(chr(wk%26+96))
        n -= wk*26**(11-i)

print(''.join(an))

Submission status: Wrong Answer

Solution code:
import sys


def input():
    return sys.stdin.readline().strip()


sys.setrecursionlimit(20000000)

MOD = 10 ** 9 + 7
INF = float("inf")


def main():
    N = int(input())
    L = []
    while N > 0:
        L.append(N % 26)
        N //= 26
    flag = False
    for i in range(len(L)):
        if L[i] == 0:
            flag = True
            for j in range(i + 1, len(L)):
                if L[j] == 0:
                    for k in range(i, j):
                        L[k] = 26
                    for k in range(j + 1, len(L)):
                        if L[k] == 2:
                            L[k] = 26
                        elif L[k] == 1:
                            L[k] = 25
                        else:
                            L[k] -= 2
                    L = L[:j] + L[j + 1 :]

                    flag = False
                    break

            if flag:
                L[i] = 26
                for k in range(i + 1, len(L)):
                    if k == len(L) - 1:
                        L = L[:-1]
                        break
                    if L[k] != 1:
                        L[k] -= 1
                        break
                    else:
                        L[k] = 26
                break

            else:
                break
    # print(L)
    answer = ""
    for a in L[::-1]:
        answer += chr(ord("a") + a - 1)
    print(answer)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import sys


def input():
    return sys.stdin.readline().strip()


sys.setrecursionlimit(20000000)

MOD = 10 ** 9 + 7
INF = float("inf")


def main():
    N = int(input())
    L = []
    while N > 0:
        L.append(N % 26)
        N //= 26
    # print(L)
    flag = False
    for i in range(len(L)):
        if L[i] == 0:
            flag = True
            for j in range(i + 1, len(L)):
                if L[j] == 0:
                    for k in range(i, j):
                        L[k] = 26
                    for k in range(j + 1, len(L)):
                        if L[k] == 2:
                            L[k] = 26
                        elif L[k] == 1:
                            L[k] = 25
                        else:
                            L[k] -= 2
                    L = L[:j] + L[j + 1 :]

                    flag = False
                    break

            if flag:
                for k in range(i + 1, len(L)):
                    if L[k] == 1:
                        L[k] = 26
                    else:
                        L[k] -= 1
                L = L[:i] + L[i + 1 :]
                break
            else:
                break
    # print(L)
    answer = ""
    for a in L[::-1]:
        answer += chr(ord("a") + a - 1)
    print(answer)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import sys


def input():
    return sys.stdin.readline().strip()


sys.setrecursionlimit(20000000)

MOD = 10 ** 9 + 7
INF = float("inf")


def main():
    N = int(input())
    L = []
    while N > 0:
        L.append(N % 26)
        N //= 26
    # print(L)
    flag = False
    for i in range(len(L)):
        if L[i] == 0:
            flag = True
            for j in range(i + 1, len(L)):
                if L[j] == 0:
                    for k in range(i, j):
                        L[k] = 26
                    for k in range(j + 1, len(L)):
                        if L[k] == 2:
                            L[k] = 26
                        elif L[k] == 1:
                            L[k] = 25
                        else:
                            L[k] -= 2
                    L = L[:j] + L[j + 1 :]

                    flag = False
                    break

        if flag:
            for k in range(i + 1, len(L)):
                if L[k] == 1:
                    L[k] = 26
                else:
                    L[k] -= 1
            L = L[:i] + L[i + 1 :]
            break
        else:
            break
    # print(L)
    answer = ""
    for a in L[::-1]:
        answer += chr(ord("a") + a - 1)
    print(answer)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys


def input():
    return sys.stdin.readline().strip()


sys.setrecursionlimit(20000000)

MOD = 10 ** 9 + 7
INF = float("inf")


def main():
    N = int(input())
    L = []
    while N > 0:
        L.append(N % 26)
        N //= 26

    L = L[::-1]
    for _ in range(len(L)):
        for i in range(len(L)):
            if L[i] == 0:
                for j in range(i):
                    if L[j] != 1:
                        L[j] -= 1
                    else:
                        L[j] = 26
                L = L[:i] + L[i + 1 :]
                break

    answer = ""
    for l in L:
        answer += chr(ord("a") + l - 1)
    print(answer)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def to_i(n, i):
    if (int(n/i)):
        return to_i(int(n/i), i)+chr(n%i+96)
    return chr(n%i+96)


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

Submission status: Wrong Answer

Solution code:
import sys


def input():
    return sys.stdin.readline().strip()


sys.setrecursionlimit(20000000)

MOD = 10 ** 9 + 7
INF = float("inf")


def main():
    N = int(input())
    L = []
    while N > 0:
        L.append(N % 26)
        N //= 26

    L = L[::-1]
    for _ in range(len(L)):
        for i in range(len(L)):
            if L[i] == 0:
                for j in range(i):
                    if L[j] != 1:
                        L[j] -= 1
                    else:
                        L[j] = 26
                L = L[:i] + L[i + 1 :]
                break

    if L[0] == 0:
        print("z" * (len(L) - 1))
    else:
        answer = ""
        for l in L:
            answer += chr(ord("a") + l - 1)
        print(answer)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy

def main():
    n = int(input())
    ans = ""
    alpa = "abcdefghijklmnopqrstuvwxyz"
    while n:
        ans += alpa[n%26-1]
        n//=26
    ans2 = ""
    for i in range(len(ans)):
        ans2 += ans[len(ans)-i-1]
    print(ans2)
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
#ABC 171 C - One Quadrillion and One Dalmatians 10:59

n = int(input())
q = []
while n > 0:
    v = n % 26
    q.append(v)
    n //= 26
    if n == 1 and v == 0:
        break

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

for i in reversed(q):
    res += dic[i]

print(res)

Submission status: Wrong Answer

Solution code:
#https://atcoder.jp/contests/abc171/tasks/abc171_c

n=[int(i) for i in input().split()]

now=n[0]
li=[]
while now>26:
    li.append(now%26)
    now=now//26
    #print(li)
li.append(now)

#print(li)
ans=""
for i in li:
    ans+=chr(96+i)

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
#https://atcoder.jp/contests/abc171/tasks/abc171_c

n=[int(i) for i in input().split()]

now=n[0]
li=[]
while now>26:
    li.append(now%26)
    now=int(now/26)
    #print(li)
li.append(now)

#print(li)
ans=""
for i in li:
    ans+=chr(96+i)

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = chr((n % 26) + 96)
tmp = n // 26

while tmp > 0:
  ans = chr((tmp % 26) + 96) + ans
  tmp = tmp // 26
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
q = []
while n > 0:
    v = n % 26
    q.append(v)
    n //= 26

res = ''
for i in reversed(q):
    res += chr(i+64).lower()

print(res)

Submission status: Wrong Answer

Solution code:
N = int(input())

alphabets = [chr(i) for i in range(97, 97+26)]
x = N
buf = 26
ans = ""

while True:
    if x <= 0:
        break
    ans = alphabets[x % buf - 1] + ans
    x //= 26

print(ans)

Submission status: Wrong Answer

Solution code:
def solve(n):
    s = [chr(ord("a")+i) for i in range(26)]
    res = ""
    while n > 0:
        res = s[n % 26 - 1] + res
        n //=26
    return res

n = int(input())
print(solve(n))

Submission status: Wrong Answer

Solution code:
n = int(input())
res = ''
while n > 0:
    n, t = divmod(n, 26)
    if t == 0:
        t = 26
    res += chr(96+t)
print(res[::-1])

Submission status: Wrong Answer

Solution code:
N=int(input())
num=0
ans=""
for i in range(1,9):
    if 26**i > N:
       N-=1
       for j in range(i):
           ans+=chr(ord("a")+N%26)
           N//=26
       break
    else:
       N-=26**i
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N=int(input())
num=0
ans=""
for i in range(1,9):
    if 26**i > N:
       for j in range(i):
           ans+=chr(ord("a")+N%26)
           N//=26
       break
    else:
       N-=26**i
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N=int(input())
num=0
ans=""
for i in range(1,9):
    if 26**i >= N:
       N-=1
       for j in range(i):
           ans+=chr(ord("a")+N%26)
           N//=26
       break
    else:
       N-=26**i
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N=int(input())
num=0
ans=""
for i in range(1,9):
    if 26**i >= N:
       for j in range(i):
           ans+=chr(ord("a")+N%26)
           N//=26
       break
    else:
       N-=26**i
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())

res = ''
while 0 < n:
    r = n % 26
    if r == 0:
        r += 26
    res += chr(r+ord('a')-1)
    n //= 26

print(res[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())

res = ''
while 0 < n:
    r = n % 26
    res += chr(r+ord('a')-1)
    n //= 26

print(res[::-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def dec2alpha(num):
  res = ""
  count = 0
  while num > 0:
    tmp = num % 26
    num = num // 26
    char = chr(tmp + ord('`'))
    res = char + res
  return res

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

alphabet = 'abcdefghijklmnopqrstuvwxyz'


def name(n):
    if n <= 26:
        return alphabet[n - 1]
    else:
        return name(n // 26) + name(n % 26)


print(name(n))

Submission status: Wrong Answer

Solution code:
def solve():
    n=int(input())
    ans=''
    check='abcdefghijklmnopqrstuvwxyz'
    while n!=0:
        n-=1
        ans+=check[n%26]
    print(ans[::-1])
    return 0

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
#関数リスト
import sys
input = sys.stdin.readline
 
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

num = I()
result = ""
alphabet = [chr(ord('a') + i) for i in range(26)]

while True:
    result = alphabet[num % 27 - 1] + result
    num = num // 27
    if num == 0:
        break
print(result, end = '')

Submission status: Wrong Answer

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

start = int(math.log(n, 26))
answer = list()
for i in range(start + 1)[::-1]:
    wk = (n // (26 ** i))
    answer.append(wk)
    n = n - ((26 ** i) * wk)

print(''.join([chr(a + 96) for a in answer]))

Submission status: Wrong Answer

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

n = ni()

ans=[]
while n>0:
  ans.append(chr(ord('a')+n%26-1))
  n//=26
print(''.join(ans[::-1]))

Submission status: Wrong Answer

Solution code:
#関数リスト
import sys
input = sys.stdin.readline
 
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

num = I()
result = ""
alphabet = [chr(ord('a') + i) for i in range(26)]

while True:
    result = alphabet[num % 26 - 1] + result
    num = num // 26
    if num == 0:
        break

print(result, end = '')

Submission status: Wrong Answer

Solution code:
#関数リスト
import sys
input = sys.stdin.readline
 
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

num = I()
result = ""
alphabet = [chr(ord('a') + i) for i in range(26)]

while True:
    result = alphabet[num % 26 - 1] + result
    num = num // 26
    if num == 0:
        break
print(result)

Submission status: Wrong Answer

Solution code:
N = int(input()) 
ans=''
for i in range(1, 99):
    if N <= 26 ** i: 
        N -= 1
        for j in range(i):
            ans += chr(ord('a') + N % 26) 
            N //= 26
        break 
else:
    N -= 26 ** i 
print(ans[::-1])

Submission status: Wrong Answer

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


def main():
    from string import ascii_lowercase
    import sys
    input = sys.stdin.readline

    n = int(input())
    ans = ''
    alpha = list(ascii_lowercase)

    while n >= 26:
        p, q = divmod(n, 26)

        if q != 0:
            ans += alpha[q - 1]

        n = p

    if n > 0:
        ans += alpha[n - 1]

    print(ans[::-1])


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n=int(input())
#x,n=map(int,input().split())
#pl=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]

res=''

# 文字数を求める
total=0
i=1
while True:
    if total+26**i>n:
        break
    else:
        total+=26**i
        i+=1

# 文字数iがわかったので，そのなかでn-i番目
k=n-total-1
for j in range(i):
    res+=chr(ord('a')+k%26)
    k=k//26

print(res[::-1])

Submission status: Wrong Answer

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


def main():
    from string import ascii_lowercase
    import sys
    input = sys.stdin.readline

    n = int(input())
    ans = ''
    alpha = list(ascii_lowercase)

    while n >= 26:
        p, q = divmod(n, 26)

        ans += alpha[q - 1]
        n = p

    if n > 0:
        ans += alpha[n - 1]

    print(ans[::-1])


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
l = []
while n != 0:
    n -= 1
    l += chr(97+n%26)
    n //= 26
print("".join(l))

Submission status: Wrong Answer

Solution code:
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','z']
n=int(input())
ans=""
while n>0:
 n-=1
 a=n%26
 ans+=alp[a-1] 
 n=int(n//26)

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
import sys


def input():
    return sys.stdin.readline().strip()


sys.setrecursionlimit(20000000)

MOD = 10 ** 9 + 7
INF = float("inf")


def main():
    MAX = 1000000000000001
    N = int(input())
    a = N
    L = []
    cnt = 0
    while a > 0:
        L.append(a % 26)
        a //= 26
        cnt += 1
    answer = ""
    for i in range(cnt):
        a = L[cnt - i - 1]
        answer += chr(ord("a") + a - 1)
    print(answer)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

n=int(input())
ans=""
while n>0:
 a=n%26
 ans+=alp[a-1] 
 n=int(n//26)

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
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']
 
n=int(input())
ans=""
while n>0:
 a=n%26
 ans+=alp[a] 
 n=int(n//26)
 
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
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']
 
n=int(input())
ans=""
while n>0:
 a=n%26
 ans+=alp[a-1] 
 n=int(n//26)
 
print(ans[::-1])

Submission status: Wrong Answer

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

n=int(input())
ans=""
while n>0:
 a=n%26
 ans+=alp[a-1] 
 n=int(n//26)

print(ans[::-1])

Submission status: Wrong Answer

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

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
import sys

if sys.subversion[0] == "PyPy":
    import io, atexit

    sys.stdout = io.BytesIO()
    atexit.register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))

    sys.stdin = io.BytesIO(sys.stdin.read())
    input = lambda: sys.stdin.readline().rstrip()
RS = raw_input
RA = lambda x=int: map(x, RS().split())
RN = lambda x=int: x(RS())


def solve():
    s = numberToBase(n, 26)
    for i in reversed(range(len(s))):
        if s[i] == 0:
            if i-1 >= 0:
                s[i] = 26
                s[i-1] -= 1
            else:
                s.remove(0)
    ans = [chr(int(c) + ord("a")- 1) for c in s]
    print "".join(ans)
    return


def numberToBase(n, b):
    if n == 0:
        return [0]
    digits = []
    while n:
        digits.append(int(n % b))
        n //= b
    return digits[::-1]

n = RN()
solve()

Submission status: Wrong Answer

Solution code:
import sys
from collections import deque

sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7


def input():
    return sys.stdin.readline().strip()


def main():
    N = int(input())
    alpahbet = [chr(ord("a") + i) for i in range(26)]

    ans = deque([])
    while N > 0:
        if N % 26 == 0:
            ans.appendleft(alpahbet[-1])
        else:
            ans.appendleft(alpahbet[N % 26 - 1])
        N //= 26

    print(*ans, sep="")


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

n=(N-1)%26
name.append(chr(ord("a")+n))

if N>=27:
  n=(N-27)%(26**2)//26
  name.append(chr(ord("a")+n))

if N>=703:
  n=(N-703)%(26**3)//(26**2)
  name.append(chr(ord("a")+n))

if N>=18279:
  n=(N-18279)%(26**4)//(26**3)
  name.append(chr(ord("a")+n))

if N>=475255:
  n=(N-475255)%(26**5)//(26**4)
  name.append(chr(ord("a")+n))

if N>=12356631:
  n=(N-12356631)%(26**6)//(26**5)
  name.append(chr(ord("a")+n))
  
print("".join(name[::-1]))

Submission status: Wrong Answer

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

n=(N-1)%26
name.append(chr(ord("a")+n))

if N>=27:
  n=(N-27)%(26**2)//26
  name.append(chr(ord("a")+n))

if N>=703:
  n=(N-703)%(26**3)//(26**2)
  name.append(chr(ord("a")+n))

if N>=18279:
  n=(N-18279)%(26**4)//(26**3)
  name.append(chr(ord("a")+n))

if N>=475255:
  n=(N-475255)%(26**5)//(26**4)
  name.append(chr(ord("a")+n))

if N>=123566310:
  n=(N-123566310)%(26**6)//(26**5)
  name.append(chr(ord("a")+n))
  
print("".join(name[::-1]))

Submission status: Wrong Answer

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

n=(N-1)%26
name.append(chr(ord("a")+n))

if N>=27:
  n=(N-27)%(26**2)//26
  name.append(chr(ord("a")+n))

if N>=703:
  n=(N-703)%(26**3)//(26**2)
  name.append(chr(ord("a")+n))

if N>=18279:
  n=(N-18279)%(26**4)//(26**3)
  name.append(chr(ord("a")+n))

if N>=475255:
  n=(N-475255)%(26**5)//(26**4)
  name.append(chr(ord("a")+n))

if N>=26**5+475255:
  n=(N-26**5-475255)%(26**6)//(26**5)
  name.append(chr(ord("a")+n))
  
print("".join(name[::-1]))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
import numpy as np
input = sys.stdin.readline
n=int(input())
Z = [chr(i) for i in range(97, 97+26)]
ans = ""
def div(k):
    k ,mod = divmod(k, 26)

    global ans
    ans += Z[mod-1]
    if mod == 0:
        return k-1
    else:
        return k


for i in range(20):
    n = div(n)
    if n == 0 and len(ans)==1:
        print(ans)
        sys.exit()
    elif n ==0 and ans[::-1][0:2:] =="az":
        print(ans[::-1][1::])
        sys.exit()
    elif n ==0 :
        print(ans[::-1])
        sys.exit()

sys.exit()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
import numpy as np
input = sys.stdin.readline
n=int(input())
Z = [chr(i) for i in range(97, 97+26)]
ans = ""
def div(k):
    k ,mod = divmod(k, 26)

    global ans
    ans += Z[mod-1]

    return k

for i in range(20):
    n = div(n)
    if n ==0 and ans[::-1][0:2:] =="az":
        print(ans[::-1][1::])
        sys.exit()
    elif n ==0 :
        print(ans[::-1])
        sys.exit()

sys.exit()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
import numpy as np
input = sys.stdin.readline
n=int(input())
Z = [chr(i) for i in range(97, 97+26)]
ans = ""
def div(k):
    k ,mod = divmod(k, 26)
    global ans
    ans += Z[mod-1]

    return k

for i in range(20):
    n = div(n)
    if n ==0 :
        print(ans[::-1])
        sys.exit()
sys.exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

N = int(input())
l = []
while N // 26 != 0:
  n = N % 26
  l.insert(0, n)
  N = N // 26
l.insert(0, N)

NAME = [chr(64+num) for num in l]
name = str.lower("".join(NAME))
print(name)

Submission status: Wrong Answer

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

# アルファベットの文字列を作成
list_alpha = [chr(i) for i in range(97, 97+26)]

# 名前長さを捜索
for i in range(1, 20):
    n_len -= pow(26, i)
    if n_len <= 0:
        break
        
ans = ''
if n_len == 0:  # 全文字zのとき
    ans = 'z' * i
    pass
else:
    for j in range(1, i+1):
        devide = n // pow(26, 1)
        rest = n % pow(26, 1)
        print(devide, rest)
        ans = ''.join([list_alpha[rest-1], ans])
        n = devide

print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
N = 27
ans = ""
def n(N):
    ans= ""
    for i in range(N):
        if N%26 ==0:
            ans = "z" +ans
            N -= 1
        else:
            ans = chr(64+ N%26) +ans
        
        if N <= 26:
            break
        N = N // 26
    return ans
    
for i in range(1,10000):
    print(n(i))
print(ans.lower())

Submission status: Wrong Answer

Solution code:
n = int(input())

# アルファベットの文字列を作成
list_alpha = [chr(i) for i in range(97, 97+26)]

# 名前長さを捜索
for i in range(1, 20):
    n_len = n
    n_len -= pow(26, i)
    if n_len <= 0:
        break
    n = n_len

ans = ''
for j in range(1, i+1):
    devide = n // pow(26, 1)
    rest = n % pow(26, 1)
    ans = ''.join([list_alpha[rest-1], ans])
    n = devide

print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())

ans = ""
for i in range(N):
    if N%26 ==0:
        ans = "z" +ans
        N -= 26
    else:
        ans = chr(64+ N%26) +ans
    
    if N <= 26:
        break
    N = N // 26
    
        
print(ans.lower())

Submission status: Wrong Answer

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

# アルファベットの文字列を作成
list_alpha = [chr(i) for i in range(97, 97+26)]

# 名前長さを捜索
for i in range(1, 20):
    n_len -= pow(26, i)
    if n_len <= 0:
        break

ans = ''
for j in range(1, i+1):
    devide = n // pow(26, 1)
    rest = n % pow(26, 1)
    ans = ''.join([list_alpha[rest-1], ans])
    n = devide

print(ans)