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())
p = []
while(1):
    b = n%26
    n = n//26
    p.append(b)
    if n<26:
        if n!=0:
            p.append(n)
        break
p = p[::-1]
for i in p:
    print(chr(i + 96),end ='')
print('')

Submission status: Wrong Answer

Solution code:
n = int(input())
p = []
while(1):
    b = n%26
    n = n//26
    p.append(b)
    if n<26:
        if n!=0:
            p.append(n)
        break
p = p[::-1]
for i in p:
    print(chr(i + 96),end ='')

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: 	C
# CreatedDate:  2020-06-21 20:42:31 +0900
# LastModified: 2020-06-22 16:48:21 +0900
#



def main():
    moji_zukan = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
    n = int(input())
    tag = ''
    for i in range(12):
        if 26**i <= n and n < 26**(i+1):
            len_str = i
            break
    for i in range(len_str,-1,-1):
        moji = n//26**i
        tag+=moji_zukan[moji-1]
        n %= 26**i
    print(tag)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: 	C
# CreatedDate:  2020-06-21 20:42:31 +0900
# LastModified: 2020-06-22 16:46:20 +0900
#



def main():
    moji_zukan = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
    n = int(input())
    tag = ''
    for i in range(11):
        if 26**i <= n and n < 26**(i+1):
            len_str = i
            break
    for i in range(len_str,-1,-1):
        moji = n//26**i
        tag+=moji_zukan[moji-1]
        n %= 26**i
    print(tag)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

sss = []

while N // 26 != 0:
    sss.append(N % 26)
    N = N // 26

sss.append(N)

sss.reverse()

result = ""

for ssssss in sss:
    result += alpha[ssssss - 1]

print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)

convert = {
    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',
    26:'z',
}
def Base_n_to_10(X, n):
    if (int(X/n)):
        return Base_n_to_10(int(X/n), n)+str(X%n)
    return str(X%n)

def main():
    r = []
    n = int(input())
    print(divmod(n, 26))
    while True:
        n -= 1
        r.append(n % 26)
        n = n // 26
        if n == 0: break
    print(r)
    for i in r[::-1]:
        print(convert[i+1], end='')
    print()
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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

while(True):
  K=-1
  K = int(N%26)
  alp.insert(0,mozi[K-1])
  N = (N-K)/26
  if(N<1):break
    
print(''.join(alp))

Submission status: Wrong Answer

Solution code:
n=int(input())

basis=[26**i for i in range(12)]
l=[]
s=0
for b in basis:
    s+=b
    l.append(s)    

i=0
f=12
while(f-i>1):
#     print(f-i)
    x=(i+f)//2
    if l[x]>n:
        f=x
    else:
        i=x

k=n-l[i]
length=i+1
x=k-1
res=[]
for i in range(length):
    q=k//26
    r=k%26
    x=q
    res.append(r)

ans=list(map(lambda x: chr(ord("a")+x),list(reversed(res))))
print("".join(ans))

Submission status: Wrong Answer

Solution code:
import string
n=int(input())
alp=string.ascii_lowercase
k=1
s=0
lis=[0]
ans=''

for i in range(1,12):
    k*=26
    s += k
    lis.append(s)
    if s >= n:
        break
#print(i,lis)
x=n-lis[-2]
#x=n
#print(x)
#print(i)


for j in reversed(range(1,i)):
    q,m=divmod(x,26**j)
    #print(x,26**j,q,m)
    if j!=1:
        if q==26:
            ans+='z'
        else:
            #print(alp[q])
            ans+=alp[q]
        #print(ans)
        if m==0:
            x=26**j
        else:
            x=m
    
    else:
        if m==0:
            q-=1
            x=26**j
        else:
            x=m
        ans+=alp[q]
        #print(ans)
        
#print(x)
#print(alp[x-1])
ans+=alp[x-1]
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
digits = 0
k = n
for i in range(16):
    if k <= pow(26, i + 1):
        digits = i + 1
        break
    k -= pow(26, i + 1)

alf = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
num = pow(26, digits - 1)
while True:
    if 1 <= n <= 26:
        ans += alf[n - 1]
        break

    for i in range(1, 27):
        if i * num < n <= (i + 1) * num:
            ans += alf[i - 1]
            n -= i * num
            break
            
    num = num // 26


print(ans)

Submission status: Wrong Answer

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import string
n=int(input())
alp=string.ascii_lowercase
k=1
s=0
lis=[0]
ans=''

for i in range(1,12):
    k*=26
    s += k
    lis.append(s)
    if s >= n:
        break
#print(i,lis)
x=n-lis[-2]
#x=n
#print(x)
#print(i)


for j in reversed(range(1,i)):
    q,m=divmod(x,26**j)
    #print(x,j,26**j,q,m)
    if q==26:
        ans+='z'
    else:
        #print(alp[q])
        ans+=alp[q]
    if m==0:
        x=26**j
    else:
        x=m
#print(x)
#print(alp[x-1])
ans+=alp[x-1]
print(ans)

Submission status: Wrong Answer

Solution code:
basis=[26**i for i in range(12)]
n=int(input())-1
if n!=0:
    res=[]
    for b in reversed(basis):
        res.append(n//b)
        n=n%b

    ans=[]
    flag=False
    for x in res:
        if x!=0:
            flag=True
        if flag:
            ans.append(chr(ord("a")+x))

    print("".join(ans))
else:
    print("a")

Submission status: Wrong Answer

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

lst = [0]
n = 0
for i in range(1,13):
    n = n + 26 ** i
    lst.append(n)

#桁数の確定
keta = 0
for i in range(len(lst)):
    if N <= lst[i]:
        keta = i
        break

num = []
ketax = keta
for _ in range(keta):
    syo = N // (26 ** (ketax - 1))
    amari = N % (26 ** (ketax - 1))
    if syo == 27:
        syo = 26
        if amari == 0:
            amari = 26 ** (ketax - 1)
    num.append(syo)
    N = amari
    ketax -= 1


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

Submission status: Wrong Answer

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

lst = [0]
n = 0
for i in range(1,13):
    n = n + 26 ** i
    lst.append(n)

#桁数の確定
keta = 0
for i in range(len(lst)):
    if N <= lst[i]:
        keta = i
        break

num = []
ketax = keta
for _ in range(keta):
    syo = N // (26 ** (ketax - 1))
    amari = N % (26 ** (ketax - 1))
    print(syo)
    if syo == 27:
        syo = 26
        if amari == 0:
            amari = 26 ** (ketax - 1)
    num.append(syo)
    N = amari
    ketax -= 1


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

Submission status: Wrong Answer

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

lst = [0]
n = 0
for i in range(1,13):
    n = n + 26 ** i
    lst.append(n)

#桁数の確定
keta = 0
for i in range(len(lst)):
    if N <= lst[i]:
        keta = i
        break

num = []
ketax = keta
for _ in range(keta):
    syo = N // (26 ** (ketax - 1))
    amari = N % (26 ** (ketax - 1))
    print(syo)
    if syo == 27:
        syo = 26
        if amari == 0:
            amari = 26 ** (ketax - 1)
    num.append(syo)
    N = amari
    ketax -= 1
print(num)

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

Submission status: Wrong Answer

Solution code:
N=int(input())
abc=[chr(i) for i in range(97, 97+26)]
ans=""
while N>0:
    ans+=(abc[N%26-1])
    N//=26
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
digit=list('abcdefghijklmnopqrstuvwxyz')
P=int(input())
ans=[]
s=''

for n in range(10,0,-1):
    if 26**n <= P:
        D = P // 26**n
        P = P % 26**n
        ans.append(D)

ans.append(P)
for i in ans:
    s += digit[i-1]

print(s)

Submission status: Wrong Answer

Solution code:
N = int(input())
name = ""
for i in range(20):
    N_mod = N % 26
    N_div = N // 26
    if N == 0:
      break
    else:
        Nmod_to_alp = chr(N_mod+ord("a")-1)
        name = Nmod_to_alp + name
        N = N_div
print(name)

Submission status: Wrong Answer

Solution code:
N = int(input())

ansList = []

for i in range(11):
    ansList.append(N // 26 ** (10 - i))
    N = N % 26 ** (10 - i)

tmp = 0
for index, hoge in enumerate(ansList):
#    print(index, hoge)
    if(hoge != 0):
        tmp = index
        break

#print(tmp)
del(ansList[:tmp])
#print(ansList)

ansList_rev = list(reversed(ansList))

str_a_to_z = "abcdefghijklmnopqrstuvwxyz"

ans = ""
for i in range(len(ansList_rev)):
    if(ansList_rev[i] == 0):
        ansList_rev[i] = 26
        if(i != len(ansList_rev)-1):
            ansList_rev[i+1] -= 1
        else:
            break
    
    ans = str_a_to_z[ansList_rev[i]-1] + ans

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = []
while n > 0:
    n -= 1
    a.append(n%26)
    n = n // 26
ans = ""
print(a)
for i in range(len(a)):
    ans += chr(ord("a")+a[(-1)*(i+1)])
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
alf = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
for i in range(1,11):
    if n <= pow(26,i):
        n -= 1
        for j in range(i):
            #ans += alf[n%26]
            ans += chr(ord('a') + n % 26)
            n //= 26
        break
    else:
        n -= pow(26, i)
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
alf = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
for i in range(1,11):
    if n <= pow(26,i):
        n -= 1
        for j in range(i):
            ans += alf[n%26]
            n //= 26
        break
    else:
        n -= pow(26, i)
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)

convert = {
    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',
}
def main():
    r = []
    n = int(input())
    while True:
        r.append(n % 26)
        n = n // 26
        if n == 0: break
    for i in r[::-1]:
        print(convert[i], end='')
    print()
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
alp = ["a","b","c","d","e","f","g","h","i","j","k","l","n","m","o","p","q","r","s","t","u","v","w","x","y","z"]
n = int(input())
lis = []
i = 0
while 26**i < n:
  i += 1
i -= 1
while i >= 0:
  temp = n//(26**i)
  lis.append(temp)
  n -= temp*(26**i)
  i -= 1
ans = ""
for j in lis:
  ans += alp[j-1]
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
alf = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
for i in range(1, 11):
    if n>pow(26,i):
        n -= pow(26,i)
    else:
        n -= 1
        for ii in range(i):
            ans += alf[n%26]
            n //= 26
        break
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
def main():
    alphabet = list(chr(i)for i in range(97, 123))
    n = int(input())
    ans = ''
    while n > 0:
        n -= 1
        ans += chr(ord('a') + (n % 26))
        n //= 26

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import bisect

N=int(input())
alphabet=[chr(i) for i in range(97,97+26)]
num=[26**i for i in range(1,12)]
ans=""
index=bisect.bisect_left(num,N)
if index==0:
    ans+=alphabet[N-1]
else:
    while True:
        tmp=N//num[index-1]
        ans+=alphabet[tmp-1]
        N-=tmp*num[index-1]
        index=bisect.bisect_left(num,N)
        if index==0:
            break
    ans+=alphabet[N-1]
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = ""

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

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


print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
result = ''


def rec(n, result):
    q, mod = divmod(n, 26)
    if n == 0:
        return result
    result += chr(mod + 96)
    n = q
    return rec(n, result)


result = rec(n, result)
print(result[::-1])

Submission status: Wrong Answer

Solution code:
n=int(input())

ans=[]
p=26
while(n!=0):
    m=n%p
    n=n//p
    ans.append(m)

res=list(map(lambda x: chr(ord("a")-1+x),ans))

print("".join(list(reversed(res))))

Submission status: Wrong Answer

Solution code:
n=int(input())

ans=[]
p=26
while(n!=0):
    m=n%p
    n=n//p
    ans.append(m)

res=list(map(lambda x: chr(ord("a")-1+x),ans))

print("".join(res))

Submission status: Wrong Answer

Solution code:
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)

a=list(base_10_to_n(N,26))
b=["1","2","3","4","5","6","7","8","9","10","11","12","13","14","15","16","17","18","19","20","21","22","23","24","25","26"]
c=["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"]
d=[]
for i in range(len(a)):
  for j in range(0,26):
    if a[i]==b[j]:
      d.append(c[j])
print("".join(d))

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',
]
res = []
while N > 0:
    a = N % 26
    N = N // 26
    a -= 1
    res.append(A[a])
res.reverse()
print(''.join(res))

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',
]
res = ''
while N > 0:
    a = N % 26
    N = N // 26
    a -= 1
    res += A[a]
print(res)

Submission status: Wrong Answer

Solution code:
n = int(input())-1
alf = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
for i in range(11, 0, -1):
    if n>=pow(26, i):
        ans += alf[n//pow(26, i)-1]
        n -= (n//pow(26,i))*pow(26,i)
ans += alf[n%26]
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
kigou=list("abcdefghijklmnopqrstuvwxyz")
a=int(input())
keta=0
count=0
for i in range(1,100):
    x=26**i+count
    if 26**i+count>=a:
      keta=i
      break
    else:
        count+=26**i

ans=""

for i in range(keta):
    # a -= 1
    ans=kigou[(a-1)%26]+ans
    a=(a)//26

print(ans)

Submission status: Wrong Answer

Solution code:
kigou=list(" abcdefghijklmnopqrstuvwxyz")
a=int(input())
keta=0
count=0
for i in range(1,100):
    x=26**i+count
    if 26**i+count>=a:
      keta=i
      break
    else:
        count+=26**i

ans=""

for i in range(keta):
    # a -= 1
    ans=kigou[a%26]+ans
    a=(a-1)//26

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
kigou=list("0abcdefghijklmnopqrstuvwxyz")
a=int(input())
keta=0
count=0
counter=[0]
for i in range(1,100):
    x=26**i+count
    if 26**i+count>=a:
      keta=i
      counter.append(x)
      break
    else:
        count+=26**i
        counter.append(count)
ans=""

for i in range(keta):
    # a -= 1
    ans=kigou[a%26]+ans
    a=a//26

print(ans)

Submission status: Wrong Answer

Solution code:
# Implementation by unihernandez22 || Idea by Vicfred
# https://atcoder.jp/contests/abc171/tasks/abc171_c
# math, greedy

n = int(input())

digits = []

while n > 0:
    digits.append(chr(n%26+96))
    n //= 26

print(''.join(reversed(digits)))

Submission status: Wrong Answer

Solution code:
# Implementation by unihernandez22 || Idea by Vicfred
# https://atcoder.jp/contests/abc171/tasks/abc171_c
# math, greedy

n = int(input())

digits = []

while n > 0:
    digits.append(chr(n%26+96))
    n //= 26

print(''.join(digits))

Submission status: Wrong Answer

Solution code:
n=int(input())
p=1
while n > 0:
  n-=26**p
  p+=1
else:
  p-=1
  if n==0:
    ans="z"*p
    print(ans)
  else:
    n+=26**p
    num=[]
    for i in range(1,p+1):
      a=n//(26**(p-i))
      num.append(a)
      n-=a*(26**(p-i))
    al=[]
    for i in range(p-1):
      m=chr(97+num[i])
      al.append(m)
    al.append(chr(96+num[p-1]))
    ans=''.join(al)
    print(ans)

Submission status: Wrong Answer

Solution code:
from decimal import Decimal

n = int(input())
alpha_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']
ans = ''


while(n > 0):
  Decimal(n) - Decimal(1)
  ans += alpha_list[int(Decimal(n) % Decimal(26))]
  n = int(Decimal(n) // Decimal(26))
  
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
s = 'abcdefghijklmnopqrstuvwxyz'
n = int(input())
ans = ''
while n > 25:
    ans += s[(n % 26)-1]
    n = n // 26
ans += s[n%26-1]
print(ans[-1::-1])

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()
	
	print(num2alpha(N).upper())


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)

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

Submission status: Wrong Answer

Solution code:
from decimal import Decimal

n = int(input())
alpha_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']
ans = ''


while(n > 0):
  ans += alpha_list[int(Decimal(n) % Decimal(26) - Decimal(1))]
  n = int(Decimal(n) // Decimal(26))
  
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n=int(input())
p=1
while n > 0:
  n-=26**p
  p+=1
else:
  p-=1
  n+=26**p
  num=[]
  for i in range(1,p+1):
    a=n//(26**(p-i))
    num.append(a)
    n-=a*(26**(p-i))
  al=[]
  for i in range(p-1):
    m=chr(97+num[i])
    al.append(m)
  al.append(chr(96+num[p-1]))
  ans=''.join(al)
  print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
N_ = N
cnt = 1
for i in range(1, N):
    N_ -= 26 ** i
    if N_ <= 0:
        cnt = i
        break

Ans = []

for i in range(cnt)[::-1]:
    a = min(N // (26 ** i), 26)
    N -= a * (26**i)
    Ans.append(chr(a + 96))
print(''.join(Ans))

Submission status: Wrong Answer

Solution code:
N = int(input())
count = 0
ans = list()
r = 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**count:
    count+=1

count = count - 1
#print(count)

while count > 0:
    N = N - 26**count
    count = count - 1

#print(N)

N = N - 1
A = 1
while A != 0:
    A = N // 26
    B = N % 26
    ans.append(B)
    N = A

#print(ans)

while len(ans) < count + 2:
    ans.append(0)

#print(N)
#print(ans)
ans.reverse()
#print(ans)

for i in range(0, len(ans)):
    ans[i] = alp[ans[i]]

#print(ans)

print(''.join(ans))

Submission status: Wrong Answer

Solution code:
n=int(input())

alf = ["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=str()

if n<=26:
    print(alf[n-1])
    exit()

while n >= 26:
    if n%26==0:
        ans += alf[25] 
        n = n//26
    else:
        n,mod = divmod(n,26)
        ans += alf[mod-1]

ans += alf[n-1]

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
N_ = N
cnt = 0
C = []
for i in range(1, N):
    N_ -= 26 ** i
    if N_ <= 0:
        cnt = i
        break

Ans = []

for i in range(cnt)[::-1]:
    a = N // (26 ** i)
    N -= a * (26**i)
    Ans.append(chr(a + 96))
print(''.join(Ans))

Submission status: Wrong Answer

Solution code:
N = int(input())
count = 0
ans = list()
r = 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**count:
    count+=1

count = count - 1
#print(count)

while count != 0:
    N = N - 26**count
    count = count - 1

#print(N)

N = N - 1
A = 1
while A != 0:
    A = N // 26
    B = N % 26
    ans.append(B)
    N = A


while len(ans) == count + 1:
    ans.append(0)

#print(N)
#print(ans)
ans.reverse()
#print(ans)

for i in range(0, len(ans)):
    ans[i] = alp[ans[i]]

print(ans)

print(''.join(ans))

Submission status: Wrong Answer

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


while(n > 0):
  ans += alpha_list[(n % 26) - 1]
  n //= 26
  
print(ans[::-1])

Submission status: Wrong Answer

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


while(n > 0):
  ans += alpha_list[(n % 26) - 1]
  n = int(n // 26)
  
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
from decimal import Decimal
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

N = I()
q,r = 0,0
A =[]
for i in range(15):
    if N < 26:
        r = N
        break
    q = N//26
    r = N%26
    if r == 0:
        q -= 1
        r = 26
    #print(f"{N} = {q} * 26 + {r}")
    A.append(string.ascii_lowercase[r-1])
    #print(A)
    N = q
A.append(string.ascii_lowercase[r-1])
print("".join(A[::-1]))

Submission status: Wrong Answer

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

lst = [0]
n = 0
for i in range(1,13):
    n = n + 26 ** i
    lst.append(n)

#桁数の確定
keta = 0
for i in range(len(lst)):
    if N <= lst[i]:
        keta = i
        break

num = []
ketax = keta
for _ in range(keta):
    syo = N // (26 ** (ketax - 1))
    amari = N % (26 ** (ketax - 1))
    if syo == 27:
        syo = 26
        amari = 26 ** (ketax - 1)
    num.append(syo)
    N = amari
    ketax -= 1

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

Submission status: Wrong Answer

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


while(n > 0):
  ans += alpha_list[(n % 26) - 1]
  n = int(n / 26)
  
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
count = 0
ans = list()
r = 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**count:
    count+=1

count = count - 1
#print(count)

while count != 0:
    N = N - 26**count
    count = count - 1

#print(N)

N = N - 1
A = 1
while A != 0:
    A = N // 26
    B = N % 26
    ans.append(B)
    N = A

#print(N)
#print(ans)
ans.reverse()
#print(ans)

for i in range(0, len(ans)):
    ans[i] = alp[ans[i]]

#print(ans)

print(''.join(ans))

Submission status: Wrong Answer

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

lst = [0]
n = 0
for i in range(1,13):
    n = n + 26 ** i
    lst.append(n)

#桁数の確定
keta = 0
for i in range(len(lst)):
    if N <= lst[i]:
        keta = i
        break

num = []
ketax = keta
for _ in range(keta):
    syo = N // (26 ** (ketax - 1))
    amari = N % (26 ** (ketax - 1))
    if syo == 27:
        syo = 26
        amari = 26
    num.append(syo)
    N = amari
    ketax -= 1

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

Submission status: Wrong Answer

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

lst = [0]
n = 0
for i in range(1,12):
    n = n + 26 ** i
    lst.append(n)

#桁数の確定
keta = 0
for i in range(len(lst)):
    if N <= lst[i]:
        keta = i
        break

num = []
ketax = keta 
for _ in range(keta):
    syo = N // (26 ** (ketax - 1))
    amari = N % (26 ** (ketax - 1))
    if syo == 27:
        syo = 26
        amari = 26
    num.append(syo)
    N = amari
    ketax -= 1

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = ord('a') - 1
ans = ''

while n != 0:
    temp = n % 26
    n = n // 26
    ans = (chr(s+temp)) + ans

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(2147483647)
N=int(input())
A=[26,702,18278,475254,12356630,321272406,8353082582,217180147158,5646683826134,146813779479510,3817158266467286,95428956661682176]
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"]
a=0
if N==702:
  print("zz")
elif N==18278:
  print("zzz")
elif N==475254:
  print("zzzz")
elif N==12356630:
  print("zzzzz")
elif N==321272406:
  print("zzzzzz")
elif N==8353082582:
  print("zzzzzzz")
elif N==217180147158:
  print("zzzzzzzz")
elif N==5646683826134:
  print("zzzzzzzzz")
elif N==146813779479510:
  print("zzzzzzzzzz")
elif N==3817158266467286:
  print("zzzzzzzzzzz")
elif N==95428956661682176:
  print("zzzzzzzzzzzz")
else:
  for x in range(12):
    if N<=A[x]:
      a=x
      break
  for y in range(a):
    b=N//(26**(a-y))
    print(B[b-1],end="")
    N=N-b*(26**(a-y))
  print(B[N-1])

Submission status: Wrong Answer

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

N = int(input())

ans = ""

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

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
p = 0
result = []
while True:
    p = n % 26
    n //= 26
    result.append(p)
    if n == 0:
        break

string = 'abcdefghijklmnopqrstuvwxyz'
ans = []
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:
N = int(input())
alf = [chr(i) for i in range(97, 97+26)]
List = []
for i in range(100):
  if N > 26:
    N -= 1
    a = N % 26
    N = N // 26
    List.append(alf[a-1])
  else:
    break
    

print("".join(List))

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = []

while n > 0:
    if n%26 != 0:
        a = chr(n%26+96)
        ans.append(a)
        n = n//26
    else:
        ans.append('z')
        n = n//26-1

for i in ans[::-1]:
    print(i)

Submission status: Wrong Answer

Solution code:
N = int(input())
alf = [chr(i) for i in range(97, 97+26)]
List = []
for i in range(100):
  if N > 26:
    N -= 1
    a = N % 26
    N = N // 26
    List.append(alf[a-1])
  else:
    List.append(alf[N-1])
    break
    

print("".join(List))

Submission status: Wrong Answer

Solution code:
N = int(input())
alf = [chr(i) for i in range(97, 97+26)]
List = []
for i in range(100):
  if N > 26:
    a = N % 26
    N = N // 26
    N -= 1
    List.append(alf[a-1])
  else:
    List.append(alf[N-1])
    break
    

print("".join(List))

Submission status: Wrong Answer

Solution code:
N = int(input())
alf = [chr(i) for i in range(97, 97+26)]
List = []
for i in range(100):
  if N > 26:
    a = N % 26
    N = N // 26
    List.append(alf[a-1])
  else:
    List.append(alf[N-1])
    break
    

print("".join(List))

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = ''
while N:
    mod = N % 26
    if mod == 0:
        mod += 26
    ans = chr(ord('a') + mod - 1) + ans
    N = N // 26
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
s = ""
al = "abcdefghijklmnopqrstuvwxyzz"
if 1 <= n <=26:
        print(al[n-1])
        exit()
while n:
    s = al[n%26-1] + s
    n //=26

print(s)

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)
num2alpha(n)

Submission status: Wrong Answer

Solution code:
n = int(input())
s = ""
al = "abcdefghijklmnopqrstuvwxyz"
while n:
    s = al[n%26-1] + s
    n //=26
print(s)