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())
L = []
a_l = 'abcdefghijklmnopqrstuvwxyz'
i = 1
L.append(1)
while True:
    if n//(26**i)>0:
        L.append(26**i+L[i-1])
    else:
        break
    i += 1

#print(L)
L  = sorted(L,reverse=True)

for i in range(len(L)):
    if i < len(L)-1:
        a = n//(L[i]-L[i+1])
        n = n%(L[i]-L[i+1])
    else:
        a = n
    print(a_l[a-1],end='')

Submission status: Wrong Answer

Solution code:
n = int(input())
dog = 1000000000000001
alphs = [chr(ord('a') + i) for i in range(26)]
ans = []
alph_size = 26
ord_s = ord("a")-1
num = n
num2 = 0
while True:
  if num < alph_size:
    break
  num2 = num%alph_size
  num = num//alph_size
  alph = alphs[num2-1]
  ans.append(alph)
alph = alphs[num-1]
ans.append(alph)
print("".join(ans[::-1]))

Submission status: Wrong Answer

Solution code:
#c
M = int(input())
s=''
a=['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']
while M>0:
    s+=a[M%26]
    M=M//26
print(s[::-1])

Submission status: Wrong Answer

Solution code:
import sys

def input():
    return sys.stdin.readline()[:-1]

N = int(input())

alphabet = "zabcdefghijklmnopqrstuvwxy"
name = ""

for i in range(10000):
    if N <= 26:
        q = N // 26
        mod = N % 26
        name = alphabet[mod] + name
        break
    else:
        q = N // 26
        mod = N % 26
        name = alphabet[mod] + name
        N = q

    #print(q, mod)


print(name)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = []
for i in range(11):
        ans.insert(0,chr(N%26+96))
        N = N//26
        if N ==0:
            break
print("".join(ans))

Submission status: Wrong Answer

Solution code:
from math import log

N = int(input())


base = 96
roop = int(log(N, 26)) + 1
ans = ['']*roop
tmp = N

for i in range(roop):
    rem = tmp % 26 
    ans[i] = chr(base+rem)
    tmp //= 26
ans.reverse()
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
import string
def resolve():
    N = int(input())
    lst = []
    while True:
        lst.append((N%26)-1)
        N //= 26
        if N == 0:
            break
    lst.reverse()

    
    st = [string.ascii_lowercase[i] for i in lst]
    print("".join(st))
resolve()

Submission status: Wrong Answer

Solution code:
N = int(input())
name = []
while N > 26:
    name.append(N%26)
    N = int(N / 26)
name.append(N)

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

swap_name = []
for i in range(len(name)):
    swap_name.append(swap(name[len(name)-i-1]))
print(*swap_name, sep="")

print(26**13)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

n = int(input())
i = 1
while True:
    if n < 26 ** i:
        length = i
        order = n - 26**i
        break
    i += 1

ans = []
while True:
    tmp=26 ** (i - 1)
    ans.append(n // tmp)
    n -= n//tmp *tmp
    i -= 1
    if i == 0:
        break

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

for i in range(length):
    print(str(s[ans[i]-1]), end="")

Submission status: Wrong Answer

Solution code:
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

n = ii()

al = [1]
nc = 0

def ntow(x):
    return chr(ord('a')+x-1)
    

for i in range(1,15):
    nc += 26 ** i
    al.append(nc+1)
    if nc > 1000000000000001:
        break


for i in range(15):
    if n < al[i]:
        keta = i
        break

# print('keta',keta)
ans = ''

for i in range(keta):
    tmp = 26**(i+1)
    # print('tmp',tmp)
    nk = n%tmp
    # print(nk//(26**i))

    ans =  ntow(nk//(26**i)) + ans

    n -= nk

print(ans)

Submission status: Wrong Answer

Solution code:
def solve():
    n = int(input())
    for i in range(1, 13)[::-1]:
        c = n // (26 ** i) + 96
        if c > 96:
            print(chr(n // (26 ** i) + 96), end='')
        n = n % 26 ** i
    print(chr(n + 96))


if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=[]
num2alpha = lambda c: chr(c+64).lower()
while True:
  if num2alpha(n%26)=='a@':
    ans.append('z')
  else:
    ans.append(num2alpha(n%26))
  n=n//26
  if n==0:
    break
for i in range(len(ans)):
  print(ans[-1-i], end='')
print()

Submission status: Wrong Answer

Solution code:
def f(n):
	for p in range(15,-1,-1):
		if 26**p <= n:
			return n//(26**p),p
		

n=int(input())

c=n
t=[]
while c:
	x,p =f(c)
	if x==1 and p>0:x=26;p-=1
	# ~ print((x,p))
	t+=[x]
	c-=(x*(26**p))
# ~ print(t)
a=""
for j in t:
	a+=chr(j+97-1)
print(a)

Submission status: Wrong Answer

Solution code:
#C
N=int(input())
alpha="abcdefghijklmnopqrstuvwxyz"
cnt=1
while True:
    if N<=26**cnt:
        break
    N-=26**cnt
    cnt+=1
ans=""
for i in range(cnt):
    ans=alpha[N%26-1]+ans
    N=N//26+1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
#n -= 1
l = []
while True:
    t = n // 26
    s = n % 26
    if s != 0:
        l.append(chr(96+s))
    n = t
    if t == 0:
        break
l.reverse()
print(''.join(l))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
alphabet='abcdefghijklmnopqrstuvwxyz'
base=[26**i for i in range(12)]
digit=0
for i in range(12):
    if base[i]>n:
        digit=i
        break
answer=''
for i in range(digit):
    t=n//base[-(13-digit)-i]
    if t==0:
        t=26
    answer+=alphabet[t-1]
    n=n%base[-(13-digit)-i]
print(answer)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [chr(ord('a') + i) for i in range(26)]
answer = ''
while N > 0:
    answer = A[N%26-1]+answer
    if N==26:
        break
    N = N//26
print(answer)

Submission status: Wrong Answer

Solution code:
n = int(input())
alphabets = "abcdefghijklmnopqrstuvwxyz"
count = 1
a = 26
while True:
  if n % a == n:
    break
  a *= 26
  count += 1
ans = ""
for i in range(count):
  a //= 26
  b = n // a
  n = n % a
  ans += alphabets[b - 1]
print(ans)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n):
    res = [None] * n
    for i in range(n):
        res[i] = II()
    return res
def LIR(n):
    res = [None] * n
    for i in range(n):
        res[i] = LI()
    return res
def FR(n):
    res = [None] * n
    for i in range(n):
        res[i] = IF()
    return res
def LFR(n):
    res = [None] * n
    for i in range(n):
        res[i] = IF()
    return res
def LIR_(n):
    res = [None] * n
    for i in range(n):
        res[i] = LI_()
    return res
def SR(n):
    res = [None] * n
    for i in range(n):
        res[i] = S()
    return res
def LSR(n):
    res = [None] * n
    for i in range(n):
        res[i] = LS()
    return res
mod = 1000000007
inf = float('INF')

#solve
def solve():
    n = II()
    ans = []
    n -= 1
    if n == 0:
        print("a")
    else:
        while n:
            x = n % 26
            n //= 26
            ans.append(chr(x + ord("a")))
        print("".join(ans[::-1]))
    return


#main
if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
N = int(input())
alphabet = "abcdefghijklmnopqrstuvdxyz"
k=0
name =""
Nhen = N
q = 10000000000000000
while q > 26:
    k += 1
    q,mod = divmod(Nhen,26)
    Nhen = q
    named = mod - 1
    name = alphabet[named]+name
print(name)

Submission status: Wrong Answer

Solution code:
N = int(input())
alphabets = {i: chr(i + 96) for i in range(1, 26)}
alphabets[0] = 'z'

queue = []
while N > 0:
    queue.insert(0, alphabets[N % 26])
    N //= 26
    
print(''.join(queue))

Submission status: Wrong Answer

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

def can_devide(num):
    return num > 26

def get_alpha(alp):
    apls = [chr(i) for i in range(97, 97+26)]
    return apls[alp - 1]


ans = ""

while True:
    alp = N % 26

    ans += get_alpha(alp)

    if not can_devide(N):
        break

    N = N // 26

print(ans[::-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
l=['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']
z=[]
while n>0:
  r=n%26
  n=n//26
  z.append(r)
s=''
for x in z:
  let=l[x-1]
  s=let+s
print(s)

Submission status: Wrong Answer

Solution code:

n=int(input())

a="0abcdefghijklmnopqrstuvwxyz"
aa=list(a)

stra=""
kk=n
for i in range(15):
    ki=kk%26
    stra=aa[ki]+stra    
    kk=(kk-ki)//26
#    print(kk,ki,stra)
    if kk==0:
        break
    
print(stra)

Submission status: Wrong Answer

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    n = int(readline())
    chars = "abcdefghijklmnopqrstuvwxyz"
    res = ""

    for i in range(100,-1,-1):
        x = 26**i
        y = n // x
        if y > 0:
            res += chars[y-1]
            n -= (y*x)

    print(res)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    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)
    P = list(map(int, Base_10_to_n(n, 26).split()))
    ans = [0] * len(P)
    for i, p in enumerate(P):
        ans[i] = chr(96 + p)


    print(''.join(ans))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

ans = ""
shou = 0

for i in reversed(range(12)):
  num = 26**i
  shou = N // num
  
  if shou == 0:
    next
  else:
    ans = ans + moji[shou - 1]
    N = N % num
    
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import decimal
N=decimal.Decimal(input())
alphabet=[chr(ord('a') + i) for i in range(26)]

N_dumy = N
out = ''
while N_dumy>0.0:
    out = alphabet[ int((N_dumy%26)-1)]+out
    N_dumy = N_dumy//26
print(out)

Submission status: Wrong Answer

Solution code:
import string
a=string.ascii_lowercase
N=int(input())
ans=[]
count=0
while N>0:
    n=N//26
    m=N%26
    ans.append(a[m-1])
    N=n
Ans=[]
for i in range(len(ans)):
    Ans.append(ans[len(ans)-i-1])
print("".join(Ans))

Submission status: Wrong Answer

Solution code:
n = int(input())
s = 'zabcdefghijklmnopqrstuvwxy'
l =[]
count = 0
for i in reversed(range(11)):
    j = n // 26 ** i

    if len(l) == 0:              
        if j == 0:
            continue
    l += s[j]
    n -= j * 26 ** i
ss = ''.join(l)
print(ss)

Submission status: Wrong Answer

Solution code:
import string
a=int(input())
n=string.ascii_lowercase
m=[]
for i in range(len(n)):
    m.append(n[i])
ans=[]
q=0
for i in range(1,13):
    if a%(26**i)==a:
        q+=i-1
        break
    ans.append(a%(26**i))

ansans=[]
while q>=0:
    ansans.append(m[a//(26**q)-1])
    a=a%(26**q)
    q-=1
print(''.join(ansans))

Submission status: Wrong Answer

Solution code:
from math import log

N = int(input())

print(ord('a'), chr(97), chr(122))

base = 96
roop = int(log(N, 26)) + 1
ans = ['']*roop
tmp = N


for i in range(roop):
    rem = tmp % 26 
    ans[i] = chr(base+rem)
    tmp //= 26

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

Submission status: Wrong Answer

Solution code:
def repeat(n):
    if n == 0: return ''
    num = n % 26 - 1
    alpha = chr(ord('a') + num)
    return repeat(n // 26) + alpha

n = int(input())
result = repeat(n)
print(result)

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:
n = int( input() )

l = []
a = 97
alp = 26
k = 1
n2 = n
while n > k:
  l.append( n2 % alp )
  n2 = ( n2 - n2 % alp ) // alp
  k *= alp

ret = ""
for c in reversed( l ):
  ret += chr( a + c - 1 )
print( ret )

Submission status: Wrong Answer

Solution code:
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
A = []
while(N>26):
    s = N % 26 
    N = (N-s) //26
    A.append(s)
A.append(N)
A = A[::-1]
ans = ''
d = ['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 A:
  ans += d[i-1]
print(ans)

Submission status: Wrong Answer

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

def dfs(N):
    n, r = divmod(N, 26)
    ans.append(alp[r-1])
    if N <= 26:
        return (n, r)
    return dfs(n)

dfs(N)
print("".join(ans[::-1]))

Submission status: Wrong Answer

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

print(num2alpha(n))

Submission status: Wrong Answer

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10, gcd
from itertools import permutations, combinations, product, accumulate, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
#from fractions import gcd
from decimal import *
import heapq
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 1, 0, -1, 1, -1, -1, 1]
dy = [1, 0, -1, 0, 1, -1, 1, -1]
debugmode = True

def Base_10_to_n(X, n):
    X_dumy = X
    out = []
    while X_dumy>0:
        n_out = [X_dumy%n]
        n_out.extend(out)
        out = deepcopy(n_out)
        X_dumy = int(X_dumy/n)
    return out

n = INT()
m = Base_10_to_n(n, 26)
#print(m)
for i in range(len(m)):
    m[i] -= 1
#print(m)
for i in reversed(range(1, len(m))):
    if m[i] < 0:
        m[i] = 25
        m[i - 1] -= 1
if m[0] < 0:
    del m[0]
#print(m)
ans = ''
for i in m:
    ans += chr(ord('a') + i)
print(ans)

Submission status: Wrong Answer

Solution code:
#C
N=int(input())
alpha="abcdefghijklmnopqrstuvwxyz"
cnt=1
while True:
    if N<=26**cnt:
        break
    N-=26**cnt
    cnt+=1
ans=""
for i in range(cnt):
    ans=alpha[N%26-1]+ans
    N=N//26+1
    print(N)
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
n = N
l = []
while True:
    a = n % 26
    n = n // 26
    l.append(a)
    if n == 0:
        break
l.reverse()
print(*[chr(ans+96) for ans in l], sep='')

Submission status: Wrong Answer

Solution code:
import sys, collections, bisect, itertools, heapq, math, copy, string
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    N = I()

    ans = ''
    while N > 26:
        ans += string.ascii_lowercase[N%26-1]
        N //= 26
    ans += string.ascii_lowercase[N%26-1]

    print(ans[::-1])

if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

Solution code:
n= int(input())

alp=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"
          ])

answer=""
while True:
    answer=alp[(n-1)%26]+answer
    if n<=26:
        break
    n=n//26

print(answer)

Submission status: Wrong Answer

Solution code:
import numpy as np
import scipy.sparse as sps
import scipy.misc as spm
import collections as col
import functools as func
import itertools as ite
import fractions as frac
import math as ma
from math import cos,sin,tan,sqrt
import cmath as cma
import copy as cp
import sys
import re
import bisect as bs
sys.setrecursionlimit(10**7)
EPS = sys.float_info.epsilon
PI = np.pi; EXP = np.e; INF = np.inf
MOD = 10**9 + 7

def sinput(): return sys.stdin.readline().strip()
def iinput(): return int(sinput())
def imap(): return map(int, sinput().split())
def fmap(): return map(float, sinput().split())
def iarr(n=0):
    if n: return [0 for _ in range(n)]
    else: return list(imap())
def farr(): return list(fmap())
def sarr(n=0):
    if n: return ["" for _ in range(n)]
    else: return sinput().split()
def barr(n): return [False for _ in range(n)]
def adj(n): return [[] for _ in range(n)]

n = iinput()
ch = ["z"]+[chr(i) for i in range(ord("a"), ord("a")+25)]

def cnt26(num):
    cnt = 0
    while 1:
        if 26 ** cnt > num: return cnt - 1
        else: cnt += 1

s = ""
dig = cnt26(n)
while dig >= 0:
    div,mod = divmod(n, 26**dig)
    #print(div,mod)
    n = mod
    s += ch[div]
    dig -= 1

print(s)

Submission status: Wrong Answer

Solution code:
N = int(input())
lst = []
for i in range(1,12):
    if N <= 26:
        lst.append(N)
        break
    lst.append(N % 26)
    N = N // 26

chr = 'abcdefghijklmnopqrstuvwxyz'
res = ""
for j in lst:
    res = chr[j-1] + res
print(res)

Submission status: Wrong Answer

Solution code:
N = int(input())

def Base_10_to_n(X, n):
    a = int(X / n)
    if a:
        b = X % n
        if b == 0:
            b = 26
        d = string[b - 1]

        if a == 1 and b == 26:
            return d
        else:
            return Base_10_to_n(int(X / n), n) + d
    return string[(X % n) - 1]


string = 'abcdefghijklmnopqrstuvwxyz'
print(Base_10_to_n(N, 26))

Submission status: Wrong Answer

Solution code:
N = int(input())

N -= 1
ans = chr(N%26+97)
N //= 26
while N > 0:
  ans = chr(N%26+96) + ans
  N //= 26
print(ans)

Submission status: Wrong Answer

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


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

m = []
for i in lis:
    m.append(alp[i-1])
m.reverse()
print("".join(m))

Submission status: Wrong Answer

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

l = []

while 1:
  amari = N % 26
  N = N//26
  l.append(amari)
  if N == 0:
    break
l = l[::-1]
l = [abc[i-1] for i in l]
print("".join(l))

Submission status: Wrong Answer

Solution code:
n = int(input())
lis = [chr(ord('a') + i) for i in range(26)]

m = n
i=1
while True:
    if m <= 26**i:
        break

    else:
        m -= 26**i
        i += 1

ans = []

for j in range(i-1, -1, -1):
    s1 = n // (26**j)
    if s1 == 0:
        ans.append(lis[s1])
    elif s1 == 27:
        s1 = 26
        ans.append(lis[-1])
    else:
        ans.append(lis[s1-1])
    n -= (26**j) * s1

print(''.join(ans))

Submission status: Wrong Answer

Solution code:
n = int(input())

name = ['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 = ' '

stop = False

while not stop: 
  if n // 26 >= 1:
    n = n // 26
    ans += name[(n-1) % 26]
  else:
    ans += name[n-1]
    stop = True

print(ans)

Submission status: Wrong Answer

Solution code:
from copy import copy
n = int(input())
nn = copy(n)
ans = ''
alp = 'abcdefghijklmnopqrstuvwxyz'
cnt = 0
while n > 0:
    n //= 26
    cnt += 1
#cnt上まである
n = copy(nn)
#print(cnt)
for i in range(cnt, 0, -1):
    if i > 1:
        a = n//(26**(i-1))
        nn //= 26
        n -= 26**(i-1)*a
        #print(a, 2)
        ans = ans + alp[a-1:a]
    else:
        a = n
        #print(n, 3)
        ans = ans + alp[a-1:a]
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
i=0
pl=list()
while True:
    i=i+1
    p=n/26**i
    if p<=1:
        break
a=n
for l in range (i):
    a,b=divmod(a,26)
    pl.insert(0,(chr(b+96)))
print("".join(pl))

Submission status: Wrong Answer

Solution code:
from math import log
def main():
    n = int(input())
    s = [chr(i) for i in range(ord('a'), ord('z')+1)]
    # print(s)
    ans = ""
    while(n):
        n = n//26
        ans+=s[max(n%26-1, 0)]
    print(ans)

    # for t in range(int(input())):
        # n = int(input())
        

# "Ashishgup" if he wins, and "FastestFinger"

# for #!/usr/bin/env python
# import os
# import sys
# from io import BytesIO, IOBase


# # region fastio

# BUFSIZE = 8192


# class FastIO(IOBase):
#     newlines = 0

#     def __init__(self, file):
#         self._fd = file.fileno()
#         self.buffer = BytesIO()
#         self.writable = "x" in file.mode or "r" not in file.mode
#         self.write = self.buffer.write if self.writable else None

#     def read(self):
#         while True:
#             b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
#             if not b:
#                 break
#             ptr = self.buffer.tell()
#             self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
#         self.newlines = 0
#         return self.buffer.read()

#     def readline(self):
#         while self.newlines == 0:
#             b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
#             self.newlines = b.count(b"\n") + (not b)
#             ptr = self.buffer.tell()
#             self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
#         self.newlines -= 1
#         return self.buffer.readline()

#     def flush(self):
#         if self.writable:
#             os.write(self._fd, self.buffer.getvalue())
#             self.buffer.truncate(0), self.buffer.seek(0)


# class IOWrapper(IOBase):
#     def __init__(self, file):
#         self.buffer = FastIO(file)
#         self.flush = self.buffer.flush
#         self.writable = self.buffer.writable
#         self.write = lambda s: self.buffer.write(s.encode("ascii"))
#         self.read = lambda: self.buffer.read().decode("ascii")
#         self.readline = lambda: self.buffer.readline().decode("ascii")


# sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
# input = lambda: sys.stdin.readline().rstrip("\r\n")

# # endregion

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
q =[0]*100
a = 0
for i in range (100):
  if(n <=26):
    a = i
    q[i] = n
    break
  q[i] = n%26
  n = n//26
for i in range(a,-1,-1):
  print(chr(96+q[i]),end='')

Submission status: Wrong Answer

Solution code:
import sys
import math
import decimal

def input():
    return sys.stdin.readline()[:-1]

N = int(input())

alphabet = "zabcdefghijklmnopqrstuvwxy"
name = ""

for i in range(10000):
    if N <= 26:
        q = N // 26
        mod = N % 26
        name = alphabet[mod] + name
        break
    else:
        q = N // 26
        mod = N % 26
        name = alphabet[mod] + name
        N = q

    print(q, mod)


print(name)

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:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
INF = float("inf")


def main():
    N = int(input())
    p = []
    a = N

    if N <= 26:
        print(chr(ord('a')+N-1))
        return
    while a > 0:
        m = a % 26
        p.append(m)
        a //= 26

    # print(list(reversed(p)))
    # " abcdefghijklmnopqrstuvwxyz"
    print("".join([chr(ord('a')+n-1) if n != 0 else "" for n in reversed(p)]))

    return


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n=int(input())

a=[]
n=n
while n > 25:
    a.append(n%26)
    n//=26

ans=""
for b in a:
    s=chr(ord('a')+b-1)
    ans+=s
ans+=chr(ord('a')+n-1)
for u in ans[::-1]:
    print(u,end="")

Submission status: Wrong Answer

Solution code:
from math import *
a=int(input())
r=''
n=ceil(a/26)
while(n and a):
    n-=1
    c=a%26
    if(c!=0):
        r+=chr(97+c-1)
    else:
        r+='z'
    a=(a//26)
print(r[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
lis =[]
while n >= 26:
    lis.append(n%26)
    n = n//26
    print(n)

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

m = []
for i in lis:
    m.append(alp[i-1])
m.reverse()
print("".join(m))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
N = int(input())
MAX = 11
ecg = ['']*MAX
#max: 724GO7J0OAD
for i in range(MAX):
  ecg[i] = chr((N % 26) + 96)
  N //= 26
  if(N == 0):
    break

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

Submission status: Wrong Answer

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

while N > 1:
  e = N % 26
  ans += memo[e - 1]
  N = N // 26
  
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input()) - 1
    res = ''
    d = 1
    base = []
    alp = 'abcdefghijklmnopqrstuvwxyz'
    for i in range(11):
        d *= 26
        base.append(d)
    st = True
    for b in base[::-1]:
        if b <= n:
            st = False
        if st:
            continue
        res += alp[(n // b) -1]
        n = n % b
    res += alp[n]
    print(res)



if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
abc = "abcdefghijklmnopqrstuvwxyz"
l = [141167095653376,5429503678976,208827064576,8031810176,308915776,11881376,456976,17576,676,26,1]
if n <= 26:
    print(abc[n-1])
    exit()
ans = []
for i in range(len(l)):
    if n < l[i] :
        continue
    a = n//l[i]
    n = n%l[i]
    ans.append(abc[a-1])

for i in ans:
    print(i,end="")

Submission status: Wrong Answer

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

ans = ""
shou = 0

for i in reversed(range(11)):
  num = 26**i
  shou = N // num
  
  if shou == 0:
    next
  else:
    ans = ans + moji[shou - 1]
    N = N % num
    
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
n -= 1
s = ""


m = n % 26
n = n // 26

s = chr(ord('a') + m) + s

while n > 0:
    m = n % 26
    n = n // 26

    s = chr(ord('a') + m - 1) + s

print(s)

Submission status: Wrong Answer

Solution code:
#c
M = int(input())
s=''
a=['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']
while M>26:
    s+=a[M%26]
    M=M//26
s+=a[M%26]
print(s[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
#n, k = [int(a) for a in input().split()]
#ps = [int(a) for a in input().split()]

a = []

remain = n

while remain > 26:
  a.append(int(remain % 26))
  remain -= a[-1]
  remain /= 26
a.append(int(remain))  
tmp = ' abcdefghijklmnopqrstuvwxyz'
a.reverse()
print(''.join([tmp[i] for i in a]))

Submission status: Wrong Answer

Solution code:
n = int(input())
alpha = "abcdefghijklmnopqrstuvwxyz"
tmp = [26 ** i for i in range(1, 20)]
lst = [0]
for num in tmp:
    lst.append(lst[-1] + num)
for i, num in enumerate(lst):
    if num >= n:
        p = i
        break
ans = ""
n -= lst[p - 1]
for i in range(p):
    ans += alpha[(n - 1) % 26]
    n //= 26
    n += 1
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N = input()
N = int(N)
print(N)
N-=1

dit = [0 for _ in range(100)]
i = 0
while True:
  dit[i] = N % 26
  N = N // 26
  if N == 0:
    break
  else:
    N -= 1
  i+=1

print(dit)
name = ""
for j in range(i,-1,-1):
  name += chr(97+dit[j])
  
print(name)

Submission status: Wrong Answer

Solution code:
n = int(input())
l = ["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"]
answer = []
while n >= 1:
    answer.append(l[n % 26 -1])
    n = n//26
ans = ''.join(list(reversed(answer)))
print(ans)