problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02629 | import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
if row <= 0:
... | import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
if row <= 0:
... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 341,626 | 341,627 | u508486691 | python |
p02629 | N = int(input())
def base10to(n, b):
if n // b:
return base10to(n // b - 1, b) + ',' + str(n % b)
return str(n % b)
res_26 = base10to(N - 1, 26)
print(res_26)
res = []
for s in res_26.split(','):
res.append(chr(97 + int(s)))
print(''.join(res))
| N = int(input())
def base10to(n, b):
if n // b:
return base10to(n // b - 1, b) + ',' + str(n % b)
return str(n % b)
res_26 = base10to(N - 1, 26)
res = []
for s in res_26.split(','):
res.append(chr(97 + int(s)))
print(''.join(res)) | [
"call.remove"
] | 341,628 | 341,629 | u345389118 | python |
p02629 | number = int(input())
alphabet = [chr(i) for i in range(97, 97+26)]
name_tag = []
while number > 0:
number, a = divmod(number, 26)
name_tag.append(a)
reverse_name_tag = reversed(name_tag)
for i in reverse_name_tag:
print(alphabet[i-1], end="") | number = int(input())
alphabet = [chr(i) for i in range(97, 97+26)]
name_tag = []
while number > 0:
number, a = divmod(number-1, 26)
name_tag.append(a)
reverse_name_tag = reversed(name_tag)
for i in reverse_name_tag:
print(alphabet[i], end="")
| [
"expression.operation.binary.remove"
] | 341,630 | 341,631 | u552533086 | python |
p02629 | number = int(input())
alphabet = [chr(i) for i in range(97, 97+26)]
name_tag = []
while number != 0:
number, a = divmod(number-1, 26)
name_tag.append(a)
reverse_name_tag = reversed(name_tag)
for i in reverse_name_tag:
print(alphabet[i-1], end="") | number = int(input())
alphabet = [chr(i) for i in range(97, 97+26)]
name_tag = []
while number > 0:
number, a = divmod(number-1, 26)
name_tag.append(a)
reverse_name_tag = reversed(name_tag)
for i in reverse_name_tag:
print(alphabet[i], end="")
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"expression.operation.binary.remove"
] | 341,632 | 341,631 | u552533086 | python |
p02629 | number = int(input())
alphabet = [chr(i) for i in range(97, 97+26)]
name_tag = []
while number != 0:
number, a = divmod(number, 26)
name_tag.append(a)
reverse_name_tag = reversed(name_tag)
for i in reverse_name_tag:
print(alphabet[i-1], end="") | number = int(input())
alphabet = [chr(i) for i in range(97, 97+26)]
name_tag = []
while number > 0:
number, a = divmod(number-1, 26)
name_tag.append(a)
reverse_name_tag = reversed(name_tag)
for i in reverse_name_tag:
print(alphabet[i], end="")
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"expression.operation.binary.remove"
] | 341,633 | 341,631 | u552533086 | python |
p02629 | import string
alphabets = "abcdefghijklmnopqrstuvwxyz"
n = 26
ans = ''
tmp = int(input())
while tmp >= n:
tmp -= 1
idx = tmp % n
ans = alphabets[idx] + ans
tmp //= n
print(ans)
| import string
alphabets = "abcdefghijklmnopqrstuvwxyz"
n = 26
ans = ''
tmp = int(input())
while tmp > 0:
tmp -= 1
idx = tmp % n
ans = alphabets[idx] + ans
tmp //= n
print(ans)
| [] | 341,634 | 341,635 | u620944332 | python |
p02629 | def main():
n = int(input())
ascii_lowercase = 'zabcdefghijklmnopqrstuvwxy'
s = ''
while n>0:
i = n % 26
s += ascii_lowercase[i]
n = n // 26
out = s[::-1]
print(out)
main() | def main():
n = int(input())
ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
s = ''
while n>0:
n -= 1
i = n % 26
s += ascii_lowercase[i]
n = n // 26
out = s[::-1]
print(out)
main() | [
"literal.string.change",
"assignment.value.change"
] | 341,636 | 341,637 | u571395477 | python |
p02629 | n = int(input())
ans = ''
for i in range(1,99):
if n <= 26**i:
n -= 1
for j in range(i):
ans += chr(ord('a')+N%26)
n //= 26
break
else:
n -= 26**i
print(ans[::-1]) | n = int(input())
ans = ''
for i in range(1,99):
if n <= 26**i:
n -= 1
for j in range(i):
ans += chr(ord('a')+n%26)
n //= 26
break
else:
n -= 26**i
print(ans[::-1]) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 341,640 | 341,641 | u513858037 | python |
p02629 | n = int(input())
dic_items = {0:'a',1:'b',2:'c',3:'d',4:'e',5:'f',6:'g',7:'h',8:'i',9:'j',10:'k'\
,11:'l',12:'m',13:'n',14:'o',15:'p',16:'q',17:'r',18:'s'
,19:'t',20:'u',21:'v',22:'w',23:'x',24:'y',25:'z'}
ans = []
while n != 0:
ans.append(n%26)
n = n//26
for i in range(len(ans)):
print(... | n = int(input())
dic_items = {0:'a',1:'b',2:'c',3:'d',4:'e',5:'f',6:'g',7:'h',8:'i',9:'j',10:'k'\
,11:'l',12:'m',13:'n',14:'o',15:'p',16:'q',17:'r',18:'s'
,19:'t',20:'u',21:'v',22:'w',23:'x',24:'y',25:'z'}
ans = []
while n != 0:
n -= 1
ans.append(n%26)
n = n//26
for i in range(len(ans)):... | [
"expression.operation.binary.remove"
] | 341,650 | 341,651 | u903148768 | python |
p02629 | N = int(input())
ans = []
while N > 26:
if N % 26 == 0:
ans.append(chr(122))
N = N // 26-1
else:
ans.insert(0,chr(N%26+96))
N = N // 26
ans.insert(0,chr(N+96))
print("".join(ans)) | N = int(input())
ans = []
while N > 26:
if N % 26 == 0:
ans.insert(0,chr(122))
N = N // 26-1
else:
ans.insert(0,chr(N%26+96))
N = N // 26
ans.insert(0,chr(N+96))
print("".join(ans)) | [
"identifier.change",
"call.arguments.add"
] | 341,661 | 341,662 | u813890414 | python |
p02629 | N = int(input())
alphabet = "zabcdefghijklmnopqrstuvwxy"
num = N
cnt = 0
div = 26
res = ""
while True:
# print(num, div)
sho = num // div
amari = num % div
# print(sho, amari, alphabet[amari])
# print("--")
res += alphabet[amari]
if amari != 0:
num = sho
else:
num = sho
div += 1
if sho == ... | N = int(input())
alphabet = "zabcdefghijklmnopqrstuvwxy"
num = N
cnt = 0
div = 26
res = ""
while True:
# print(num, div)
sho = num // div
amari = num % div
# print(sho, amari, alphabet[amari])
# print("--")
res += alphabet[amari]
if amari != 0:
num = sho
else:
num = sho -1
if sho == 0:
bre... | [
"assignment.value.change"
] | 341,665 | 341,666 | u074687136 | python |
p02629 | N = int(input())
s = ""
words = "abcdefghijklmnopqrstuvwxyz"
while N > 0:
if N%26 == 0:
amari = 26
else:
amari = N%26
if N > 26:
N = (N-N%26)/26
else:
N = N-26
s = words[int(amari-1)]+s
print(s) | N = int(input())
s = ""
words = "abcdefghijklmnopqrstuvwxyz"
while N > 0:
if N%26 == 0:
amari = 26
else:
amari = N%26
if N > 26:
N = (N-amari)/26
else:
N = N-26
s = words[int(amari-1)]+s
print(s) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 341,679 | 341,680 | u601426916 | python |
p02629 | x = int(input())
alphbet = lambda c: chr(c+64)
def Base_10_to_n(X, n):
X_dumy = X
out = []
while X_dumy > 0:
if X_dumy % n == 0:
out.append( 26 )
X_dumy = int(X_dumy / n - 1)
print(X_dumy)
else:
out.append( X_dumy % n )
X_dumy = int(X_dumy / n)
retur... | x = int(input())
alphbet = lambda c: chr(c+64)
def Base_10_to_n(X, n):
X_dumy = X
out = []
while X_dumy > 0:
if X_dumy % n == 0:
out.append( 26 )
X_dumy = int(X_dumy / n - 1)
else:
out.append( X_dumy % n )
X_dumy = int(X_dumy / n)
return out
if 1 <= x <= 100... | [
"call.remove"
] | 341,681 | 341,682 | u694536861 | python |
p02629 | n = int(input())
ans = ''
while True:
q, mod = divmod(n, 26)
if mod == 0:
ans = 'z' + ans
else:
ans = (chr(ord('a') + mod-1)) + ans
if q == 0:
break
else:
n = q
print(ans)
| n = int(input())
ans = ''
while True:
q, mod = divmod(n, 26)
if mod == 0:
ans = 'z' + ans
q -= 1
else:
ans = (chr(ord('a') + mod-1)) + ans
if q == 0:
break
else:
n = q
print(ans)
| [] | 341,685 | 341,686 | u058592821 | python |
p02629 | num = int(input())
strng = ""
while num >= 1 :
kalan = num % 26
if(kalan==0):
strng = "z" +strng
else:
strng = chr(96+kalan)+strng
num = num // 26
print(strng) | num = int(input())
strng = ""
while num >= 1 :
kalan = num % 26
if(kalan==0):
strng = "z" +strng
else:
strng = chr(96+kalan)+strng
num-=1
num = num // 26
print(strng) | [] | 341,687 | 341,688 | u830982516 | python |
p02629 | n=int(input())
al=[chr(ord('a') + i) for i in range(26)]
sakai=[]
k=0
for i in range(10):
k+=26**(i+1)
sakai.append(k)
if n<=26:
n-=1
u=1
elif n>sakai[9]:
n-=sakai[9]+1
u=11
for i in range(9):
if (sakai[i]<n<=sakai[i+1]):
n-=sakai[i]+1
u=i+2
def base(n):
ans=[]
while(n>26):
r=n%26
n=... | n=int(input())
al=[chr(ord('a') + i) for i in range(26)]
sakai=[]
k=0
for i in range(10):
k+=26**(i+1)
sakai.append(k)
if n<=26:
n-=1
u=1
elif n>sakai[9]:
n-=sakai[9]+1
u=11
for i in range(9):
if (sakai[i]<n<=sakai[i+1]):
n-=sakai[i]+1
u=i+2
def base(n):
ans=[]
while(n>=26):
r=n%26
n... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 341,691 | 341,692 | u404639509 | python |
p02629 | n = int(input()) - 1
num = 1
while 26**num < n:
n -= 26**num
num += 1
r = []
while 25 < n:
r.append(n % 26)
n //= 26
r.append(n)
if len(r) < num:
for i in range(num - len(r)):
r.append(0)
for i in r[::-1]:
print(chr(97+i), end='') | n = int(input()) - 1
num = 1
while 26**num <= n:
n -= 26**num
num += 1
r = []
while 25 < n:
r.append(n % 26)
n //= 26
r.append(n)
if len(r) < num:
for i in range(num - len(r)):
r.append(0)
for i in r[::-1]:
print(chr(97+i), end='') | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 341,709 | 341,710 | u872538555 | python |
p02629 | 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)
n=int(input())
print(num2alpha(n))
| def num2alpha(num):
if num<=26:
return chr(96+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(122)
else:
return num2alpha(num//26)+chr(96+num%26)
n=int(input())
print(num2alpha(n))
| [
"literal.number.integer.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 341,711 | 341,712 | u375681664 | python |
p02629 | n = int(input())
su=[26**i for i in range(1,20)]
from itertools import accumulate
wa = list(accumulate(su))
import bisect
c = 0
n = n-1
if n>26:
c=bisect.bisect_left(wa, n)
n=n-wa[c-1]
m = n
k=26
bi=[]
for i in range(c+1):
bi.append(n % k)
n = (n-n%k)//k
print(bi)
al=[chr(ord('a') + i) for i ... | n = int(input())
su=[26**i for i in range(1,20)]
from itertools import accumulate
wa = list(accumulate(su))
import bisect
c = 0
n = n-1
if n>26:
c=bisect.bisect_left(wa, n)
n=n-wa[c-1]
m = n
k=26
bi=[]
for i in range(c+1):
bi.append(n % k)
n = (n-n%k)//k
al=[chr(ord('a') + i) for i in ... | [
"call.remove"
] | 341,722 | 341,723 | u836311327 | python |
p02629 | n = int(input())
def num2alpha(num):
if num<=26:
return chr(64+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(64+num%26)
x = num2alpha(n)
print(x.upper()) | n = int(input())
def num2alpha(num):
if num<=26:
return chr(64+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(64+num%26)
x = num2alpha(n)
print(x.lower()) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 341,732 | 341,733 | u456173883 | python |
p02629 |
def C():
import math
n= int(input())
counter = 0
for i in range(1,13):
if int(26*(pow(26,i-1))/(26-1)) <= n < int(26*(pow(26,i))/(26-1)):
counter = i
break
kekka = n - int(26*(pow(26,counter-1))/(26-1))
alplist=["a","b","c","d","e","f","g","h","i","j","k","l","... |
def C():
import math
n= int(input())
counter = 0
for i in range(1,13):
if int(26*(pow(26,i-1))/(26-1)) <= n < int(26*(pow(26,i))/(26-1)):
counter = i
break
kekka = n - int(26*(pow(26,counter-1))/(26-1))
alplist=["a","b","c","d","e","f","g","h","i","j","k","l","... | [
"call.remove"
] | 341,748 | 341,749 | u050622763 | python |
p02629 | n = int(input())
s = ""
t = 26
c = ['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']
while n > 0:
s += c[int(n%t)]
n //= 26
print(s[::-1]) | n = int(input())
s = ""
t = 26
c = ['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']
while n > 0:
s += c[int(n%t)]
n -= 1
n //= 26
print(s[::-1])
| [] | 341,756 | 341,757 | u628047647 | python |
p02629 | s=int(input())-1
d=[]
while s>0:
d.append(chr(s%26+97))
s//=26
t=''
for i in reversed(d):
t+=i
print(t) | s=int(input())-1
d=[]
while s>=0:
d.append(chr(s%26+97))
s//=26
s-=1
t=''
for i in reversed(d):
t+=i
print(t) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 341,758 | 341,759 | u035885928 | python |
p02629 | n=int(input())
while n>=0:
n=n-1 ##for tracking last character
z+= chr( n%26 + ord('a') )
n=n//26
print(z[::-1])
| n=int(input())
z=""
while n>0:
n=n-1 ##for tracking last character
z+= chr( n%26 + ord('a') )
n=n//26
print(z[::-1])
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 341,764 | 341,765 | u153427406 | python |
p02629 | n=int(input())-1
ans=''
last=0
keta=1
while True:
if last+26**keta>n:
for i in range(keta):
idx=n%26
n//=26
ans+=chr(97+idx)
break
n-=26**keta
keta+=1
print(ans) | n=int(input())-1
ans=''
last=0
keta=1
while True:
if last+26**keta>n:
for i in range(keta):
idx=n%26
n//=26
ans+=chr(97+idx)
break
n-=26**keta
keta+=1
print(ans[::-1]) | [] | 341,766 | 341,767 | u211706121 | python |
p02629 | alphabet = 'aabcdefghijklmnopqrstuvwxyz'
N =int(input())
name = ''
while N > 0:
n = N % 26
N = N//26
if n == 0:
name += 'z'
else:
name += alphabet[n]
new_name = name[::-1]
print(new_name)
| alphabet = 'aabcdefghijklmnopqrstuvwxy'
N =int(input())
name = ''
while N > 0:
n = N % 26
N = N // 26
if n == 0:
name += 'z'
N = N-1
else:
name += alphabet[n]
new_name = name[::-1]
print(new_name) | [
"literal.string.change",
"assignment.value.change"
] | 341,787 | 341,788 | u756311765 | python |
p02629 | N = int(input())
l = []
while N:
l.append(chr(96+(N % 26)))
N //= 26
print("".join(l[::-1])) | N = int(input())
l = []
while N:
N -= 1
l.append(chr(97+(N % 26)))
N //= 26
print("".join(l[::-1])) | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 341,795 | 341,796 | u690536347 | python |
p02629 | num = int(input())
num2alpha = lambda c: chr(c+96)
ans = []
newans = []
string = ''
while num > 0:
if num % 26 == 0:
ans.append(26)
else:
ans.append(num%26)
if num < 27:
break
num = int(int(num) / 26)
for item in ans:
newans.append(num2alpha(item))
for item in rever... | num = int(input())
num2alpha = lambda c: chr(c+96)
ans = []
newans = []
string = ''
while num > 0:
if num % 26 == 0:
ans.append(26)
else:
ans.append(num%26)
if num < 27:
break
num = int((int(num) - 1) / 26)
for item in ans:
newans.append(num2alpha(item))
for item in... | [
"call.arguments.change"
] | 341,797 | 341,798 | u376752722 | python |
p02629 | from sys import stdin
def Base_10_to_n(X, n):
if X == 26:
return "z"
alpha = "zabcdefghijklmnopqrstuvwxy"
X_dumy = X
out = ''
while X_dumy>0:
amari = X_dumy%n
if amari == 0:
new = alpha[amari]
out = new+out
X_dumy = int(X_dumy/n)-1
... | from sys import stdin
def Base_10_to_n(X, n):
if X == 26:
return "z"
alpha = "zabcdefghijklmnopqrstuvwxy"
X_dumy = X
out = ''
while X_dumy>0:
amari = X_dumy%n
if amari == 0:
new = alpha[amari]
out = new+out
X_dumy = int(X_dumy/n)-1
... | [
"assignment.remove"
] | 341,799 | 341,800 | u355078864 | python |
p02629 | a = "zabcdefghijklmnopqrstuvwxy"
number = int(input())
result = ""
for i in range(13):
result += a[int(number % 26)]
if number % 26 == 0:
number -= 26
if number // 26 == 0:
break
number /= 26
result = result[::-1]
print(result) | a = "zabcdefghijklmnopqrstuvwxy"
number = int(input())
result = ""
for i in range(13):
result += a[int(number % 26)]
if number % 26 == 0:
number -= 26
if number // 26 == 0:
break
number = number // 26
result = result[::-1]
print(result) | [
"assignment.value.change"
] | 341,809 | 341,810 | u743682467 | python |
p02629 | import string
def main():
alpha = string.ascii_lowercase
def to_n(X, n, list_=[]):
X_dumy = X
while X_dumy > 0:
list_.insert(0, X_dumy % n)
X_dumy = int(X_dumy/n)
return list_
N = int(input())
res = N
counter = 0
while res > 0:
counter += 1
res -= 26**counter
res += 26... | import string
def main():
alpha = string.ascii_lowercase
def to_n(X, n, list_=[]):
X_dumy = X
while X_dumy > 0:
list_.insert(0, X_dumy % n)
X_dumy = int(X_dumy/n)
return list_
N = int(input())
res = N
counter = 0
while res > 0:
counter += 1
res -= 26**counter
res += 26... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 341,817 | 341,818 | u522140891 | python |
p02629 | n = int(input())
s = "abcdefghijklmnopqrstuvwxyz"
l = [26]
for i in range(2, 14):
a = 26 ** (i) + l[i-2]
l.append(a)
idx = 0
while True:
if n <= l[idx]:
break
idx += 1
if idx == 0:
print(s[idx-1])
exit()
q = n - l[idx-1] - 1
ll = []
for j in range(idx+1):
q, mod = divmod(q, 26)
... | n = int(input())
s = "abcdefghijklmnopqrstuvwxyz"
l = [26]
for i in range(2, 14):
a = 26 ** (i) + l[i-2]
l.append(a)
idx = 0
while True:
if n <= l[idx]:
break
idx += 1
if idx == 0:
print(s[n-1])
exit()
q = n - l[idx-1] - 1
ll = []
for j in range(idx+1):
q, mod = divmod(q, 26)
... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 341,825 | 341,826 | u129325056 | python |
p02629 | a=int(input())
s=0
d=1
si=[]
while a>0:
b=a%26
si.append(b)
a=a//26
if b==0:
a-=1
c=""
for i in si:
if i==0:
i=26
c+=chr(i+96)
c=c[::-1]
print(c)
print(si) | a=int(input())
s=0
d=1
si=[]
while a>0:
b=a%26
si.append(b)
a=a//26
if b==0:
a-=1
c=""
for i in si:
if i==0:
i=26
c+=chr(i+96)
c=c[::-1]
print(c) | [
"call.remove"
] | 341,829 | 341,830 | u771538568 | python |
p02629 | n = int(input())
ans = []
s == 0
while 1:
if s == 1 and n < 1:
break
s = 1
if n%26 == 0:
ans.append(0)
else:
ans.append(n%26)
n -= n%26
n = n//26
for i in range(len(ans)):
if i != len(ans)-1:
if ans[i] <= 0:
ans[i+1] -= 1
ans[i] += 26
... | n = int(input())
ans = []
s = 0
while 1:
if s == 1 and n < 1:
break
s = 1
if n%26 == 0:
ans.append(0)
else:
ans.append(n%26)
n -= n%26
n = n//26
for i in range(len(ans)):
if i != len(ans)-1:
if ans[i] <= 0:
ans[i+1] -= 1
ans[i] += 26
... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 341,839 | 341,840 | u614181788 | python |
p02629 |
import math
alphabets = [chr(i) for i in range(97, 97+26)]
N = int(input())
def run(n):
a = 0
for i in range(1, 12):
if math.pow(26, i) >= n:
break
n -= int(math.pow(26, i))
ans = ''
for j in range(i-1):
b = n // int(math.pow(26, i-j-1))
amari = n % int(m... | import math
alphabets = [chr(i) for i in range(97, 97+26)]
N = int(input())
def run(n):
a = 0
for i in range(1, 12):
if math.pow(26, i) >= n:
break
n -= int(math.pow(26, i))
ans = ''
for j in range(i-1):
b = n // int(math.pow(26, i-j-1))
amari = n % int(ma... | [
"control_flow.loop.for.condition.change"
] | 341,856 | 341,857 | u536781361 | python |
p02629 | n = int(input())
def nume(num):
if num<=26:
return chr(96+num)
elif num%26==0:
return nume(num//26-1)+chr(126)
else:
return nume(num//26)+chr(96+num%26)
print(nume(n)) | n = int(input())
def nume(num):
if num<=26:
return chr(96+num)
elif num%26==0:
return nume(num//26-1)+chr(122)
else:
return nume(num//26)+chr(96+num%26)
print(nume(n)) | [
"literal.number.integer.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 341,860 | 341,861 | u342563578 | python |
p02629 | N = int(input())
ans=''
while True:
n = (N-1)%26
ans = chr(n+64+1) + ans
N = N//26
if N == 0: break
print(ans.lower()) | N = int(input())
ans=''
while True:
n = (N-1)%26
ans = chr(n+64+1) + ans
N = (N-1)//26
if N == 0: break
print(ans.lower())
| [] | 341,863 | 341,864 | u882831132 | python |
p02629 | n = int(input())
s = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
while n > 0:
q, r = divmod(n, 26)
ans += s[r-1]
n = q
print(ans[::-1]) | n = int(input())
s = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
while n > 0:
n -= 1
q, r = divmod(n, 26)
ans += s[r]
n = q
print(ans[::-1]) | [
"expression.operation.binary.remove"
] | 341,869 | 341,870 | u996262044 | python |
p02629 | def main():
n = int(input())
A = list("zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz")
beki = [0, 26, 702, 18278, 475254, 12356630, 321272406, 8353082582, 217180147158, 5646683826134, 146813779479510, 3817158266467286]
ika = 0
for i in range(12):
if n <= beki[i]:
ika = i... | def main():
n = int(input())
A = list("zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz")
beki = [0, 26, 702, 18278, 475254, 12356630, 321272406, 8353082582, 217180147158, 5646683826134, 146813779479510, 3817158266467286]
ika = 0
for i in range(12):
if n <= beki[i]:
ika = i... | [
"call.remove"
] | 341,871 | 341,872 | u414458988 | python |
p02629 | N = int(input())
cnt = 1
a = ord("a")
while True:
if N <= 26**cnt:
N -= 1
ans = []
while 0 < N:
ans.append(N%26)
N //= 26
print("a"*(cnt-len(ans)),end="")
for i in range(len(ans)-1,-1,-1):
print(chr(a+ans[i]),end="")
print()
... | N = int(input())
cnt = 1
a = ord("a")
while True:
if N <= 26**cnt:
N -= 1
ans = []
while 0 < N:
ans.append(N%26)
N //= 26
print("a"*(cnt-len(ans)),end="")
for i in range(len(ans)-1,-1,-1):
print(chr(a+ans[i]),end="")
print()
... | [
"call.remove"
] | 341,875 | 341,876 | u441575327 | python |
p02629 | def run(n):
'''
'''
_base_array = string.ascii_lowercase
results = []
while n > 0:
results.append(_base_array[n%26 - 1])
if n%26 == 0:
n = n//26 - 1
continue
n = n//26
print(''.join(results[::-1]))
if __name__ == '__main__':
n = int(input()... | import string
def run(n):
'''
'''
_base_array = string.ascii_lowercase
results = []
while n > 0:
results.append(_base_array[n%26 - 1])
if n%26 == 0:
n = n//26 - 1
continue
n = n//26
print(''.join(results[::-1]))
if __name__ == '__main__':
... | [] | 341,877 | 341,878 | u835095496 | python |
p02629 | def num2alpha(num):
if num<=26:
return chr(96+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(96+num%26)
N=int(input())
print(num2alpha(N)) | 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)
N=int(input())
print(num2alpha(N).lower()) | [
"literal.number.integer.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"call.add"
] | 341,916 | 341,917 | u765721093 | python |
p02629 | N=int(input())
abclist=[]
for a in 'abcdefghijklmnopqrstuvwxyz':
abclist.append(a)
k=0
n=N
alist=[]
while n>0:
amari=n%26
if amari==0:
n=n//26-1
else:
n=n//26
alist.append(amari)
print(alist)
name=''
for a in alist:
name=abclist[a-1]+name
print(name)
| N=int(input())
abclist=[]
for a in 'abcdefghijklmnopqrstuvwxyz':
abclist.append(a)
k=0
n=N
alist=[]
while n>0:
amari=n%26
if amari==0:
n=n//26-1
else:
n=n//26
alist.append(amari)
#print(alist)
name=''
for a in alist:
name=abclist[a-1]+name
print(name)
| [
"call.remove"
] | 341,924 | 341,925 | u336968242 | python |
p02629 | N = int(input())
k = list()
while(N >= 27):
a = int(N%26)
if a==0:
a =26
k.insert(0,a)
N = (N-a)/26
k.insert(0,int(N))
ans = str()
for i in range(len(k)):
x = k[i] + 64 +32
ans = ans + str(chr(x))
print(k)
print(ans) | N = int(input())
k = list()
while(N >= 27):
a = int(N%26)
if a==0:
a =26
k.insert(0,a)
N = (N-a)/26
k.insert(0,int(N))
ans = str()
for i in range(len(k)):
x = k[i] + 64 +32
ans = ans + str(chr(x))
#print(k)
print(ans) | [
"call.remove"
] | 341,926 | 341,927 | u849341325 | python |
p02629 | 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)
n=int(input())
p=num2alpha(n)
p=p.lower()
p | 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)
n=int(input())
p=num2alpha(n)
p=p.lower()
print(str(p)) | [
"call.add",
"call.arguments.add"
] | 341,930 | 341,931 | u887152994 | python |
p02629 | N = int(input())
ans = []
alp = 'abcdefghijklmnopqrstuvwxyz'
def dfs(N):
n, r = divmod(N, 26)
ans.append(alp[r-1])
if N <= 26:
return (n, r)
return dfs(n)
dfs(N)
print("".join(ans[::-1]))
| N = int(input())
ans = []
alp = 'abcdefghijklmnopqrstuvwxyz'
def dfs(N):
n, r = divmod(N-1, 26)
ans.append(alp[r])
if N <= 26:
return (n, r)
return dfs(n)
dfs(N)
print("".join(ans[::-1]))
| [
"expression.operation.binary.remove"
] | 341,932 | 341,933 | u761087127 | python |
p02629 | def resolve():
N = int(input())
N_to_str = ""
alphabet_list = "abcdefghijklmnopqrstuvwxyz"
while N > 0:
N_to_str=alphabet_list[N%26-1]+N_to_str
N = (N-N%26)//26
print(N_to_str)
if __name__ == "__main__":
resolve()
|
def resolve():
N = int(input())
N_to_str = ""
alphabet_list = "zabcdefghijklmnopqrstuvwxyz"
# N -= 1
while N > 0:
N-=1
N_to_str=alphabet_list[N%26+1]+N_to_str
# if N==26:
# break
N = (N-N%26)//26
print(N_to_str)
if __name__ == "__main__":
resolve() | [
"literal.string.change",
"assignment.value.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 341,959 | 341,960 | u805332733 | python |
p02629 | import string
N = int(input())
char_list = string.ascii_lowercase
char_list = char_list[:-1]
char_list = 'z' + char_list
tmp = 0
count = 0
ans = ''
while 1:
before = tmp
count += 1
tmp += 26**count
if before < N <= tmp:
tmp = N
while 1:
ans = char_list[tmp%26] + ans
... | import string
N = int(input())
char_list = string.ascii_lowercase
char_list = char_list[:-1]
char_list = 'z' + char_list
tmp = 0
count = 0
ans = ''
while 1:
before = tmp
count += 1
tmp += 26**count
if before < N <= tmp:
tmp = N
while 1:
ans = char_list[tmp%26] + ans
... | [] | 341,965 | 341,966 | u427819770 | python |
p02629 | import string
N = int(input())
char_list = string.ascii_lowercase
char_list = char_list[:-1]
char_list = 'z' + char_list
tmp = 0
count = 0
ans = ''
while 1:
before = tmp
count += 1
tmp += 26**count
if before < N <= tmp:
tmp = N
while 1:
ans = char_list[tmp%26] + ans
... | import string
N = int(input())
char_list = string.ascii_lowercase
char_list = char_list[:-1]
char_list = 'z' + char_list
tmp = 0
count = 0
ans = ''
while 1:
before = tmp
count += 1
tmp += 26**count
if before < N <= tmp:
tmp = N
while 1:
ans = char_list[tmp%26] + ans
... | [] | 341,967 | 341,966 | u427819770 | python |
p02629 | 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)
num = int(input())
answer = num2alpha(num)
print(answer) | 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)
num = int(input())
answer = num2alpha(num)
print(answer.lower()) | [
"call.add",
"call.arguments.change"
] | 341,972 | 341,973 | u504856568 | python |
p02629 | N = int(input())
# N = 1000000000000001
alphabet = [chr(ord('a') + i) for i in range(26)]
resid = []
while(True):
q, mod = divmod(N, 26)
resid.append(mod)
if(q == 0):
break
N = q
# print(resid)
for i in range(len(resid)):
e = resid.pop()
print(alphabet[e-1], end = "")
print(""... | N = int(input())
# N = 1000000000000001
alphabet = [chr(ord('a') + i) for i in range(26)]
resid = []
while(True):
q, mod = divmod(N - 1, 26)
resid.append(mod)
if(q == 0):
break
N = q
# print(resid)
for i in range(len(resid)):
e = resid.pop()
print(alphabet[e], end = "")
print(... | [
"expression.operation.binary.remove"
] | 341,974 | 341,975 | u790487011 | python |
p02629 | def num2alpha(num):
if num<=26:
return chr(64+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(64+num%26)
num2alpha(int(input())).lower() | 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)
print(num2alpha(int(input())).lower()) | [
"call.add",
"call.arguments.change"
] | 341,976 | 341,977 | u480264129 | python |
p02629 | N = int(input())
def num10to26(num):
if num<=26:
return chr(64+num)
elif num%26==0:
return num10to26(num//26-1)+chr(90)
else:
return num10to26(num//26)+chr(64+num%26)
print(num10to26(N)) | N = int(input())
def num10to26(num):
if num<=26:
return chr(64+num)
elif num%26==0:
return num10to26(num//26-1)+chr(90)
else:
return num10to26(num//26)+chr(64+num%26)
print(str.lower(num10to26(N))) | [
"call.arguments.add",
"call.arguments.change"
] | 341,980 | 341,981 | u863879653 | python |
p02629 | n = int(input())
alpha = [chr(x) for x in range(ord('a'), ord('z')+1)]
name = ''
while n:
n -= 1
r = int(n%26)
n = n // 26
print(n, r)
name += alpha[r]
print(name[::-1]) | n = int(input())
alpha = [chr(x) for x in range(ord('a'), ord('z')+1)]
name = ''
while n:
n -= 1
r = int(n%26)
n = n // 26
name += alpha[r]
print(name[::-1]) | [
"call.remove"
] | 341,988 | 341,989 | u771383254 | python |
p02629 | n = int(input())
alpha = [chr(x) for x in range(ord('a'), ord('z')+1)]
name = ''
while n:
r = int(n%26)
n = n // 26
name += alpha[r-1]
print(name[::-1]) | n = int(input())
alpha = [chr(x) for x in range(ord('a'), ord('z')+1)]
name = ''
while n:
n -= 1
r = int(n%26)
n = n // 26
name += alpha[r]
print(name[::-1]) | [
"expression.operation.binary.remove"
] | 341,990 | 341,989 | u771383254 | python |
p02629 | N = int(input())
char = [i for i in range(97, 97+26)]
a_n = 96
base = 26
base_list = []
ans = ''
while N > 0:
add = N % 26
if add==0:
add=26
ans += chr(a_n+add)
N = N // 26
# # base_list += [base]
# # base = base + base*26
# base = 26
# # cumsum = 0
# for b in enumerate(base_list):
# ... | N = int(input())
char = [i for i in range(97, 97+26)]
a_n = 96
base = 26
base_list = []
ans = ''
while N > 0:
add = N % 26
if add==0:
add=26
ans += chr(a_n+add)
N = (N-1) // 26
# # base_list += [base]
# # base = base + base*26
# base = 26
# # cumsum = 0
# for b in enumerate(base_list):... | [] | 342,042 | 342,043 | u108617242 | python |
p02629 | import sys
#sys.exit()
#sorted( ,reverse=True)
N = int(input())
#S,T = map(int, input().split())
#A = list(map(int, input().split()))
#A = [int(input()) for _ in range(N)]
#cnt = 0
#cnt += 1
d=""
dchar ="abcdefghijklmnopqrstuvwxyz"
while N > 0:
d += dchar[N%26-1]
N//=26
print(d[::-1])
#print(N)
#prin... | import sys
#sys.exit()
#sorted( ,reverse=True)
N = int(input())
#S,T = map(int, input().split())
#A = list(map(int, input().split()))
#A = [int(input()) for _ in range(N)]
#cnt = 0
#cnt += 1
d=""
dchar ="abcdefghijklmnopqrstuvwxyz"
while N > 0:
N -= 1
d += dchar[N%26]
N//=26
#print(N%26,N,d)
prin... | [
"expression.operation.binary.remove"
] | 342,058 | 342,059 | u529106146 | python |
p02629 | n = input()
def num2alpha(num):
if num<=26:
return chr(96+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(122)
else:
return num2alpha(num//26)+chr(96+num%26)
print(num2alpha(n)) | n = int(input())
def num2alpha(num):
if num <= 26:
return chr(96 + num)
elif num % 26 == 0:
return num2alpha(num // 26 - 1) + chr(122)
else:
return num2alpha(num // 26) + chr(96 + num % 26)
print(num2alpha(n)) | [
"call.add",
"call.arguments.change"
] | 342,073 | 342,074 | u208512038 | python |
p02629 | def ans(an, n, N, X, x, inx):
N -= inx * x ** (n + 1)
if n == 0:
an += X[N]
return an
an += X[N // x**n]
inx = N // x**n
n -= 1
return ans(an, n, N, X, x, inx)
N = int(input())
X = "abcdefghijklnmopqrstuvwxyz"
an = ""
x = 26
n = 1
inx = 0
while N > x * ((x**n - 1)//(x - 1)):
n += 1
n -= 1
N -= ... | def ans(an, n, N, X, x, inx):
N -= inx * x ** (n + 1)
if n == 0:
an += X[N]
return an
an += X[N // x**n]
inx = N // x**n
n -= 1
return ans(an, n, N, X, x, inx)
N = int(input())
X = "abcdefghijklmnopqrstuvwxyz"
an = ""
x = 26
n = 1
inx = 0
while N > x * ((x**n - 1)//(x - 1)):
n += 1
n -= 1
N -= ... | [
"literal.string.change",
"assignment.value.change"
] | 342,077 | 342,078 | u536034761 | python |
p02629 | bounds = [sum([26 ** i for i in range(n)]) for n in range(1, 11)]
N = int(input())
for b in reversed(bounds):
if b <= N:
break
N -= b
length = bounds.index(b) + 1
s = ''
for i in range(length - 1, 0, -1):
idx, N = divmod(N, 26**i)
s = s + lis[idx]
print(s + lis[N]) | bounds = [sum([26 ** i for i in range(n)]) for n in range(1, 12)]
lis = 'abcdefghijklmnopqrstuvwxyz'
N = int(input())
for b in reversed(bounds):
if b <= N:
break
N -= b
length = bounds.index(b) + 1
s = ''
for i in range(length - 1, 0, -1):
idx, N = divmod(N, 26**i)
s = s + lis[idx]
print(s + lis[N]... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 342,091 | 342,090 | u430937688 | python |
p02629 | n=int(input()) #96
a=""
while n>0:
n-=1
rem=n%26
a+=chr(97+rem)
n=(n-rem)//26
print(a)
| n=int(input()) #96
a=""
while n>0:
n-=1
rem=n%26
a+=chr(97+rem)
n=(n-rem)//26
print(a[::-1])
| [] | 342,092 | 342,093 | u041366730 | python |
p02629 | entierAConvertir = int(input())
baseArrivee= 26
sortie = []
while entierAConvertir>0:
reste = entierAConvertir % baseArrivee
if reste==0:
reste = 26
sortie.append(reste)
entierAConvertir-=reste
entierAConvertir = (entierAConvertir//baseArrivee)
print(sortie)
for i in range(len(sortie)):
print(chr(sorti... | entierAConvertir = int(input())
baseArrivee= 26
sortie = []
while entierAConvertir>0:
reste = entierAConvertir % baseArrivee
if reste==0:
reste = 26
sortie.append(reste)
entierAConvertir-=reste
entierAConvertir = (entierAConvertir//baseArrivee)
for i in range(len(sortie)):
print(chr(sortie[len(sortie)-... | [
"call.remove"
] | 342,110 | 342,111 | u156591744 | python |
p02629 | n = int(input())
def NumToAlpha(n):
if n<=26:
return chr(64+n)
elif n%26==0:
return NumToAlpha(n//26-1)+chr(90)
else:
return NumToAlpha(n//26)+chr(64+n%26)
N = NumToAlpha(n)
print(N) | n = int(input())
def NumToAlpha(n):
if n<=26:
return chr(96+n)
elif n%26==0:
return NumToAlpha(n//26-1)+chr(122)
else:
return NumToAlpha(n//26)+chr(96+n%26)
N = NumToAlpha(n)
print(N) | [
"literal.number.integer.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 342,114 | 342,115 | u039934639 | python |
p02629 | a=[26, 702, 18278, 475254, 12356630, 321272406, 8353082582, 217180147158, 5646683826134, 146813779479510, 3817158266467286]
n=int(input())
k=0
for i in range(10):
if n<=a[i]:
k=i+1
break
else:
k=11
if k==1:
print(chr(n+96))
else:
ans=""
n=n-a[k-2]
for i in range(k):
if i!... | a=[26, 702, 18278, 475254, 12356630, 321272406, 8353082582, 217180147158, 5646683826134, 146813779479510, 3817158266467286]
n=int(input())
k=0
for i in range(10):
if n<=a[i]:
k=i+1
break
else:
k=11
if k==1:
print(chr(n+96))
else:
ans=""
n=n-a[k-2]-1
for i in range(k):
if ... | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 342,118 | 342,119 | u239653493 | python |
p02629 | n = int(input())
nam = ""
flag = True
while(flag):
k = n % 26
if n <= 26: flag = False
if k == 0: k = 26
nam = chr(96 + k) + nam
n = n // 26
print(nam) | n = int(input())
nam = ""
flag = True
while(flag):
k = n % 26
if n <= 26: flag = False
if k == 0: k = 26
nam = chr(96 + k) + nam
n = (n - k) // 26
print(nam) | [] | 342,124 | 342,125 | u283929013 | python |
p02629 | n = int(input())
dicts = {}
dicts[1] = "a"
dicts[2] = "b"
dicts[3] = "c"
dicts[4] = "d"
dicts[5] = "e"
dicts[6] = "f"
dicts[7] = "g"
dicts[8] = "h"
dicts[9] = "i"
dicts[10] = "j"
dicts[11] = "k"
dicts[12] = "l"
dicts[13] = "m"
dicts[14] = "n"
dicts[15] = "o"
dicts[16] = "p"
dicts[17] = "q"
dicts[18] = "r"
dicts[19] = ... | n = int(input())
dicts = {}
dicts[1] = "a"
dicts[2] = "b"
dicts[3] = "c"
dicts[4] = "d"
dicts[5] = "e"
dicts[6] = "f"
dicts[7] = "g"
dicts[8] = "h"
dicts[9] = "i"
dicts[10] = "j"
dicts[11] = "k"
dicts[12] = "l"
dicts[13] = "m"
dicts[14] = "n"
dicts[15] = "o"
dicts[16] = "p"
dicts[17] = "q"
dicts[18] = "r"
dicts[19] = ... | [
"call.remove"
] | 342,130 | 342,131 | u198660978 | python |
p02629 | n = int(input())
def num2alpha(num):
if num<=26:
return chr(64+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(64+num%26)
x = num2alpha(n)
print(x) | n = int(input())
def num2alpha(num):
if num<=26:
return chr(64+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(64+num%26)
X = num2alpha(n)
print(X.swapcase()) | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"io.output.change",
"call.add"
] | 342,178 | 342,179 | u030278108 | python |
p02629 | N = int(input())
n = 26
m = 1
while N > n:
n = n + n * 26
m += 1
e = n
result = ''
for i in range(m):
a = N % 26
if a == 0:
a = 26
result = chr(a + 96) + result
N = (N - a) // 26
print(result) | N = int(input())
n = 26
m = 1
while N > n:
n = n * 26 + 26
m += 1
e = n
result = ''
for i in range(m):
a = N % 26
if a == 0:
a = 26
result = chr(a + 96) + result
N = (N - a) // 26
print(result) | [
"expression.operation.binary.remove"
] | 342,182 | 342,183 | u150664457 | python |
p02629 |
n=int(input())
def num2alpha(num):
if num<=26:
return chr(64+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(64+num%26)
print(num2alpha(n))
| n=int(input())
def num2alpha(num):
if num<=26:
return chr(64+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(64+num%26)
print(num2alpha(n).lower())
| [
"call.add"
] | 342,184 | 342,185 | u734274573 | python |
p02629 | N = int(input())
ans = ''
while N != 0:
ans = chr(N % 26 + 96) + ans
N = N // 26
print(ans) | N = int(input()) - 1
ans = ''
while N >= 0:
ans = chr(N % 26 + 97) + ans
N = N // 26 - 1
print(ans) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 342,186 | 342,187 | u345778634 | python |
p02629 | n = int(input())
alp = [chr(i) for i in range(97, 97+26)]
ans = []
while n != 0 and n != 1:
c = n % 26
ans.insert(0, alp[c-1])
n //= 26
if c == 0:
n -= 1
print("".join(ans)) | n = int(input())
alp = [chr(i) for i in range(97, 97+26)]
ans = []
while n != 0:
c = n % 26
ans.insert(0, alp[c-1])
n //= 26
if c == 0:
n -= 1
print("".join(ans)) | [] | 342,190 | 342,191 | u821989875 | python |
p02629 | n = int(input())
alphabet = list("abcdefghijklmnopqrstuvwxyz")
if n <= 26:
print(alphabet[n-1])
else:
ans = ""
while(True):
q, mod = divmod(n, 26)
if mod == 0:
q -= 1
ans = "z" + ans
else:
ans = alphabet[mod-1] + ans
if q <= 1:
... | n = int(input())
alphabet = list("abcdefghijklmnopqrstuvwxyz")
if n <= 26:
print(alphabet[n-1])
else:
ans = ""
while(True):
q, mod = divmod(n, 26)
if mod == 0:
q -= 1
ans = "z" + ans
else:
ans = alphabet[mod-1] + ans
if q < 1:
b... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 342,194 | 342,195 | u173550659 | python |
p02629 | N = int(input())
ls = ['z','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','z','v','w','x','y']
word = ''
while N != 0:
word = ls[N%26] + word
N = (N-1) // 26
print(word) | N = int(input())
ls = ['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']
word = ''
while N != 0:
word = ls[N%26] + word
N = (N-1) // 26
print(word) | [
"literal.string.change",
"assignment.value.change"
] | 342,212 | 342,213 | u875769753 | python |
p02629 | N=int(input())
def conv_alpha(N):
if N<=26:
return chr(96+N)
elif N%26==0:
return conv_alpha(N//26-1)+chr(90)
else:
return conv_alpha(N//26)+chr(96+N%26)
print(conv_alpha(N))
| N=int(input())
def conv_alpha(N):
if N<=26:
return chr(96+N)
elif N%26==0:
return conv_alpha(N//26-1)+chr(122)
else:
return conv_alpha(N//26)+chr(96+N%26)
print(conv_alpha(N))
| [
"literal.number.integer.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 342,226 | 342,227 | u419481574 | python |
p02629 | alpha = 'abcdefghijklmnopqrstuvwxyz'
N= int(input())
len_alpha = 26
tmp = N
calc = tmp
cnt = 1
while tmp > 0:
calc = tmp
tmp -= (len_alpha **cnt)
cnt += 1
res =''
for i in range(1, cnt - 1):
tmp = int(calc/(len_alpha**(cnt - i - 1)))
calc -= tmp * len_alpha**(cnt - i - 1)
res += alpha[tmp]
re... | alpha = 'abcdefghijklmnopqrstuvwxyz'
N= int(input())
len_alpha = 26
tmp = N
calc = tmp
cnt = 1
while tmp > 0:
calc = tmp
tmp -= (len_alpha **cnt)
cnt += 1
res =''
for i in range(1, cnt - 1):
tmp = int((calc-1)/(len_alpha**(cnt - i - 1)))
calc -= tmp * len_alpha**(cnt - i - 1)
res += alpha[tmp]... | [
"call.arguments.change"
] | 342,232 | 342,233 | u487767879 | python |
p02629 | n = int(input())
e_str = [chr(ord('a') + i) for i in range(26)]
ans = []
while n>0:
i = n % 26
ans.append(e_str[i-1])
n = n// 26
# print(e_str)
# print(ans)
ans.reverse()
a = ''.join(ans)
print(a) | n = int(input())
e_str = [chr(ord('a') + i) for i in range(26)]
ans = []
while n>0:
n -= 1
i = n % 26
# print(i)
ans.append(e_str[i])
n = n// 26
# print(n)
# print(e_str)
# print(ans)
ans.reverse()
a = ''.join(ans)
print(a) | [
"expression.operation.binary.remove"
] | 342,243 | 342,244 | u945157177 | python |
p02629 | n = int(input())-1
x = 26
d = 1
while n > x:
n -= x
d += 1
x *= 26
ans = ""
al = list("abcdefghijklmnopqrstuvwxyz")
tmp = pow(26,d)
for i in range(d-1,-1,-1):
tmp //= 26
ans += al[n//tmp]
n %= tmp
print(ans) | n = int(input())-1
x = 26
d = 1
while n >= x:
n -= x
d += 1
x *= 26
ans = ""
al = list("abcdefghijklmnopqrstuvwxyz")
tmp = pow(26,d)
for i in range(d-1,-1,-1):
tmp //= 26
ans += al[n//tmp]
n %= tmp
print(ans) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 342,245 | 342,246 | u115110170 | python |
p02629 | a=int(input())
b=''
while a>0:
c=a%26
if c==0:
b=b+'z'
a=a-26
elif c==1:
b=b+'a'
a=a-1
elif c==2:
b=b+'b'
a=a-2
elif c==3:
b=b+'c'
a=a-3
elif c==4:
b=b+'d'
a=a-4
elif c==5:
b=b+'e'
a=a-5
elif c==6:
b=b+'f'
a=a-6
elif c==7:
b=b+'g'
a=a-7
... | a=int(input())
b=''
while a>0:
c=a%26
if c==0:
b=b+'z'
a=a-26
elif c==1:
b=b+'a'
a=a-1
elif c==2:
b=b+'b'
a=a-2
elif c==3:
b=b+'c'
a=a-3
elif c==4:
b=b+'d'
a=a-4
elif c==5:
b=b+'e'
a=a-5
elif c==6:
b=b+'f'
a=a-6
elif c==7:
b=b+'g'
a=a-7
... | [] | 342,251 | 342,252 | u000037600 | python |
p02629 | n = int(input())
alp = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
name = ''
while(True):
m = n%26
if(m == 0):
m = 26
name = alp[m-1] + name
n = n//26
if(n==0):
break
print(name) | n = int(input())
alp = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
name = ''
while(True):
m = n%26
if(m == 0):
m = 26
n -= 26
name = alp[m-1] + name
n = n//26
if(n==0):
break
print(name) | [] | 342,263 | 342,264 | u749742659 | python |
p02629 | n = int(input())
l = [chr(ord('a') + i) for i in range(26)]
l = [l.pop()] + l
print(l)
k = []
while n > 0:
y = n % 26
k.append(l[y])
n -= 1
n //= 26
print(''.join(reversed(k))) | n = int(input())
l = [chr(ord('a') + i) for i in range(26)]
l = [l.pop()] + l
k = []
while n > 0:
y = n % 26
k.append(l[y])
n -= 1
n //= 26
print(''.join(reversed(k))) | [
"call.remove"
] | 342,267 | 342,268 | u636683284 | python |
p02629 | n = int(input())
l = []
while(n > 0):
l.append((n - 1) % 26)
n = int((n - 1) / 26)
print(l)
l.reverse()
ans = []
for i in l:
ans.append(chr(i + ord('a')))
print(''.join(ans)) | n = int(input())
l = []
while(n > 0):
l.append((n - 1) % 26)
n = int((n - 1) / 26)
l.reverse()
ans = []
for i in l:
ans.append(chr(i + ord('a')))
print(''.join(ans)) | [
"call.remove"
] | 342,269 | 342,270 | u082945913 | python |
p02629 | def num2alpha(num):
if num<=26:
return chr(96+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(96+num%26)
n=int(input())
print(num2alpha(n)) | def num2alpha(num):
if num<=26:
return chr(96+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(122)
else:
return num2alpha(num//26)+chr(96+num%26)
n=int(input())
print(num2alpha(n)) | [
"literal.number.integer.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 342,275 | 342,276 | u981206782 | python |
p02629 | N = int(input())
def num2alpha(num):
if num<=26:
return chr(96+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(96+num%26)
print(num2alpha(N)) | N = int(input())
def num2alpha(num):
if num<=26:
return chr(96+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(122)
else:
return num2alpha(num//26)+chr(96+num%26)
print(num2alpha(N)) | [
"literal.number.integer.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 342,277 | 342,278 | u583285098 | python |
p02629 | n=int(input())
def num2alpha(num):
if num<=26:
return chr(64+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(64+num%26)
print(num2alpha(n)) | n=int(input())
def num2alpha(num):
if num<=26:
return chr(64+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(64+num%26)
print(num2alpha(n).lower()) | [
"call.add",
"call.arguments.change"
] | 342,287 | 342,288 | u000660752 | python |
p02629 | def func(n):
if n<=26:
return chr(n+96)
if n%26==0:
return func(n//26)+'z'
return func(n//26)+chr(n%26+96)
n=int(input())
print(func(n)) | def func(n):
if n<=26:
return chr(n+96)
if n%26==0:
return func(n//26-1)+'z'
return func(n//26)+chr(n%26+96)
n=int(input())
print(func(n)) | [
"expression.operation.binary.add"
] | 342,289 | 342,290 | u631299617 | python |
p02629 | n=int(input())
a=[]
while n>0:
b=n%26
if b==0:
b=26
t=1
c=lambda b:chr(b+64)
a.append(c(b))
n//=26
if t==1:
n-=1
t=0
d=len(a)
e=[]
for i in range(d):
e.append(a[-1-i])
ans=''.join(e)
ans=ans.lower()
print(ans) | n=int(input())
a=[]
t=0
while n>0:
b=n%26
if b==0:
b=26
t=1
c=lambda b:chr(b+64)
a.append(c(b))
n//=26
if t==1:
n-=1
t=0
d=len(a)
e=[]
for i in range(d):
e.append(a[-1-i])
ans=''.join(e)
ans=ans.lower()
print(ans) | [
"assignment.add"
] | 342,301 | 342,302 | u919235786 | python |
p02629 | N=int(input())
asci = 'abcdefghijklmnopqrstuvwxyz'
ans=[]
temp=N
while temp!=0:
ans.append(asci[temp%26-1])
temp=temp//26
ans.reverse()
print(''.join(ans)) |
N=int(input())
asci = 'abcdefghijklmnopqrstuvwxyz'
ans=[]
temp=N
while temp!=0:
temp-=1
ans.append(asci[temp%26])
temp=temp//26
ans.reverse()
print(''.join(ans)) | [
"expression.operation.binary.remove"
] | 342,337 | 342,338 | u942051624 | python |
p02629 | ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
n = ii()
al = [1]
nc = 0
def ntow(x):
if x == 0:
return 'z'
v = chr(ord('a')+x-1)
# print(x,v)
return v
for i in range(1,15):
nc += 26 ** i
al.append(nc+1)
if nc > 10000... | ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
n = ii()
al = [1]
nc = 0
def ntow(x):
if x == 0:
return 'z'
v = chr(ord('a')+x-1)
# print(x,v)
return v
for i in range(1,15):
nc += 26 ** i
al.append(nc+1)
if nc > 10000... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 342,356 | 342,357 | u117054186 | python |
p02629 | a = int(input()) - 1
counter = 1
sum_num = 26 ** counter
before_sum_num = 0
while True:
if a <= sum_num:
a -= before_sum_num
for i in range(counter, 0, -1):
z = a // (26 ** (i - 1))
a = a % (26 ** (i-1))
print(chr(ord('a') + z), end='')
break
else:
before_sum_num = sum_num
... | a = int(input())
counter = 1
sum_num = 26 ** counter
before_sum_num = 0
while True:
if a <= sum_num:
a -= before_sum_num
a -= 1
for i in range(counter, 0, -1):
z = a // (26 ** (i - 1))
a = a % (26 ** (i-1))
print(chr(ord('a') + z), end='')
break
else:
before_sum_num = sum_n... | [
"expression.operation.binary.remove"
] | 342,360 | 342,361 | u243572357 | python |
p02629 | import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
INF = 1000000000000
n = I()
s = "abcdefghijklmnopqrstuvwxyz"
val = [-1]*100
i ... | import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
INF = 1000000000000
n = I()
s = "abcdefghijklmnopqrstuvwxyz"
val = [-1]*100
i ... | [
"call.remove"
] | 342,366 | 342,367 | u755989869 | python |
p02629 | n = int(input())
def num2alpha(num):
if num<=26:
return chr(96+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(96+num%26)
print(num2alpha(n)) | n = int(input())
def num2alpha(num):
if num<=26:
return chr(64+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(64+num%26)
print(num2alpha(n).lower()) | [
"literal.number.integer.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"call.add"
] | 342,380 | 342,381 | u363599046 | python |
p02629 | N = int(input())
ans = []
while N != 0:
k = N % 26
if k == 0:
k += 26
ans.append(chr(96 + k))
N -= k
N //= 26
print(''.join(ans)) | N = int(input())
ans = []
while N != 0:
k = N % 26
if k == 0:
k += 26
ans.append(chr(96 + k))
N -= k
N //= 26
ans.reverse()
print(''.join(ans)) | [
"call.add"
] | 342,386 | 342,387 | u189479417 | python |
p02629 | n = int(input())
s = []
while n > 0:
s.append(chr((n-1) % 26 + 97))
n = n // 26
print(''.join(list(reversed(s)))) | n = int(input())
s = []
while n > 0:
s.append(chr((n-1) % 26 + 97))
n = (n-1) // 26
print(''.join(list(reversed(s))))
| [] | 342,396 | 342,397 | u274504193 | python |
p02629 | n = int(input())
ans = ""
lis = []
while n>0:
lis.append(chr(97+n%26-1))
n //= 26
for i in range(len(lis)):
ans += lis[len(lis)-i-1]
print(ans) | n = int(input())
ans = ""
lis = []
while n>0:
n-=1
lis.append(chr(97+n%26))
n //= 26
for i in range(len(lis)):
ans += lis[len(lis)-i-1]
print(ans) | [
"expression.operation.binary.remove"
] | 342,398 | 342,399 | u306033313 | python |
p02629 | n = int(input())
cp = 26
pcp = 1
cl = 1
while n > cp:
pcp = cp
cl += 1
cp += 26**cl
n -= pcp + 1
cp = 1
ans = ''
for i in range(cl):
t = (n % (cp * 26) - n % cp) // cp
t = max(t, 0)
ans = chr(t + 97) + ans
n -= t*cp
cp *= 26
print(ans)
| n = int(input())
cp = 26
pcp = 0
cl = 1
while n > cp:
pcp = cp
cl += 1
cp += 26**cl
n -= pcp + 1
cp = 1
ans = ''
for i in range(cl):
t = (n % (cp * 26) - n % cp) // cp
t = max(t, 0)
ans = chr(t + 97) + ans
n -= t*cp
cp *= 26
print(ans)
| [
"literal.number.integer.change",
"assignment.value.change"
] | 342,411 | 342,412 | u151199272 | python |
p02629 | n = int(input())
ans = []
keta = n//26
while n != 0 and n != 1:
i = n%26
if i == 0:
o = 'z'
n = n//26 -1
else:
o = chr(n%26 +96)
n //= 26
ans.append(o)
ans = reversed(ans)
print(''.join(ans)) | n = int(input())
ans = []
keta = n//26
while n != 0:
i = n%26
if i == 0:
o = 'z'
n = n//26 -1
else:
o = chr(n%26 +96)
n //= 26
ans.append(o)
ans = reversed(ans)
print(''.join(ans)) | [] | 342,417 | 342,418 | u674343825 | python |
p02629 | a=int(input())
name=""
while (a>26):
b=a%26
a=a//26
if b==0:
b=26
name+=chr(b+96)
name+=chr(a+96)
name = name[::-1]
print(name) | a=int(input())
name=""
while (a>26):
b=a%26
a=a//26
if b==0:
b=26
a-=1
name+=chr(b+96)
name+=chr(a+96)
name = name[::-1]
print(name) | [] | 342,432 | 342,433 | u160204399 | python |
p02629 | 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)
print(num2alpha(int(input()))) | def num2alpha(num):
if num<=26:
return chr(64+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(64+num%26)
print(num2alpha(int(input())).lower()) | [
"call.add",
"call.arguments.change"
] | 342,442 | 342,443 | u868606077 | python |
p02629 | """
NTC here
"""
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
profile = 0
pypy = 1
def iin(): return int(input())
def lin(): return list(map(int, input().split()))
def main():
n = iin()
ans = []
rf = ord('a')
while n :
x = n%26
if x == 0:
... | """
NTC here
"""
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
profile = 0
pypy = 1
def iin(): return int(input())
def lin(): return list(map(int, input().split()))
def main():
# for n in range(1, 1000):
n = iin()
ans = []
rf = ord('a')
while n :
x = ... | [
"call.remove"
] | 342,454 | 342,455 | u542037391 | python |
p02629 | N = int(input())
S = ''
while N:
S += (chr(N%26+ord('a')-1))
N//=26
print(S[::-1])
| N = int(input())
S = ''
while N:
N -= 1
S += (chr(N%26+ord('a')))
N//=26
print(S[::-1])
| [
"expression.operation.binary.remove"
] | 342,462 | 342,463 | u597937638 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.