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())
ans=""
def change(N,shinsu):
    keta=0
    for i in range(10**9):
        if N<shinsu**i:
             keta+=i
             break
    ans=[0]*keta
    check=0
    for i in range(1,keta+1):
        j=N//(shinsu**(keta-i))
        ans[check]=j
        check+=1
        N-=(j)*(shinsu**(keta-i))
    return ans, keta

#print(change(N,K))
N_26, keta= change(N, 26)
for i in range(keta):
	ans+=chr(ord("a")+N_26[i]-1)
print(ans)
"""
while N>0:
	N-=1
	ans+=chr(ord("a")+ N%26)
	N//=26
print(ans[::-1])
"""

Submission status: Wrong Answer

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

import math
import sys
from collections import defaultdict, Counter
from itertools import accumulate, product, permutations, combinations
from operator import itemgetter
from bisect import bisect_left, bisect
from heapq import heappop, heappush
from fractions import gcd
import copy


def next_line():
    return input()


def next_int():
    return int(input())


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


def int_ar_mul(size):
    return [int(input()) for _ in range(size)]


def str_ar(size):
    return [input() for _ in range(size)]


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


def strs():
    return input().split()


def main():
    alp = "zabcdefghijklmnopqrstuvwxy"
    n = next_int()
    str = ""
    while n > 0:
        str = alp[n % 26] + str
        n //= 26
    print(str)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())

def conversion(num):
    converted_list = []
    flg = True
    
    while flg:
        num, mod = divmod(num, 26)
        converted_list.append(mod)
        if num == 0:
            flg = False
            
    converted_list = converted_list[::-1]
    return converted_list

alphabet = [chr(i) for i in range(97, 123)]
ans = ''

for i in conversion(n):
    if i == 0:
        pass
    else:
        ans += alphabet[i - 2]
    
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

def conversion(num):
    converted_list = []
    flg = True
    
    while flg:
        num, mod = divmod(num, 26)
        converted_list.append(mod)
        if num == 0:
            flg = False
            
    converted_list = converted_list[::-1]
    return converted_list

alphabet = [chr(i) for i in range(97, 123)]
ans = ''

for i in conversion(n):
    ans += alphabet[i - 1]
    
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
al=['']
b=[chr(i) for i in range(ord('a'), ord('z')+1)]
al+=b
c=''
while n != 0:
    i = n%26
    n=n//26
    c+=al[i]
c=c[::-1]
print(c)

Submission status: Wrong Answer

Solution code:
def solve():
    N = int(input())

    skip_thresholds = {}
    for i in range(10, -1, -1):
        threshold = 0
        for j in range(1, i+1):
            threshold += 26**j
        skip_thresholds[i] = threshold

    ans = ''
    remainder = N
    for i in range(10, -1, -1):
        if remainder == 0:
            head,tail = ans[:len(ans)-1],ans[-1]
            ans = head + chr(ord(tail)-1)
            remainder += 26**(i+1)
        if remainder <= skip_thresholds[i]:
            continue
        digit,remainder = divmod(remainder, 26**i)
        if digit > 26:
            remainder += 26**i * (digit-26)
            digit = 26
        ans += chr(digit + 96)
    print(ans)

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
def solve():
    N = int(input())

    skip_thresholds = {}
    for i in range(10, -1, -1):
        threshold = 0
        for j in range(1, i+1):
            threshold += 26**j
        skip_thresholds[i] = threshold

    ans = ''
    remainder = N
    for i in range(10, -1, -1):
        if remainder <= skip_thresholds[i]:
            continue
        digit,remainder = divmod(remainder, 26**i)
        if digit > 26:
            remainder += 26**i * (digit-26)
            digit = 26
        if digit != 0:
            ans += chr(digit + 96)
    print(ans)

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
N=int(input())

alpha=['なんちゃら','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=[]

kaijo=[]
jousuu=0

while(26**jousuu<N):
    kaijo.append(26**jousuu)
    jousuu +=1
    
rem=N
for i in range(len(kaijo)):
    syou=rem // kaijo[len(kaijo)-i-1]
    rem -= kaijo[len(kaijo)-i-1]*syou
    print(alpha[syou],end='')

Submission status: Wrong Answer

Solution code:
N = int(input())

name_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']
name = ""

while N != 0:
    num = (N)%26 - 1
    N = N//26
    name += name_list[num]

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

Submission status: Wrong Answer

Solution code:
N = int(input())
res = ''

while True:
    amari = N % 26
    if amari == 0:
        amari = 26
    res += chr(96 + amari)
    if N - amari == 0:
        break
    N //= 26

print(res[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
res = ''
chars = 'Xabcdefghijklmnopqrstuvwxyz'

while N > 0:
    amari = N % 26
    if amari == 0:
        amari = 26
    # res += chr(96 + amari)
    res += chars[amari]
    N //= 26

print(res[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
res = ''

while N > 0:
    amari = N % 26
    if amari == 0:
        amari = 27
    res += chr(96 + amari)
    N //= 26

print(res[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())
res = ''

while N > 0:
    amari = N % 26
    if amari == 0:
        amari = 26
    res += chr(96 + amari)
    N //= 26

print(res[::-1])

Submission status: Wrong Answer

Solution code:
OFFSET = 97
def main():
    n = int(input()) - 1
    if n==0:
        print('a')
        return 
    ans = []
    while n!=0:
        n,mod = divmod(n,26)
        ans.append(chr(mod+OFFSET))
    print(''.join(ans)[::-1])
    return

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
OFFSET = 96
def main():
    n = int(input())
    ans = []
    while n!=0:
        n,mod = divmod(n,26)
        ans.append(chr(mod+OFFSET))
    print(''.join(ans)[::-1])
    return

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
p = N
s = []
abt = "zabcdefghijklmnopqrstuvwxy"
ans = ""

while p > 0:
   s.append(p % 26)
   p //= 26

for i in s[::-1]:
    ans += abt[i]

print(ans)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
def main():
    from string import ascii_lowercase

    N = int(input())
    # print(N)

    num = []
    for i in range(12, -1, -1):
        if N >= 26 ** i:
            for j in range(i, -1, -1):
                res = 26 ** j
                num.append(N // res)
                N = N % res
    for i in num:
        if i:
            print(ascii_lowercase[i - 1], end='')
        else:
            print(ascii_lowercase[i], end='')
    # print()
    # print(num)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
def main():
    from string import ascii_lowercase

    N = int(input())

    num = [0] * 13
    for i in range(12, -1, -1):
        res = 26 ** i
        if N >= res:
            num[i] = N // res
            N = N % res
    for i in num[::-1]:
        if i:
            print(ascii_lowercase[i - 1], end='')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())

abc = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
while n > 26:
    ans += abc[(n%26)-1]
    n //= 26
    
ans += abc[n-1]    
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
def solve():
    N = int(input())
    ans = ''
    remainder = N
    for i in range(10, -1, -1):
        digit,remainder = divmod(remainder, 26**i)
        if digit != 0:
            ans += chr(digit + 96)
    print(ans)

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
n=int(input())
# n-=1
r=[]
if n==0:r.append(0)
while n:
	r.append(n%26)
	n//=26
print(*['abcdefghijklmnopqrstuvwxyz'[t-1] for t in r][::-1],sep='')

Submission status: Wrong Answer

Solution code:
def abc171c_one_quadrillion():
    n = int(input())
    s = ''
    while n > 26:
        i = 0
        total = 1
        while total <= n:
            i += 1
            total += pow(26, i)
        i -= 1
        
        val = min(26, n // pow(26, i))

        if n - val * pow(26, i) < i:
            val -= 1
        s += chr(64 + val)
        n -= val * pow(26, i)
    s += chr(64 + n)
    print(s.lower())


abc171c_one_quadrillion()

Submission status: Wrong Answer

Solution code:
def abc171c_one_quadrillion():
    n = int(input())
    s = ''
    while n > 26:
        i = 0
        total = 1
        while total <= n:
            i += 1
            total += pow(26, i)
        i -= 1
        val = min(26, n // pow(26, i))
        if val * pow(26, i) - n == 0:
            val -= 1
        s += chr(64 + val)
        n -= val * pow(26, i)
    s += chr(64 + n)
    print(s.lower())


abc171c_one_quadrillion()

Submission status: Wrong Answer

Solution code:
def abc171c_one_quadrillion():
    n = int(input())
    s = ''
    while n > 26:
        i = 0
        total = 1
        while total <= n:
            i += 1
            total += pow(26, i)
        i -= 1
        val = min(26, n//pow(26, i))
        s += chr(64+val)
        n -= val * pow(26, i)
    s += chr(64 + n)
    print(s.lower())

abc171c_one_quadrillion()

Submission status: Wrong Answer

Solution code:
def abc171c_one_quadrillion():
    n = int(input())
    s = ''
    while n > 26:
        i = 0
        while pow(26, i) <= n:
            i += 1
        i -= 1
        val = n//pow(26, i)
        s += chr(64+val)
        n -= val * pow(26, i)
    s += chr(64 + n)
    print(s.lower())
abc171c_one_quadrillion()

Submission status: Wrong Answer

Solution code:
n = int(input())

a = 'abcdefghijklmnopqrstuvwxyz'
s = ''
while n > 0:
    n, mod = divmod(n, 26)
    s += a[mod-1]
print(''.join(list(reversed(s))))

Submission status: Wrong Answer

Solution code:
N = int(input().strip())-1

a = 1
while a <= N:
    a *= 26

ans = ''
while a >= 1:
    d = N // a - 1
    if a == 1:
        d += 1
    N = N % a
    a //= 26
    if d == -1:
        continue
    ans += chr(ord('a') + d)

print(ans)

Submission status: Wrong Answer

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

a = 1
while a <= N:
    a *= 26

a //= 26

ans = ''

while a >= 1:
    d = N // a - 1
    if a == 1:
        d += 1
    N = N % a
    a //= 26
    ans += chr(ord('a') + d)

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = ''

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

Submission status: Wrong Answer

Solution code:
import math

N = int(input())

kata = int(math.log(N, 26)) + 1
res = ""

for i in range(kata):
    offset = (N // int(26 ** i)) % 26
    tmp_char = chr(ord("a") + offset - 1)
    res = tmp_char + res

print(res)

Submission status: Wrong Answer

Solution code:
import math

N = int(input())

kata = int(math.log(N, 26)) + 1
print("kata:", kata)
res = ""

for i in range(kata):
    offset = (N // int(26 ** i)) % 26
    print("offset:", offset)
    tmp_char = chr(ord("a") + offset - 1)
    print("tmp_char:", tmp_char)
    res = tmp_char + res

print(res)

Submission status: Wrong Answer

Solution code:


n=int(input())
ans=''
while n:
  
  k=n//26
  r=n%26
  if r==0:
      ans='z'+ans
  else:
      ans=chr(ord('a')+r-1)+ans   

  n=k
    
print(ans)






# -----------------------------------------------------------------------------------------!

Submission status: Wrong Answer

Solution code:
N = int(input())-1
mod = [N%26]
while N>=26:
    N = int(N/26)
    mod.append(N%26-1)
    
mod.reverse()
ans = [chr(i+ord('a')) for i in mod]
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
N = int(input())-1
mod = [N%26]
while N>=26:
    N = int(N/26)
    mod.append(N%26-1)
    
mod.reverse()
print(mod)
ans = [chr(i+ord('a')) for i in mod]
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
N = int(input())
mod = [N%26]

while N>=26:
    N = int(N/26)
    mod.append(N%26)
    
mod.reverse()
ans = [chr(i+ord('a')-1) for i in mod]
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
N = int(input())

name_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']
name = ""

while N != 0:
    num = (N-1)%26
    N = N//26
    name += name_list[num]

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

Submission status: Wrong Answer

Solution code:
N = int(input())

name_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']
name = ""

while N != 0:
    num = N%26
    N = N//26
    name += name_list[num-1]

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: 	C_fix
# CreatedDate:  2020-08-18 13:59:41 +0900
# LastModified: 2020-08-18 14:07:56 +0900
#


import os
import sys
# import numpy as np
# import pandas as pd


def main():
    n = int(input())
    ans = ''
    for i in range(10, -1, -1):
        if n//(26**i) != 0:
            ans += chr(n//(26**i)+96)
        n = n%(26**i)
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

num = N-1
while(True):
  if num > 26:
    ans.append(num%26)
    num = num//26-1
  else:
    ans.append(num)
    break
answer = ""
for n in ans[::-1]:
  answer += chr(97+n)
print(answer)

Submission status: Wrong Answer

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

num = N
while(True):
  if num > 26:
    if num%26 == 0:
      ans.append(26)
    else:
      ans.append(num%26)
    num = num//26
  else:
    ans.append(num)
    break
answer = ""
for n in ans[::-1]:
  answer += chr(96+n)
print(answer)

Submission status: Wrong Answer

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

num = N
while(True):
  if num > 26:
    ans.append(num%26)
    num = num//26
  else:
    ans.append(num)
    break
answer = ""
for n in ans[::-1]:
  answer += chr(96+n)
print(answer)

Submission status: Wrong Answer

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

num = N
while(True):
  if num > 26:
    ans.append(num%26)
    num = num//26
  else:
    ans.append(num)
    break
answer = ""
for n in ans[::-1]:
  answer += chr(96+n)
print(answer)

Submission status: Wrong Answer

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

ans=''
while 26<N:
    s=N%26
    ans=alpha[s-1]+ans
    N=int(N/26)
ans=alpha[N-1]+ans
print(ans)

Submission status: Wrong Answer

Solution code:
def too(x):
    if x % 26 == 0:
        y = 26
    else:
        y = x % 26

    return y


def main():
    n = int(input())
    abc = 'abcdefghijklmnopqrstuvwxyz'

    length = 1
    accumulation = 0
    while True:
        if n <= 26 ** length + accumulation:
            break
        else:
            accumulation += 26 ** length
            length += 1


    lst = []
    l = 1
    while l <= length:
        lst.append(too(n))
        n -= 26 ** l
        l += 1


    answer = ''
    for i in range(len(lst)):
        number = int(lst[i])
        answer += str(abc[number - 1])

    print(answer)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    abc = 'abcdefghijklmnopqrstuvwxyz'

    length = 1
    accumulation = 0
    while True:
        if n <= 26 ** length + accumulation:
            break
        else:
            accumulation += 26 ** length
            length += 1


    if length == 1:
        answer = abc[n - 1]

    else:
        lst = []
        for _ in range(length - 1):
             tmp = n // (26 ** (length - 1))
             if tmp > 26:
                 tmp = 26
             lst.append(tmp)
             n -= (26 ** (length - 1) * tmp)
             length -= 1

        lst.append(n)

        answer = ''
        for i in range(len(lst)):
            number = lst[i]
            answer += abc[number - 1]


    print(answer)



if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
# One Quadrillion and One Dalmatians
from string import ascii_lowercase as alp
N = int(input())

# 27進法に直す
def f(n):
    digits = []
    while 0 != n:
        rem = n % 26
        n = n // 26
        digits.append(rem)
    return digits
ans = ''.join([alp[e-1] for e in f(N)])[::-1]
print(ans)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
N=int(input())
N-=1

waru=[26**i for i in range(1,12)]

ans=""

for num in waru[::-1]:
    if N//num!=0:
        ans+=chr(N//num+96)
        N=N%num
    

ans+=chr(N+97)
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
    no = int(input())

    n26 = 1
    n = no
    while n > 0:
        n26 *= 26
        n -= n26
    n += n26
    n -= 1
    r = []
    while n:
        t1 = n % 26
        r.append(chr(t1 + 97))
        n = n // 26
    print("".join(r[::-1]))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
    n = int(input())
    r = []
    num26 = 26
    while n > -1:
        t1 = n % num26
        t2 = t1 // (num26 // 26)
        if t2 == 0:
            t2 = 26
        r.append(chr(t2+96))
        n -= num26
        num26 *= 26
    r2 = "".join(r[::-1])
    print(r2)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n1 = input()
n = int(n1)
a = "abcdefghijklmnopqrstuvwxyz"
aa = "zabcdefghijklmnopqrstuvwxy"
alist = list(a)
aalist = list(aa)
c, d = 0, 0
name = ""
namelist = []
cnt = 0
while 1:
    cnt += 1
    if n <= (26**(cnt+1)-26)/25:
        break
n -=  (26**(cnt)-26)/25
n = int(n)
while 1:
    c = n//26
    d = n%26
    n = c
    namelist.append(d)
    if n == 0:
        break
while 1:
    if len(namelist) < cnt:
        namelist.append(0)
    else:break
    
for i in range(cnt):
    if len(namelist)==cnt+1:
        name = "z"*cnt
        break
    num = namelist[i]
    if i == 0:
        name = aalist[num]
    else:
        name = alist[num] + name

print(name)

Submission status: Wrong Answer

Solution code:
N = int(input())

t = ""
while N > 0:
    t += chr((N % 26) + 97 - 1)
    N //= 26

print(t[::-1])

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
    n = int(input())
    r = []
    num26 = 26
    while n > 0:
        t1 = n % num26
        t1 -= 1
        t2 = t1 // (num26 // 26)
        r.append(chr(t2+97))
        n -= num26
        num26 *= 26
    r2 = "".join(r[::-1])
    print(r2)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
    n = int(input())
    r = []
    num26 = 26
    flag = False
    while n > 0:
        t1 = n % num26
        t2 = t1 // (num26 // 26)
        t2 += flag
        r.append(chr(t2+96))
        n -= num26
        num26 *= 26
        flag = True

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
    n = int(input())
    r = []
    num26 = 26
    n -= 1
    while n > 0:
        t1 = n % num26
        t2 = t1 // (num26 //26) + 1
        r.append(chr(t2+96))
        n -= num26
        num26 *= 26

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
    n = int(input())
    r = []
    while n:
        t1 = n % 26
        r.append(chr(t1+96))
        n += 1
        n = n // 26

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
    n = int(input())
    r = []
    while n:
        n += 1
        t1 = n % 26
        r.append(chr(t1+95))
        n = n // 26
    print("".join(r[::-1]))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
h = 26
i = 2
while(True):
    if(n<=h):
        break
    h+= 26**i
    i+=1
i -= 1
n = 26**i
print(i)
alp = "abcdefghijklmnopqrstuvwxyz"
ans = []
for j in range(i):
    ans.append(alp[n%26-1])
    n = n // 26
anss = " "
for k in range(i):
    anss += ans[-1]
    del ans[-1]
print(anss)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = "zabcdefghijklmnopqrstuvwxy"
alist = list(a)
c, d = 0, 0
name = ""
namelist = []
while 1:
  c = n//26
  d = n%26
  n = c
  namelist.append(alist[d])
  if n == 0:
    break
namelist.reverse()
name = "".join(namelist)
print(name)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = "zabcdefghijklmnopqrstuvwxy"
alist = list(a)
c, d = 0, 0
name = ""
namelist = []
while 1:
  c = n//26
  d = n%26
  n = c
  namelist.append(alist[d])
  print(n)
  if n == 0:
    break
namelist.reverse()
name = "".join(namelist)
print(name)

Submission status: Wrong Answer

Solution code:
n=int(input())
alf = list("abcdefghijklmnopqrstuvwxyz")
ans=""
i=0
while n-26**i>0:
  n-=26**i
  i+=1

while n>=1:
  n,b=divmod(n,26)
  ans+=str(alf[b])
print(ans[::-1])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())
keta=1
a=26
while N>a:
  a*=26
  keta+=1
  if a+1<=N<+a+27:
    break
ans=""
for i in range(keta-1,0,-1):
  a=(N-1)//(26**i)
  ans+=chr(ord('a')+a-1)
  N-=a*(26**i)
ans+=chr(ord('a')+N-1)
print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
keta=1
a=26
while N-1>a:
  a*=26
  keta+=1
ans=""
for i in range(keta-1,0,-1):
  a=(N-1)//(26**i)
  ans+=chr(ord('a')+a-1)
  N-=a*(26**i)
ans+=chr(ord('a')+N-1)
print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
keta=1
a=26
while N>a:
  a*=26
  keta+=1
ans=""
for i in range(keta-1,0,-1):
  a=N//(26**i)-1
  N=N%(26**i)
  ans+=chr(ord('a')+a)
ans+=chr(ord('a')+N-1)
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
ascii_letters = 'abcdefghijklmnopqrstuvwxyz'
minus=1
for i in range(1,15):
    if n<=26**i:
        order=i
        n-=minus
        break
    else:
        minus+=26**i

for i in range(order):
    print(ascii_letters[n//(26**(order-i-1))],end='')
    n%=(26**(order-i-1))
print()

Submission status: Wrong Answer

Solution code:
n = int(input())
ascii_letters = 'abcdefghijklmnopqrstuvwxyz'
minus=1
for i in range(1,12):
    if n<=26**i:
        order=i
        n-=minus
        break
    else:
        minus+=26**i

for i in range(order):
    print(ascii_letters[n//(26**(order-i-1))],end='')
    n%=(26**(order-i-1))
print()

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = ''
i = 1

while N > 0:
    ans = chr(ord('a') + N % (26) - 1) + ans

    N = (N-1) // 26

print(ans)
exit()

Submission status: Wrong Answer

Solution code:
ans=[]
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']

while N>0:
    N,b=divmod(N,26)
    b=alf[b-1]
    ans.insert(0,b)


print(''.join(ans))

Submission status: Wrong Answer

Solution code:
ans=[]
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']

while N>=1:
    N,b=divmod(N,26)
    b=alf[b-1]
    ans.insert(0,b)


print(''.join(ans))

Submission status: Wrong Answer

Solution code:
ans=[]
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']

while N>1:
    N,b=divmod(N,26)
    b=alf[b-1]
    ans.insert(0,b)


print(''.join(ans))

Submission status: Wrong Answer

Solution code:
a = list('abcdefghijklmnopqrstuvwxyz')
n = int(input()) - 1

ans = ""
while True:
  b = n // 26
  c = n % 26
  print(b)
  print(c)
  if b == 0:
    ans = a[c] + ans
    break
  elif b == 1:
    ans = a[b - 1] + a[c] + ans
    break
  else:
    ans = a[c] + ans
    n = b - 1
    
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
ch_quotient = n//26
ch_mod = n%26
if ch_mod == 0:
  ch_mod = 26
dogname = str('')
name_base = [ch_mod]
while ch_quotient != 0:
  if ch_mod == 26:
    ch_mod = (ch_quotient-1)%26
    if ch_mod == 0:
      ch_mod = 26
  name_base.append(ch_mod)
  if ch_quotient-1 <= 26:
    break
  ch_quotient = (ch_quotient-1)//26
for i in name_base:
  dogname = dogname + chr(i+96)
print(dogname[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
ch_quotient = n//26
ch_mod = n%26
dogname = str('')
name_base = [ch_mod]
while ch_quotient != 0:
  ch_mod = ch_quotient%26
  ch_quotient = ch_quotient//26
  name_base.append(ch_mod)
for i in name_base:
  dogname = dogname + chr(i+96)
print(dogname[::-1])

Submission status: Wrong Answer

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

while n > 0:
  n -= 1
  x = n%26
  n /= 26
  s += al[int(x)]

print(s[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
s = ""
al = "zabcdefghijklmnopqrstuvwxyz"

while n > 0:
  n -= 1
  x = n%26
  n /= 26
  s += al[int(x)]

print(s[::-1])

Submission status: Wrong Answer

Solution code:
n = int(input())
s = ""
al = "zabcdefghijklmnopqrstuvwxyz"

while n > 0:
  x = n%26
  n //= 26
  id = int(x)
  s += al[id]

print(s[::-1])

Submission status: Wrong Answer

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

while n > 0:
  x = n%26
  n //= 26
  id = int((x-1)%26)
  
  s += al[id]

print(s[::-1])

Submission status: Wrong Answer

Solution code:
def base10to(n, b):
    if (int(n/b)):
        return base10to(int(n/b), b) + Alp[n%b]
    return Alp[n%b-1]
Alp = ["","a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","i","s","t","u","v","w","x","y","z"]
print(base10to(int(input()),26))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

bit = []
r = 0
while True:
    M = N
    N = N // 26
    bit.append(M % 26)
    if N == 0:
        break

alph = ["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"]
char = []
for i in range(len(bit)):
        char.insert(0, alph[bit[i]])

ans = "".join(char)
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
out_ans = []
while N > 26:
    out_ans.append(int(N % 26))
    N = (N // 26)
out_ans.append(int(N))
out_dic = ['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 = ''
for i in range(len(out_ans)-1, -1, -1):
    ans = ans + (out_dic[out_ans[i] - 1])
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
out_ans = []
while N > 26:
    out_ans.append(int(N % 26))
    N = (N - N % 26) / 26
out_ans.append(int(N))
out_dic = ['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 = ''
for i in range(len(out_ans)-1, -1, -1):
    ans = ans + (out_dic[out_ans[i] - 1])
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = ''
i = 0
while True:
    if n < 26**i:
        break
    tmp = (n//(26**i)) % 26
    ans = chr(tmp + 97 - 1) + ans
    i += 1

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N = int(input())
#N = 100
a = []
s = ""

while N != 0:
    a.insert(0, N % 26)
    N = N //26

#print(a)

for i in range(len(a)):
    a[i] = chr(96+a[i])
    s += a[i]

print(s)

Submission status: Wrong Answer

Solution code:
num = int(input())
    
def Base_10_to_n(X, n):
    X_dumy = X
    out = ''
    alist = ['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 X_dumy>1:
        out = alist[(X_dumy%n)-1]+out
        X_dumy = int(X_dumy/n)
    return out
    
print(Base_10_to_n(num, 26))

Submission status: Wrong Answer

Solution code:
num = int(input())
    
def Base_10_to_n(X, n):
    X_dumy = X
    out = ''
    alist = ['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']

    while X_dumy>0:
        # if X_dumy%n==0:
        #     moji = ''
        # else:
        #     moji = alist[(X_dumy%n)-1]
        out = alist[(X_dumy%n)-1]+out
        X_dumy = int(X_dumy/n)
    return out
    
print(Base_10_to_n(num, 26))

Submission status: Wrong Answer

Solution code:
num = int(input())
    
def Base_10_to_n(X, n):
    X_dumy = X
    out = ''
    alist = ['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 X_dumy>0:
        if X_dumy%n==0:
            moji = ''
        else:
            moji = alist[(X_dumy%n)-1]
        out = moji+out
        X_dumy = int(X_dumy/n)
    return out
    
print(Base_10_to_n(num, 26))

Submission status: Wrong Answer

Solution code:
num = int(input())
    
def Base_10_to_n(X, n):
    X_dumy = X
    out = ''
    alist = ['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']
    # print(alist[(X_dumy%n)])
    while X_dumy>0:
        out = alist[(X_dumy%n)-1]+out
        X_dumy = int(X_dumy/n)
    return out
    
print(Base_10_to_n(num, 26))