Problem:


Score : 300 points

Problem Statement

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

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

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

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

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

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

and so on.

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

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

Now, Roger asks you:

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

Constraints

N is an integer.

 1 \leq N \leq 1000000000000001

Input

Input is given from Standard Input in the following format:

N

Output

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

Sample Input 1

2

Sample Output 1

b

Sample Input 2

27

Sample Output 2

aa

Sample Input 3

123456789

Sample Output 3

jjddja



Sample input:
2


Sample output:
b

Submission status: Wrong Answer

Solution code:
import math
n=int(input())
cc=[26,702,18278,475254,12356630,321272406,8353082582,217180147158,7842777632145,149009873285521]
cca=["z","zz","zzz","zzzz","zzzzz","zzzzzz","zzzzzzz","zzzzzzzz","zzzzzzzzz","zzzzzzzzzz"]
if n in cc:
    num=cc.index(n)
    print(cca[num])
else:
    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"]
    s=int(math.log10(n)/math.log10(26))
    L=[]
    for i in range(s,-1,-1):
        #print(i)
        L.append(n//26**i)
        n-=(n//26**i)*(26**i)
    #print(L)
    A=[]
    for i in range(len(L),0,-1):
        if L[i-1]==0:
            A.append("z")
            L[i-2]-=1
        else:
            A.append(al[L[i-1]-1])
    #print(A)
    for i in range(len(A),0,-1):
        print(A[i-1],end="")

Submission status: Wrong Answer

Solution code:
def modosu(a):
    if a == 'a':
        return('z')
    elif a == 'b':
        return('a') 
    elif a == 'c':
        return('b') 
    elif a == 'd':
        return('c') 
    elif a == 'e':
        return('d') 
    elif a == 'f':
        return('e') 
    elif a == 'g':
        return('f') 
    elif a == 'h':
        return('g') 
    elif a == 'i':
        return('h') 
    elif a == 'j':
        return('i') 
    elif a == 'k':
        return('j') 
    elif a == 'l':
        return('k') 
    elif a == 'm':
        return('l') 
    elif a == 'n':
        return('m') 
    elif a == 'o':
        return('n') 
    elif a == 'p':
        return('o') 
    elif a == 'q':
        return('p') 
    elif a == 'r':
        return('q') 
    elif a == 's':
        return('r') 
    elif a == 't':
        return('w') 
    elif a == 'u':
        return('t') 
    elif a == 'v':
        return('u') 
    elif a == 'w':
        return('v') 
    elif a == 'x':
        return('w') 
    elif a == 'y':
        return('x') 
    else:
        return('y') 

n = int(input())

digits = " abcdefghijklmnopqrstuvwxyz"

output1 = []

n=n+1

while n:
    output1.append(digits[n%26])
    n //= 26

output2 = "".join(reversed(output1))

output3 = output2[0:-1]+ modosu(output2[-1])

print(output3)

Submission status: Wrong Answer

Solution code:
N = int(input())
resulter = "abcdefghijklmnopqrstuvwxyz"
# NS = str(N)
# print(len(resulter))
hoge = []
count = 10
while True:
    re = pow(26, count)
    if N > re:
        tmp = N // re
        mod = N % re
        print(tmp, mod, N, re)
        if tmp == 1 and (N - re) % 26 == 0:
            hoge.append(resulter[26 - 1])
        else:
            hoge.append(resulter[tmp - 1])
        N = N - re * tmp

    count = count - 1
    if count < 1:
        hoge.append(resulter[N - 1])
        break


print("".join(hoge))

Submission status: Wrong Answer

Solution code:
N = int(input())
s = ""
words = "abcdefghijklmnopqrstuvwxyz"
N = N-1
while N > 0:
    amari = N%26
    if N > 26:
        N = (N-N%26)/26-1
    else:
        N = N-26
    s = words[int(amari)]+s
print(s)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans, i = 0, 1
def toN(X, n):
    if (int(X/n)):
        return toN(int(X/n), n)+str(X%n).zfill(2)
    return str(X%n).zfill(2)

while N > ans + 26**i:
    ans += 26**i
    i += 1
    
a = toN(N, 26)
lang = []

for j in range(0, i*2, 2):
    if j == 0:
        lang.append('a')
    else:
        lang.append(chr(int(a[j:j+2])+96))
        pre = int(a[j:j+2])
    
print(''.join(lang))

Submission status: Wrong Answer

Solution code:
d={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"}

x=input()
y=int(x)
s=""
while y!=0:
	s+=d[y%26]
	
	y=y//26
	
print(s[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
count = 0
ans =""
k_list =[]
for i in range(1,20):
    count += 1
    if N - 26**i > 0:
        N = N - 26**i
    else:
        break
for i in reversed(range(1,count)):
    k = N // (26**i)
    k_list.append(int(k))
    if k != 0:
        N = N - 26**i * k

if N ==0:
    for i in range(len(k_list)):
        if k_list[i] == 0:
            ans = ans + "z"
        else:
            ans = ans + chr(96 + k_list[i])
    ans = ans + "z"
else:
    for i in range(len(k_list)):
        ans = ans + chr(97 + k_list[i])
    ans = ans + chr(96 + N)

print(ans)

Submission status: Wrong Answer

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

def slove():
    n = int(input())
    ans = ""
    abc = "abcdefghijklmnopqrstuvwxyz"
    while n != 0:
        k = n % 26
        n = n//26
        tmp = abc[k-1]
        ans = tmp + ans
        if k == 0 and n == 1:
            break
    print(ans)


if __name__ == "__main__":
    slove()

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
 
## Library
 
import sys
from fractions import gcd
import math
from math import ceil,floor
import collections
from collections import Counter
import itertools

## input
 
# N=int(input())
# A,B,C,D=map(int, input().split())
# S = input()
# yoko = list(map(int, input().split()))
# tate = [int(input()) for _ in range(N)]
# N, M = map(int,input().split()) 
#    P = [list(map(int,input().split())) for i in range(M)]

def base10to(n, b):
    if (int(n/b)):
        return base10to(int(n/b), b) + str(n%b)
    return str(n%b)

N=int(input())


alpha = "abcdefghijklmnopqrstuvwxyz"

S = base10to(N,26)

ans = ""
for i in range(len(S)):
    ans += alpha[int(S[i])-1]

print(ans)

Submission status: Wrong Answer

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

base = 96
roop = 0
tmp = 1
while 1:
    roop += 1
    if 26**roop + tmp > N:
        break
    tmp += 26**roop
ans = ['']*roop
tmp = N

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

Submission status: Wrong Answer

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

    ascii_lowercase = 'zabcdefghijklmnopqrstuvwxy'

    s = ''
    while True:
        i = n % 26
        s += ascii_lowercase[i]
        n = n // 26
        if n==0:
            break
    out = s[::-1]
    print(out)

main()

Submission status: Wrong Answer

Solution code:
import math
import pprint
import fractions
import collections
import itertools
from decimal import *
N=int(input())
l=[pow(26,i) for i in range(11)]

ans=[]
#print(l)
x=[26]
for i in range(2,11):
    x.append(x[len(x)-1]+l[i])
l.sort(reverse=True)
#print(x)
le=0
for i in range(9):
    #print(x[i])
    if N<=x[i]:
        le=i+1
        break
#print(le)
ans=[]
for i in range(le-1,-1,-1):
    d=min(26,N//pow(26,i))
    N=N-d*pow(26,i)
    #print(d)
    ans.append(chr(d-1+ord("a")))
print("".join(ans))

Submission status: Wrong Answer

Solution code:
n = int(input())

al = ["0","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"]
re = []


while(n != 0):
    am = n%26
    
    n = n//26
    
    re.append(al[am])
    
re.reverse()

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

Submission status: Wrong Answer

Solution code:
import math
import itertools
N = int(input())
a = [chr(i) for i in range(97, 97+26)]
data = ''
count = 1
data = f'{data}{a[N % 26-1]}'
if int(N/26) == 0:
    print(data[0])
    exit(0)
N -= 26**count
while N >= 0:
    if count >= 2:
        data = f'{a[int((N/26**count) % 26)-1]}{data}'
    else:
        data = f'{a[int((N/26**count) % 26)]}{data}'
    N -= 26**count
    count += 1
if N == 0:
    print(f'{data}a')
if count <= 2:
    print(data)
    exit(0)
print(data[1::])
exit(0)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

base = 96
roop = 0
tmp = 1
while 1:
    roop += 1
    if 26**roop + tmp > N:
        break
    tmp += 26**roop
ans = ['']*roop
tmp = N

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

Submission status: Wrong Answer

Solution code:
N=int(input())
alpha=list("abcdefghijklmnopqrstuvwxyz")

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

Submission status: Wrong Answer

Solution code:
n = int(input())
cnt = 0
arr = []
ans = ""
moji = "zabcdefghijklmnopqrstuvwxy"
flg = False
if n % 26 == 0:
    flg = True

for i in range(10000):
    arr.append(n % 26)
    n = n // 26
    if n == 0:
        cnt = i
        break

arr.reverse()

if flg:
    print("z" * cnt)
else:
    for i in arr:
        ans +=moji[i]
    print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

memo = {}
def get_ord(num):
	return ord(num) - ord('a') + 1

def get_char(num):
	return(chr(num-1+ord('a')))

def num_characters(num):
	s = 26
	c = 1
	while True:
		if num <= s:
			return c

		s += 26**(c+1)
		c += 1
	return c

s = N
chars = ""
for i in range(num_characters(N)):
	# s -= 
	char = s // pow(26, i)
	char %= 26
	s-=char
	chars = get_char(char) + chars

print(chars)

Submission status: Wrong Answer

Solution code:
from sys import stdin

def Base_10_to_n(X, n):
    if X == 26:
        return "z"
    alpha = "zabcdefghijklmnopqrstuvwxy"
    X_dumy = X
    out = ''
    while X_dumy>0:
        amari = X_dumy%n
        if amari == 0:
            new = alpha[amari]
            out = new+out
            X_dumy = int(X_dumy/n)-1
        else:
            new = alpha[X_dumy%n]
            out = new+out
            X_dumy = int(X_dumy/n)
    return out

def main():
    n = int(input())
    n = 78
    x16_expr = Base_10_to_n(n, 26)
    print(x16_expr)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
n=int(input())

num2alpha = lambda c: chr(c+64)

p=[]
while n>0:
  a=n%26
  p.append(a)
  if a==0:
    n = n-26
  else:
    n=n//26

for i in range(len(p)):
  if p[i] == 0:
    p[i] = 'z'
  else:
    p[i]=num2alpha(p[i]).lower()

p.reverse()  

b=''

for i in range(len(p)):
  b += p[i]
  
print(b)

Submission status: Wrong Answer

Solution code:
n=int(input())
from math import log, floor
  
def ten_to_n(X,n):
  if X//n:
    ans = ten_to_n(X//n,n)
    ans.append(X%n)
    return ans
  else:
    return [X%n]
  
dic = {}
l = ten_to_n(n,26)
print(l)
#for i in range(len(l)-1,0,-1):
#  if l[i]
#l[-1]+=1
for i in range(len(l)-1,0,-1):
  if l[i] > 25:
    t = l[i]
    l[i-1] += t//26
    l[i] = t%26
for i in range(len(l)-1,0,-1):
  if l[i] <= 0:
    l[i]+=26
    l[i-1]-=1
if l[0] == 0:
  l = l[1:]
#print(l)
    
for v1,v2 in zip(range(1,27),'abcdefghijklmnopqrstuvwxyz'):
  dic[v1]=v2
ans = ''.join([dic[v] for v in l])
print(ans)

Submission status: Wrong Answer

Solution code:
maps = {'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',
       }
n = int(input())
s=''
while True:
  s = maps[str(n%26)] + s
  tmp = n
  n //= 26
  if (n <= 0) | (tmp==26):
    break
print(s)

Submission status: Wrong Answer

Solution code:
import sys
import math
import numpy as np
import functools
import operator
import collections
import itertools

N=int(input())
ban=N
ANS=[]
count=0
count1=26
count2=2
A=[chr(i) for i in range(97, 97+26)]
for i in range(2,10000):
    count=26**i
    if count+count1==N:
        for j in range(count2):
            ANS.append(A[25])
            #print("1")
        ans="".join(ANS)
        print(ans)
        sys.exit()
    count1=count+count1
    count2+=1
#print(A[25])
if N<=26:
    print(A[N-1])
    sys.exit()
for i in range(N):
    ban=N//26
    amari=N%26
    if amari==0:
        ANS.append(A[25])
    else:
        ANS.append(A[amari-1])
    if ban<=26:
        if ban==26:
           ANS.append(A[26-1]) 
        if ban<27:
            ANS.append(A[ban-1])
        ANS.reverse()
        ans="".join(ANS)
        print(ans)
        sys.exit()
    N=ban
    
#print(A[25])

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']
if N == 27:
  print('aa')
  exit()
for i in range(10**15):
  N -= 26**i
  if N <= 0:
    n = i
    a = N+(26**i)
    break
ans = ['']*n
S = [0]*n
for i in range(n):
  S[-i-1] = (a//(26**i))%26
  ans[-i-1] = alp[S[-i-1]]

print(''.join(ans))

Submission status: Wrong Answer

Solution code:
N = int(input())

hyou = ['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 = 0
added = 0

while added < N:
  n += 1
  added += 26 ** n

result = ''
for i in reversed(range(0, n)):
  base = 26 ** i
  for j in range(2, 27):
    if base * j == N:
      result += hyou[j-1]
      N = 0
      break
    if base * j > N:
      result += hyou[j-2]
      N = N - (base * (j - 1))
      break
  else:
    result += hyou[j-1]
    N = N - (base * j)
  if N == 0:
    break

print(result)

Submission status: Wrong Answer

Solution code:
n = int(input())

su=[26**i for i in range(1,10)]
from itertools import accumulate
wa = list(accumulate(su)) 
import bisect
c = 0
if n>27:
    c=bisect.bisect_left(wa, n)
    n=n-wa[c-1]-1

k=26
bi=[]
for i in range(c+1):
    
      bi.append(n % k)
      n = (n-n%k)//k

al=[chr(ord('a') + i) for i in range(26)]

li = [al[i] for i in bi]
li.reverse()

mojiretu = ''.join(li)

print(mojiretu)

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:
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"]
Ans=[]
s=0
for i in range(11):
    s+=26**i
    S=s+26**(i+1)
    if s<=N<S:
        I=i
        break
while I>=0:
    for i in range(1,27):
        n=N-26**I*i
        if n<26**I:
            Ans.append(l[i-1])
            N=n
            I-=1
            break
print("".join(Ans))

Submission status: Wrong Answer

Solution code:
N = int(input())
if N <= 26:
    print(chr(ord("a") + N-(1)))

else:
    n = 1
    cnt = 0
    while n < N:
        cnt += 1
        n *= 26
    # print(cnt)
    ans = []

    while True:
        if cnt == 0:
            # print(N%26-1)
            if N%26:
                ans.append(chr(ord("a") + N%(26)-(1)))
                break
            else:
                # ans.append("z")
                break
        
        if N%26**cnt == 0:
            ans.append("z")
            N == 0
        elif N//(26**cnt):
            # print(N//(26**cnt))
            ans.append(chr(ord("a") + N//(26**cnt)-1))
            N %= (26**cnt)
        cnt -= 1
        # print("N", N)

    print("".join(ans))

Submission status: Wrong Answer

Solution code:
from functools import reduce
a=int(input())
a+= -1
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)
n26=Base_10_to_n(a, 26)
x=str(n26)
c=len(x)
y=0
l = [int(x) for x in list(str(x))]
new_n = int(reduce(lambda x, y: x + y, [str(x) for x in l]))
new_n=str(new_n)
z=''
b=['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 y<c:
    e=new_n[y]
    e=int(e)
    f=b[e]
    z+=str(f)
    y+=1
print(z)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

keta = 0
max = 0
while True:
    keta += 1
    max += 26 ** keta
    if max >= N:
        break

# print(keta)

result = []
while keta >= 1:
    if N // 26 ** (keta-1) > 26:
        v = 26
    else:
        v = N // (26 ** (keta-1))

    N = N - (26 ** (keta-1)) * v
    # print(v, N)
    result.append(v)

    keta -= 1

# print(result)

a_z_list = [chr(i) for i in range(97, 97+26)]
for v in result:
    print(a_z_list[v-1], end='')

print('')

Submission status: Wrong Answer

Solution code:
n = int(input())
def a(n):
    print(n)
    word = ''
    while n:
        a ,b = divmod(n, 26)
        print(a, b)
        if b == 0:
            word += (chr(96 + 26))
            n = a - 1
        else:
            word += (chr(96 + b))
            n = a
    print(word[::-1])
    print('---------')

for l in range(n+1):
    a(l)

Submission status: Wrong Answer

Solution code:
def digit_to_char(digit):
    return chr(ord('a') + digit-1)

def str_base(number,base):
    if number < 0:
        return '-' + str_base(-number, base)
    (d, m) = divmod(number, base)
    if d > 0:
        return str_base(d, base) + digit_to_char(m)
    return digit_to_char(m)

N = int(input())

print(str_base(N,26))

Submission status: Wrong Answer

Solution code:
"""    Arnab Chanda    """

from collections import defaultdict, deque
from itertools import permutations
from sys import stdin,stdout
from bisect import bisect_left, bisect_right
from copy import deepcopy
import heapq

int_input=lambda : int(stdin.readline())
string_input=lambda : stdin.readline().split()
multi_int_input =lambda : map(int, stdin.readline().split())
multi_input = lambda : stdin.readline().split()
list_input=lambda : list(map(int,stdin.readline().split()))
string_list_input=lambda: list(string_input())
MOD = pow(10,9)+7


ans = []

n = int_input()

while (n > 0):
    quo = n%26
    n = n//26
    #print(n)
    if quo == 0:
        ans.append('z')
    else:
        ans.append(chr(97+quo-1))


ans.reverse()

s = ""

for c in ans:
    s+=c

print(s)

Submission status: Wrong Answer

Solution code:
a=int(input())
b='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'
b=b.split(' ')
k=0
f=[]
while k<a:
    f.append((b[(a%26)-1]))
    a=a//26
    k=k+1
k=0
z=-1
while k<len(f):
    print(f[z],end='')
    k=k+1
    z=z-1

Submission status: Wrong Answer

Solution code:
N = int(input())
if 1<= N <= 1000000000000001:
    moji = list('abcdefghijklmnopqrstuvwxyz')
    amari = N
    syo = 0
    kai = ""
    lis = []
    for i in range(12,0,-1):
        syo = amari // 26 ** i
        amari = amari % 26 ** i
        if syo >0:
            kai += moji[syo - 1]
            
    kai += moji[amari - 1]
    print(kai)
        
else:
    print("")

Submission status: Wrong Answer

Solution code:
N=int(input())

ALpha='abcdefghijklmnopqrstuvwxyz'

def To26(In):
    if In//26:
        return To26(In//26)+ALpha[In%26-1]
    else:
        return ALpha[In%26-1]

print(To26(N))

Submission status: Wrong Answer

Solution code:
N = int(input())

charList = [chr(i) for i in range(97, 97+26)]
ansStr = ""
amari = 0
while(True):
  amari = N % 26
  if amari == 0:
    amari = 26
  ansStr = charList[amari-1] + ansStr
  N = N//26
  if N == 0:
    break
print(ansStr)

Submission status: Wrong Answer

Solution code:
n = int(input())
result = []
while True:
    n, p = divmod(n, 26)
    result.append(p)
    if n == 0:
        break
 
ans = []
string = 'abcdefghijklmnopqrstuvwxyz'
for i in range(len(result)-1,-1, -1):
    index = result[i]-1 
    ans.append(string[index:index+1])
print (''.join(map(str, ans)))

Submission status: Wrong Answer

Solution code:
import numpy as np
n= int(input())

digit = str(np.base_repr(n, 26))
digit2 = str(np.base_repr(n-26, 26))
if n == 26 or n == 676 or n == 17576 or n == 456976 or n == 11881376 or n == 308915776 or n == 8031810176 or n == 208827064576 or n == 5429503678976 or n == 141167095653376 or n == 3670344486987776:
  target = digit[1:]
elif n % 26 ==0:
  target = digit2
else:
  target = digit

ans = target.translate(str.maketrans({'1':'a','2':'b','3':'c','4':'d','5':'e','6':'f','7':'g','8':'h','9':'i','A':'j','B':'k','C':'l','D':'m','E':'n','F':'o','G':'p','H':'q','I':'r','J':'s','K':'t','L':'u','M':'v','N':'w','O':'x','P':'y','0':'z'}))
print(ans)

Submission status: Wrong Answer

Solution code:

def main():
    N = int(input())
    ans = ""

    while N > 26:
        tmp = N % 26
        if tmp == 0:
            ans += "z"
        else:
            ans += chr(tmp + 96)
        N //= 26
    else:
        ans += chr(N + 96)

    print(ans[::-1])


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def solve():
    n = int(input())
    a = 96
    # n = 26
    # fn = n
    s = []
    tmp = 0
    for i in range(1, 11):
        tmp += 26 ** i
        if n == tmp:
            print('z'*i)
            exit()

    for i in range(1, 11)[::-1]:
        c = (n // (26 ** i))
        # print(c)
        s.append(c)
        if c > 0:
            print(chr(c+a), end='')
        n = n % 26 ** i
    s.append(n)
    print(chr(n + a))
    # tes(fn, s)


def tes(n, s):
    k = 10
    ans = 0
    for i in s:
        print(k, (26**k) * i)
        ans+=(26**k) * i
        k -= 1
    print(ans == n)





if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
N = int(input())

s = []
n = N
while True:
    mod = n % 26
    s.append(mod)
    if n // 26 == 0:
        break
    n = (n - mod) // 26

for i in range(len(s)):
    if s[i] == 0 and i != len(s)-1:
        s[i] = 26
        s[i+1] = s[i+1] - 1

if s[-1] == 0:
    s = s[:-1]

name = ''
for i in range(len(s)):
    name = 'abcdefghijklmnopqrstuvwxyz'[s[i]-1] + name

print(name)

Submission status: Wrong Answer

Solution code:
import itertools
n = int(input())
a = "abcdefghijklmnopqrstuvwxyz"
temp = n
count = 0
while temp>0:
    temp //= 26
    count+=1
s = list(a*count)
p = list(itertools.permutations(s,count))
ans = list(set(p))
ans.sort()
print(*ans[n-26**(count-1)-count+1], sep="")

Submission status: Wrong Answer

Solution code:
N = int(input())
line = ['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', 'z' ]
output =""
while True:
    if (int(N/26)):
        output = line[N%26] + output
        N = int(N/26)
    else:
        output = line[N%26] + output
        break
print(output)

Submission status: Wrong Answer

Solution code:
import string
from decimal import Decimal, getcontext

getcontext().prec = 99
characters = string.ascii_lowercase
base_number = Decimal(26)


def convert_base_number(tmp, result):
    idx = (Decimal(tmp) % base_number) - 1
    if idx < 0:
        idx = 0

    return characters[int(idx)] + result


def resolve():
    tmp = Decimal(input())

    result = ''
    while tmp >= base_number:
        result = convert_base_number(tmp, result)
        tmp = Decimal(tmp) / base_number

    result = convert_base_number(tmp, result)
    print(result)


resolve()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys


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

def Base_10_to_n(i10, n, ans_list:list):
    if(int(i10/n)):
        ans_list.append(Base_10_to_n(int(i10/n), n, ans_list))
        return str(i10%n)
    return str(i10%n)


def resolve():
    n = int(input().rstrip())
    n_list = []

    ans_list = []

    n_list.append(Base_10_to_n(n, 26, n_list))
    cnt = 0
    #print(n_list)
    for i in range(len(n_list)):
        #print(ans_list)
        if n_list[i] == "0":
            cnt += 1
            while n_list[i - cnt] == "1":
                #print(ans_list,cnt, i-cnt)
                ans_list.pop(i-cnt)
                #print(ans_list)
                if i-cnt == 0:
                    break
                cnt += 1
            for j in range(cnt):
                ans_list.append("z")
        else:
            string = ord('a') + int(n_list[i]) -1
            ans_list.append(chr(string))

    ans_string = ""
    for st in ans_list:
        ans_string += st
    print(ans_string.rstrip())

if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

Solution code:
N = input()

N = int(N)

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

flg = 0
count = 0
first = 0

out = []

while flg == 0:
    q = (N-1)%26
    if first == 0:
        N = (N-1)//26
        first = 1
    else:
        N = N//26
    out.append(aTo1(q))
    if N == 0:
        break
    count = count + 1

outT = ""

for i in range(len(out)):
    outT = out[i] + outT

print(outT)

Submission status: Wrong Answer

Solution code:
n = int(input())
cnt = 0
arr = []
ans = ""
moji = "zabcdefghijklmnopqrstuvwxy"
flg = False
if n % 26 == 0:
    flg = True

for i in range(100):
    arr.append(n % 26)
    n = n // 26
    if n == 0:
        cnt = i
        break

arr.reverse()

if flg:
    print("z" * cnt)
else:
    for i in arr:
        ans +=moji[i]
    print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

ans = ''
for i in range(len(L)):
  ans += chr(L[i]+96)

rans = ''
for i in range(len(ans)-1,-1,-1):
  rans += ans[i]
  
print(rans)

Submission status: Wrong Answer

Solution code:
n = int(input())

tmp = [0] * 11
for i in range(10, -1, -1):
  #print('----')
  #print(n // (26 ** i))
  #print(26 ** i)
  tmp[i] = n // (26 ** i)
  if tmp[i] > 0:
    n -= tmp[i] * (26 ** i)
  #print(n)
ans = ''
#print(tmp)
tmp.reverse()
#print(tmp)
for i in range(11):
  if tmp[i] > 0:
    ans += chr(ord('a')+tmp[i]-1)
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

p = []
while n >= 1:
  p.append(chr(n % 26 + 96))
  n = n // 26
print(''.join(p[::-1]))

Submission status: Wrong Answer

Solution code:
N = int(input())
ans, i = 0, 1
def toN(X, n):
    if (int(X/n)):
        return toN(int(X/n), n)+str(X%n).zfill(2)
    return str(X%n).zfill(2)

while N > ans + 26**i:
    ans += 26**i
    i += 1
    
a = toN(N, 26)
lang = []
for j in range(0, i*2, 2):
    lang.append(chr(int(a[j:j+2])+96))
    pre = int(a[j:j+2])
    
print(''.join(lang))

Submission status: Wrong Answer

Solution code:
n=int(input())
k=26**20
ans=''
m=20
while (m):
    m-=1
    if k<=n:
        ans+=chr(ord('a')-1+n//k)
        n%=k
    k//=26
if (n):
    ans += chr(ord('a') - 1 + n )
print(ans)

Submission status: Wrong Answer

Solution code:
import string

# 1千兆 + 1
N = int(input())
n_digits = len(str(1000000000000001))
letters = string.ascii_lowercase
map_letters = { i-1:v for i,v in enumerate(string.ascii_lowercase)}

x = N - 1
ans = []
for d in range(n_digits):
    mod = x % 26
    ans = [ mod ] + ans
    x = x // 26 - 1
    if x <= 0:
        if sum(ans) == 0:
            ans = [0] + ans
        break

# print(ans)
# fa = []
# for i in range(len(ans)-1):
#     fa.append(ans[i]-1)
# fa.append(ans[-1])
print(
    ''.join(map(lambda d: letters[d], ans))
)

Submission status: Wrong Answer

Solution code:
import math
from typing import List, NoReturn, Tuple


def main() -> NoReturn:
    n: int = int(input())
    # 0.9615384615384616 == 25 / 26
    group: int = math.ceil(math.log(0.9615384615384616 * n + 1, 26))
    in_group_index: int = n - (26 * (26 ** (group - 1) - 1)) // 25

    alphabet_num: List[int] = []
    alphabet: str = "abcdefghijklmnopqrstuvwxyz"
    temp = in_group_index
    for i in range(group - 1, -1, -1):
        alphabet_num.append(temp // 26 ** i)
        temp %= 26 ** i
    # else:
    #     alphabet_num[-1] -= 1
    name_chars: List[str] = [alphabet[i - 1] for i in alphabet_num]
    print("".join(name_chars))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
name = ''
i = 0
while N >= 26**i:
    i += 1
keta = i - 1
while N != 0:
    name += chr(N // 26**keta + 96)
    N = N - 26**keta * (N // 26**keta)
    keta -= 1
print(name)