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())
s = []
while n > 0:
    s.append(chr(n % 26 + 0x60))
    n //= 26
print(''.join(reversed(s)))

Submission status: Wrong Answer

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

import collections
import random

def linput(ty=int, cvt=list):
	return cvt(map(ty,input().split()))

def gcd(a: int, b: int):
	while b: a, b = b, a%b
	return a

def lcm(a: int, b: int):
	return a * b // gcd(a, b)

def dist(x1,y1,x2,y2):
	return abs(x1-x2)+abs(y1-y2)

def main():
	N = int(input())
	#vS = [input().rstrip() for _ in [0,]*N]
	oA = ord("a")
	vD = [chr(i+oA) for i in range(26)]
	#vD += [".","#"]

	N -= 1
	res = vD[N%26]
	N //= 26
	while N:
		res += vD[N%26 - 1]
		N //= 26
	
	print(res[::-1])
	#sT = "No Yes".split()
	#print(sT[res])
	

if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
n = int(input())
n -= 1
name = []
while n > 0:
    modulo = n % 26
    name += chr(ord("a")+modulo)
    #print (modulo)
    #print (n // 26-1)
    n = n // 26 - 1
print ("".join(reversed(name)))

Submission status: Wrong Answer

Solution code:
n = int(input())
q = []
while n != 0:
    q.insert(0,n % 26)
    n = n // 26
ans = ''
for i in q:
    ans += chr(96 + i)
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
name = []
while n > 0:
    modulo = n % 26
    name.append(chr(ord("a")+modulo-1))
    n //= 26
print ("".join(reversed(name)))

Submission status: Wrong Answer

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
a = N - 1
ans = ""
while a >= 26:
    b = a % 26
    a //= 26
    ans = chr(b + 97)+ ans
else:
    ans = chr(a + 96)+ ans 

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = N - 1
ans = ""
while a >= 26:
    b = a % 26
    a //= 26
    ans = chr(b + 97)+ ans
else:
    ans = chr(a + 97)+ ans 

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = N
ans = ""
while a >= 26:
    b = a % 26
    a //= 26
    ans = chr(b + 96)+ ans
else:
    ans = chr(a + 96)+ ans 

print(ans)

Submission status: Wrong Answer

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random,resource

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n = I()
    r = []
    while n >= 1:
        r.append(chr(ord('a') + (n-1) % 26))
        n //= 26

    return JA(r[::-1], '')


print(main())

Submission status: Wrong Answer

Solution code:
n = int(input())
li = [chr(i) for i in range(ord('a'), ord('z') + 1)]
result=[]

while True:
    s, t = n//26, n%26
    if t == 0:
        t = 26
    result.append(li[t-1])
    n = s
    if n == 0:
        result = result[::-1]
        print("".join(result))
        break

Submission status: Wrong Answer

Solution code:
n = int(input())

li = []

count = 0
val = 1

while(True):

	val *= 26
	count += 1

	if (val > n):
		break

for i in range(count-1,-1,-1):

	val2 = n // pow(26,i)
	#print(val2)
	li.append(val2)
	n -= (val2 * pow(26,i))

for i in li:
	print(chr(96+i),end="")

Submission status: Wrong Answer

Solution code:
n = int(input())

li = []

count = 0
val = 1

while(True):

	val *= 27
	count += 1

	if (val > n):
		break

for i in range(count-1,-1,-1):

	val2 = n // pow(26,i)
	li.append(val2)
	n -= (val2 * pow(26,i))

for i in li:
	print(chr(96+i),end="")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while 26 < n:
    syo, jyoyo = divmod(n, 26)
    names.insert(0, chr(96+jyoyo))
     # print(chr(64+jyoyo))
    n = syo
else:
    names.insert(0, chr(96+n))

print("".join(names))

Submission status: Wrong Answer

Solution code:
N = int(input())
q = [0]*13
i = 10
n = N
cflag = 0
str = []
while i != -1:
    q[i] = n // 26 ** i
    mod = n % 26 ** i
    n = mod
    i -= 1
for i in range(12):
    if q[i] == 0 and q[i+1] == 0:
        break
    elif q[i] == 0:
        str.append("z")
        cflag = 1
    elif q[i] == 1 and q[i+1] == 0 and cflag == 1:
        break
    elif q[i] == 1 and cflag == 1:
        str.append ("z")
    else:
        str.append(chr(q[i] + 96 -cflag))
        cflag = 0

i = len(str) -1
while i >= 0:
    if[str] == '':
        i-=1
        continue
    elif i == 0:
        print(str[i])
        break
    else:
        print(str[i], end="")
        i -= 1

Submission status: Wrong Answer

Solution code:
N = int(input())
q = [0]*12
i = 10
n = N
cflag = 0
str = []
while i != -1:
    q[i] = n // 26 ** i
    mod = n % 26 ** i
    n = mod
    i -= 1
for i in range(11):
    if q[i] == 0 and q[i+1] == 0:
        break
    elif q[i] == 0:
        str.append("z")
        cflag = 1
    elif q[i] == 1 and q[i+1] == 0 and cflag == 1:
        break
    elif q[i] == 1 and cflag == 1:
        str.append ("z")
    else:
        str.append(chr(q[i] + 96 -cflag))
        cflag = 0

i = len(str) -1
while i >= 0:
    if[str] == '':
        i-=1
        continue
    elif i == 0:
        print(str[i])
        break
    else:
        print(str[i], end="")
        i -= 1

Submission status: Wrong Answer

Solution code:
N=int(input())
ans=""

for _ in range(10**5):
	ans+=chr(ord("a")+(N%26)-1)
	N=N//26
	if N<=0:
		break

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N=int(input())
eng=[chr(i) for i in range(97, 97+26)]
ans=""
up=N
for _ in range(10**5):
	ans+=eng[(up%26)-1]
	up=up//26
	if up==0:
		break

print(ans[::-1])

Submission status: Wrong Answer

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

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

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())
name = ""
m = 0
while True:
    if N < 27:
        name =  chr(N + 96) + name
        break
    name = chr(N % 26 + 96) + name
    N = N // 26

print(name)

Submission status: Wrong Answer

Solution code:
N = int(input())
name = ""
m = 0
while True:
    if N < 27:
       name = chr(N + 96) + name
       break
    name = chr(N%26+96) + name
    N = N // 26

print(name)

Submission status: Wrong Answer

Solution code:
N = int(input())
name = ""
m = 0
while True:
    if N < 26:
       name += chr(N + 96)
       break
    name += chr(N%26+96) 
    N = N // 26

print(name)

Submission status: Wrong Answer

Solution code:
N = int(input())
name = ""
m = 0
while True:
    if N < 26:
       name = chr(N + 96) + name
       break
    name = chr(N%26+96) + name
    N = N // 26

print(name)

Submission status: Wrong Answer

Solution code:
def conv(n):
    if (n>26):
        conv(n//26)
    print('z' if n%26==0 else chr(96+(n%26)), end='')
conv(int(input()))

Submission status: Wrong Answer

Solution code:
def conv(n):
    if (n>25):
        conv(n//26)
    print(chr(96+(n%26)), end='')
conv(int(input()))

Submission status: Wrong Answer

Solution code:
import math
n=int(input())
a=[]
y=math.log(((n*25)/26)+1,26)
#print(y)
if(y%1==0):
    print('z'*int(y))
else:
  y=math.ceil(y)
  for i in range(y):
    a.append(n%(26**(i+1)))
#print(a)
  for i in range(y):
       a[i]=a[i]//(26**(i))
  a.reverse()
#print(a,y)
  q=['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']    
  for i in range(y):
    print(q[a[i]-1],end="")

Submission status: Wrong Answer

Solution code:
import math
n=int(input())
a=[]
y=int(math.log(n,26))
for i in range(y+1):
    a.append(n%(26**(i+1)))
for i in range(y+1):
    a[i]=a[i]//(26**i)
a.reverse()
#print(a,y)
q=['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']
for i in range(y+1):
    print(q[a[i]-1],end="")

Submission status: Wrong Answer

Solution code:
import math
n=int(input())
a=[]
y=int(math.log(n,26))
for i in range(y+1):
    a.append(n%(26**(i+1)))
for i in range(y+1):
    a[i]=a[i]//(26**i)
a.reverse()
print(a,y)
q=['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']
for i in range(y+1):
    print(q[a[i]-1],end="")

Submission status: Wrong Answer

Solution code:
 
n=int(input(""))
a=[]
n-=1
for i in range(11):
    if (n==0):
        break
    a+=[n%26+1]
    n=int(n/26)
b=[]
for i in range(len(a)):
    b+=[a[len(a)-i-1]]

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

Submission status: Wrong Answer

Solution code:
 
n=int(input(""))
a=[]
for i in range(11):
    if (n==0):
        break
    a+=[n%26]
    n=int(n/26)
b=[]
for i in range(len(a)):
    b+=[a[len(a)-i-1]]

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

Submission status: Wrong Answer

Solution code:
 
n=int(input(""))
a=[]
for i in range(11):
    a+=[n%26]
    n=int(n/26)
b=[]
for i in range(len(a)):
    b+=[a[len(a)-i-1]]

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

Submission status: Wrong Answer

Solution code:
 
n=int(input(""))
a=[]
for i in range(11):
    a+=[n%26]
    n=int(n/26)
b=[]
for i in range(len(a)):
    b+=[a[len(a)-i-1]]

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

Submission status: Wrong Answer

Solution code:
 
n=int(input(""))
a=[]
for i in range(11):
    a+=[n%26]
    n=int(n/26)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
alpha = ['Z']
alpha.extend([chr(ord('a') + i) for i in range(26)])
N = int(input())
q = N
ans = ''
while True:
    if q <= 26:
        ans += str(alpha[q])
        break
    else:
        q, mod = divmod(q, 26)
        if mod == 0:
            mod = 26
        ans += str(alpha[mod])

print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N = int(input())

for i in reversed(range(10)):
    n = N // 26**i
    N %= 26**i
    if n != 0:
        print(chr(96+n),end="")

Submission status: Wrong Answer

Solution code:
N = int(input())

num2s = " abcdefghijklmnopqrstuvwxyz"


def base10_to_n(x, n):
    if (int(x/n)):
        return base10_to_n(int(x/n), n) + [x%n]
    else:
        return [x%n]


res = base10_to_n(N, 26)
ans = ""

if res[-1] == 0:
    res = [26] * (len(res)-1)

for s in res:
    ans += num2s[s]
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

num2s = " abcdefghijklmnopqrstuvwxyz"


def base10_to_n(x, n):
    if (int(x/n)):
        return base10_to_n(int(x/n), n) + [x%n]
    else:
        return [x%n]


res = base10_to_n(N, 26)
print(res)
ans = ""

if res[-1] == 0:
    res = [26] * (len(res)-1)

for s in res:
    ans += num2s[s]
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

num2s = " abcdefghijklmnopqrstuvwxyz"


def base10_to_n(x, n):
    if (int(x/n)):
        return base10_to_n(int(x/n), n) + [x%n]
    else:
        return [x%n]


res = base10_to_n(N, 26)

ans = ""
for s in res:
    if s==0:
        continue
    ans += num2s[s]
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = ""
while n >= 26:
  n, mod = divmod(n-1, 26)
  ans = chr(ord("a")+mod) + ans
ans = chr(ord("a")+n-1) + ans

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = ""
while n > 26:
  n, mod = divmod(n, 26)
  if mod != 0:
    ans = chr(ord("a")+mod-1) + ans
  elif mod == 0:
    ans = "a" + ans
ans = chr(ord("a")+n-1) + ans

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = ""
while n > 26:
  n, mod = divmod(n, 26)
  ans = chr(ord("a")+mod-1) + ans
ans = chr(ord("a")+n-1) + ans

print(ans)

Submission status: Wrong Answer

Solution code:
def II(): return int(input())
N=II()
N-=1
i=1
while N>(26**i):
  N-=26**i
  i+=1
ans=''
for j in range(i):
  q,mod=divmod(N,26)
  ans=ans+chr(mod+ord('a'))
  N=q
ans=ans[::-1]
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

l = []
a = 0
b = 0
while n > 0:
#    print(n)
    if n % 26 == 0:
        a = 25
        b = -1
    else:
        a = n % 26 - 1
#    print(chr(ord('a') + a))
    l.append(chr(ord('a') + a))
    n //= 26
    n += b

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

Submission status: Wrong Answer

Solution code:
n = int(input())

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

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

Submission status: Wrong Answer

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

N = int(input())
i = 0
lis = []
while True:
    lis.append(N % 26)
    N = N//26
    if N ==0:
        break
    

for i in range(len(lis)-1,-1,-1):
    print(chr(lis[i]+96),end = "")

Submission status: Wrong Answer

Solution code:
def II(): return int(input())
N=II()
abc=[chr(i) for i in range(97, 97+26)]
tmp=1
i=1
while N>(26**i):
  N-=26**i
  i+=1
ans=''
for j in range(i):
  q,mod=divmod(N,26)
  ans=ans+abc[mod-1]
  N=q+1
ans=ans[::-1]
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

num2alpha = lambda c: chr(c)
tmp_N = N
result = ''
while (tmp_N / 26) > 1.0:
    k = int(tmp_N / 26)
    res = tmp_N % 26
    if res == 0:
        res = 26
    result += num2alpha(res+64).lower()
    tmp_N = k
res = tmp_N % 26
if res == 0:
    res = 26
result += num2alpha(res+64).lower()
new_str = ''.join(list(reversed(result)))
print(new_str)

Submission status: Wrong Answer

Solution code:
N = int(input())

num2alpha = lambda c: chr(c)
tmp_N = N
result = ''
while int(tmp_N / 26) > 0:
    k = int(tmp_N / 26)
    res = tmp_N % 26
    result += num2alpha(res+64).lower()
    tmp_N = k
result += num2alpha((tmp_N % 26)+64).lower()
new_str = ''.join(list(reversed(result)))
print(new_str)

Submission status: Wrong Answer

Solution code:
N = int(input())

num2alpha = lambda c: chr(c)
k = 100000
tmp_N = N
result = ''
while k > 0:
    k = int(tmp_N / 26)
    res = tmp_N % 26
    result += num2alpha(res+64).lower()
    tmp_N = k

new_str = ''.join(list(reversed(result)))
print(new_str)

Submission status: Wrong Answer

Solution code:
N = int(input())

num2alpha = lambda c: chr(c)
k = 100000
tmp_N = N
result = ''
while k > 0:
    k = int(tmp_N / 26)
    res = tmp_N % 26
        
    if k == 0:
        break
    result += num2alpha(res+64).lower()
    tmp_N = k

m = N % 26
result += num2alpha(m+64).lower()
print(result)

Submission status: Wrong Answer

Solution code:
N = int(input())

num2alpha = lambda c: chr(c)
k = 100000
tmp_N = N
result = ''
while k > 0:
    k = int(tmp_N / 26)
    res = tmp_N % 26
        
    if k == 0:
        break
    result += num2alpha(res+64).lower()
    tmp_N = k

m = N % 26
result += num2alpha(m+64).lower()

Submission status: Wrong Answer

Solution code:
N = int(input())

num2alpha = lambda c: chr(c)
k = 100000
tmp_N = N
result = ''
while k > 0:
    k = int(tmp_N / 26)
    res = tmp_N % 26
        
    if k == 0:
        break
    print(res)
    result += num2alpha(res+64).lower()
    tmp_N = k

m = N % 26
result += num2alpha(m+64).lower()

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=[]
b=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
for i in range(100):
    if n <= 26:
        ans.append(b[n-1])
        break
    ans.append(b[n%26-1])
    n=n//26
ans.reverse()
print(''.join(ans))

Submission status: Wrong Answer

Solution code:
N = int(input())

name = ""

def num2char(n) :
  if n == 0:
    n = 26
  return chr(n+96)

while(N > 26) :
  name = num2char(N%26) + name
  N = int(N/26)
  
name = num2char(N) + name
print(name)

Submission status: Wrong Answer

Solution code:
#x = 1000000000000001
x=int(input())
list_Shou=[]
list_New = []
list_Alphabet = [""]
for i in range(97, 97+26):
    list_Alphabet.append(chr(i))

for i in range(1, 11)[::-1]:
    Warukazu = 26**i
    Shou = min(x//Warukazu,26)
    Amari = x - (Shou*Warukazu)
    print(str(Warukazu)+"="+str(Shou)+"..."+str(Amari))
    
    if Amari==26**(i-1)  and Shou>0:
        Shou+=-1#shouを１減らして
        Amari+=Warukazu#Amariを割る数ぶん増やす
        print("New"+str(Shou)+"/"+str(Amari))
        
    list_Shou.append(Shou)
    x=Amari
    
    #list_Shou.append(Amari+Shou*26)#ひとけため：if Amari==0の処理がいらないので、for文からくくりだす

print(list_Shou)
#リストをアルファベットに変換

for j in list_Shou:
    list_New.append(list_Alphabet[j])
print(list_New)
Answer = "".join(list_New)
print(Answer)

Submission status: Wrong Answer

Solution code:
n = int(input())
T =[]
S = ""
while n>0:
  T.insert(0, n%26)
  n = n//26
for t in T:
  S += chr(t+96)
print(S)

Submission status: Wrong Answer

Solution code:
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7

N = int(readline())
N -= 1
digit = 26
now = 26
while now < N:
    digit *= 26
    now += digit
now = now - digit
N = N - now
ans = ''
while N > 0:
    ans += chr(97+N%26)
    N = N//26
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7

N = int(readline())

digit = 26
now = 26
c = 1
while now < N:
    digit *= 26
    now += digit
    c += 1
N -= 26**(c-1)
ans = ''
for i in range(c):
    rem = N%26
    N = N//26
    if i == c-1:
        ans += chr(97+rem)
    else:
        ans += chr(96+rem)
print(ans[::-1])

Submission status: Wrong Answer

Solution code:
N=int(input())
l=[3817158266467286,146813779479510,5646683826134,217180147158,8353082582,321272406,12356630,475254,18278,702,26,1]
abc=["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"]
for i in l:
    if N-i>=0:
        n=12-l.index(i)
        break
ans=""
b=N
for j in reversed(range(n)):
    a,b=divmod(b,26**j)
    ans+=abc[a-1]
print(ans)

Submission status: Wrong Answer

Solution code:
import math
a = [chr(i) for i in range(97, 97+26)]
n = int(input())-1
s = []
c = 0
a.append('')
cc = 0
while True:
    s.append(n % 26-cc)
    n = int(n/26)
    cc = 1
    c += 1
    if n < 26:
        if n == 0:
            c -= 1
            break
        s.append(n-cc)
        break
name = ''
for i in range(c, -1, -1):
    name += a[s[i]]
print(name)

Submission status: Wrong Answer

Solution code:
import math
a = [chr(i) for i in range(97, 97+26)]
n = int(input())
s = []
c = 0
a.append('')
while True:
    s.append(n % 26-1)
    n = int(n/26)
    c += 1
    if n == 1 or n == 0:
        s.append(n-1)
        break
name = ''
for i in range(c, -1, -1):
    name += a[s[i]]
print(name)

Submission status: Wrong Answer

Solution code:
import sys
import string
sys.setrecursionlimit(2147483647)

def main():
  arr = []
  N = int(input())
  while(N > 0):
    arr.append(N%26)
    N = N//26
  ans = ''
  for a in arr:
    ans += string.ascii_lowercase[a-1]
  print(ans)


if __name__=='__main__':
  main()

Submission status: Wrong Answer

Solution code:
N=int(input())
keta=0
n=N
ketakari=0
while(1):
    keta+=1
    ketakari+=26**keta
    if N<=ketakari:
        break
for j in range(1,keta):
    N-=26**j
ans=""
#print(keta)
#print(ans)
print(N)
N-=1
for i in range(keta):
    kari=N%26
    ans=chr(ord("a")+kari)+ans
    N//=26
print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
keta=0
n=N
ketakari=0
while(1):
    keta+=1
    ketakari+=26**keta
    if N<=ketakari:
        break
for j in range(1,keta):
    N-=26**j
ans=("a"*keta)
#print(keta)
#print(ans)
#print(N)
N-=1
for i in range(keta):
    kari=N%26
    ans=ans[:keta-1-i]+chr(ord("a")+kari)+ans[keta-i:]
    if N<=26:
        break
    N//=26
print(ans)

Submission status: Wrong Answer

Solution code:
def num_to_str(N):
    # Nが26の何桁になるかをcheck(N^a)
    a = 0
    while True:
        if N > 26 ** a:
            a += 1
        else:
            break
#     print(f"a: {a}")
    
    # x1 * (26 ** a) + x2 * (26 ** (a-1)) + ... + xa * (26 ** 0)
    x_list = []
    if a == 1 or a == 0:
        x_list = [N]
    else:
        for i in range(1, a):
#           print("N:", N)
            b = a - i
            x_i = N // 26 ** b
            x_0 = N % 26 ** b
            
            x_list.append(x_i)
            N -= x_i * 26 ** b
        x_list.append(x_0)
#     print(f"x_list1: {x_list}")
    x_list2 = x_list.copy()
    for i, n in enumerate(x_list):
        if n == 0:
            x_list2[i - 1] += -1
            x_list2[i] = 26
#     print(f"x_list2: {x_list2}")
    
    ans = ""
    for n in x_list2:
        n2 = ord("a") + n - 1
        ans += chr(n2)
    
    return ans
n_input = int(input())
print(num_to_str(n_input))

Submission status: Wrong Answer

Solution code:
N=int(input())
ans=""
while(N!=0):
    if N%26==0:
        ans="z"+ans
    else:
        kari=N%26
        ans=chr(ord("a")+kari-1)+ans
    if N<=26:
        break
    N//=26
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def print_ans(num):
#     num = int(input())
    base = 26

    checker = True
    ind = 1
    while checker:
        if num > base ** ind:
            ind += 1
        else:
            checker = False
            ind -= 1

    pre_ans_num = []
    for i in range(ind):
        ind_2 = ind - i
        quot = num // base ** ind_2
        pre_ans_num.append(quot)
        num = num % base ** ind_2
    pre_ans_num.append(num)

    
    pre_ans_num2 = pre_ans_num.copy()
    for i , ans_num in enumerate(pre_ans_num):
        if ans_num == 0:
        	pre_ans_num2[i - 1] += -1
    
    ans = ""
    for n in pre_ans_num2:
        if n==0:
            ans += "z"
        else:
            order = ord("a") + n - 1
            ans += chr(order)

    print(ans)
    
a = int(input())
print_ans(a)

Submission status: Wrong Answer

Solution code:
def print_ans(num):
#     num = int(input())
    base = 26

    checker = True
    ind = 1
    while checker:
        if num > base ** ind:
            ind += 1
        else:
            checker = False
            ind -= 1

    pre_ans_num = []
    for i in range(ind):
        ind_2 = ind - i
        quot = num // base ** ind_2
        pre_ans_num.append(quot)
        num = num % base ** ind_2
    pre_ans_num.append(num)

    ans = ""
    
#     print(pre_ans_num)
    pre_ans_num2 = pre_ans_num.copy()
    for i , ans_num in enumerate(pre_ans_num):
#         print(i, ans_num)
        pre_ans_num2[i - 1] += -1
        
    for n in pre_ans_num2:
        if n==0:
            ans += "z"
        else:
            order = ord("a") + n - 1
            ans += chr(order)

    print(ans)
    
a = int(input())
print_ans(a)

Submission status: Wrong Answer

Solution code:
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce


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


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


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


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


def ZIP(n): return zip(*(MAP() for _ in range(n)))


sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def main():
    N = INT()
    name = []
    while (N > 25):
        name.append(N%26)
        N = N // 26
    name.append(N)
    name = list(reversed(name))
    name = [chr((x-1)%26 + 97) for x in name]
    
    
    print("".join(name))




if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

alp = 'abcdefghijklmnopqrstuvwxyz'

while N:
    ans.append(alp[(N-1)%26])
    N //= 26

print(''.join(map(str, ans[::-1])))

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = []
while x>0:
	tmp = x%26
	ans.append(tmp)
	x -= tmp
	x //= 26

l = len(ans)
for i in range(l-1):
	if ans[l-i-1]==0:
		print('z',end="")
	else:
		print(chr(ord('a')+ans[l-i-1]-1),end="")

if ans[0]==0:
	print('z')
else:
	print(chr(ord('a')+ans[0]-1))