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())
list1=[]
nokori=N
while nokori>26:
  list1.append(nokori%26)
  nokori=nokori//26
list1.append(nokori)
alpha="abcdefghijklmnopqrstuvwxyz"
list2=[]
for i in range(len(list1)):
  list2.append(alpha[(list1[i]-1)])
list2.reverse()
ans="".join(list2)
print(ans)

Submission status: Wrong Answer

Solution code:
# C - One Quadrillion and One Dalmatians
n = int(input())
dic = dict()

import string
i = 1

for s in string.ascii_lowercase:
	dic[i % 26] = s
	i += 1

name = ''

while True:
	mod = n % 26
	name += dic[mod]
	
	if n > 25:
		n //= 26
	else:
		break

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

Submission status: Wrong Answer

Solution code:
N = int(input())

name = ""
for i in range(100,0,-1):
    if N >= 26**i:
        while i >= 0:
            name = name + chr(ord("a") + N // 26**i -1)
            N = N % (26**i)
            i -= 1
print(name)

Submission status: Wrong Answer

Solution code:
x = int(input())

def converter(x):
    if x <= 26:
        y = chr(x + 96)
    elif x % 26 == 0:
        y = converter(x // 26) + chr(122)
    else:
        y = converter(x // 26) + chr(x % 26 + 96)
    return y

name = converter(x)

print(name)

Submission status: Wrong Answer

Solution code:
x = int(input())

def converter(x):
    if x <= 26:
        y = chr(x + 96)
    elif x % 26 == 0:
        y = converter(x // 26) + converter(26)
    else:
        y = converter(x // 26) + converter(x % 26)
    return y

name = converter(x)

print(name)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

name = ""
while N:
    num0  =(N % 26)
    if num0:
        num = num0
    else:
        num = 26
    name = chr(num+96)+ name
    N = N//26

print(name)

Submission status: Wrong Answer

Solution code:
N = int(input())

name = ""
while N:
    name = chr(N % 26+96) + name
    N = N // 26

print(name)

Submission status: Wrong Answer

Solution code:
import sys
import math
import collections

def set_debug(debug_mode=False):
    if debug_mode:
        fin = open('input.txt', 'r')
        sys.stdin = fin


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


def get(s):
    return str(s % 9) + '9' * (s // 9)

if __name__ == '__main__':
    # set_debug(True)

    # t = int(input())
    t = 1

    for ti in range(1, t + 1):
        n = int(input())

        res = ''

        while n >= 1:
            mod = n % 26
            n = (n - mod) // 26
            res += chr(ord('a') + mod - 1)

        print(res[::-1])

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input()) - 1
    digits = []

    while True:
        a, b = N // 26, N % 26
        digits.append(b)
        if a == 0:
            break
        N = a

    digits.reverse()
    chars = map(to_alphabet, digits)
    print(''.join(chars))


def to_alphabet(x: int):
    return chr(65 + x).lower()


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    digits = []

    while True:
        a, b = N // 26, N % 26
        digits.append(b)
        if a == 0:
            break
        N = a

    digits.reverse()
    chars = map(to_alphabet, digits)
    print(''.join(chars))


def to_alphabet(x: int):
    return chr(64 + x).lower()


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

for i in range(0,14):
  t=13-i
  if  26**t>=n:
    lis.append(-1)
  else:
    key=n//26**t
    n-=key*26**t
    lis.append(key)

ans=""
flag=0
for i in range(0,14):
  if lis[i]!=-1:
    flag=1
  if flag==1:
    if lis[i]==0:
      ans+="z"
    else:
      ans+=chr(96+lis[i])
print(ans)

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]) # reversed

Submission status: Wrong Answer

Solution code:
n = int(input())
s=''
while n!=0:
  tmp=n%26
  s=chr(96+tmp)+s
  n//=26
print(s)

Submission status: Wrong Answer

Solution code:
ma = lambda :map(int,input().split())
ni = lambda:int(input())
import collections
import math
import itertools
gcd = math.gcd
n = ni()
alp = "abcdefghijklmnopqrstuvwxyz"
ans = ""
for i in range(10,0,-1):
    p,q = divmod(n,26**i)
    if q !=n:
        ans= ans + alp[p-1]
    n = q
if n != 0:
    ans+=alp[n-1]
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
def input():
    return sys.stdin.readline().rstrip('\n')
    

def calc(N):
    abc = 'zabcdefghijklmnopqrstuvwxy'
    s = ''
    while N > 0:
        i = N % 26
        N = N // 26
        s = abc[i] + s
    return s

N = int(input())
print(calc(N))

Submission status: Wrong Answer

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


def solve(N: int):
    n = N
    res = ''

    pre = 0
    digits = []
    for i in range(0, 14):
        pre += pow(26, i)
        digits.append(pre)

    i = 12
    while i >= 0:
        base = pow(26, i)
        if digits[i] <= n:
            d = int(n / base)
            d = min(26, d)
            if n == d*base and i > 0:
                d = 25
            # print(i, n, d, base, chr(ord('a')+(d-1)))
            n -= base * d
            # if i == 0:
            #     res += chr(ord('a')+(d-1))
            # else:
            #     res += chr(ord('a')+(d))
            res += chr(ord('a')+(d-1))
        i -= 1
    print(res)
    return res


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
q = int(input())
s = ""
if q <= 26:
    print(chr(q + 96))
else:
    while q != 0:
        s += chr(q % 26 + 96)
        q = q // 26
    print(s[::-1])

Submission status: Wrong Answer

Solution code:
n=int(input())
lis=[]
for i in range(0,12):
  t=11-i
  if 26**t>n:
    lis.append(0)
  else:
    kw=n//(26**t)
    n=n%(26**t*kw)
    lis.append(kw)

ans=""
flag=0
for i in range(0,12):
  if flag==0:
    if lis[i]!=0:
      ans+=chr(96+lis[i])
      flag=1
  else:
    ans+=chr(96+lis[i])
print(ans)

Submission status: Wrong Answer

Solution code:
import string
n = int(input())
alpha_list = string.ascii_lowercase


def a(num: int):
    n_ = ""

    if num < 27:
        n_ += alpha_list[num - 1]
    else:
        n_ += a(int(num / 26))
        n_ += alpha_list[num % 26 - 1]

    return n_


print(a(n))

Submission status: Wrong Answer

Solution code:
def A(x):
  if ord(x) - ord('a') >= 0:
    print('a')
  else:
    print('A')


def B(n, k, p_list):
  p_list = sorted(p_list)
  print(sum(p_list[:k]))


def C(N):
  for i in range(99):
    if N < 26**i:
      ans = []
      for j in range(i):
        ans += chr(ord('a') + N % 26)
        N //= 26
      return ''.join(ans)
    else:
      N -= 26**i


def main():
  # letter = input()
  # A(letter)
  # for x in ['A', 'Z', 'a', 'z']:
  #   A(x)

  # n, k = map(int, input().split())
  # p_list = map(int, input().split())
  # B(n, k, p_list)
  print(C(int(input())))
  # C(702)
  # C(703)
  # C(18279)
  # C(475254)


if __name__ == '__main__':
  main()

Submission status: Wrong Answer

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


def solve(N: int):
    n = N
    res = ''

    pre = 0
    digits = []
    for i in range(0, 14):
        pre += pow(26, i)
        digits.append(pre)

    i = 12
    while i >= 0:
        base = pow(26, i)
        if digits[i] <= n:
            d = int(n / base)
            if d == 26 and i > 0:
                d = 25
            d = min(26, d)
            # print(i, n, d, base, chr(ord('a')+(d-1)))
            n -= base * d
            res += chr(ord('a')+(d-1))
        i -= 1
    print(res)
    return res


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

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:
from sys import stdin
import math

N = int(stdin.readline())
K = (math.log(N,27))
if K == math.ceil(K):
    K=int(K)+1
else:
    K=int(math.ceil(K))


Q=0

if K==1:
    print(chr(96+N))
    Q=1

if Q==0:
   for t in range(K,0,-1):
       A = N/26**(t-1)

       if A == int(math.floor(N/26**(t-1))) and N>26:
           A=int(A-1)
       else:
           A=int(A)


       if A==0:
           print('a',end='')
       else:
           print(chr(96 + A), end='')

       N -= (26**(t-1))*A

Submission status: Wrong Answer

Solution code:
N=int(input())
START = 96
ALP = 26
ans = []
while True:
  if N < ALP:
    ans.append(chr(START + N)) 
    break
  p = N % ALP
  if p==0:
    p=1
  ans.append(chr(START + p))
  N = N // ALP
print(''.join(ans[::-1]))

Submission status: Wrong Answer

Solution code:
N=int(input())
START = 96
ALP = 26
ans = []
while True:
  if N <= ALP:
    ans.append(chr(START + N)) 
    break
  p = N % ALP
  ans.append(chr(START + p))
  N = N // ALP
print(''.join(ans[::-1]))

Submission status: Wrong Answer

Solution code:
from sys import stdin
import math

N = int(stdin.readline())
K = (math.log(N,27))
if K == math.ceil(K):
    K=int(K)+1
else:
    K=int(math.ceil(K))


Q=0

if K==1:
    print(chr(96+N))
    Q=1

if Q==0:
   for t in range(K,0,-1):
       A = int(math.floor(N/26**(t-1)))

       print(chr(96 + A), end='')

       N -= (26**(t-1))*A

Submission status: Wrong Answer

Solution code:
from sys import stdin
import math

N = int(stdin.readline())
K = (math.log(N,27))
if K == math.ceil(K):
    K=int(K)+1
else:
    K=int(math.ceil(K))

print(K)
Q=0

if K==1:
    print(chr(96+N))
    Q=1

if Q==0:
   for t in range(K,0,-1):
       A = int(math.floor(N/26**(t-1)))

       print(chr(96 + A), end='')

       N -= (26**(t-1))*A

Submission status: Wrong Answer

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


def solve(N: int):
    i = 12
    n = N
    res = ''
    while i >= 0:
        base = pow(26, i)
        if base <= n:
            d = int(n / base)
            n -= base * d
            res += chr(ord('a')+(d-1))
        i -= 1
    print(res)
    return res


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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


def solve(N: int):
    i = 10
    n = N
    res = ''
    while i >= 0:
        base = pow(26, i)
        if base <= n:
            d = int(n / base)
            n -= base * d
            res += chr(ord('a')+(d-1))
        i -= 1
    print(res)
    return res


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import string

def main():  
    alphabet = string.ascii_lowercase
    ans = []

    N = int(input())

    if N < 27:
        ans.append(alphabet[N-1])
    else:
        q, mod = divmod(N, 26)

        if mod == 0:
            if q == 1:
                ans.append('z')
                return ans
            elif 1 < q and q <= 27:
                ans.append('z')
                ans.append(alphabet[q-2])
                return ans
            elif 27 < q:
                ans.append('z')
                n = q
        else:
            if 1 <= q and q < 27: 
                ans.append(alphabet[mod-1])
                ans.append(alphabet[q-1])
                return ans
            if 27 <= q:
                ans.append(alphabet[mod-1])
                n = q

        while n:
            q, mod = divmod(n, 26)

            if mod == 0:
                if q == 1:
                    ans.append('z')
                    return ans
                elif 1 < q and q <= 27:
                    ans.append('z')
                    ans.append(alphabet[q-2])
                    return ans
                elif 27 < q:
                    ans.append('z')
                    n = q
            else:
                if 1 <= q and q < 27: 
                    ans.append(alphabet[mod-1])
                    ans.append(alphabet[q-1])
                    return ans
                if 27 <= q:
                    ans.append(alphabet[mod-1])
                    n = q
    
    return ans

def main_2(): 
    ans = main()

    str_list = reversed(ans)
    mojiretu = ''
    
    for x in str_list:
        mojiretu += x
        
    print(mojiretu)

main_2()

Submission status: Wrong Answer

Solution code:
import math
 
n = int(input())
 
ans_list = []
 
def waru(n):
    n -= 1
    amari = n%26
    kotae = n // 26
    ans_list.append(amari)
    if kotae < 1:
        return 0
    else:
        waru(kotae)
 
waru(n)
 
ans_list.reverse()

Submission status: Wrong Answer

Solution code:
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"]
NUM = 26
id = ""
N = int(input())

while True:
  q = N // NUM
  mod = N % NUM
  if mod == 0:
    id = name[NUM-1]+id
  else:
    id = name[mod-1]+id
  if q == 0:
    break
  if q < 26:
    if mod == 0:
      if q != 1:
        id = name[q-2]+id
    else:
      id = name[q-1]+id
    break
  else:
    N = q
    
print(id)

Submission status: Wrong Answer

Solution code:
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"]
NUM = 26
id = ""
N = int(input())

while True:
  q = N // NUM
  mod = N % NUM
  if mod == 0:
    id = name[NUM-1]+id
  else:
    id = name[mod-1]+id
  if q < 26:
    if mod == 0:
      id = name[q-2]+id
    else:
      id = name[q-1]+id
    break
  else:
    N = q
    
print(id)

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

S = []

if N <= 26:
    amari = N % 26
    S.append(amari)
else:
    while N != 0:
        amari = N % 26
        if amari == 0:
            S.append(26)
        else:
            S.append(amari)
        N = N//26

S.reverse()
Moji = ''
for i in range(len(S)):
    Moji = Moji + A[S[i]-1] 
print(Moji)

Submission status: Wrong Answer

Solution code:
n = int(input())
f = True
num = 'abcdefghijklmnopqrstuvwxyz'
name = []

i = 0
while f:
    name.append(n%26)
    n = n // 26
    if(n <= 1):
        f = False

for i in range(len(name)):
    print(num[name[len(name)-i-1]%26 -1],end='')
print()

Submission status: Wrong Answer

Solution code:
n = int(input())
f = True
num = 'abcdefghijklmnopqrstuvwxyz'
name = []

i = 0
while f:
    name.append(n%26)
    n = int(n/26)
    if(n <= 0):
        f = False

for i in range(len(name)):
    print(num[name[len(name)-i-1]%26 -1],end='')
print()

Submission status: Wrong Answer

Solution code:
import string
def frac(digit,n):
  ans[digit]=n%26
  if n <= 26:
    return
  else:
    return frac(digit+1,n//26)

n = int(input())
l=0
r=0
for i in range(1,10000000000000):
  l = r+1
  r = l+26**i-1
  if l <= n <= r:
    n = n-l+1
    break

n=n-1
ans=[0]*i

frac(0,n)
res=""
for i in ans[::-1]:
  res+=string.ascii_lowercase[i]
print(res)

Submission status: Wrong Answer

Solution code:
import string
N = int(input())
ans = ''
while N != 0:
    tmp = N//26
    ans += string.ascii_lowercase[N%26-1]
    N = tmp
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
import string
def frac(digit,n):
  ans[digit]=n%26
  if n <= 26:
    return
  else:
    return frac(digit+1,n//26)

n = int(input())
l=0
r=0
for i in range(1,100):
  l = r+1
  r = l+26**i-1
  if l <= n <= r:
    n = n-l+1
    break

n=n-1
ans=[0]*i

frac(0,n)
res=""
for i in ans[::-1]:
  res+=string.ascii_lowercase[i]
print(res)

Submission status: Wrong Answer

Solution code:
import math

N = int(input())

log26_N = math.log(N)/math.log(26)
li = []
char_li = [chr(i) for i in range(97,97+26)]
a = ''
 
for i in range(math.ceil(log26_N)):
  li.append(N % 26)
  N = N // 26

for index in reversed(li):
  a += char_li[index - 1 if index != 0 else index]
  
print(a)

Submission status: Wrong Answer

Solution code:
import math

N = int(input())

log26_N = math.log(N)/math.log(26)
li = []
char_li = [chr(i) for i in range(97,97+26)]
a = ''
 
for i in range(math.ceil(log26_N)):
  li.append(N % 26)
  N = N // 26

for index in reversed(li):
  a += char_li[index - 1 if index != 0 else 0]
  
print(a)

Submission status: Wrong Answer

Solution code:
import math

N = int(input())

log26_N = math.log(N)/math.log(26)
li = []
char_li = [chr(i) for i in range(97,97+26)]
a = ''
 
for i in range(math.ceil(log26_N)):
  li.append(N % 26)
  N = N // 26

for index in reversed(li):
  a += char_li[index - 1]
  
print(a)

Submission status: Wrong Answer

Solution code:
import math

N = int(input())

log26_N = math.log(N)/math.log(26)
li = []
char_li = [chr(i) for i in range(97,97+26)]
a = ''
 
for i in range(math.floor(log26_N)):
  li.append(N % 26)
  N = N // 26

li.append(N)

for index in reversed(li):
  a += char_li[index - 1]
  
print(a)

Submission status: Wrong Answer

Solution code:
def int2char(i):
    return chr(ord("a") + i - 1)

N = int(input())
n = N

ans = ""
while (1):
    n_next = int(n/26)
    ans = int2char(n - n_next*26) + ans
    n = n_next
    if n_next == 0:
        break

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
li = []
char_li = [chr(i) for i in range(97,97+26)]
a = ''
 
while N > 1:
  li.append(N % 26)
  N = N // 26

for index in reversed(li):
  a += char_li[index - 1]
  
print(a)

Submission status: Wrong Answer

Solution code:
N = int(input())
li = []
char_li = [chr(i) for i in range(97,97+26)]
a = ''
 
while N > 0:
  li.append(N % 26)
  N = N // 26

for index in reversed(li):
  a += char_li[index - 1]
  
print(a)

Submission status: Wrong Answer

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

while N > 0:
  li.append(N % 26)
  N = N // 26

print(li)

for index in reversed(li):
  a += char_li[index - 1]
  
print(a)

Submission status: Wrong Answer

Solution code:
N = int(input())
abc = 'zabcdefghijklmnopqrstuvwxyz'
name = ''

while N>0:
    name = abc[N%26] + name
    N //= 26
print(name)

Submission status: Wrong Answer

Solution code:
from string import ascii_lowercase
N = int(input())
s = list()

while N > 0: 
	m = N%26 - 1
	s.append(ascii_lowercase[m])
	N = int(N/26)
	
s.reverse()
s = ''.join(s)
print(s)

Submission status: Wrong Answer

Solution code:
from string import ascii_lowercase
N = int(input())
s = list()

while N > 0: 
	m = N%26 - 1
	s.append(ascii_lowercase[m])
	N = int(N/26)
	if N > 0: N -= 1
	
s.reverse()
s = ''.join(s)
print(s)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# Problem C - One Quadrillion and One Dalmatians

# input
N = int(input())

# initialization
alphabet = "abcdefghijklmnopqrstuvwxyz"
ans = ""

# check
if N>=1 and N<=26:
    ans = alphabet[N-1]
else:
    while N>0:
        ans += alphabet[(N%26)-1]
        N = N // 26

# output
ans = ans[::-1]
print(ans)

Submission status: Wrong Answer

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

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

def main():
    mod=10**9+7
    N=I()
    ans=[]
    for i in range(100):
        ans.append(chr(N%26+96))
        N=N//26
        if N==0:
            break
        
    print(''.join(map(str, ans[::-1])))

main()

Submission status: Wrong Answer

Solution code:
n = int(input())
r = 26
d = 1
while n-r > 0:
    n -= r
    r *= 26
    d += 1
a = 'abcdefghijklmnopqrstuvwxyz'
name = ''
n -= 1
while n >= 26:
    name = a[n % 26]+name
    n //= 26
    d -= 1
name = a[n]+name
d -= 1
for i in range(d):
    name += 'a'
print(name)

Submission status: Wrong Answer

Solution code:
n = int(input())
r = 26
while n-r > 0:
    n -= r
    r *= 26
a = 'abcdefghijklmnopqrstuvwxyz'
name = ''
n -= 1
while n >= 26:
    name = a[n % 26]+name
    n //= 26
name = a[n]+name
print(name)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = 'abcdefghijjklmnopqrstuvwxyz'
name = ''
while n >= 26:
    name = a[n % 26-1]+name
    n //= 26
name = a[n-1]+name
print(name)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = 'abcdefghijjklmnopqrstuvwxyz'
name = ''
while n >= 26:
    name += a[n % 26-1]
    n //= 26
name += a[n-1]
print(name)

Submission status: Wrong Answer

Solution code:
n=int(input())
a='abcdefghijjklmnopqrstuvwxyz'
name=''
while n>=26:
  name+=a[n%26]
  n//=26
name+=a[n]
print(name)

Submission status: Wrong Answer

Solution code:
N=int(input())
P=[chr(ord('a') + i) for i in range(26)]
T=[]
while N>=1:
  T.insert(0, N%26)
  N=N//26
S=""
for i in range (0,len(T)):
  S=S+P[T[i]-1]
print(S)

Submission status: Wrong Answer

Solution code:
N=int(input())
P=[chr(ord('a') + i) for i in range(26)]
T=[]
while N>0:
  T.insert(0, N%26)
  N=N//26
S=""
for i in range (0,len(T)):
  S=S+P[T[i]-1]
print(S)

Submission status: Wrong Answer

Solution code:
N=int(input())
P=[chr(ord('a') + i) for i in range(26)]
T=[]
Q=0
while N>0:
  T.insert(0, N%26)
  N=N//26
S=""
for i in range (0,len(T)):
  S=S+P[T[i]-1]
print(S)

Submission status: Wrong Answer

Solution code:
n,s = int(input()), ''
while n:
    n, r = divmod(n, 26)
    s = chr(96 + r) + s
print(s)

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']
m = []

a = 26**10

while a>0:
  b = int(n/a)
  if b > 0:
    b -= 1
    m.append(l[b])
  n = int(n%a)
  a /= 26

name=''.join(m)
print(name)

Submission status: Wrong Answer

Solution code:
alphabet_lowercase = 'abcdefghijklmnopqrstuvwxyz'

N = int(input())

output = []
q,r = divmod(N, 26)
output.append(r)
while q > 0:
    q, r = divmod(q, 26)
    output.append(r)

for i in range(len(output)-1):
    if output[i] == 0:
        output[i] = 26
        output[i+1] -= 1
    
output_str = ''
for i in range(len(output)-1, -1, -1):
    if output[i] == 0:
        continue
    else :
        output_str += alphabet_lowercase[output[i]-1]

print(output_str)

Submission status: Wrong Answer

Solution code:
N = int(input())

def tenToN(N, n):
    if (int(N/n)):
        return tenToN(int(N/n), n)+' '+str(N%n)
    return str(N%n)

alphabet_lowercase = 'abcdefghijklmnopqrstuvwxyz'

output = tenToN(N, 26).split()
output_string = ''

for o in output:
    output_string += alphabet_lowercase[int(o)-1]
    
print(output_string)

Submission status: Wrong Answer

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

readline = sys.stdin.buffer.readline
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print('\n'.join(map(str,x)))
def printline(x):print(' '.join(map(str,x)))

n = readint()

a = ord('a')
ans = []
i = 1
while n:
    if n>26**i:
        n-=26**i
        i+=1
    else:
        if n%26==0:
            ans.append('z')
            n = n//26-1
        else:
            ans.append(chr(n%26+a))
            n//=26

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

Submission status: Wrong Answer

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

readline = sys.stdin.buffer.readline
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print('\n'.join(map(str,x)))
def printline(x):print(' '.join(map(str,x)))

n = readint()

a = ord('a')-1
ans = []
while n:
    ans.append(chr(n%26+a))
    n//=26

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

Submission status: Wrong Answer

Solution code:
def INT():
    return int(input())

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

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

from string import ascii_lowercase

al = ascii_lowercase

N = INT()
ans = []

while True:
    
    if N < 26:
        ans.append(al[N - 1])
        break
        
    ans.append(al[N % 26 - 1])
    N //= 26

ans.reverse()

print("".join(map(str, ans)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

l = []

for _ in range(13):
  rem = n % 26
  l.append(rem - 1 if rem else 25)
  n = n // 26
  if n == 0:
    break;

l.reverse()
print("".join([alphabet[i] for i in l]))

Submission status: Wrong Answer

Solution code:
n = int(input())
c = list()

while n != 0:
    c.append(chr(n%26 + 96))
    n //= 26

for i in range(len(c)-1, -1, -1):
    print(c[i], end='')
print()

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
def conv(a): #convert the num to character
  a += 97
  return chr(a)

# 整数の入力
n = int(input())
name = ''

while n>0:
  n -= 1
  print("nは{}で26で割って{}あまりは{}".format(n,n//26,n%26))
  name += conv(n%26)
  n //= 26

# 出力
print(name[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
alpha ='abcdefghijklmnopqrstuvwxyzz'
answer = ''
import copy
M = copy.copy(N)
num = 0
check = 0
numsum = 0
while True:
    if M+1==numsum:
        check = 1
    if M<numsum:
        num -= 1
        break
    numsum += 26**num
    num += 1
numlist = []*num

for i in range(num):
    syo = N//(26**(num-i-1))
    amari = N%(26**(num-i-1))
    answer += alpha[syo-1]
    if syo == 27:
        N -= (26**(num-i))
    else:
        N = amari

if check ==1:
    answer ='z'*num
print(answer)

Submission status: Wrong Answer

Solution code:
N = int(input())
alpha ='abcdefghijklmnopqrstuvwxyzz'
answer = ''
import copy
M = copy.copy(N)
num = 0
check = 0
numsum = 0
while True:
    if M+1==numsum:
        check = 1
    if M<numsum:
        num -= 1
        break
    numsum += 26**num
    num += 1
numlist = []*num

for i in range(num):
    syo = N//(26**(num-i-1))
    amari = N%(26**(num-i-1))
    answer += alpha[syo-1]
    if syo == 27:
        N -= (26**(num-i))
    else:
        N = amari
    print(syo,amari,answer)
if check ==1:
    answer ='z'*num
print(answer)

Submission status: Wrong Answer

Solution code:
N = int(input())
alpha ='abcdefghijklmnopqrstuvwxyzz'
answer = ''
import copy
M = copy.copy(N)
num = 0
check = 0
numsum = 0
while True:
    if M+1==numsum:
        check = 1
    if M<numsum:
        num -= 1
        break
    numsum += 26**num
    num += 1
numlist = []*num

for i in range(num):
    syo = N//(26**(num-i-1))
    amari = N%(26**(num-i-1))
    answer += alpha[syo-1]
    N = amari
    
if check ==1:
    answer ='z'*num
print(answer)

Submission status: Wrong Answer

Solution code:
def Base_10_to_n(X, n):
    base=[]
    X_dumy = X
    out = ''
    while X_dumy>0:
        out = int(X_dumy%n)
        X_dumy = int(X_dumy/n)
        base.append(out)
    return base
n=['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=int(input())
b=Base_10_to_n(a,26)
b.reverse()

ans=''
for i in b:
    ans=ans+n[i-1]
print(ans)

Submission status: Wrong Answer

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)

f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    n = int(input())
    L = [chr(i) for i in range(97, 97 + 26)]

    res = ""
    i = 1
    while n:
        r = n % 26
        res += L[r - 1]
        n = (n - i) // 26
        i += 1
    print(res[::-1])


if __name__ == '__main__':
    resolve()