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:
#!/usr/bin/env python3
import sys
import string

def solve(N: int):
    alphabet = string.ascii_lowercase
    digits = []
    for i in range(100):
        nd = 26**i
        if nd < N:
            digits.append(nd)
        else:
            break
    s = ""
    for i in range(len(digits)-1,-1,-1):
        currentDigit = digits[i]
        digitNum = N // currentDigit
        currentChar = alphabet[digitNum-1]
        N-=currentDigit*digitNum
        s += currentChar
    print(s)
    return


# 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())

A = "\0abcdefghijklmnopqrstuvwxyz"

b = ""

while n != 0:
    c = n % 26
    b = A[c] + b
    n -= c
    n //= 26

print(b)

Submission status: Wrong Answer

Solution code:
N = int(input())
al=[chr(ord('a') + i) for i in range(26)]
def convert(n,k):
    result = ""
    while n>0:
        result = al[(n%k)-1]+result
        n //= k
    return result
print(convert(N,26))

Submission status: Wrong Answer

Solution code:
n = int(input())
result_list = []
while n >=1:
  result_list.append(n%26)
  n = n//26
  
alpha = [chr(i) for i in range(97, 97+26)]
result_list = result_list[::-1]
str_ = ""
for result in result_list:
  str_ += alpha[result-1]
  
print(str_)

Submission status: Wrong Answer

Solution code:
import sys

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


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

    while n > 26:
        x = n % 26
        res += chars[x-1]
        n //= 26

    res += chars[n-1]
    print(res[::-1])


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N=int(input())
ta=[]
t=N
while t>0:
    t,m=divmod(t,26)
    ta.append(m)
l='abcdefghijklmnopqrstuvwxyz'
ta=ta[::-1]
ans=''
for i in ta:
    ans+=l[i-1]
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

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

res.reverse()
for v in res:
    print(chr(ord('a') + v - 1), end='')
print('')

Submission status: Wrong Answer

Solution code:
N = int(input())
a = ord("a")-1
cnt = 1
ans = []
while N != 0:
    ans.append(N%26)
    N //= 26
for i in range(len(ans)-1,-1,-1):
    print(chr(a+ans[i]),end="")
print()

Submission status: Wrong Answer

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

sys.setrecursionlimit(1000000)
ACMOD = 1000000007
INF = 1 << 62


def solve(N: int):
    base = 26
    # z 26
    # aa 27
    # ab 28
    if N == 1:
        print("a")
        return
    N -= 1
    rans = []
    for i in range(100000):
        if N == 0:
            break
        if i == 0:
            rans.append(chr(N % base + ord('a')))
            N = N // base
        else:
            rans.append(chr((N-1) % base + ord('a')))
            N = N// base
    print("".join(reversed(rans)))
    return


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())
A = []
while(N > 0):
    a,b = N//26,N%26
    A.insert(0,b)
    N = a
ans = ""
for a in A:
    ans = ans + chr(a+96)
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = []
num = [26**i for i in range(15)]
num.reverse()
for i in range(15):
    if n >= num[i]:
        for j in range(i, 15):
            count = 0
            while n >= num[j]:
                count += 1
                n -= num[j]
            if count == 0:
                ans[-1] -= 1
                ans.append(26)
            else:
                ans.append(count)
    else:
        continue
ans = [chr(i+96) for i in ans]
print(*ans, sep = "")

Submission status: Wrong Answer

Solution code:
N = int(input())
alf = []
while 0 < N:
    alf.append(chr((N % 26)+96))
    N //= 26
alf.reverse()
alf = ''.join(alf)
print(alf)

Submission status: Wrong Answer

Solution code:
def resolve():
    n = int(input())
    log26 = []
    while n > 0:
        if n%26 == 0:
            log26.append(26)
        else:
            log26.append(n%26)
        n //= 26
    ans = []
    for i in reversed(range(len(log26))):
        ans.append(chr(log26[i]+96))
    print("".join(ans))
resolve()

Submission status: Wrong Answer

Solution code:
n = int(input())
alfabet = 'abcdefghijklmnopqrstuvwxyz'
name = ''
while True:
  if n <= 26:
    name = alfabet[int(n-1)] + name
    break
  else:
    num = n % 26
    name = alfabet[int(num-1)] + name
    n /= 26
print(name)

Submission status: Wrong Answer

Solution code:
n=int(input())

n-=1
ans=chr(n%26+97)
while(n):
    n//=26
    if n==0:
        break
    ans=chr(n%26+96)+ans

print(ans)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right

def main():
    N = int(input())
    a = 'zabcdefghijklmnopqrstuvwxy'
    ans = ''
    i = 0
    while N > 0:
        ans += a[N%26]
        N //= 26
        # print(N)
    print(ans[::-1])

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
al = [chr(i) for i in range(97, 97+26)]
ans = ""
while True:
    temp = N % 26
    ans = al[temp-1] + ans
    if N // 26 == 0:
        break
    else:
        N = N // 26

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
t = 0
c = 1
for i in range(1, 100):
    if n <= 26**i + t:
        ansl = []
        tt = 100
        while n >= 26:
            if n // (26**tt) == 0:
                pass
            else:
                ansl.append(n // (26**tt))
                n %= (26**tt)
            tt -= 1
        ansl.append(n)

        break
    else:
        t += 26**i
        c += 1
ans = [chr(ord('a') + x-1) for x in ansl]

print(''.join(ans))

Submission status: Wrong Answer

Solution code:
#!python3

import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())

def resolve():
    N = int(input())
    s = " abcdefghijklmnopqrstuvwxyz"
    ans = ""
    a = N
    while a:
        a, b = divmod(a, 26)
        ans =  s[b] + ans

    print(ans)

if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    N = int(input())
    m = 26
    ans = ''
    n = N
    while n:
        ans += chr((n-1) % m + 97)
        n //= 26
    print(ans[::-1])

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

while n:
	q, r = divmod(n, 26)
	f += [r]
	n //= 26

g = ''
s = 'abcdefghijklmnopqrstuvwxyz'
f.reverse()
for i in f:
	g += s[i-1]

print(g)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

name = ''
while N != 0:
    name += alphabet[N % 26]
    N //= 26
print(name[::-1])

Submission status: Wrong Answer

Solution code:
from sys import stdin, setrecursionlimit

a_list = 'abcdefghijklmnopqrstuvwxyz'


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


def main():
    input = stdin.buffer.readline
    n = int(input())
    n = [int(i) for i in list(str(n))]
    print(*[a_list[i - 1] for i in base_convert(n, 10, 26)], sep='')


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
ord_a = ord("a")
ans = ""
while n:
    res,mod = divmod(n,26)
    n = res
    ans = chr(ord_a+mod-1) + ans
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

name = []

while (N > 0):
    i = N % 26
    name.append(chr(ord("a")+i-1))
    N = N // 26

print("".join(name[::-1]))

Submission status: Wrong Answer

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

#S=input()
N = int(input())

base=ord('a')-1

print_string=""

while (N >= 26):
  #print(N%26)
  print_string=chr(base+N%26)+print_string
  N//=26

print_string=chr(base+N%26)+print_string
#print(N)
print(print_string)
#N,K=list(map(int,input().split()))
#P=list(map(int,input().split()))

#P.sort()
#print(sum(P[:K]))

#print(A)

Submission status: Wrong Answer

Solution code:
n = int(input())
cnt = 1
now = 0
while now < n:
    now += 26 ** cnt
    cnt += 1
cnt -= 1
ans = ""
for i in range(cnt):
    ans += str(chr(ord("a")+n%26-1))
    n -= n%26
    n //= 26
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
n=int(input())

l=[]
while n>0:
  r=n%26
  l.insert(0,chr(ord('a')+r-1))
  n=n//26
  
print(''.join(l))

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np
import random
from decimal import Decimal
import itertools
import re
import bisect
from collections import deque, Counter
from functools import lru_cache

sys.setrecursionlimit(10**9)
INF = 10**13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
def SERIES(n): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ')
def GRID(h,w): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ').reshape(h,-1)[:,:w]
def GRIDfromString(h,w): return np.frombuffer(sys.stdin.buffer.read(), 'S1').reshape(h,-1)[:,:w]
MOD = 1000000007

def main():
	n = I()
	alphabets = [chr(ord('a')+i) for i in range(26)]
	mod_list = []
	while n >= 26:
		mod_list.append(n % 26)
		n = n // 26
	mod_list += [n]
	ans = ''
	for mod in reversed(mod_list):
		ans += alphabets[mod-1]
	print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
	return list(map(int,input().split()))
def m(): #複数文字
	return map(int,input().split())
def onem(): #Nとかの取得
	return int(input())
def s(x): #圧縮
	a = []
	if len(x) == 0:
		return []
	aa = x[0]
	su = 1
	for i in range(len(x)-1):
		if aa != x[i+1]:
			a.append([aa,su])
			aa = x[i+1]
			su = 1
		else:
			su += 1
	a.append([aa,su])
	return a
def jo(x): #listをスペースごとに分ける
	return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
	return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
	ll = 0
	rr = r
	while True:
		mid = (ll+rr)//2

	if rr == mid:
		return ll
	if (ここに評価入れる):
		rr = mid
	else:
		ll = mid+1
"""

n = onem()
ans = ""
while True:
	if n <= 26:
		ans = chr(96+n) + ans
		break
	else:
		po = n % 26
		if po == 0:
			po = 26
		ans = chr(96+po) + ans
		n //= 26
print(ans)

Submission status: Wrong Answer

Solution code:
# input()
# int(input())
# map(int, input().split())
# list(map(int, input().split()))
# list(map(int, list(input()))) # スペースがない数字リストを読み込み
import math
import fractions
import sys
import bisect
import heapq  # 優先度付きキュー(最小値取り出し)
import collections
from collections import Counter
from collections import deque
import pprint

sr = lambda: input()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""
def factorization(n):
    arr = []
    temp = n
    if n == 1:
        return arr

    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

# a^n
def power(a,n,mod):
    x = 1
    while n:
        if n & 1:
            x *= a % mod
        n >>= 1
        a *= a % mod
    return x % mod

# n*(n-1)*...*(l+1)*l
def kaijo(n, l, mod):
    if n == 0:
        return 1
    a = n
    tmp = n-1
    while(tmp >= l):
        a = a*tmp%mod
        tmp -= 1
    return a

inf = 10**18
mod = 10**9+7

n = ir()
ans = []
while n != 0:
    tmp = n%26
    ans.append(tmp)
    n = n//26
a = []
for i,num in enumerate(ans):
    if num == 0:
        a.append('z')
    else:
        a.append(chr(ord('a')+num-1))
a.reverse()
print(*a, sep='')

Submission status: Wrong Answer

Solution code:
N = int(input())

name = list()
while N >= 1:
    num_name = N % 26
    name.append(chr(ord("a") + num_name - 1))
    N //= 26

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = []
while N > 0:
    A.append(N%26)
    N = N // 26
ans = []
for i in A:
    ans.append(chr(i + 96))

print(*ans[::-1], sep = "")

Submission status: Wrong Answer

Solution code:
import sys
#import copy
#import math
#import bisect
#import numpy as np
#import itertools
#import collections
#from collections import deque
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
#from scipy.sparse import csr_matrix
#import functools

sys.setrecursionlimit(10**6)
input = sys.stdin.readline
#read = sys.stdin.buffer.read

numbers = "0123456789"
characters = ['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']

def base_cvt(value, n=26):
    try:
        tmp = int(value)
    except:
        raise ValueError('Invalid value:', value)
 
    if n < 2 or n > len(characters):
        raise ValueError('Invalid n:', value)
 
    result = ''
    tmp = int(value)
    while tmp >= n:
        idx = tmp%n
        result = characters[idx] + result
        tmp = int(tmp / n)
    idx = tmp%n
    result = characters[idx] + result
    return result

def main():
    N = int(input())
    ans = base_cvt(N)
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
tmp_n = N
ans = []
while True:
    s, r = divmod(tmp_n, 26)
    if r == 0:
        r = 26
    ans.append(chr(r+96))
    tmp_n = s
    if s == 0:
        break
print("".join(ans[::-1]))

Submission status: Wrong Answer

Solution code:
n = int(input())
x = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
while True:
    ans = x[n % 26 - 1] + ans
    n //= 26
    if n == 0:
        break
    elif n < 26:
        ans = x[n - 1] + ans
        break
print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
ans=""
while N>=27:
    x=N%26
    ans=chr(ord('a')+x-1)+ans
    N=N//26
print(chr(ord('a')+N-1)+ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
num2alpha = lambda c: chr(c+64)
ans = []

while True:
    if n == 0:
        break

    i = n%26
    n = int(n/26)

    ans.append(num2alpha(i))

ans.reverse()
print("".join(ans).lower())

Submission status: Wrong Answer

Solution code:
N = int(input())

ans=""
while N:
    r=(N+26-1)%26
    ans+=chr(ord("a")+r)
    N//=26
print("".join(reversed(ans)))

Submission status: Wrong Answer

Solution code:
MAX = 500
  
# Function to print Excel column name  
# for a given column number 
def printString(n): 
  
    # To store result (Excel column name) 
    string = ["\0"] * MAX
  
    # To store current index in str which is result 
    i = 0
  
    while n > 0: 
        # Find remainder 
        rem = n % 26
  
        # if remainder is 0, then a  
        # 'Z' must be there in output 
        if rem == 0: 
            string[i] = 'z'
            i += 1
            n = (n // 26) - 1
        else: 
            string[i] = chr((rem - 1) + ord('a')) 
            i += 1
            n = n // 26
    string[i] = '\0'
  
    # Reverse the string and print result 
    string = string[::-1] 
    print("".join(string) )

printString(int(input()))

Submission status: Wrong Answer

Solution code:
n=int(input())
l=[]
i=1
while n>0:
  x=n%(i*26)
  l.append(x)
  n//=26
a=''
s=[chr(i) for i in range(97, 97+26)]
for x in l:
  a=s[x-1]+a
print(a)

Submission status: Wrong Answer

Solution code:
N=int(input())

#26真数
abc=list("abcdefghijklmnopqrstuvwxyz")
ans=""
while True:
    ans=abc[N%26-1]+ans
    if N<27:
        break
    N=N//26
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
s = ''
tmp = N
while True:
    s = chr((tmp-1)%26+97) + s
    tmp //= 26
    if tmp==0:
        break
print(s)

Submission status: Wrong Answer

Solution code:
cha='abcdefghijklmnopqrstuvwxyz'
dig=[]
N=int(input())
n=N
while n>0:
  dig.append(n%26)
  n//=26
ans=[]
for i in range(len(dig)):
  ans.append(cha[dig[i]-1])
ans.reverse()
print(*ans,sep='')

Submission status: Wrong Answer

Solution code:
N = int(input())
abc = '=abcdefghijklmnopqrstuvwxyz'
ans = ''
while N > 0:
    ans = abc[N%26] + ans
    N //= 26
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = []
now = N
while now >= 27:
    R = now%26
    R = (R-1)%26
    now //= 26
    ans.append(chr(R+97))
R = now-1
ans.append(chr(R+97))
ans.reverse()
output = "".join(ans)
print(output)

Submission status: Wrong Answer

Solution code:
n = int(input())

c = ord("a")
l = ""
while n > 26:
    a = n % 26
    n = (n-a)//26
    l = l+chr(c+a-1)
l = l+chr(c+n-1)
print(l[::-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)


def main():
    N = int(input().strip())
    ans = ""
    while N > 0:
        N, m = divmod(N, 26)
        ans = chr(0x60 + m) + ans

    return ans


if __name__ == "__main__":
    print(main())

Submission status: Wrong Answer

Solution code:
n = int(input())

arr = []
a_code = ord('a')
while n != 0:
  tmp = n % 26
  
  arr.append(chr(tmp+a_code-1))
  
  n //= 26

arr = reversed(arr)
print(''.join(arr))

Submission status: Wrong Answer

Solution code:
import sys
import string

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
from math import floor, sqrt, factorial, hypot, log  # log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter, defaultdict, deque
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from bisect import bisect_left, bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint


def ceil(a, b): return (a + b - 1) // b


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


def pprint(*A):
    for a in A:     print(*a, sep='\n')


def INT_(n): return int(n) - 1


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


def MF(): return map(float, input().split())


def MI_(): return map(INT_, input().split())


def LI(): return list(MI())


def LI_(): return [int(x) - 1 for x in input().split()]


def LF(): return list(MF())


def LIN(n: int): return [I() for _ in range(n)]


def LLIN(n: int): return [LI() for _ in range(n)]


def LLIN_(n: int): return [LI_() for _ in range(n)]


def LLI(): return [list(map(int, l.split())) for l in input()]


def I(): return int(input())


def F(): return float(input())


def ST(): return input().replace('\n', '')


def main():
    N = I()
    ans = []
    alpha = string.ascii_lowercase
    while N:
        ans.append(alpha[N%26-1])
        N = N // 26
    ans.reverse()
    answ = ""
    for a in ans:
        answ += a
    print(answ)



if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
name = ""
while N > 0:
    if N == 26:
        name = 'z' + name
        break
    rem = N % 26
    name = ('z' if rem == 0 else chr(ord('a') + rem - 1)) + name
    N //= 26

print(name)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = ''
while n != 0:
    s = n % 26
    if s == 0:
        s = 26
    ans += chr(s + 96)
    n //= 26
print(ans[::-1])

Submission status: Wrong Answer

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

a = int(input())

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

print(base10to(a,26))

Submission status: Wrong Answer

Solution code:
letters = list("abcdefghijklmnopqrstuvwxyz")

n = int(input())

newNumber = ""
while n > 0:
    newNumber = newNumber + letters[int(n % 26)-1]
    n = n // 26
print(newNumber[::-1])

Submission status: Wrong Answer

Solution code:
alp = "abcdefghijklmnopqrstuvwxyz"

n = int(input())

ans = ""

while n != 0 :
  mod = n % 26 
  n = n // 26
  ans = alp[mod-1] + ans

print(ans)

Submission status: Wrong Answer

Solution code:
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict

# import fractions

sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)
# lcm = lambda x, y: (x * y) // fractions.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = ii()
    d, m = divmod(N, 26)
    S = chr(96 + m)
    while d > 26:
        d, m = divmod(d, 26)
        S = chr(96 + m) + S

    if d > 0:
        print(chr(96 + d) + S)
    else:
        print(S)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import os
import sys
from io import BytesIO, IOBase

BUFSIZE = 8192
class FastIO(IOBase):
    newlines = 0

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

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

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

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
INF = 10 ** 18
MOD = 10**9+7


Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()

n = int(ri())
# n-=1

arr = []
while n > 0:
    temp = n%26

    arr.append((temp-1)%26)

    n = n//26

ans = []
for i in range(len(arr)):
    ans.append(chr(ord('a') + arr[i]))

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

Submission status: Wrong Answer

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

while n>1:
    r = n % 26
    z += s[r-1] 
    n = n // 26

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

Submission status: Wrong Answer

Solution code:
N = int(input())
temp = N
L = []

while temp != 0:
  a, b = divmod(temp, 26)
  temp = a
  if b == 0:
    b += 26
  L.append(chr(96+b))

L.reverse()

print("".join(L))

Submission status: Wrong Answer

Solution code:
n=int(input())
l=[]
while n!=0:
    rem=n%26
    if rem==0:
        l.append('z')
    else:
        l.append(chr(97+(rem-1)))
    n=n//26
l.reverse()
print("".join(l))

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = ""

base = ord("a") - 1

while N > 0:
    a = N % 26
    ans = chr(base + a) + ans
    N = N // 26

print(ans)

Submission status: Wrong Answer

Solution code:
def Base_10_to_n(X, n):
    if (int(X/n)):
        return Base_10_to_n(int(X/n), n)+str(chr(ord('a')+X%n-1))
    return str(chr(ord('a')+X%n-1))

x10 = int(input())
x26 = Base_10_to_n(x10, 26)
print(x26)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
n = int(input())

for a in range(11,-1,-1):
  if n > (26*pow(26,a)-26)/(26-1):
    break
a += 1
ans = []
for i in range(a):
  s = n%26
  ans.append(chr(96+s))
  n //= 26
print(''.join(ans[::-1]))

Submission status: Wrong Answer

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

while n>0:
    s=chr(n%26+96)+s
    n=n//26
print(s)

Submission status: Wrong Answer

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

input = sys.stdin.readline

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

inf = float('inf')
mod = 1000000007

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

def main():
	N = inputInt()

	ans = ""
	listss = 'abcdefghijklmnopqrstuvwxyz'

	tmp = N // 26
	ama = N % 26
	if tmp > 0:
		ans = listss[ama-1]
		while True:
			if tmp == 0:
				break
			ama = tmp %26
			tmp = tmp //26

			ans = listss[ama-1] + ans
	else:
		ans = listss[N-1]

	print(ans)



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

Submission status: Wrong Answer

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

ans =num2alpha(int(A))
print(ans)

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    s = "abcdefghijklmnopqrstuvwxyz"
    ans = ""

    while True:
        ans += s[(n % 26)-1]
        if n < 26:
            break
        n //= 26
    print(ans[::-1])

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N = int(input())

ANS = []
c = 26
p = 96
while N != 0:
    n = N % 26
    if n == 0:
        n = 26

    ANS.append(chr(p + n))

    if N <= 26:
        break
    N //= 26

print("".join(map(str, ANS[::-1])))

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = ""
while n > 0:
    ans = chr(ord('a')+n%26-1)+ans
    n //= 26
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
res = ""
while True:
    ch = n % 26
    res += chr(ord("a") + ch - 1)
    n //= 26
    if n == 0:
        break
print(res[::-1])

Submission status: Wrong Answer

Solution code:
import string

N = int(input())

alph = string.ascii_lowercase

ans = []
while N > 0:
    k = N % 26
    ans.append(alph[k-1])
    N //= 26

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