Problem:


Score : 300 points

Problem Statement

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

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

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

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

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

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

and so on.

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

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

Now, Roger asks you:

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

Constraints

N is an integer.

 1 \leq N \leq 1000000000000001

Input

Input is given from Standard Input in the following format:

N

Output

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

Sample Input 1

2

Sample Output 1

b

Sample Input 2

27

Sample Output 2

aa

Sample Input 3

123456789

Sample Output 3

jjddja



Sample input:
2


Sample output:
b

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    alp = "abcdefghijklmnopqrstuvwxyz"
    reslist = []
    q, r = divmod(N, 26)
    reslist.append(r)

    while q > 0:
        q, r = divmod(q, 26)
        reslist.append(r)
    
    name = [alp[s-1] for s in reslist]
    name = reversed(name)

    print(''.join(name))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from collections import defaultdict

n = int(input()) - 1

ans = defaultdict(str)
for i in range(26):
    ans[i] = chr(ord('a') + i)

res = []
while True:
    if n:
        res.append(n%26)
        n //= 26
    else:
        break

res.reverse()
for i, v in enumerate(res):
    if i < len(res)-1:
        print(ans[v-1], end='')
    else:
        print(ans[v])

Submission status: Wrong Answer

Solution code:
N = int(input())
num = []
ans = 0
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"]
while N >26:
  num.insert(0,N%26)
  N = N//26
num.insert(0, N)
for i in num:
  if ans == 0:
    ans = alp[i]
  else:
    ans += alp[i]
print(ans)

Submission status: Wrong Answer

Solution code:
# 2107
# 解法　2109 　26進数とみなして，10進数->26進数に変換すると思えばよいだろう．
# 実装
N = int(input())
# 26で割っていき，余りを記録していく．割れなくなったら終了．
AL = []
while N >=26:
    amari = N % 26
    N = int((N-amari) / 26)
    AL.append(amari)
AL.append(N)
bias = 127
R = [chr(ord('a')+a-1) for a in AL]
print(''.join(R[::-1]))

Submission status: Wrong Answer

Solution code:
N = int(input())
keta = 0
while N > 26**keta:
  keta += 1
  
ans = ''
while keta > 0:
  num = N // (26**(keta-1))
  N = N % (26**(keta-1))
  ans += chr(96+num)
  keta -= 1
  
print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
seen=[]
ans=""
count=1
while N>0:
    mod=26
    k=N%mod
    seen.append(k)
    N=(N-k)//mod
for x in seen[::-1]:
    ans+=chr(96+x)
print(ans)

Submission status: Wrong Answer

Solution code:
import string
n = int(input())
a = "abcdefghijklmnopqrstuvwxyz"
s = []
while n > 0:
    s.append(a[n%26 - 1])
    n //= 26
print(''.join(s[::-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']

ans=''
tmp=N
while tmp>0:
    dx=tmp%26
    if dx==0:
        dx=26
    dx-=1
    ans+=A[dx]
    tmp=int(tmp/26)

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

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=[]
trans=["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"]
while n//26!=0:
    a=n%26
    ans.append(a-1)
    n=n//26
ans.append(n)
ans[-1]-=1
name=""
for i in range(len(ans)):
    name+=trans[ans[i]]
ans2=name[::-1]
print(ans2)

Submission status: Wrong Answer

Solution code:
a=int(input())
c=0
i=0
while c<=a:
  i+=1
  c+=26**i
l=[0]*i
p=0
for k in range(i):
  p+=26**k
a-=p
for j in range(i):
  l[j]=a//(26**(i-j-1))
  a=a%(26**(i-j-1))
for n in l:
  print(chr(n+97),end='')

Submission status: Wrong Answer

Solution code:
n = int(input())
name = ""
while(n > 0):
	r = n % 26
	n = n // 26
	if r == 0:
		name = 'z' + name
	else:
		name = chr(r+96) + name
print(name)

Submission status: Wrong Answer

Solution code:
a=int(input())
name=""
while (a>26):
    b=a%26
    a=a//26
    name+=chr(b+96)
name+=chr(a+96)
name = name[::-1]
print(name)

Submission status: Wrong Answer

Solution code:

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

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

    print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
l='abcdefghijklmnopqrstuvwxyz'
ans=''

while N > 26:
  N,mod=divmod(N,26)
  ans+=l[mod-1]
  
ans+=l[N-1]

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
an = []
alfa = 'abcdefghijklmnopqrstuvwxyz'
while True:
    amari = N % 26
    an.append(amari)
    if N < 27:
        break
    N = N // 26
ans = ''
for x in an :
    ans = alfa[x-1] + ans
print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
from decimal import *

input = sys.stdin.readline

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	N = inputInt()

	ans = ""
	listss = 'abcdefghijklmnopqrstuvwxyz'

	tmp = N // 26
	ama = N % 26
	if tmp > 0:
		ans = listss[ama-1]
		while True:
			#print(tmp)
			ama = tmp %26
			ans = listss[ama-1] + ans
			if tmp <= 26:
				break
			tmp = tmp//26
	else:
		ans = listss[N-1]

	print(ans)



#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
def num2str(n): # 1,2,3... -> a,b,c,...
	if n == 0:
		return 'z'
	else:
		return chr(ord('a') + n-1)

N = int(input())

ans = ''
while N > 26:
	ans = num2str(N%26) + ans
	N = int(N/26)
ans = num2str(N%26) + ans

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

print(num2alpha(N))

Submission status: Wrong Answer

Solution code:
import sys

n = int(sys.stdin.read())
s = ' abcdefghijklmnopqrstuvwxyz'
write = sys.stdout.write
a = []
append = a.append
while n > 26:
  n, v = divmod(n, 26)
  append(s[v])
append(s[n])
a.reverse()
print(''.join(a))

Submission status: Wrong Answer

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def solve():
    N = int(rl())
    
    nums = [1]
    while nums[-1] <= 10 ** 16:
        nums.append(nums[-1] * 26)
    
    ans = []
    for num in reversed(nums):
        if not ans and N < num:
            continue
        div = N // num
        if div == 0:
            ans.append('a')
            continue
        ans.append(chr(ord('a') + div - 1))
        N -= num * div
    print(''.join(ans))


if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
n = int(input())

result = ""

while(n != 0):
  result = chr(ord("a") + (n % 26) - 1) + result

  n //= 26

print(result)

Submission status: Wrong Answer

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

num2alpha = lambda c: chr(c+64)

while True:
    if n <= a:
        break
    a *= 26
    c += 1

for i in range(c):
    t = num2alpha(int(n % 26))
    if t == "@":
        t = "z"
    res = t + res
    n = n / 26

print(str.lower(res))

Submission status: Wrong Answer

Solution code:
#C
alphabet = "abcdefghijklmnopqrstuvwxyz"
n = int(input())
cnt = 0
amari = []
while n // 26 > 0:
    n_before = n
    amari.append(n%26)
    n = n // 26
    cnt += 1
    tmp = n_before - (n*26)

amari.append(n)
amari.reverse()

result = []
for i in range(len(amari)):
    result.append(alphabet[amari[i]-1])
print("".join(result))

Submission status: Wrong Answer

Solution code:

N=int(input())

n=26
result =""
characters='abcdefghijklmnopqrstuvwxyz'
while N > n:
    idx = N%n
    result = characters[idx-1] + result
    N = N//n
idx = N%n
result = characters[idx-1]+result

print(result)

Submission status: Wrong Answer

Solution code:
n = int(input())

num = []

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

num.append(n)
num.reverse()

ans = []
for numi in num:
    ans.append(chr(numi + 96))

print(''.join(ans))

Submission status: Wrong Answer

Solution code:
import string
def main():
    a = string.ascii_lowercase
    list = []
    num = int(input())

    while(num > 0):
        list.append(num % 26)
        num = num // 26

    ans = []
    for i in range(1,len(list)+1):
        ans.append(a[list[len(list) - i] - 1])

    print(''.join(ans))


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
al = 'abcdefghijklmnopqrstuvwxyz'
a = n
ans = []
check = [int(26**i) for i in range(20)]
while True:
    
    c = a // 26
    b = a % 26 -1
    ans.append(al[b])
    if a // 26 == 0:
        break
    a = c
    
if n in check:
    ans.pop(-1)

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

Submission status: Wrong Answer

Solution code:
N = int(input())

amari = []
while(N>0):
    amari.append(chr(N%26+96))
    N = N//26

amari.reverse()
for i in range(len(amari)):
    print(amari[i],end = "")

Submission status: Wrong Answer

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

coe = []
while True:
    q, mod = divmod(N, 26)
    coe.insert(0, mod)
    if N // 26 == 0:
        break
    N = q
ans = ""
for i in coe:
    ans += alp[i - 1]
print(ans)

Submission status: Wrong Answer

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

while True:
  x = n % 26
  ans = ans + chr(ord('a')+x-1)
  n = n // 26
  if n == 0:
    break
    
ans = ans[::-1]
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
l = []
ascii_lowercase = 'zabcdefghijklmnopqrstuvwxy'
while N>=26:
    l.append(N%26)
    N = N//26
l.append(N)
for i in l[::-1]:
    print(ascii_lowercase[i], end='')
print('')

Submission status: Wrong Answer

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

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


    abc = 'abcdefghijklmnopqrstuvwxyz'
    res = ''
    prev = -1
    for i in res_list[::-1]:
        temp = abc[i-1]
        if prev == 'z':
            pass
        else:
            if i == 0:
                res =  res +  'z'
                prev = 'z'
            else:
                res = res + temp

    print(res)

if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

Solution code:

import glob
import os

bn = os.path.basename(__file__).split('.')[0]
dn = os.path.dirname(__file__).split('/')

# 問題ごとのディレクトリのトップからの相対パス
REL_PATH = dn[len(dn)-2] + '\\' + dn[len(dn)-1] + '\\' + bn

# テスト用ファイル置き場のトップ
TOP_PATH = 'C:\\AtCoder'

class Common:

    problem = []
    index = 0

    def __init__(self, rel_path):
        self.rel_path = rel_path

    def initialize(self, path):
        file = open(path)
        self.problem = file.readlines()
        self.index = 0
        return

    def input_data(self):
        try:
            IS_TEST
            self.index += 1
            return self.problem[self.index-1]

        except NameError:
            return input()

    def resolve(self):
        pass

    def exec_resolve(self):
        try:
            IS_TEST
            for path in glob.glob(TOP_PATH + '\\' + self.rel_path + '/*.txt'):
                print("Test: " + path)
                self.initialize(path)
                self.resolve()
                print("\n\n")
        except NameError:
            self.resolve()


class Solver(Common):

    def resolve(self):

        N = int(self.input_data())
        dog_num = 1000000000000001
        alp = 'abcdefghijklmnopqrstuvwxyz'

        name = ''
        for i in range(12, -1, -1):
            n = int(N / (26 ** i))
            if n != 0:
                name = name + alp[n-1]
            elif name != '':
                name = name + 'a'
            N = N % (26 ** i)

        print(name)

solver = Solver(REL_PATH)
solver.exec_resolve()

Submission status: Wrong Answer

Solution code:
n=int(input())
#n,k=map(int,input().split())
#p=list(map(int,input().split()))
#ab=[list(map(int,input().split())) for _ in range(n)]
#n=1000000000000001

#p.sort()
#print(sum(p[:k]))
# アルファベット(a〜z)→数値(1〜26)小文字限定
a2n = lambda c: ord(c) - ord('a') + 1
# 数値(1〜26)→アルファベット(a〜z)
n2a = lambda c: chr(c+64).lower()
ans=[]
if n==0:
  print('a')
  exit()
while n:
  a=n%26
  ans.append(a)
  n//=26
for i in range(len(ans)-1):
  if ans[i]==0:
    ans[i+1]-=1
    ans[i]=26
ans=list(map(n2a,ans))
ans.reverse()
print(''.join(ans).replace('@',''))
#gbdpxgs@xjm
#gbdpxgrzxjm

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [0] * 12
for i in range(11,0,-1):
    m = n // 26 ** i
    a[i] = m
    n -= m * (26 ** i)
a[0] = n
b = "abcdefghijklmnopqrstuvwxyz"
c = []
for i in range(11,-1,-1):
    if a[i] != 0:
        c.append(b[a[i] - 1])
print(*c, sep="")

Submission status: Wrong Answer

Solution code:
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)

def rand_query(ran1, ran2, rantime):
  r_query = []
  while len(r_query) < rantime:
    n_q = rand_ints_nodup(ran1, ran2, 2)
    if not n_q in r_query:
      r_query.append(n_q)
  return sorted(r_query)

from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
import heapq
import math
from fractions import gcd
import random
import string
import copy
from itertools import combinations, permutations, product
from operator import mul
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7


#############
# Main Code #
#############

n = getN()
lista = []
digit = 26
i = 0

while n != 0:
    opt = n % digit
    if n % digit == 0:
        opt = 0
        n -= 26 ** i
    lista.insert(0, opt)
    n //= digit
    i += 1

str_list = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
for i in range(len(lista)):
    ans += str_list[lista[i] - 1]
print(ans)

Submission status: Wrong Answer

Solution code:
#! -*- coding: utf-8 -*-
n = int(input())

"""
26 ** 10 から値がたつか確かめる
"""

counter = 10
counter_list = []

for i in reversed(range(0, 11)):
    result = n // (26 ** i)
    if result > 0:
        counter_list.append(chr(96 + result))
    n %= (26 ** i)

print(''.join(counter_list))

Submission status: Wrong Answer

Solution code:
N = int(input())


BASE_CHR = 96
# chr(97) # a

result = ""

while True:
    temp = N % 26
    flag = False
    if temp == 0:
        result += "z"
        flag = True
    else:
        result += chr(BASE_CHR+temp)

    N = N // 26

    if N == 0 or (N == 1 and flag):
        break

print(result[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
s = []
while n > 0:
  s.append(chr((n-1) % 26 + 97))
  n = n // 26
print(''.join(list(reversed(s))))

Submission status: Wrong Answer

Solution code:
def change(X,words):
    if (int(X/words)):
        return change(int(X/words), words)+str(X%words)
    return str(X%words)

str_list='abcdefghijklmnopqrstuvwxyz'
N=int(input())
after = change(N, 26)
ans=''
for i in range(len(after)):
    ans+=str_list[int(after[i])-1]
print(ans)

Submission status: Wrong Answer

Solution code:
n = list(input())
for i in range(len(n)):
    n[i] = int(n[i])

def base_convert(nl, ibase, obase):
    o = []
    while any(nl):
        c = 0
        for i in range(len(nl)):
            c = c * ibase + nl[i]
            nl[i],c = divmod(c,obase)
        o.append(c)
    o.reverse()
    return o

x = base_convert(n, 10, 26)
ans = ""

for i in x:
    ans += chr(ord('a') + i-1)

print(ans)

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 = ''
if n <= 26:
    print(s[n-1])
else:
    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:
import math
N=int(input())

a=[chr(i) for i in range(97, 97+26)]
# [chr(i) for i in range(ord('a'), ord('z')+1)]
if N>=26:
    answers = []
    while N >= 26:
        b = N % 26
        answers.append(a[b - 1])
        N = N // 26

    answers.append(a[b - 1])
    answers.reverse()
    b = ''
    for a in answers:
        b += a
    print(b)
else:
    print(a[N-1])

Submission status: Wrong Answer

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


for i in range(1000):
    if 26*(26**i-1)//25+1 <= n <= 26*(26**(i+1)-1)//25:
        t=i+1
        break

ans=[]
for i in range(t):
    no=True
    for g in range(1,27):
        if g*26**(t-i-1)<=n<(g+1)*26**(t-i-1):
            ans.append(alphabet[g-1])
            no=False
            n-=g*26**(t-i-1)
            break
    if no:
        ans.append("z")
        n-=26*26**(t-i-1)

print(''.join(ans))

Submission status: Wrong Answer

Solution code:
n=int(input())

ans=[]
while True:
    if n >26:
        x = n % 26
        ans.append(x)
        n=n//26
    else:
        ans.append(n)
        break

hoge=[]
for i in ans:
    s=chr(96+i)
    hoge.append(s)
hoge.reverse()
hoge="".join(hoge)
print(hoge)

Submission status: Wrong Answer

Solution code:
import math

import numpy

n = int(input())

x = list(numpy.base_repr(n,26))

s = list("abcdefghijklmnopqrstuvwxyz")

t = list("0123456789")

for i in range(16):
    t.append(s[i].upper())
    
for i in x:
    print(s[t.index(i)-1],end = "")

Submission status: Wrong Answer

Solution code:
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))

def Base_10_to_n(X, n):
    X_dumy = X
    t = X_dumy%n
    out = chr(t + ord('a'))
    X_dumy = int(X_dumy/n)
    while X_dumy>0:
        t = X_dumy%n
        out = chr(t + ord('a') - 1) + out
        X_dumy = int(X_dumy/n)
    return out

n = int(input()) - 1

print(Base_10_to_n(n, 26))

Submission status: Wrong Answer

Solution code:
def resolve():
    # 1000000000000001
    from collections import deque
    S = "abcdefghijklmnopqrstuvwxyz"
    N = int(input())
    tmp = N
    A = deque()
    while True:
        N, a = divmod(N, 26)
        A.append(a)
        if N == 0:
            break
    if tmp % 26 == 0:
        A.pop()
    for a in reversed(A):
        print(S[a - 1], end="")
    print()


resolve()

Submission status: Wrong Answer

Solution code:
letters = 'abcdefghijklmnopqrstuvwxyz'

N = int(input())

result = ''
while N > 0:
    letter_index = N % 26
    result = letters[letter_index-1] + result
    N //= 26

print(result)

Submission status: Wrong Answer

Solution code:
N = int(input())
cur = 1
while N > 26 ** cur:
    cur += 1
p, r = N // 26, N % 26
temp = [''] * cur
i = cur - 1
while i >= 0:
    temp[i] = chr(r + 96)
    i -= 1
    r = p % 26
    p //= 26

print(''.join(temp))

Submission status: Wrong Answer

Solution code:
N=int(input())
result=[]
list=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","i","s","t","u","v","w","x","y","z"]
while N>=1:
    n=N%26
    if n==0:
        n=26
    result.append(int(n))
    N=(N-n)/26
answer=""
for i in range(len(result)):
    answer+=list[result[i]-1]
print(answer)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param
# s = sys.stdin.readline().rstrip()
# N = int(sys.stdin.readline())
# INF = float("inf")
import sys

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


def Base_10_to_n(X, n):
    if (int(X//n)):
        return Base_10_to_n(int(X//n), n)+chr(X%n+ord("a")-1)
    return chr(X%n+ord("a")-1)

print(Base_10_to_n(N,26))

Submission status: Wrong Answer

Solution code:
n = int(input())
# n = 1000000000000001

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

x = []

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

    if a < 1:
        break

    m = a

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

Submission status: Wrong Answer

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

i = 1
while(True):
    if pow(26,i) >= n:
        break
    
    i += 1


for j in range(i,0,-1):
    # print(j)
    t = pow(26,j-1)
    if j > 1:
        c = n//t
    else:
        c = n
    n -= c*t
    ans += alp[c-1]

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
s = "abcdefghijklmnopqrstuvwxyz"
z = ""

while True:
    r = n % 26
    z += s[r-1] 
    if n <= 26:
        break
    n = n // 26

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

def Base_10_to_n(X, n):
    X_dumy = X
    out = ''
    while X_dumy>0:
        out = str(X_dumy%n)+out
        X_dumy = int(X_dumy/n)
    return out

def main():
    alpha = "0ABCDEFGHIJKLMNOPQRSTUVWXYZ"

    n = int(input())
    x16_expr = Base_10_to_n(n, 26)
    for ch in x16_expr:
        print(alpha[int(ch)], end="")
    print("")

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

if N <= 26:
  print(check[N-1])
  exit(0)
i = 0
keta = 26**i 
while keta < N:
  i += 1
  keta = 26**i
ans = ""
for j in range(i):
  checker = int(N / 26**(i - j -1))
  N = N - checker*26**(i-j-1)
  s = check[checker-1]
  ans = ans + s
print(ans)

Submission status: Wrong Answer

Solution code:
a = int(input())
counter = 1
sum_num = 26 ** counter
before_sum_num = 0

while True:
  if a <= sum_num:
    n = sum_num - before_sum_num
    
    for i in range(counter, 0, -1):
      z = a // (26 ** (i - 1))
      a = a % (26 ** (i-1))
      print(chr(ord('a') + z - 1), end='')
    break

  else:
    before_sum_num = sum_num
    counter += 1
    sum_num += 26 ** counter

print()

Submission status: Wrong Answer

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

while n > 0:
    k = n % 26
    str = str + table[k-1]
    n = int(n / 26)

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

Submission status: Wrong Answer

Solution code:
from math import log
from functools import reduce
N = int(input())

i = int(log(N,26))

z = []
r = N
while i > 0:
    q,r = divmod(r, 26**i)
    i -= 1
    z.append(q)
z.append(r)

print(reduce(lambda x,y: x+y, map(lambda x:chr(ord('a')+x-1), z)))

Submission status: Wrong Answer

Solution code:
n = int(input())
a = "abcdefghijklmnopqrstuvwxyz"
s = []
while n > 26:
    s.append(a[n%26 - 1])
    n //= 26
s.append(a[n%26 - 1])
print(''.join(s[::-1]))

Submission status: Wrong Answer

Solution code:
n = int(input())
dic_items = {-1:'z',0:'a',1:'b',2:'c',3:'d',4:'e',5:'f',6:'g',7:'h',8:'i',9:'j',10:'k'\
             ,11:'l',12:'m',13:'n',14:'o',15:'p',16:'q',17:'r',18:'s'
             ,19:'t',20:'u',21:'v',22:'w',23:'x',24:'y',25:'z'}
ans = []
while n != 0:
  ans.append(n%26)
  n = n//26
for i in range(len(ans)):
  print(dic_items[ans[len(ans)-1-i]-1],end='')

Submission status: Wrong Answer

Solution code:
N = int(input())

n = 26
m = 1

while N > n:
    n = n * 26
    m += 1

e = n
result = ''

for i in range(m):
    a = N // (26 ** (m - 1 - i))
    result = result + chr(a + 96)
    N = N % (26 ** (m - 1 - i))

print(result)

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

if N in MOJI:
  print("z"*C)
  exit()

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())
an = []
alfa = 'abcdefghijklmnopqrstuvwxyz'
while True:
    amari = N % 26
    an.append(amari)
    if N < 26:
        break
    N = N // 26
ans = ''
for x in an :
    ans = alfa[x-1] + ans
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
name = ''
while True:
    if n%26 == 0:
        for i in range(n//26):
            name += 'z'
        print(name)
        exit()

    if n < 26:
        for i in range(26):
            if n%26 == i+1:
                name = chr(ord('a')+i) + name
        print(name)
        exit()
    for i in range(26):
        if n%26 == i+1:
            name = chr(ord('a')+i) + name
            n = n//26

Submission status: Wrong Answer

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

n = num2alpha(123456789)
print(n.lower())

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = []
while n > 26:
    ans.append(n % 26)
    n = n // 26
ans.append(n)
ans.reverse()
for i in ans:
    print(chr(i+96), end="")
print("")

Submission status: Wrong Answer

Solution code:
#! -*- coding: utf-8 -*-
n = int(input())

"""
26 ** 10 から値がたつか確かめる
"""

counter = 10
counter_list = []

for i in reversed(range(0, 11)):
    result = n // (26 ** i)
    print(result)
    if result > 0:
        counter_list.append(chr(96 + result))
    n %= (26 ** i)

print(''.join(counter_list))

Submission status: Wrong Answer

Solution code:
import string
n = int(input())
ans = ""

while (n != 0):
    s = n // 26
    t = n % 26
    p = string.ascii_lowercase[t-1]
    ans = p+ans
    n = s
print(ans)

Submission status: Wrong Answer

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

while N > 26:
    rem = N % 26
    N = N // 26
    ans.append(alphabet[rem-1])

ans.append(alphabet[N-1])
ans.reverse()

print(''.join(ans))

Submission status: Wrong Answer

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

alphabets = [chr(i) for i in range(97, 97+26)]
N = int(input())
S = Base_10_to_n(N, 26)
if N%26 == 0:
    S = S[:-1]
ans = [alphabets[int(x)-1] for x in S[::-1]]
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
import sys
import string
#from collections import defaultdict, deque, Counter
#import bisect
#import heapq
#import math
#from itertools import accumulate
#from itertools import permutations as perm
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as combr
#from fractions import gcd
#import numpy as np

stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def main():
    n = int(stdin.readline().rstrip())
    #n,k = map(int, stdin.readline().rstrip().split())
    #p = list(map(int, stdin.readline().rstrip().split()))
    #numbers = [[int(c) for c in l.strip().split()] for l in sys.stdin]
    #word = [stdin.readline().rstrip() for _ in range(n)]
    #number = [[int(c) for c in stdin.readline().rstrip()] for _ in range(n)]
    #zeros = [[0] * w for i in range(h)]
    letter = string.ascii_lowercase
    sho, amari = divmod(n,26)
    if sho == 0:
        print(letter[amari-1])
        exit()
    t = 11
    while True:
        if n > 26**t:
            break
        else:
            t -= 1
    for i in range(t,0,-1):
        sho, amari = divmod(n,26 ** i)
        print(letter[sho-1],end="")
        n = amari
    print(letter[amari-1])




main()

Submission status: Wrong Answer

Solution code:
alp = [chr(i) for i in range(97, 97+26)]
N = int(input())
q = N
s = ""
while True:
  q,m = divmod(q,26)
  s = alp[m - 1] + s
  if q == 0:
    break
print(s)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
s_list = 'abcdefghijklmnopqrstuvwxyz'

str = ''
while(N>=1):
  i = N % 26
  N = N // 26
  str = s_list[i-1] + str
print(str)

Submission status: Wrong Answer

Solution code:
N = int(input())

list = [0] * 11
if N > 141167095653376:
    list[0] = int(N / 141167095653376)
    N = N % 141167095653376
if N > 5429503678976:
    list[1] = N / 5429503678976
    N = N % 5429503678976
if N > 208827064576:
    list[2] = N / 208827064576
    N = N % 208827064576
if N > 8031810176:
    list[3] = N / 8031810176
    N = N % 8031810176
if N > 308915776:
    list[4] = N / 308915776
    N = N % 308915776
if N > 11881376:
    list[5] = N / 11881376
    N = N % 11881376
if N > 456976:
    list[6] = N / 456976
    N = N % 456976
if N > 17576:
    list[7] = N / 17576
    N = N % 17576
if N > 676:
    list[8] = N / 676
    N = N % 676
if N > 26:
    list[9] = N / 26
    N = N % 26
list[10] = N

num2alpha = lambda c: chr(c+64)

result = ''
for i in list:
    if int(i) != 0:
        result = result + num2alpha(int(i))
print(result.lower())