Problem:


Score : 300 points

Problem Statement

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

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

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

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

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

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

and so on.

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

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

Now, Roger asks you:

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

Constraints

N is an integer.

 1 \leq N \leq 1000000000000001

Input

Input is given from Standard Input in the following format:

N

Output

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

Sample Input 1

2

Sample Output 1

b

Sample Input 2

27

Sample Output 2

aa

Sample Input 3

123456789

Sample Output 3

jjddja



Sample input:
2


Sample output:
b

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N = int(input())

def base10to(n, b):
    if (int(n/b)):
        ad = str(n%b)
        if ad =='0':
            return base10to(int(n/b), b)
        else:
            return base10to(int(n/b), b) + str(chr(96 + n%b))
    return str(chr(96 + n%b))

print(base10to(N, 26))

Submission status: Wrong Answer

Solution code:
n = int(input())

l = []

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

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

ans = []
for i in range(1, len(l)+1):
  ans.append(list[int(l[-i]-1)])
  
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
N = int(input())

#順に考えているとTLEする
#26進数と考える


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

    while 1:
        #print(chr(96 + N%26))
        if N%26 != 0:
            ans.append(chr(96 + N%26))
        else:
            ans.append("z")
        N = N//26
        if N <= 26:
            #print(chr(96 + N%26))
            if N%26 != 0:
                ans.append(chr(96 + N%26))
            else:
                ans.append("z")

            break

    print(''.join(map(str, ans[::-1])))

Submission status: Wrong Answer

Solution code:
n = int(input())
s = ["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 _ in range(10000):
    x = n%26
    n = n//26
    ans = s[x-1] + ans
    if n <=26:
        ans = s[n-1] + ans
        print(ans)
        break

Submission status: Wrong Answer

Solution code:
n = int(input())

alpha = ['z'] + [chr(i) for i in range(ord('a'),ord('z')+1)]
step = 0
result = ''
while(True):
    t = n % 26
    result = alpha[t] + result
    if n <=26:
        break
    n //= 26

print(result)

Submission status: Wrong Answer

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

n = ni()

def f(k):
    return chr(97+k)

c = 0
i = 1
while True:
    d = c+pow(26,i)
    if c < n <= d:
        break
    c = d
    i+=1

m = n-c-1
print(m)
ans = ''
while m > 26:
    ans = f(m%26) + ans
    m = m//26
ans = f(m%26) + ans

ans = 'a'*(i-len(ans)) + ans

print(ans)

Submission status: Wrong Answer

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

    ans = ''
    while n != 0:
        if n % 26 == 0:
            ans = chr(26 + 96) + ans
            n //= 27
        else:
            ans = chr(n % 26 + 96) + ans
            n //= 26

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
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"]
N=int(input())
li=[]
while N >= 1:
    na=N%26
    li.append(alp[na])
    if N<=26:
        break
    else:
        N=N//26
ans=""
for i in range(len(li)):
    ans+=li[i]
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

N=int1(input())
ans=[]
a=ord('a')
z=26
c=1
while N>=z:
    N-=z
    z*=26
    c+=1
while N:
    b=N%26
    ans.append(chr(b+a))
    N//=26
    if N==1:
        break
for _ in range(c-len(ans)):
    ans.append('a')
ans.reverse()
print(''.join(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

alps = 'abcdefghijklmnopqrstuvwxyz'

def cnv(X, n):
    if X//n:
        return cnv(X//n, n) + [X%n]
    return [X%n]

ans = cnv(N, 26)
print(''.join(list(map(lambda x: alps[x - 1], ans))))

Submission status: Wrong Answer

Solution code:
import sys

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

ans = ""
while N:
    pos = N % 26
    char = chr(ord("a") + (pos - 1) % 26)    
    ans = char + ans
    # print(pos, char)
    N = N // 26

print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
dict={}
s='zabcdefghijklmnopqrstuvwxy'
for i in range(len(s)):
    dict[i]=s[i]

cnt=0
ans=""
while True:
    tmp=n%26
    ans=dict[tmp]+ans
    n//=26
    if n==0 or (tmp==0 and n==1):
        break
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
l=["a","a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
ans=''
if n<=26:
    print(l[n])
else:
    while n>26 :

        a=n%26
        ans+=l[a]
        n=int(n/26)
        if n<=26:
            ans+=l[n]

    print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N=int(input())
asci = 'abcdefghijklmnopqrstuvwxyz'
ans=[]
temp=N
while temp!=0:
    ans.append(asci[temp%26-1])
    temp=temp//26
ans.reverse()
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
n = int(input())
s = [chr(ord("a")+i) for i in range(26)]
num = [26**i for i in range(1, 12)]
i = 0
while n - num[i] > 0:
    i += 1
ans = ""
while i >= 0:
    tmp = 0
    for j in range(1, 27):
        if n - j*26**i < 0:
            break
        tmp = j
    ans += s[tmp- 1]
    n -= tmp*26**i
    i -= 1
print(ans)

Submission status: Wrong Answer

Solution code:
import math
#map(int,input().split())
#int(x) for x in input().split()
#for _ in range(int(input())):
n=int(input())
s=''
while n!=0:
	x=n//26
	d=n-x*26
	if d==0:
		s+='z'
	else:
		s+=chr(96+int(d))
	if n%26==0 and x==1:
		break
	n=x
print(s[::-1])

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())
ans = ""
while True:
    if(N<=26):
        break
    k = N%26
    m = al[k-1]
    m += ans
    ans = m
    N = N//26
if(N != 0):
    k = al[N-1]
    k += ans
    ans = k
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
while n>1:
    b=n%26
    if b==0:
        b=26
    c=lambda b:chr(b+64)
    a.append(c(b))
    n//=26
d=len(a)
e=[]
for i in range(d):
    e.append(a[-1-i])
ans=''.join(e)
ans=ans.lower()
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import copy
from collections import deque
stdin = sys.stdin

mod = 10**9+7

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

n = ni()

maxn = 10*15+1

def div(n, p):
    return int(n//p), n%p

c = []
now = 26**10
while n>26:
    i, n = div(n, now)
    c.append(i)
    now = now/26

c.append(int(n))

s = [chr(i+96) for i in c if i]
print(''.join(s))

Submission status: Wrong Answer

Solution code:
N = int(input())

Alphabet = "abcdefghijklmnopqrstuvwxyz"

ans = ""

while N:
  ind = N%26
  ans = Alphabet[ind-1] + ans
  N = N//26

print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
ans=[]
ch=[]
anlist=[]
num2alpha = lambda c: chr(c+64)
while N>26:
  num=N%26
  ans.append(num)
  N=int((N-num)/26)
ans.append(N)
for i in ans:
  tmp=num2alpha(i)
  anlist.append(tmp)
ans2="".join(anlist)
ans2=ans2.lower()
print(ans2[::-1])

Submission status: Wrong Answer

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

div = n
while div != 0:
    l.append(div % 26)
    div = div // 26

print("".join(map(lambda x: chr(x+64), reversed(l))).lower())

Submission status: Wrong Answer

Solution code:
"""
N = list(map(int,input().split()))
S = [str(input()) for _ in range(N)]
S = [list(map(int,list(input()))) for _ in range(h)] 
print(*S,sep="")
"""

import sys
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()
inf = float("inf") # 無限

n = int(input())

temp = ""

while True:
    if n!=0:
        num = n%26
        temp = chr(ord("a") + num-1) + temp
        n //=26
    else:
        break
print(temp)

Submission status: Wrong Answer

Solution code:
N = int(input())
l = 'abcdefghijklmnopqrstuvwxyz'
name = ''
while N > 0:
    t1 = N // 26
    t2 = N % 26
    name = l[t2-1] + name
    N = t1
print(name)

Submission status: Wrong Answer

Solution code:
a=int(input())
s=0
si=[]
while a!=0:
    b=a%26
    si.append(b)
    a=a//26

c=""
for i in si:
    c+=chr(i+96)
c=c[::-1]
print(c)

Submission status: Wrong Answer

Solution code:
N = int(input())

def dog(n, b):
    arr = ["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", "x"]
    if (int(n/b)):
        return dog(int(n/b), b) + str(arr[n%b-1])
    return str(arr[n%b-1])

print(dog(N,26))

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = ''
while True:
    ans = ans+chr(ord('a')+N%26-1)
    if ans[-1] == '`':
        ans = ans[:len(ans)-1]+'a'
    N = N//26
    if N == 0:
        break
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N=int(input())
a=["a","b","c","d","e","f","g",
"h","i","j","k","l","m","n",
"o","p","q","r","s","t","u",
"v","w","x","y","z"]
l=1
num=26

while N>num:
    if N<num:
        break
    l+=1
    N-=num
    num*=26
ans=[]
for i in range(l):
    ans.append(N%26)
    N//=26
if max(ans)==0:
    print("z"*l)
else:
    ans[0]-=1
    for j in ans[::-1]:
        print(a[j],end="")
    print()

Submission status: Wrong Answer

Solution code:
n=int(input())
char='abcdefghijklmnopqrstuvwxyz'

name=''
while 1:
    x=n%26
    name=char[x-1]+name
    n=n//26
    if n==0:
        break
print(name)

Submission status: Wrong Answer

Solution code:
n = int(input())
intTOch = {i + 1: c for i, c in zip(range(26), [chr(i) for i in range(97, 97 + 26)])}
intTOch[0] = 'z'
ans = ''
while n != 0:
    ans += intTOch[n % 26]
    if n % 26 == 0 and n // 26 == 1:
        break
    n //= 26
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())

base = 26

a = 26
cnt = 1
while 1:
    if N <= a:
        break
    else:
        a*=26
        cnt += 1

ans = []
for i in range(cnt,0,-1):
    keta = N // base**(i-1)
    ans.append(keta)
    N -= (base**(i-1))*keta
r = []
for i in range(len(ans)):
    r.append(chr(ord("a") + ans[i]-1))

print("".join(r))

Submission status: Wrong Answer

Solution code:
def func(n):
    if n<=26:
        return chr(n+96)
    if n%26==0:
        return func(n//26)+'z'
    return func(n//26)+chr(n%26+96)


n=int(input())
print(func(n))

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

n = int(input())

ans = []

def Base_10_to_n(X, n, ans):
    if (int(X/n)):
        if X%n!=0:
            ans.append(chr(ord('a')-1+(X%n)))
        return Base_10_to_n(int(X/n), n, ans)+str(X%n)
    if X%n!=0:
        ans.append(chr(ord('a')-1+(X%n)))
    return str(X%n)

num  = Base_10_to_n(n,26, ans)

ans.reverse()

print(*ans,sep='')

Submission status: Wrong Answer

Solution code:
import string

N = int(input())

s = string.ascii_lowercase

n = N
l = []
append = l.append
while 1:
  a, b = n // 26, n % 26
  append(s[b - 1])
  if a == 0:
    break
  n = a

print("".join(l[::-1]))

Submission status: Wrong Answer

Solution code:
def resolve():
  N = int(input())
  N_to_str = ""
  alphabet_list = "abcdefghijklmnopqrstuvwxyz"

  while N > 0:
    N_to_str=alphabet_list[N%26-1]+N_to_str
    N = (N-N%26)//26
  print(N_to_str)

if __name__ == "__main__":
  resolve()

Submission status: Wrong Answer

Solution code:
n = int(input())

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

x = []

m = n
while True:
    if m < 26:
        x.append(alphabets[m - 1])
        break
    else:
        a = m // 26
        b = m % 26
        x.append(alphabets[b - 1])

        m = a

print(''.join(reversed(x)))

Submission status: Wrong Answer

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

n = ri()
li = []
while n > 26:
  a = n%26
  li.append(a)
  n //= 26
li.append(n)
li.reverse()
ans = ''
for i in li:
  s = 'abcdefghijklmnopqrstuvwxyz'[i-1]
  ans += s
print(ans)

Submission status: Wrong Answer

Solution code:
# i番目は26 ^ i個
# i番目までの個数は 26 * (26 ^ i - 1) / 25

n = int(input())
_ = 96

# 桁数
ans = ''
while True:
  a, b = divmod(n, 26)
  #print(a, b)
  if b == 0:
    b = 26
  ans += str(chr(b + _))
  if a == 0:
    break
  n = a
  
print(ans[::-1])

Submission status: Wrong Answer

Solution code:

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

    s = 0

    Alphabets = [''] + [chr(i) for i in range(97, 97+26)]
    ans = {}
    name = ""

    for i in range(10, -1, -1):
        r = pow(26, i)
        if n < r:
            if name:
                name += "a"
            continue

        ans[i] = n // r
        n = n % r
        name += Alphabets[ans[i]]

    print(name)


q3()

Submission status: Wrong Answer

Solution code:
n = int(input())

s = []
while n > 26:
    tmp = n % 26
    n //= 26
    s.append(tmp)

s.append(n)

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

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
alphabet = 'abcdefghijklmnopqrstuvwxyz'

n -= 1
ans = ''
while n >= 0:
    ans += alphabet[n % 26]
    n //= 26
    n -= 1

print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=[]
while n>=26:
	ans.append(n%26)
	n=n//26
ans.append(n)
ans=ans[::-1]
for a in ans:
	print(chr(a+96),end="")

Submission status: Wrong Answer

Solution code:
# import sys
# readline = sys.stdin.readline
# generator = (readline().strip() for _ in range(N))

# N, M = map(int, input().split())
# As = list(map(int, input().split()))
# queries = (input() for _ in range(N))


def solve():
    N = int(input())
    v = N

    ans = ''

    while v > 0:
        d, m = divmod(v, 26)
        ans = chr(m + 96) + ans
        v = d

    return ans


def main():
    print(solve())


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))

abc='abcdefghijklmnopqrstuvwxyz'

n=int(input())

ans=''
while n%26!=0:
  t_ans=n%26
  ans+=str(abc[t_ans-1])
  n//=26

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())

AlList = {0:'Z', 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'}

result = ''

while N > 0:
    tmp = N % 26
    result = AlList[tmp] + result
    N //= 26
    if N == 1 and tmp == 0:
        break

print(result.swapcase())

Submission status: Wrong Answer

Solution code:
N = int(input())
lis = [1,26]
num = 26
n = 1
while lis[-1]<N:
    num *= 26
    lis.append(lis[-1]+num)
    n += 1
c = N-lis[-2]-1
ans = ''
for i in range(n):
    ans = chr(c%26+ord('a')) + ans
    c //= 26
print(ans)

Submission status: Wrong Answer

Solution code:
#import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left, bisect_right #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')

N = int(input())
t6s = [26**i for i in range(12)]
# ketas = [26**i for i in range(12)]
# for i in range(11):
#     ketas[i+1] = ketas[i] + ketas[i+1]

# keta = bisect_left(ketas, N)
# resi = N%ketas[keta-1]

moji = 'abcdefghijklmnopqrstuvwxyz'

res = ''
while 0<N:
    br = bisect_right(t6s, N)
    shou = N//t6s[br-1]
    resi = N%t6s[br-1]
    res += moji[shou-1]
    N = resi

print(res)

Submission status: Wrong Answer

Solution code:
n = int(input())
alh = "abcdefghijklmnopqrstuvwxyz"
ans = []
while n > 1:
    ans.append(n%26)
    n = n//26

if n!=0:
    ans.append(n)

#print(ans)

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

Submission status: Wrong Answer

Solution code:
N = int(input())

div = 26
ans = []

while 1:
    amari = N % div
    ans.append(amari)
    N //= div
    if N == 0:
        break

ans.reverse()
name = []

for i in ans:
    name.append(chr(i+96))

print(''.join(name))

Submission status: Wrong Answer

Solution code:
N = int(input())

Alphabet = "abcdefghijklmnopqrstuvwxyz"

ans = ""

while N:
  ind = N%26
  ans = Alphabet[ind] + ans
  N = N//26

print(ans)

Submission status: Wrong Answer

Solution code:
#C - One Quadrillion and One Dalmatians
N = int(input())

a = [chr(i) for i in range(97,97+26)]
#print(a)

ans = ""
if N <= 26:
    print(a[N-1])
    exit()

while N // 26 > 0:
    ans = a[N%26-1] + ans
    N = N // 26
    if N < 26:
        ans = a[N % 26 - 1] + ans


print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
def Base_10_to_n(X, n):
    value_list =  [chr(i) for i in range(97, 97+26)]
    if (int(X/n)):
        return Base_10_to_n(int(X/n), n)+str(value_list[int((X%n))-1])
    return str(value_list[int((X%n))-1])
x10 = N
x2 = Base_10_to_n(x10, 26)
print(x2)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = ""
al = "zabcdefghijklmnopqrstuvwxy"
while(N>26):
    ans += al[N%26]
    N = N // 26
ans += al[N%26]
ans = ans[::-1]
print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np


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


def main(N):
    ans = ""
    while True:
        if N <= 26:
            ans = tostr(N)+ans
            break
        ans = tostr(N % 26)+ans
        N = N//26
    return ans


N = int(input())
print(main(N))

Submission status: Wrong Answer

Solution code:
N = int(input())

A = ''
ap = 0
num2alpha = lambda c: chr(c+64)
for i in range(1000000000000001):
    if N <= 16:
        ap = int(N)
    else:
        ap = int(N%26)
    num2alpha(ap)
    A = A + num2alpha(ap)
    if N <= 16:
        break
    N = N/26

print(A.lower()[::-1])

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

n = I()
tmp = 1
lst = []
while tmp * 26 <= n:
    tmp *= 26

while tmp >= 1:
    lst.append(n // tmp)
    n %= tmp
    tmp //= 26
alpha = 'abcdefghijklmnopqrstuvwxyz'
ans = []
for i in lst:
    ans.append(alpha[i-1])
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
n = int(input())
s = ""
a = [chr(i) for i in range(97, 97+26)]
for i in range(12, 0, -1):
    s += a[n // (26 ** i) - 1] if n >= 26 ** i else ""
    n %= 26 ** i
print(s + a[n - 1])

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

name = ''
while N != 0:
    name += alphabet[(N-1) % 26]
    if N == 26:
      break
    N //= 26
print(name[::-1])

Submission status: Wrong Answer

Solution code:
# from scipy.sparse import csr_matrix
# import statistics # Pythonのみ
# import string
import unittest
from io import StringIO
import sys
sys.setrecursionlimit(10 ** 5 + 10)


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


def resolve():


    def base(n, b, digits="abcdefghijklmnopqrstuvwxyz"):
        if n==0:
            return 'a'
        
        s=[]
        p=abs(n)
        while p:
            s.append(digits[p%b])
            p//=b
        return ''.join(reversed(s))
    
    n=int(input())
    alp=list(chr(ord('a')+i) for i in range(26))
    

    ans=base(n,26)
    for i in ans:
        if i!='a':
            print(chr(ord(i)-1),end='')
        else: print('a',end='')
    print()


resolve()

Submission status: Wrong Answer

Solution code:
n = int(input())
A = 'abcdefghijklmnopqrstuvwxyz'
ANS = []

while n > 0:
    r = n % 27
    ANS.append(r)
    n = n // 27

ANS = reversed(ANS)

for a in ANS:
    print(A[a-1], end="")

Submission status: Wrong Answer

Solution code:
N = int(input())
alp = "zabcdefghijklmnopqrstuvwxy"
L = ""
while(True):
    ind = int(N%26)
    N = (N-ind)/26
    L = alp[ind] + L
    if (N==0):
        break
print(L)

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(ord('a')+X%n-1)
    return chr(ord('a')+X%n-1)
    
x10 = int(input())
x26 = Base_10_to_n(x10, 26)
print(x26)

Submission status: Wrong Answer

Solution code:
table = []
s = 1
n = int(input())
while s <= 1000000000000001:
    table.append(s)
    s *= 26

ans = ""
for i in range(len(table)):
    idx = len(table)-1-i
    c = n//(table[idx])
    if c == 0:
        continue
    else:
        n -= c*table[idx]
        ans += chr(c+96)
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
while n>1:
    b=n%26
    if b==0:
        b=26
    c=lambda b:chr(b+64)
    a.append(c(b))
    n//=26
d=len(a)
e=[]
for i in range(d):
    e.append(a[-1-i])
ans=''.join(e)
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import copy
from collections import deque
stdin = sys.stdin

mod = 10**9+7

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

n = ni()

maxn = 10*15+1

def div(n, p):
    return int(n//p), n%p

c = []
now = 26**10
print(now)
while n>26:
    i, n = div(n, now)
    c.append(i)
    now = now/26

c.append(int(n))

s = [chr(i+96) for i in c if i]
print(''.join(s))

Submission status: Wrong Answer

Solution code:
n = int(input())

l = []

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

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

ans = []
for i in range(1, len(l)+1):
  ans.append(list[int(l[-i]-1)])
  
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline


def S():
    return input().rstrip()


def I():
    return int(input())


def MI():
    return map(int, input().split())


def itoa(n):
    return chr(n + 96)


n = I()

ans = []
while n // 26 != 0:
    n, mod = divmod(n, 26)
    ans.append(itoa(mod))

print(str(itoa(n % 26)) + "".join(ans[::-1]))

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())
tmp = 26
ans = ''
while True:
    ans += al[N%26-1]
    if N <= 26:
        break
    N = N // tmp
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
a = "abcdefghijklmnopqrstuvwxyz"
now = 0
tnp = 0
for i in range(1,1000):
    x = now + 26**i
    if (n<=x):
        tnp = i
        break
    now = x
x = n - now
ans = ""
for i in range(i):
    if i==0:
        ans = a[x%26-1] + ans
    else:
        ans = a[x%26] + ans
    x = (x-1) // 26
print(ans)

Submission status: Wrong Answer

Solution code:
from bisect import bisect_left, bisect_right
N = int(input())

MOJI = [26]
for i in range(2,12):
  MOJI.append(MOJI[i-2]+26**i)

C = bisect_left(MOJI, N)+1

ans = []
for i in range(C-1,-1,-1):
  tmp = N//(26**i)
  ans.append(chr(tmp+ord("a")-1))
  N = N%(26**i)

L=[str(a) for a in ans]
L="".join(L)
print(L)

Submission status: Wrong Answer

Solution code:
n=int(input())
al=[chr(97+ i) for i in range(26)]
ans=""
while n//26:
    ans+=str(al[n%26-1])
    n//=26
ans+=str(al[n%26-1])    
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
a = int(input())
n = 26
def numalpha(num):
    if num<=n:
        return chr(ord('a')+num-1)
    else:
        return numalpha(num//n)+chr(ord('a')+num%n-1)
        
print(numalpha(a))

Submission status: Wrong Answer

Solution code:
import operator as op
import re
import sys
from bisect import bisect, bisect_left, insort, insort_left
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from functools import reduce
from itertools import (
    accumulate, combinations, combinations_with_replacement, groupby,
    permutations, product)
from math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,
                  log2, pi, radians, sin, sqrt, tan)
from operator import itemgetter, mul
from string import ascii_lowercase, ascii_uppercase, digits

# For getting input from input.txt file
# sys.stdin = open('input.txt', 'r')

# Printing the Output to output.txt file
# sys.stdout = open('output.txt', 'w')


def inp():
    return(int(input()))


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


def instr():
    s = input()
    return(list(s[:len(s)]))


def invr():
    return(map(int, input().split()))


def def_value():
    return 0


def solve(n, res):
    if n <= 26:
        return res + chr(ord('a')+n-1)
    d = n % 26
    res += chr(ord('a')+d-1)
    return solve(n//26, res)


n = inp()

res = solve(n, "")
print(res[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
def numalpha(num):
    if num <= 26:
        return chr(96+ num)
    elif num % 26 == 0:
        return numalpha(num // 26-1) + chr(90)
    else:
        return numalpha(num//26) + chr(96 + num % 26)
print(numalpha(n))

Submission status: Wrong Answer

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

n = I()
s = "abcdefghijklmnopqrstuvwxyz"

val = [-1]*100

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

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

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

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

word = ""
while(n > 26):
    word = alpha[n % 26 - 1] + word
    n = n // 26
word = alpha[n - 1] + word

print(word)

Submission status: Wrong Answer

Solution code:
N = int(input())
X_dumy = N
out = ''
while X_dumy > 0:
    out = chr(ord('a') + X_dumy % 26 - 1) + out
    X_dumy = int(X_dumy / 26)

print(out)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n",
     "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"]
name = ""
s = True
while s:
  a = N % 26
  N = N // 26
  if N == 0:
    s = False
  else:
    name = A[a-1] + name
print(name)

Submission status: Wrong Answer

Solution code:
n=int(input())-1
lst=[]
if not n:lst=[0]
while n:
    lst.append(n%26)
    n//=26
for i in range(1,len(lst)):
    lst[i]=(lst[i]-1)%26
print(''.join([chr(i+97) for i in lst][::-1]))

Submission status: Wrong Answer

Solution code:
n=int(input())
def num2(num):
    if num<=26:
        return chr(num+64)
    elif num%26==0:
        return num2(num//26-1)+chr(90)
    else:
        return num2(num//26)+chr(64+num%26)
print(num2(n))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

char_list = [ chr(ord('a')+num) for num in range( 26 ) ]
N = int(input())

def Base_10_to_n(X, n):
    if (int(X/n)):
        return Base_10_to_n(int(X/n), n)+str(char_list[(X%n)-1])
    return str(char_list[(X%n)-1])
print(Base_10_to_n(N,26))

Submission status: Wrong Answer

Solution code:
########関数部分##############
def Base_10_to_n(X, n):
    if (int(X/n)):
        return Base_10_to_n(int(X/n), n)+str(X%n) + " "
    return str(X%n) + " "
############################

#####関数をつかってみる．#####
######今回は二進数に変換######
x10 = int(input())
x2 = Base_10_to_n(x10, 26)
ans = ""
a = ""
for x in x2:
    if x == " ":
        ans += chr(int(a) + 96)
        a = ""
        continue
    a += x

print(ans)