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 | 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))
| 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-1,26)
b=alf[b]
ans.insert(0,b)
print(''.join(ans))
| [
"expression.operation.binary.remove"
] | 339,890 | 339,891 | u892166393 | python |
p02629 | 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))
| 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-1,26)
b=alf[b]
ans.insert(0,b)
print(''.join(ans))
| [
"expression.operation.binary.remove"
] | 339,892 | 339,891 | u892166393 | python |
p02629 | #!/usr/bin/env pypy3
N = int(input())
ans = ''
while N>0:
ans = chr(N%26+96) + ans
N = N // 26
print(ans)
| N = int(input())
ans = ''
while N>0:
N -= 1
ans = chr(N%26+97) + ans
N = N // 26
print(ans)
| [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 339,933 | 339,934 | u349449706 | python |
p02629 | #!/usr/bin/env pypy3
N = int(input())
ans = ''
while N>0:
ans = chr(N%26+96) + ans
N = N // 26
print(ans)
| #!/usr/bin/env pypy3
N = int(input())
ans = ''
while N>0:
N -= 1
ans = chr(N%26+97) + ans
N = N // 26
print(ans)
| [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 339,933 | 339,935 | u349449706 | python |
p02629 | n = int(input())
alpha = "abcdefghijklmnopqrstuvwxyx"
ans = ""
counter = 0
while n!=0:
n -= 1
ans += alpha[n%26]
n //= 26
print(ans[::-1])
| n = int(input())
alpha = "abcdefghijklmnopqrstuvwxyz"
ans = ""
counter = 0
while n!=0:
n -= 1
ans += alpha[n%26]
n //= 26
print(ans[::-1])
| [
"literal.string.change",
"assignment.value.change"
] | 339,940 | 339,941 | u671239754 | python |
p02629 | n=int(input())
c=""
while n:
c=chr(n%26+96)+c
n//=26
print(c) | n=int(input())
c=""
while n:
n-=1
c=chr(n%26+97)+c
n//=26
print(c) | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 339,952 | 339,953 | u619819312 | python |
p02629 | n = int(input())
chars = 'Xabcdefghijklmnopqrstuvwxyz'
res = ''
while True:
x = n%26
if x == 0:
x = 26
res += chars[x]
n -= x
if n == 0 :
break
#n //= 26
print(res[::-1]) | n = int(input())
chars = 'Xabcdefghijklmnopqrstuvwxyz'
res = ''
while True:
x = n%26 #最下位の位の文字を求める(係数が26でない最下位の位が余りとして出せる)
if x == 0: #Xが26のときのみ余り0で対応させるため26に書き換え
x = 26
res += chars[x] #文字を正解リストに追加
n -= x #xを左辺に持っていって右辺で10の位以上の数値を調べる
if n == 0 :
break
n //= 26 #n-xは必ず26の倍数になっている... | [] | 339,964 | 339,963 | u642528832 | python |
p02629 | n = int(input())
chars = 'Xabcdefghijklmnopqrstuvwxyz'
res = ''
while True:
x = n%26
if x == 0:
x = 26
res += chars[x]
n -= x
if n == 0 :
break
#n //= 26
print(res[::-1]) | n = int(input())
chars = 'Xabcdefghijklmnopqrstuvwxyz'
res = ''
while True:
x = n%26
if x == 0:
x = 26
res += chars[x]
n -= x
if n == 0 :
break
n //= 26
print(res[::-1]) | [] | 339,964 | 339,965 | u642528832 | python |
p02629 | N = int(input())
ans = ''
for i in range(1,99):
if 26**i >= N:
N -= 1
for s in range(i):
ans += chr(ord('a') + N%26)
N //= 26
break
else:
N -= 26**i
print(ans)
| N = int(input())
ans = ''
for i in range(1,99):
if 26**i >= N:
N -= 1
for s in range(i):
ans += chr(ord('a') + N%26)
N //= 26
break
else:
N -= 26**i
print(ans[::-1])
| [] | 339,968 | 339,969 | u616382321 | python |
p02629 | 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]) | N=int(input())
ans=""
for _ in range(10**5):
N-=1
ans+=chr(ord("a")+(N%26))
N=N//26
if N<=0:
break
print(ans[::-1]) | [
"expression.operation.binary.remove"
] | 339,972 | 339,973 | u602773379 | python |
p02629 | N = int(input())
alpha = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
while N > 0:
ans = alpha[N%26] + ans
N = N//26
print(ans) | N = int(input())
alpha = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
while N > 0:
N = N - 1
ans = alpha[N%26] + ans
N = N//26
print(ans) | [
"assignment.add"
] | 339,978 | 339,979 | u217571418 | python |
p02629 | n = input()
chars = "Xabcdefghijklmnopqrstuvwxyz"
n_rem = n
ans = ""
while True:
x = n_rem % 26
if x == 0:
x = 26
ans += chars[x]
n_rem -= x
if n_rem == 0:
break
n_rem //= 26
print(ans[::-1]) | n = int(input())
chars = "Xabcdefghijklmnopqrstuvwxyz"
n_rem = n
ans = ""
while True:
x = n_rem % 26
if x == 0:
x = 26
ans += chars[x]
n_rem -= x
if n_rem == 0:
break
n_rem //= 26
print(ans[::-1]) | [
"call.add",
"call.arguments.change"
] | 339,987 | 339,988 | u544272759 | python |
p02629 | n = input()
chars = "Xabcdefghijklmnopqrstuvwxyz"
n_rem = n
ans = ""
while True:
x = n_rem % 26
if x == 0:
x = 26
ans += chars[x]
n_rem -= 26
if n_rem == 0:
break
n_rem //= 26
print(ans[::-1]) | n = int(input())
chars = "Xabcdefghijklmnopqrstuvwxyz"
n_rem = n
ans = ""
while True:
x = n_rem % 26
if x == 0:
x = 26
ans += chars[x]
n_rem -= x
if n_rem == 0:
break
n_rem //= 26
print(ans[::-1]) | [
"call.add",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove"
] | 339,989 | 339,988 | u544272759 | python |
p02629 | N=int(input())-1
L=[]
S=[]
A=[chr(i) for i in range(97,123)]
X=""
while N>=0:
if N==0:
L.append(N%26)
N=N//26
break
elif N!=0:
L.append(N%26)
N=N//26-1
S=reversed(L)
for i in range(len(L)):
X+=A[L[i]]
print(str(X)) | N=int(input())-1
L=[]
S=[]
A=[chr(i) for i in range(97,123)]
X=""
while N>=0:
if N==0:
L.append(N%26)
N=N//26
break
elif N!=0:
L.append(N%26)
N=N//26-1
S=list(reversed(L))
for i in range(len(S)):
X+=A[S[i]]
print(str(X))
| [
"call.add",
"call.arguments.change",
"identifier.change",
"control_flow.loop.range.bounds.upper.change",
"variable_access.subscript.index.change"
] | 340,000 | 340,001 | u854962015 | python |
p02629 | N = int(input())
# 26進数に変換する問題
ans = ""
alphabet = "Xabcdefghijklmnopqlstuvwxyz"
while N > 0:
mod = N % 26
if mod == 0:
mod = 26
ans = alphabet[mod] + ans
N -= mod
N //= 26
print(ans)
| N = int(input())
# 26進数に変換する問題
ans = ""
alphabet = "Xabcdefghijklmnopqrstuvwxyz"
while N > 0:
mod = N % 26
if mod == 0:
mod = 26
ans = alphabet[mod] + ans
N -= mod
N //= 26
print(ans)
| [
"literal.string.change",
"assignment.value.change"
] | 340,020 | 340,021 | u684435505 | python |
p02629 | a_list = [chr(ord('a') + i) for i in range(26)]
n = int(input())
l_list = []
ans = ''
while n > 0:
if n % 26 == 0:
l_list.append(25)
n = n // 26 - 1
else:
l_list.append(n%26)
n = n // 26
l_list = l_list[::-1]
for i in l_list:
ans += a_list[i]
print(ans) | a_list = [chr(ord('a') + i) for i in range(26)]
n = int(input())
l_list = []
ans = ''
while n > 0:
if n % 26 == 0:
l_list.append(26)
n = n // 26 - 1
else:
l_list.append(n%26)
n = n // 26
l_list = l_list[::-1]
for i in l_list:
ans += a_list[i-1]
print(ans) | [
"literal.number.integer.change",
"call.arguments.change"
] | 340,051 | 340,052 | u475189661 | python |
p02629 | import sys , math
from bisect import bisect
N=int(input())
alp="abcdefghijklmnopqrstuvwxyz"
R=[]
i=1
tot = 0
while tot < 1000000000000001:
tar = 26**i
tot+=tar
R.append(tot+1)
i+=1
keta = bisect(R , N)+1
if keta == 1:
print(alp[N])
sys.exit()
ans = ""
M = N - R[keta - 1]
for i in range(keta):... | import sys , math
from bisect import bisect
N=int(input())
alp="abcdefghijklmnopqrstuvwxyz"
R=[]
i=1
tot = 0
while tot < 1000000000000001:
tar = 26**i
tot+=tar
R.append(tot+1)
i+=1
keta = bisect(R , N)+1
if keta == 1:
print(alp[N-1])
sys.exit()
ans = ""
M = N - R[keta - 1]
for i in range(keta... | [
"expression.operation.binary.add"
] | 340,054 | 340,055 | u556069480 | python |
p02629 | n=int(input())
ans = ''
while n>0:
n = n-1
s += chr(ord('a') + (n)% 26)
n//=26
ans = ans[::-1]
print(ans) | n=int(input())
ans = ''
while n>0:
n = n-1
ans += chr(ord('a') + (n)% 26)
n//=26
ans = ans[::-1]
print(ans) | [
"identifier.change"
] | 340,064 | 340,065 | u244434589 | python |
p02629 | n=int(input())
s = ''
for i in range(11):
if N != 0:
n -= 1
s += chr(ord('a') + N % 26)
n //= 26
print(s[::-1]) | n=int(input())
s = ''
for i in range(11):
if n != 0:
n -= 1
s += chr(ord('a') + n % 26)
n //= 26
print(s[::-1]) | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 340,071 | 340,072 | u536642030 | python |
p02629 | N = int(input())
alp = "abcdefghijklmnopqrstuvwxyz"
answer = ""
while N != 0:
index = N % 26
answer += alp[index]
N = N // 26
print(answer[::-1])
| N = int(input())
alp = "abcdefghijklmnopqrstuvwxyz"
answer = ""
while N != 0:
N -= 1
index = N % 26
answer += alp[index]
N = N // 26
print(answer[::-1])
| [] | 340,073 | 340,074 | u617384447 | python |
p02629 | N = int(input())
alp = "abcdefghijklmnopqrstuvwxyz"
answer = ""
while N != 0:
N -= 1
index = (N - 1) % 26
answer += alp[index]
N = N // 26
print(answer[::-1])
| N = int(input())
alp = "abcdefghijklmnopqrstuvwxyz"
answer = ""
while N != 0:
N -= 1
index = N % 26
answer += alp[index]
N = N // 26
print(answer[::-1])
| [] | 340,075 | 340,074 | u617384447 | python |
p02629 | 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 = ''
while N > 0:
N-=1
index = N%1
ans = alpha[index] + ans
N = N // 26
print(ans) | 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 = ''
while N > 0:
N-=1
index = N%26
ans = alpha[index] + ans
N = N // 26
print(ans) | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 340,084 | 340,085 | u889919275 | python |
p02629 | n = int(input())
ans = ''
while n:
ans += chr(ord('a') + n % 26 - 1)
n //= 26
print(ans[::-1]) | n = int(input())
ans = ''
while n:
n -= 1
ans += chr(ord('a') + n % 26)
n //= 26
print(ans[::-1]) | [
"expression.operation.binary.remove"
] | 340,108 | 340,109 | u347600233 | python |
p02629 | n = int(input())
abc = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
while n:
n, m = divmod(n, 26)
ans = abc[m-1] + ans
print(ans) | n = int(input())
abc = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
while n:
n -= 1
n, m = divmod(n, 26)
ans = abc[m] + ans
print(ans) | [
"expression.operation.binary.remove"
] | 340,112 | 340,113 | u972591645 | python |
p02629 | N = int(input())
ls = []
while N > 0:
a = N % 26
N //= 26
ls.append(a+96)
print("".join(map(chr, reversed(ls))))
| N = int(input())
ls = []
while N > 0:
N -= 1
a = N % 26
N //= 26
ls.append(a+97)
print("".join(map(chr, reversed(ls))))
| [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 340,116 | 340,117 | u231095456 | python |
p02629 | N = int(input())
eList = ['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']
n = N
mod = N
numList = []
while n > 0:
n, mod = divmod(n,26)
if mod != 0:
numList.insert(0, mod - 1)
else:
numList.insert(0, 25)
n -= 1
for num in numList:
ans += eLi... | N = int(input())
eList = ['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']
n = N
mod = N
numList = []
while n > 0:
n, mod = divmod(n,26)
if mod != 0:
numList.insert(0, mod - 1)
else:
numList.insert(0, 25)
n -= 1
ans =''
for num in numList:
an... | [
"assignment.add"
] | 340,128 | 340,129 | u299645128 | python |
p02629 | #!/usr/bin/env python3
import sys
import string
l = [None]+[c for c in string.ascii_lowercase]
def f(N: int):
N -= 1
if N // 26:
return f(N//26) + l[N%26]
else:
return l[N%26]
def solve(N):
print(f(N))
# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You u... | #!/usr/bin/env python3
import sys
import string
l = [c for c in string.ascii_lowercase]
def f(N: int):
N -= 1
if N // 26:
return f(N//26) + l[N%26]
else:
return l[N%26]
def solve(N):
print(f(N))
# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the ... | [
"expression.operation.binary.remove"
] | 340,134 | 340,135 | u544587633 | python |
p02629 | n = int(input())
tmp = 0
for ll in range(1,15):
tmp+=26**ll
if n <= tmp:
break
ans = ""
for l in range(1,ll+1):
n-=1
ans+=chr(n%26+ord('a'))
n //= 26**l
print(ans[::-1])
| n = int(input())
tmp = 0
for ll in range(1,15):
tmp+=26**ll
if n <= tmp:
break
ans = ""
for l in range(1,ll+1):
n-=1
ans+=chr(n%26+ord('a'))
n //= 26
print(ans[::-1])
| [
"expression.operation.binary.remove"
] | 340,160 | 340,161 | u464205401 | python |
p02629 | n = int(input())
alp = 'zabcdefghijklmnopqrstuvwxy'
name = []
while n > 0:
n -= 1
name.append(alp[n % 26])
n //= 26
name.reverse()
print(*name,sep='') | n = int(input())
alp = 'abcdefghijklmnopqrstuvwxyz'
name = []
while n > 0:
n -= 1
name.append(alp[n % 26])
n //= 26
name.reverse()
print(*name,sep='') | [
"literal.string.change",
"assignment.value.change"
] | 340,173 | 340,174 | u891687930 | python |
p02629 | n = int(input())
name = []
while n > 0:
n -= 1
name.append(alp[n % 26])
n //= 26
name.reverse()
print(*name,sep='') | n = int(input())
alp = 'abcdefghijklmnopqrstuvwxyz'
name = []
while n > 0:
n -= 1
name.append(alp[n % 26])
n //= 26
name.reverse()
print(*name,sep='') | [
"assignment.add"
] | 340,175 | 340,174 | u891687930 | python |
p02629 | n = int(input())
alp = 'zabcdefghijklmnopqrstuvwxy'
name = []
while n > 0:
name.append(alp[n % 26])
n //= 26
name.reverse()
print(*name,sep='') | n = int(input())
alp = 'abcdefghijklmnopqrstuvwxyz'
name = []
while n > 0:
n -= 1
name.append(alp[n % 26])
n //= 26
name.reverse()
print(*name,sep='') | [
"literal.string.change",
"assignment.value.change"
] | 340,176 | 340,174 | u891687930 | python |
p02629 | n=int(input())
ans = ''
while n:
tmp = (n-1)%26
ans += chr(ord('a')+tmp)
n//=26
print(ans[::-1]) | n=int(input())
ans = ''
while n:
tmp = (n-1)%26
ans += chr(ord('a')+tmp)
n-=1
n//=26
print(ans[::-1]) | [] | 340,232 | 340,233 | u566529875 | python |
p02629 | def main():
alphabet = list(chr(i)for i in range(97, 123))
n = int(input())
ans = ''
while n > 0:
n -= 1
ans += chr(ord('a') + (n % 26))
n //= 26
print(ans)
if __name__ == "__main__":
main()
| def main():
alphabet = list(chr(i)for i in range(97, 123))
n = int(input())
ans = ''
while n > 0:
n -= 1
ans = chr(ord('a') + (n % 26)) + ans
n = n//26
print(ans)
if __name__ == "__main__":
main()
| [
"assignment.value.change"
] | 340,238 | 340,239 | u044964932 | python |
p02629 | import string
n = int(input())
s = string.ascii_lowercase
ans = ''
while n != 0:
n -= 1
ans += s[n%26]
n = n // 26
print(ans) | import string
n = int(input())
s = string.ascii_lowercase
ans = ''
while n != 0:
n -= 1
ans += s[n%26]
n = n // 26
print(ans[::-1]) | [] | 340,240 | 340,241 | u317779196 | python |
p02629 | N = int(input())
L = list("abcdefghijklmnopqrstuvwxyz")
a = 1
while N > 26**a:
N = N - 26**a
a += 1
pre = []
for i in reversed(range(1,a)):
r = N // 26**i
pre.append(r)
N = int(N%(26**i))
ans = ''
for i in pre:
ans += L[i]
print(ans+L[N-1]) | N = int(input())
L = list("abcdefghijklmnopqrstuvwxyz")
a = 1
while N > 26**a:
N = N - 26**a
a += 1
pre = []
for i in reversed(range(1,a)):
r = (N-1) // 26**i
pre.append(r)
N = int(N%(26**i))
ans = ''
for i in pre:
ans += L[i]
print(ans+L[N-1]) | [] | 340,250 | 340,251 | u090361088 | python |
p02629 | n = int(input())
alp = 'abcdefghijklmnopqrstuvwxyz'
# 名前の長さを求める
min_n = 0
max_n = 26
l = 1
while min_n < n <= max_n:
min_n += max_n
max_n += max_n * 26
l += 1
# n - min_n 番目の名前を求める <=> n - min_n - 1 を26進数に変換
m = n - min_n - 1
ans = ''
while m >= 26:
ans = alp[m % 26] + ans
m = m // 26 - 1
ans = al... | n = int(input())
alp = 'abcdefghijklmnopqrstuvwxyz'
# 名前の長さを求める
min_n = 0
max_n = 26
l = 0
while min_n < n <= max_n:
min_n += max_n
max_n += max_n * 26
l += 1
# n - min_n 番目の名前を求める <=> n - min_n - 1 を26進数に変換
m = n - min_n - 1
ans = ''
while m >= 26:
ans = alp[m % 26] + ans
m = m // 26 - 1
ans = al... | [
"literal.number.integer.change",
"assignment.value.change"
] | 340,262 | 340,263 | u384793271 | python |
p02629 | n = int(input())
ans = ""
while n:
n -= 1
ans += chr(97 + n % 26)
n //= 26
print(ans) | n = int(input())
ans = ""
while n:
n -= 1
ans += chr(97 + n % 26)
n //= 26
print(ans[::-1]) | [] | 340,276 | 340,277 | u725001080 | python |
p02629 | def c171(n):
ans = ""
while n > 0:
ans += chr(ord('a') + n % 26 - 1)
n //= 26
return ans[::-1]
def main():
n = int(input())
print(c171(n))
if __name__ == '__main__':
main() | def c171(n):
ans = ""
while n > 0:
n -= 1
ans += chr(ord('a') + n % 26)
n //= 26
return ans[::-1]
def main():
n = int(input())
print(c171(n))
if __name__ == '__main__':
main() | [
"expression.operation.binary.remove"
] | 340,299 | 340,300 | u488934106 | 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
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]) | [
"control_flow.break.add"
] | 340,301 | 340,302 | u137912513 | python |
p02629 | N = int(input())
ans = ""
while N > 0:
N -= 1
ans += chr(ord('a') + N % 26)
N //= 26
print(ans) | N = int(input())
ans = ""
while N > 0:
N -= 1
ans += chr(ord('a') + N % 26)
N //= 26
print(ans[::-1]) | [] | 340,313 | 340,314 | u691399849 | python |
p02629 | N = int(input())
ans = ""
while num > 0:
N -= 1
ans += chr(ord('a') + N % 26)
N //= 26
print(ans) | N = int(input())
ans = ""
while N > 0:
N -= 1
ans += chr(ord('a') + N % 26)
N //= 26
print(ans[::-1]) | [
"identifier.change",
"control_flow.loop.condition.change"
] | 340,315 | 340,314 | u691399849 | python |
p02629 | roman = "abcdefghijklmnopqrstuvwxyz"
num_to_roman = {}
for i in range(26):
num_to_roman[i+1] = roman[i]
n = int(input())
ans = []
while(n):
ans.insert(0, num_to_roman[n%26])
n = n//26
ans_str = ''.join(ans)
print(ans_str) | roman = "abcdefghijklmnopqrstuvwxyz"
num_to_roman = {}
for i in range(26):
num_to_roman[i] = roman[i]
n = int(input())
ans = []
while(n):
n-=1
ans.insert(0,num_to_roman[n%26])
n = n//26
ans_str = ''.join(ans)
print(ans_str) | [
"expression.operation.binary.remove"
] | 340,326 | 340,327 | u862466626 | python |
p02629 | N=int(input())
List='abcdefghijklmnopqrstuvdxy'
Ans=''
while N>=1:
Amari=N%26
if Amari==0:
Ans='z'+Ans
else:
Ans=List[Amari-1]+Ans
N=(N-1)//26
print(Ans) | N=int(input())
List='abcdefghijklmnopqrstuvwxy'
Ans=''
while N>=1:
Amari=N%26
if Amari==0:
Ans='z'+Ans
else:
Ans=List[Amari-1]+Ans
N=(N-1)//26
print(Ans)
| [
"literal.string.change",
"assignment.value.change"
] | 340,349 | 340,350 | u942280986 | python |
p02629 | N=int(input())
List='abcdefghijklmnopqrstuvdxy'
Ans=''
while N>0:
Amari=N%26
if Amari==0:
Ans='z'+Ans
else:
Ans=List[Amari-1]+Ans
N=(N-1)//26
print(Ans) | N=int(input())
List='abcdefghijklmnopqrstuvwxy'
Ans=''
while N>=1:
Amari=N%26
if Amari==0:
Ans='z'+Ans
else:
Ans=List[Amari-1]+Ans
N=(N-1)//26
print(Ans)
| [
"literal.string.change",
"assignment.value.change"
] | 340,352 | 340,350 | u942280986 | python |
p02629 | N=int(input())
List='abcdefghijklmnopqrstuvdxyz'
Ans=''
while N>=1:
Amari=N%26
if Amari==0:
Ans='z'+Ans
else:
Ans=List[Amari-1]+Ans
N=(N-1)//26
print(Ans) | N=int(input())
List='abcdefghijklmnopqrstuvwxy'
Ans=''
while N>=1:
Amari=N%26
if Amari==0:
Ans='z'+Ans
else:
Ans=List[Amari-1]+Ans
N=(N-1)//26
print(Ans)
| [
"literal.string.change",
"assignment.value.change"
] | 340,354 | 340,350 | u942280986 | python |
p02629 | N = input()
s = "abcdefghijklmnopqrstuvwxyz"
ans = ""
n, m = 0, 0
for i in range(1, 1000):
m += 26 ** i
if N <= m:
n = i
break
for i in range(n):
a, b = divmod(N, 26)
N = a
if b == 0:
ans += s[25]
N -= 1
else:
ans += s[b-1]
ans1 = ''.join(list(reversed... | N = int(input())
s = "abcdefghijklmnopqrstuvwxyz"
ans = ""
n, m = 0, 0
for i in range(1, 1000):
m += 26 ** i
if N <= m:
n = i
break
for i in range(n):
a, b = divmod(N, 26)
N = a
if b == 0:
ans += s[25]
N -= 1
else:
ans += s[b-1]
ans1 = ''.join(list(rev... | [
"call.add",
"call.arguments.change"
] | 340,357 | 340,358 | u293215208 | python |
p02629 | N = int(input())
ans = ""
li = "abcdefghijklmnopprstuvwxyz"
while N > 0:
N -= 1
ans += li[N % 26]
N //= 26
print(ans[::-1])
| N = int(input())
ans = ""
li = "abcdefghijklmnopqrstuvwxyz"
while N > 0:
N -= 1
ans += li[N % 26]
N //= 26
print(ans[::-1])
| [
"literal.string.change",
"assignment.value.change"
] | 340,359 | 340,360 | u547608423 | python |
p02629 | N = int(input())
ans = ""
li = "abcdefghijklmnopprstuvwxyz"
while N>0:
N -= 1
ans += li[N%26]
N //= 26
print(ans)
| N = int(input())
ans = ""
li = "abcdefghijklmnopqrstuvwxyz"
while N > 0:
N -= 1
ans += li[N % 26]
N //= 26
print(ans[::-1])
| [
"literal.string.change",
"assignment.value.change"
] | 340,361 | 340,360 | u547608423 | python |
p02629 | N = int(input())
name = ''
while N!=0:
name = chr(ord('a')-1+N%26) + name
N = N//26
print(name) | N = int(input())
name = ''
while N!=0:
N -= 1
name = chr(ord('a')+N%26) + name
N = N//26
print(name) | [
"expression.operation.binary.remove"
] | 340,362 | 340,363 | u405733072 | python |
p02629 | from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import numpy as np
import itertools
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i ... | from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import numpy as np
import itertools
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i ... | [] | 340,366 | 340,367 | u215286521 | python |
p02629 | n = int(input())
mod = 26
i= 0
name = ''
while n>0:
n -= 1
name += chr(ord('a')+n%mod)
n //= mod
print(name) | n = int(input())
mod = 26
i= 0
name = ''
while n>0:
n -= 1
name += chr(ord('a')+n%mod)
n //= mod
print(name[::-1]) | [] | 340,368 | 340,369 | u161164709 | python |
p02629 | N = int(input())
ans = ""
while N > 0:
N -= 1
ans += chr(97 + N%26)
N = N // 26
print(ans) | N = int(input())
ans = ""
while N > 0:
N -= 1
ans += chr(97 + N%26)
N = N // 26
print(ans[::-1]) | [] | 340,376 | 340,377 | u836589274 | python |
p02629 | n = int(input())
ans = ""
while n:
n -= 1
ans = chr(96 + n % 26) + ans
n //= 26
print(ans)
| n = int(input())
ans = ""
while n:
n -= 1
ans = chr(97 + n % 26) + ans
n //= 26
print(ans)
| [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 340,378 | 340,379 | u277312083 | python |
p02629 | def solve():
N = int(input())
k = 1
while N>pow(26,k):
N -= pow(26,k)
k += 1
ans = ''
N -= 1
for i in range(k,1,-1):
ans += chr(ord('a')+N//pow(26,i-1))
N%=pow(26,i-1)
ans += chr(ord('a')+N%pow(26,i))
return ans
print(solve()) | def solve():
N = int(input())
k = 1
while N>pow(26,k):
N -= pow(26,k)
k += 1
ans = ''
N -= 1
for i in range(k,1,-1):
ans += chr(ord('a')+N//pow(26,i-1))
N%=pow(26,i-1)
ans += chr(ord('a')+N%26)
return ans
print(solve()) | [
"call.remove",
"call.arguments.change"
] | 340,380 | 340,381 | u678167152 | python |
p02629 | N = int(input())
lis = [1,26]
num = 26
n = 1
while lis[-1]<N:
num *= 26
lis.append(lis[-1]+num)
n += 1
c = N-lis[-2]-1
ans = ''
for i in range(n):
ans = chr(c%26+ord('a')) + ans
c //= 26
print(ans) | N = int(input())
lis = [0,26]
num = 26
n = 1
while lis[-1]<N:
num *= 26
lis.append(lis[-1]+num)
n += 1
c = N-lis[-2]-1
ans = ''
for i in range(n):
ans = chr(c%26+ord('a')) + ans
c //= 26
print(ans) | [
"literal.number.integer.change",
"assignment.value.change"
] | 340,382 | 340,383 | u678167152 | python |
p02629 | n = int(input())
ans = ''
while n:
ans = chr(n%26 + ord('a') - 1) + ans
n //= 26
print(ans)
| n = int(input())
ans = ''
while n:
n -= 1
ans = chr(n%26 + ord('a')) + ans
n //= 26
print(ans)
| [
"expression.operation.binary.remove"
] | 340,400 | 340,401 | u933341648 | python |
p02629 | n = int(input())
s = []
while n > 0:
s.append(chr(n % 26 + 0x60))
n //= 26
print(''.join(reversed(s))) | n = int(input())
s = []
while n > 0:
n -= 1
s.append(chr(n % 26 + 0x61))
n //= 26
print(''.join(reversed(s))) | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 340,404 | 340,405 | u086056891 | python |
p02629 | 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))) | 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))) | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 340,408 | 340,409 | u986254798 | python |
p02629 | 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()
| 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-d)//26
ans += chr(ord('a')+n-1)
print(ans[::-1])
if __name__ == "__main__":
main()
| [] | 340,412 | 340,413 | u546338822 | python |
p02629 | N = int(input())
ans = []
while N > 0:
ans.append(chr((N % 26) + ord('a')-1))
N //= 26
print("".join(ans[::-1]))
| N = int(input())
ans = []
while N > 0:
N-=1
ans.append(chr((N % 26) + ord('a')))
N //= 26
print("".join(ans[::-1]))
| [
"expression.operation.binary.remove"
] | 340,426 | 340,427 | u473291366 | python |
p02629 | 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]) | # 自力では解けなかった(2020.7.6)
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:
q -= 1
mod = 26
ans += str(alpha... | [] | 340,434 | 340,435 | u497592162 | python |
p02629 | N = int(input())
ans = ''
while N > 0:
ans += chr(ord('a') + N % 26 -1)
N //= 26
print(ans[::-1]) | N = int(input())
ans = ''
while N > 0:
N -= 1#この行の意味が分からずに失敗した。今も分からない
ans += chr(ord('a') + N % 26)
N //= 26
print(ans[::-1]) | [
"expression.operation.binary.remove"
] | 340,444 | 340,445 | u620238824 | python |
p02629 | 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) | 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) | [
"call.remove"
] | 340,464 | 340,465 | u065079240 | python |
p02629 | import sys
input = sys.stdin.readline
N = int(input())
# upper-case A-Z
#[chr(i) for i in range(65,65+26)]
# lower-case a-z
#alphabet = [chr(i) for i in range(97,97+26)]
ans = ''
while N > 0:
ans += chr(ord('a') + N % 26 - 1)
N = N // 26
print(ans[::-1]) | import sys
input = sys.stdin.readline
N = int(input())
ans = ''
while N > 0:
N -= 1
ans += chr(ord('a') + N % 26)
N = N // 26
print(ans[::-1]) | [
"expression.operation.binary.remove"
] | 340,468 | 340,469 | u308097393 | python |
p02629 | import string,sys
def I(): return int(sys.stdin.readline().rstrip())
N = I()
abc = string.ascii_lowercase
def main(N):
if N<=26:
return abc[N-1]
if N%26==0:
return main(N//26)+abc[-1]
return main(N//26)+abc[N%26-1]
print(main(N))
| import string,sys
def I(): return int(sys.stdin.readline().rstrip())
N = I()
abc = string.ascii_lowercase
def main(N):
if N<=26:
return abc[N-1]
if N%26==0:
return main(N//26-1)+abc[-1]
return main(N//26)+abc[N%26-1]
print(main(N))
| [
"expression.operation.binary.add"
] | 340,510 | 340,511 | u579699847 | python |
p02629 | n=int(input())
l=[]
while(n):
n-=1
x=n%26
l.insert(0,chr(( x-1) + ord('a')))
n//=26
print("".join(l))
| n=int(input())
l=[]
while(n):
n-=1
x=n%26
l.insert(0,chr(( x) + ord('a')))
n//=26
print("".join(l)) | [
"expression.operation.binary.remove"
] | 340,516 | 340,517 | u963747475 | python |
p02629 | n=int(input())
l=[]
while(n):
x=n%26
l.insert(0,chr(( x-1) + ord('a')))
n//=26
print("".join(l)) | n=int(input())
l=[]
while(n):
n-=1
x=n%26
l.insert(0,chr(( x) + ord('a')))
n//=26
print("".join(l)) | [
"expression.operation.binary.remove"
] | 340,518 | 340,517 | u963747475 | python |
p02629 | n = int(input())
ans = ''
while n > 0:
ans += chr(n % 26 - 1 + ord('a'))
n //= 26
print(ans[::-1])
| n = int(input())
ans = ''
while n > 0:
n -= 1
ans += chr(n % 26 + ord('a'))
n //= 26
print(ans[::-1])
| [
"expression.operation.binary.remove"
] | 340,522 | 340,523 | u517621096 | python |
p02629 | import sys
from collections import deque
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N = int(input())
alpahbet = [chr(ord("a") + i) for i in range(26)]
ans = []
while N:
N -= 1
ans.append(alpah... | import sys
from collections import deque
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N = int(input())
alpahbet = [chr(ord("a") + i) for i in range(26)]
ans = []
while N:
N -= 1
ans.append(alpah... | [] | 340,528 | 340,529 | u346812984 | python |
p02629 | def C():
n = int(input())
ret = [None]*12
q = n
for i in range(12):
q,mod = divmod(q,26)
if mod == 0:
ret[i] = "z"
else:
ret[i] = chr(mod+96)
if q == 0:
break
ret = ret[:i+1]
ret.reverse()
print("".join(map(str,ret)))
C() | def C():
n = int(input())
ret = [None]*12
q = n
for i in range(12):
q,mod = divmod(q,26)
if mod == 0:
ret[i] = "z"
q -= 1
else:
ret[i] = chr(mod+96)
if q == 0:
break
ret = ret[:i+1]
ret.reverse()
print("".join(ma... | [] | 340,536 | 340,537 | u985041094 | python |
p02629 | n=int(input())
alpha=[chr(i) for i in range(ord('a'),ord('z'))]
ans=''
while n>0:
n-=1
ans=alpha[n%26]+ans
n//=26
print(ans)
| #171C
##One Quadrillion and One Dalmatians
n=int(input())
alpha=[chr(i) for i in range(ord('a'),ord('z')+1)]
ans=''
while n>0:
n-=1
ans=alpha[n%26]+ans
n//=26
print(ans)
| [
"control_flow.loop.range.bounds.upper.change",
"assignment.change"
] | 340,544 | 340,545 | u658915215 | python |
p02629 | #!/usr/bin/env python
# coding: utf-8
# In[ ]:
#171C
##One Quadrillion and One Dalmatians
n=int(input())
alpha=[chr(i) for i in range(ord('a'),ord('z'))]
ans=''
while n>0:
n-=1
ans=alpha[n%26]+ans
n//=26
print(ans)
| #171C
##One Quadrillion and One Dalmatians
n=int(input())
alpha=[chr(i) for i in range(ord('a'),ord('z')+1)]
ans=''
while n>0:
n-=1
ans=alpha[n%26]+ans
n//=26
print(ans)
| [
"control_flow.loop.range.bounds.upper.change",
"assignment.change"
] | 340,546 | 340,545 | u658915215 | python |
p02629 | n = int(input())
cha = "abcdefghijklmnopqrstuvwxyz"
ans = ""
while n>=1:
ans += cha[((n-1)%26)]
n=n//26
print(ans[::-1]) | n = int(input())
cha = "abcdefghijklmnopqrstuvwxyz"
ans = ""
while n>=1:
ans += cha[((n-1)%26)]
n=(n-1)//26
print(ans[::-1]) | [] | 340,549 | 340,550 | u035453792 | python |
p02629 | x = int(input())
def converter(x):
if x <= 26:
y = chr(x + 96)
elif x % 26 == 0:
y = converter(x // 26) + chr(122)
else:
y = converter(x // 26) + chr(x % 26 + 96)
return y
name = converter(x)
print(name) | x = int(input())
def converter(x):
if x <= 26:
y = chr(x + 96)
elif x % 26 == 0:
y = converter(x // 26 - 1) + chr(122)
else:
y = converter(x // 26) + chr(x % 26 + 96)
return y
name = converter(x)
print(name) | [
"assignment.change"
] | 340,561 | 340,562 | u904811150 | python |
p02629 | n = int(input())
tmp = 0
i = -1
tmp_list= []
while tmp<=n:
i+=1
tmp+=26**i
tmp_list.append(26**i)
n-=tmp-tmp_list[-1]
tmp = []
while 1:
if n<=26:
tmp.append(n%26)
break
tmp.append(n%26)
n = n//26
alphabet = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r",... | n = int(input())
tmp = 0
i = -1
tmp_list= []
while tmp<=n:
i+=1
tmp+=26**i
tmp_list.append(26**i)
n-=(tmp-tmp_list[-1])
tmp = []
while 1:
if n<26:
tmp.append(n%26)
break
tmp.append(n%26)
n = n//26
alphabet = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r",... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 340,565 | 340,564 | u013864607 | python |
p02629 | def main():
N = int(input()) - 1
digits = []
while True:
a, b = N // 26, N % 26
digits.append(b)
if a == 0:
break
N = a
digits.reverse()
chars = map(to_alphabet, digits)
print(''.join(chars))
def to_alphabet(x: int):
return chr(65 + x).lower()
... | def main():
N = int(input()) - 1
digits = []
while True:
a, b = N // 26, N % 26
digits.append(b)
if a == 0:
break
N = a - 1
digits.reverse()
chars = map(to_alphabet, digits)
print(''.join(chars))
def to_alphabet(x: int):
return chr(65 + x).lowe... | [
"assignment.change"
] | 340,566 | 340,567 | u395252999 | python |
p02629 | def main():
N = int(input())
digits = []
while True:
a, b = N // 26, N % 26
digits.append(b)
if a == 0:
break
N = a
digits.reverse()
chars = map(to_alphabet, digits)
print(''.join(chars))
def to_alphabet(x: int):
return chr(64 + x).lower()
if... | def main():
N = int(input()) - 1
digits = []
while True:
a, b = N // 26, N % 26
digits.append(b)
if a == 0:
break
N = a - 1
digits.reverse()
chars = map(to_alphabet, digits)
print(''.join(chars))
def to_alphabet(x: int):
return chr(65 + x).lowe... | [
"literal.number.integer.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 340,568 | 340,567 | u395252999 | python |
p02629 | n = int(input())
s=''
while n!=0:
tmp=n%26
s=chr(96+tmp)+s
n//=26
print(s) | n = int(input())
s=''
while n!=0:
n-=1
tmp=n%26
s=chr(96+tmp+1)+s
n//=26
print(s) | [
"assignment.change"
] | 340,573 | 340,574 | u842388336 | python |
p02629 | def A(x):
if ord(x) - ord('a') >= 0:
print('a')
else:
print('A')
def B(n, k, p_list):
p_list = sorted(p_list)
print(sum(p_list[:k]))
def C(N):
for i in range(99):
if N < 26**i:
ans = []
for j in range(i):
ans += chr(ord('a') + N % 26)
N //= 26
return ''.join(a... | def A(x):
if ord(x) - ord('a') >= 0:
print('a')
else:
print('A')
def B(n, k, p_list):
p_list = sorted(p_list)
print(sum(p_list[:k]))
def C(N):
for i in range(99):
if N < 26**i:
ans = []
for j in range(i):
ans += chr(ord('a') + N % 26)
N //= 26
return ''.join(a... | [] | 340,577 | 340,578 | u805586810 | python |
p02629 | from string import ascii_lowercase
N = int(input())
s = list()
while N > 0:
m = N%26 - 1
s.append(ascii_lowercase[m])
N = int(N/26)
s.reverse()
s = ''.join(s)
print(s) | from string import ascii_lowercase
N = int(input())
s = list()
while N > 0:
N -= 1
m = N%26
s.append(ascii_lowercase[m])
N = int(N/26)
s.reverse()
s = ''.join(s)
print(s) | [
"expression.operation.binary.remove"
] | 340,605 | 340,606 | u211306418 | python |
p02629 | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
n = int(input())
res = []
while n:
n, r = divmod(n, 26)
# print(r)
res.append(chr(ord('a') + r - 1))
res.reverse()
print(''.join... | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
n = int(input())
res = []
while n:
n, r = divmod(n - 1, 26)
res.append(chr(ord('a') + r))
res.reverse()
print(''.join(res))
resolve() | [
"expression.operation.binary.remove"
] | 340,629 | 340,630 | u440566786 | python |
p02629 | n = input()
ans = []
while n:
n, r = divmod(n - 1, 26)
ans.append(chr(ord('a') + r))
ans.reverse()
print(''.join(ans)) | n = int(input())
ans = []
while n:
n, r = divmod(n - 1, 26)
ans.append(chr(ord('a') + r))
ans.reverse()
print(''.join(ans))
| [
"call.add",
"call.arguments.change"
] | 340,631 | 340,632 | u440566786 | python |
p02629 | n = input()
ans = []
while n:
n, r = divmod(n - 1, 26)
ans.append(chr(ord('a') + r))
ans.reverse()
print(''.join()) | n = int(input())
ans = []
while n:
n, r = divmod(n - 1, 26)
ans.append(chr(ord('a') + r))
ans.reverse()
print(''.join(ans))
| [
"call.add",
"call.arguments.change"
] | 340,633 | 340,632 | u440566786 | python |
p02629 | n = int(input())
alphabet = "abcdefghijklmnopqrstuvwxyz"
l = []
for _ in range(13):
rem = n % 26
l.append(rem - 1 if rem else 25)
n = n // 26
if n == 0:
break;
l.reverse()
print("".join([alphabet[i] for i in l])) | n = int(input())
alphabet = "abcdefghijklmnopqrstuvwxyz"
l = []
for _ in range(20):
rem = n % 26
l.append(rem - 1 if rem else 25)
n = (n - 1) // 26
if n == 0:
break;
l.reverse()
print("".join([alphabet[i] for i in l])) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 340,650 | 340,651 | u081193942 | python |
p02629 | n = int(input())
ans = ""
while n > 0:
re = n % 26
if re != 0:
ans = chr(ord('a') + (re - 1)) + ans
n = n // 26
else:
ans = 'z' + ans;
n = n / 26 - 1
print(ans) | n = int(input())
ans = ""
while n > 0:
re = n % 26
if re != 0:
ans = chr(ord('a') + (re - 1)) + ans
n = n // 26
else:
ans = 'z' + ans;
n = n // 26 - 1
print(ans) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 340,671 | 340,672 | u631025015 | python |
p02629 | from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
import math
rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: map(int, stdin.readline().split())
rlf = lambda: map(float, stdin.readline().split())
INF, NINF = float('inf'), float('-in... | from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
import math
rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: map(int, stdin.readline().split())
rlf = lambda: map(float, stdin.readline().split())
INF, NINF = float('inf'), float('-in... | [
"expression.operation.binary.remove"
] | 340,677 | 340,678 | u064505481 | python |
p02629 | n=int(input())
ans=''
while n>0:
ans+=chr(ord('a')+n%26-1)
n=n//26
print(ans[::-1]) | n=int(input())
ans=''
while n>0:
n-=1
ans+=chr(ord('a')+n%26)
n=n//26
print(ans[::-1]) | [
"expression.operation.binary.remove"
] | 340,695 | 340,696 | u932868243 | python |
p02629 | import string
s = string.ascii_lowercase
def f(x, tmp):
if x == 0:
return ""
x -= 1
if x <= 26:
return s[x] + tmp
else:
return f(x // 26, s[x % 26] + tmp)
n = int(input())
r = f(n, "")
print(r)
| import string
s = string.ascii_lowercase
def f(x, tmp):
if x == 0:
return ""
x -= 1
if x < 26:
return s[x] + tmp
else:
return f(x // 26 , s[x % 26] + tmp)
n = int(input())
r = f(n, "")
print(r)
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 340,701 | 340,702 | u867826040 | python |
p02629 | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
def main():
n = int(input())
ans = ""
alpa = "abcdefghijklmnopqrstuvwxyz"
while n:
ans += alpa[n%26-1]
n//=26
ans2 = ""
... | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
def main():
n = int(input())
ans = ""
alpa = "abcdefghijklmnopqrstuvwxyz"
while n:
ans += alpa[n%26-1]
n-=1
n//=26
... | [] | 340,705 | 340,706 | u379142263 | python |
p02629 | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
import bisect
if __name__ == "__main__":
n = int(input())
a = [0]*18
a[0] = 26
b = 2
alpa = ["a","b","c","d","e","f","g","h","i","j","k","l... | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
import bisect
if __name__ == "__main__":
n = int(input())
a = [0]*18
a[0] = 26
b = 2
alpa = ["a","b","c","d","e","f","g","h","i","j","k","l... | [
"expression.operation.binary.remove"
] | 340,707 | 340,708 | u379142263 | python |
p02629 | def solve(n):
s = [chr(ord("a")+i) for i in range(26)]
res = ""
while n > 0:
res = s[n % 26 - 1] + res
n //=26
return res
n = int(input())
print(solve(n)) | def solve(n):
s = [chr(ord("a")+i) for i in range(26)]
res = ""
while n > 0:
n -= 1
res = s[n % 26] + res
n //=26
return res
n = int(input())
print(solve(n)) | [
"expression.operation.binary.remove"
] | 340,716 | 340,717 | u879309973 | python |
p02629 | n = int(input())
res = ''
while n > 0:
n, t = divmod(n, 26)
if t == 0:
t = 26
res += chr(96+t)
print(res[::-1]) | n = int(input())
res = ''
while n > 0:
n, t = divmod(n, 26)
if t == 0:
t = 26
n -= 1
res += chr(96+t)
print(res[::-1]) | [] | 340,722 | 340,723 | u492641452 | python |
p02629 | n = int(input())
res = ''
while 0 < n:
r = n % 26
res += chr(r+ord('a')-1)
n //= 26
print(res[::-1]) | n = int(input())
res = ''
while 0 < n:
n -= 1
r = n % 26
res += chr(r+ord('a'))
# print(res)
n //= 26
print(res[::-1]) | [
"expression.operation.binary.remove"
] | 340,726 | 340,727 | u737609426 | python |
p02629 | n=int(input())
ans=""
while n>0:
ans+=chr(96+n%26)
n=n//26
print(ans[::-1])
| n=int(input())
ans=""
while n>0:
n-=1
ans+=chr(97+n%26)
n=n//26
print(ans[::-1])
| [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 340,728 | 340,729 | u252628711 | python |
p02629 | N = int(input())
a = 26
counter = 1
while a<N:
N -= a
counter += 1
a *= 26
ans = []
N -= 1
while N>26:
ans.append(N%26)
N = N //26
ans.append(N)
#print(ans)
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 = [dic[i] fo... | N = int(input())
a = 26
counter = 1
while a<N:
N -= a
counter += 1
a *= 26
ans = []
N -= 1
while N>=26:
ans.append(N%26)
N = N //26
ans.append(N)
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 = [dic[i] for i in ans[... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 340,732 | 340,733 | u845573105 | python |
p02629 | n = int(input())
kouho = [chr(i) for i in range(97, 97+26)]
ans = []
while n>0:
ans.append(kouho[n%26-1])
n = n//26
ans.reverse()
print(''.join(ans)) | n = int(input())
kouho = [chr(i) for i in range(97, 97+26)]
ans = []
while n>0:
n-=1
ans.append(kouho[n%26])
n = n//26
ans.reverse()
print(''.join(ans)) | [
"expression.operation.binary.remove"
] | 340,736 | 340,737 | u494058663 | python |
p02629 | n = int(input())
alphabet = 'abcdefghijklmnopqrstuvwxyz'
def name(n):
if n <= 26:
return alphabet[n - 1]
else:
return name(n // 26) + name(n % 26)
print(name(n))
| n = int(input())
alphabet = 'abcdefghijklmnopqrstuvwxyz'
def name(n):
if n <= 26:
return alphabet[n - 1]
else:
return name((n - 1) // 26) + name(n % 26)
print(name(n))
| [
"call.arguments.change",
"function.return_value.change"
] | 340,741 | 340,742 | u439542873 | python |
p02629 | N = int(input())
x = 1
alphabet = {i-96:chr(i) for i in range(97, 97+26)}
if int(N) > 26:
ans = ''
while x != 0:
x = N // 26
mod = N%26
#print(x, mod)
if mod == 0:
ans += 'z'
x -= x%26
else:
#print(x, mod, alphabet[mod])
ans += ... | N = int(input())
x = 1
alphabet = {i-96:chr(i) for i in range(97, 97+26)}
if int(N) > 26:
ans = ''
while x != 0:
x = N // 26
mod = N%26
#print(x, mod)
if mod == 0:
ans += 'z'
#x -= x%26
x -= 1
else:
#print(x, mod, alphabet[mod])... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 340,748 | 340,749 | u894265012 | python |
p02629 | N = int(input())
x = 1
alphabet = {i-96:chr(i) for i in range(97, 97+26)}
if int(N) > 26:
ans = ''
while x != 0:
x = N // 26
mod = N%26
print(x, mod)
if mod == 0:
ans += 'z'
x -= 1
else:
#print(x, mod, alphabet[mod])
ans += alph... | N = int(input())
x = 1
alphabet = {i-96:chr(i) for i in range(97, 97+26)}
if int(N) > 26:
ans = ''
while x != 0:
x = N // 26
mod = N%26
#print(x, mod)
if mod == 0:
ans += 'z'
#x -= x%26
x -= 1
else:
#print(x, mod, alphabet[mod])... | [
"call.remove"
] | 340,750 | 340,749 | u894265012 | python |
p02629 | strings = sorted(a)
N = int(input())
set_index = ''
while N > 0:
N -= 1
index = (N % 26) + ord('a')
set_index += chr(index)
N //= 26
print(set_index[::-1]) | N = int(input())
set_index = ''
while N > 0:
N -= 1
index = (N % 26) + ord('a')
set_index += chr(index)
N //= 26
print(set_index[::-1]) | [
"assignment.remove"
] | 340,754 | 340,755 | u232652798 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.