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 |
|---|---|---|---|---|---|---|---|
p02744 | import sys
sys.setrecursionlimit(10 ** 6)
def create_li(li):
if len(li) >= n:
lis.append(li)
return
p = li[-1]
for i in range(1, p + 2):
cp = li[:]
cp.append(i)
# print(cp)
create_li(cp)
lis = []
n = int(input())
pre = [1]
create_li(pre)
lis.sort()
al = ["a","b","c","d","e","f","g","h"... | import sys
sys.setrecursionlimit(10 ** 6)
def create_li(li):
if len(li) >= n:
lis.append(li)
return
p = max(li)
for i in range(1, p + 2):
cp = li[:]
cp.append(i)
# print(cp)
create_li(cp)
lis = []
n = int(input())
pre = [1]
create_li(pre)
lis.sort()
al = ["a","b","c","d","e","f","g","h... | [
"call.add",
"assignment.value.change"
] | 524,600 | 524,601 | u802963389 | python |
p02744 | import sys
sys.setrecursionlimit(10**7)
n = int(input())
def dfs(s):
if len(s) == n:
print(s)
else:
for x in map(chr, range(97, ord(s[-1])+2)):
dfs(s+x)
dfs("a") | import sys
sys.setrecursionlimit(10**7)
n = int(input())
def dfs(s):
if len(s) == n:
print(s)
else:
for x in map(chr, range(97, ord(max(s))+2)):
dfs(s+x)
dfs("a") | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 524,602 | 524,603 | u790710233 | python |
p02744 | import sys
sys.setrecursionlimit(10**7)
n = int(input())
ls = []
def dfs(s):
if len(s) == n:
ls.append(s)
return 0
else:
for x in map(chr, range(97, ord(s[-1])+2)):
dfs(s+x)
dfs("a")
ls.sort()
for x in ls:
print(x) | import sys
sys.setrecursionlimit(10**7)
n = int(input())
ls = []
def dfs(s):
if len(s) == n:
ls.append(s)
return 0
else:
for x in map(chr, range(97, ord(max(s))+2)):
dfs(s+x)
dfs("a")
ls.sort()
for x in ls:
print(x)
| [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 524,604 | 524,605 | u790710233 | python |
p02744 | def num_to_str(n):
return chr(97 + n)
def str_to_num(s):
return ord(s) - 97
def dfs(s,m,n,N,ans):
if n == N:
ans.append(s)
return
for i in range(m+2):
dfs(s+num_to_str(i),max(m,i),n+1,N,ans)
def main():
N = int(input())
ans = []
dfs('a',0,1,N,ans)
ans.sort()
... | def num_to_str(n):
return chr(97 + n)
def str_to_num(s):
return ord(s) - 97
def dfs(s,m,n,N,ans):
if n == N:
ans.append(s)
return
for i in range(m+2):
dfs(s+num_to_str(i),max(m,i),n+1,N,ans)
def main():
N = int(input())
ans = []
dfs('a',0,1,N,ans)
ans.sort()
... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 524,614 | 524,615 | u761529120 | python |
p02744 | import string
alphabet = string.ascii_lowercase
n = int(input())
def DFS(before,keta):
num = 0
if keta == n:
print(before)
return
for i in before:
num = min(num,alphabet.index(i))+1
for j in range(num+1):
DFS(before+alphabet[j],keta+1)
DFS("",0) | import string
alphabet = string.ascii_lowercase
n = int(input())
def DFS(before,keta):
num = 0
if keta == n:
print(before)
return
for i in before:
num = max(num,alphabet.index(i))
num += 1
for j in range(num+1):
DFS(before+alphabet[j],keta+1)
DFS("a",1) | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"literal.number.integer.change"
] | 524,616 | 524,617 | u987164499 | python |
p02744 | import string
alphabet = string.ascii_lowercase
n = int(input())
def DFS(before,keta):
num = 0
if keta == n:
print(before)
return
for i in before:
num = max(num,alphabet.index(i))+1
for j in range(num+1):
DFS(before+alphabet[j],keta+1)
DFS("",0) | import string
alphabet = string.ascii_lowercase
n = int(input())
def DFS(before,keta):
num = 0
if keta == n:
print(before)
return
for i in before:
num = max(num,alphabet.index(i))
num += 1
for j in range(num+1):
DFS(before+alphabet[j],keta+1)
DFS("a",1) | [
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"literal.number.integer.change"
] | 524,618 | 524,617 | u987164499 | python |
p02744 | n=int(input())
ans=[]
def dfs(i,c,d):
if i==n:
ans.append(c)
return
for j in range(0,d+1):
dfs(i+1,c+chr(97+j),d+(i==d))
dfs(0,"",0)
print("\n".join(ans)) | n=int(input())
ans=[]
def dfs(i,c,d):
if i==n:
ans.append(c)
return
for j in range(0,d+1):
dfs(i+1,c+chr(97+j),d+(j==d))
dfs(0,"",0)
print("\n".join(ans)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 524,625 | 524,626 | u670180528 | python |
p02744 | n = int(input())
s = ['a']*(n)
#print(''.join(s))
def dfs(x,alp):
if x == n:
print(''.join(s))
return
for i in range(alp+1):
#print(x,alp,i)
s[x] = chr(i+ord("a"))
dfs(x+1,min(i+1,alp+1))
#print(alp)
dfs(0,0) | n = int(input())
s = ['a']*(n)
#print(''.join(s))
def dfs(x,alp):
if x == n:
print(''.join(s))
return
for i in range(alp+1):
#print(x,alp,i)
s[x] = chr(i+ord("a"))
dfs(x+1,max(i+1,alp))
#print(alp)
dfs(0,0) | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 524,627 | 524,628 | u228223940 | python |
p02744 | N = int(input())
ans_list = ["a"] # 生成元の初期状態 (N = 1 の答え)
alphabet = [chr(ord("a") + i) for i in range(N)] # 使用するアルファベット
for i in range(N - 1):
ans_list = [ans + x for ans in ans_list for x in alphabet[:len(ans) + 1]]
for ans in ans_list:
print(ans) | N = int(input())
ans_list = ["a"] # 生成元の初期状態 (N = 1 の答え)
alphabet = [chr(ord("a") + i) for i in range(N)] # 使用するアルファベット
for i in range(N - 1):
ans_list = [ans + x for ans in ans_list for x in alphabet[:len(set(ans)) + 1]]
for ans in ans_list:
print(ans) | [
"call.add",
"call.arguments.change"
] | 524,633 | 524,634 | u190905976 | python |
p02744 | def examA():
L = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
K = I()
ans = L[K-1]
print(ans)
return
def examB():
H, W = LI()
if H==1 or W==1:
print(1)
return
ans = H*W//2 + (H*W)%2
print(ans)
return
def ex... | def examA():
L = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
K = I()
ans = L[K-1]
print(ans)
return
def examB():
H, W = LI()
if H==1 or W==1:
print(1)
return
ans = H*W//2 + (H*W)%2
print(ans)
return
def ex... | [
"expression.operation.binary.remove"
] | 524,635 | 524,636 | u638795007 | python |
p02744 | n = int(input())
before = ["0"]
for i in range(n-1):
next = []
for elem in before:
m = 1
for j in range(len(elem)):
m = max(m, int(elem[j]))
for j in range(m+1):
next.append(elem+str(j))
before = next[:]
before.sort()
d = {"0":"a", "1":"b", "2":"c", "3":"d",... | n = int(input())
before = ["0"]
for i in range(n-1):
next = []
for elem in before:
m = 1
for j in range(len(elem)):
m = max(m, int(elem[j])+1)
for j in range(m+1):
next.append(elem+str(j))
before = next[:]
before.sort()
d = {"0":"a", "1":"b", "2":"c", "3":"d... | [
"assignment.change"
] | 524,650 | 524,651 | u426108351 | python |
p02744 | import sys
sys.setrecursionlimit(4100000)
N = int(input())
def dfs(i,s):
if len(s) == N:
return print(s)
for x in range(97,i + 1):
t = s + chr(x)
dfs(x + 1,t)
dfs(ord("a"),"") | import sys
sys.setrecursionlimit(4100000)
N = int(input())
def dfs(i,s):
if len(s) == N:
return print(s)
for x in range(97,i + 1):
t = s + chr(x)
dfs(max(x + 1,i),t)
dfs(ord("a"),"") | [
"call.arguments.add"
] | 524,654 | 524,655 | u355371431 | python |
p02744 | N = int(input())
dp = [[] for _ in range(N)]
dp[0].append('a')
for i in range(1, N):
for strings in dp[i-1]:
j = 97
while j <= ord(strings[-1])+1:
nextstr = strings
nextstr += chr(j)
dp[i].append(nextstr)
j += 1
dp[N-1].sort()
for strings in dp[N-1... | N = int(input())
dp = [[] for _ in range(N)]
dp[0].append('a')
for i in range(1, N):
for strings in dp[i-1]:
j = 97
while j <= ord(max(strings))+1:
nextstr = strings
nextstr += chr(j)
dp[i].append(nextstr)
j += 1
dp[N-1].sort()
for strings in dp[N-... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 524,656 | 524,657 | u781535828 | python |
p02744 | def getStr(vars):
if len(vars)==N:
print(getPrintStr(vars))
return
vars.append(0)
for i in range(0,vars[-2]+2):
vars[-1] = i
#print(":", i, vars)
getStr(vars)
del vars[-1]
return
def getPrintStr(vars):
ret = ""
for i in range(len(vars)):
... | def getStr(vars):
if len(vars)==N:
print(getPrintStr(vars))
return
vars.append(0)
for i in range(0,max(vars)+2):
vars[-1] = i
#print(":", i, vars)
getStr(vars)
del vars[-1]
return
def getPrintStr(vars):
ret = ""
for i in range(len(vars)):
... | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 524,658 | 524,659 | u714887242 | python |
p02744 | N = int(input())
a_num = 97
def dfs(s, n, cnt): #s: 現在の文字列, n: 残りの文字数, cnt: 現在の文字列の最大の値
if n == 0:
print(s)
return
for i in range(cnt+2):
if i == cnt+1:
dfs(s+chr(a_num+i), n-1, cnt+i)
else:
dfs(s+chr(a_num+i), n-1, cnt)
dfs("a", N-1, 0) | N = int(input())
a_num = 97
def dfs(s, n, cnt): #s: 現在の文字列, n: 残りの文字数, cnt: 現在の文字列の最大の値
if n == 0:
print(s)
return
for i in range(cnt+2):
if i == cnt+1:
dfs(s+chr(a_num+i), n-1, cnt+1)
else:
dfs(s+chr(a_num+i), n-1, cnt)
dfs("a", N-1, 0) | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 524,666 | 524,667 | u423966555 | python |
p02744 | n = int(input())
ans = []
def dfs(A):
if len(A) == n:
ans.append(''.join(A))
return
for i in range(len(A)+1):
v = chr(i+ord('a'))
A.append(v)
dfs(A)
A.pop()
dfs([])
ans.sort()
for i in range(len(ans)):
print(ans[i])
| n = int(input())
ans = []
def dfs(A):
if len(A) == n:
ans.append(''.join(A))
return
for i in range(len(set(A))+1):
v = chr(i+ord('a'))
A.append(v)
dfs(A)
A.pop()
dfs([])
ans.sort()
for i in range(len(ans)):
print(ans[i])
| [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 524,674 | 524,675 | u186838327 | python |
p02744 | n = int(input())
L = [0]*n
for i in range(n):
L[i] = chr(i+ord('a'))
#print(L)_
ans = []
def dfs(A):
if len(A) == n:
ans.append(''.join(A))
return
for v in L[0:len(A)+1]:
A.append(v)
dfs(A)
A.pop()
dfs([])
ans.sort()
for i in range(len(ans)):
print(ans[i])
| n = int(input())
L = [0]*n
for i in range(n):
L[i] = chr(i+ord('a'))
#print(L)_
ans = []
def dfs(A):
if len(A) == n:
ans.append(''.join(A))
return
for v in L[0:len(set(A))+1]:
A.append(v)
dfs(A)
A.pop()
dfs([])
ans.sort()
for i in range(len(ans)):
print(ans[i])... | [
"call.add",
"call.arguments.change"
] | 524,676 | 524,677 | u186838327 | python |
p02744 |
N = int(input())
def func(x):
if len(x) == N:
print("".join(x))
return
last = ord(x[-1]) - ord("a") + 1 if x else 0
for i in range(min(26, last) + 1):
x.append(chr(ord("a") + i))
func(x)
x.pop()
func([])
|
N = int(input())
def func(x):
if len(x) == N:
print("".join(x))
return
last = ord(max(x)) - ord("a") + 1 if x else 0
for i in range(min(26, last) + 1):
x.append(chr(ord("a") + i))
func(x)
x.pop()
func([])
| [
"call.add",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 524,684 | 524,685 | u057109575 | python |
p02744 | import itertools
#再帰関数のときのRE予防
import sys
sys.setrecursionlimit(312467)
N = int(input())
List = []
def dfs(S):
List.append(S)
if len(S) < N:
for i in range(ord("a"), ord(S[len(S)-1])+2):
dfs(S+[chr(i)])
return
dfs(["a"])
for i in List:
if len(i) == N:
print("".join(i))
elif len(i) > N... | import itertools
#再帰関数のときのRE予防
import sys
sys.setrecursionlimit(312467)
N = int(input())
List = []
def dfs(S):
List.append(S)
if len(S) < N:
for i in range(ord("a"), ord(max(S))+2):
dfs(S+[chr(i)])
return
dfs(["a"])
for i in List:
if len(i) == N:
print("".join(i))
elif len(i) > N:
... | [
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 524,692 | 524,693 | u870559097 | python |
p02744 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**9)
N = int(input())
def main(s, o, n):
n += 1
if n == N:
print(s)
else:
for i in range(97, o + 2):
main(s + chr(i), i, n)
main("a", 97, 0)
| #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**9)
N = int(input())
def main(s, o, n):
n += 1
if n == N:
print(s)
else:
for i in range(97, o + 2):
main(s + chr(i), max(o, i), n)
main("a", 97, 0)
| [
"call.add",
"call.arguments.change"
] | 524,696 | 524,697 | u094999522 | python |
p02744 | from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator impor... | from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator impor... | [
"call.add",
"call.arguments.add"
] | 524,701 | 524,702 | u603958124 | python |
p02744 | def solve(ans, p, n):
if len(p) == n:
s = ""
for v in p:
s += chr(ord("a")+v)
ans.append(s)
return
for v in range(p[-1]+2):
p.append(v)
solve(ans, p, n)
p.pop()
return
def main():
n = int(input())
ans = []
p = [0]
solve(ans... | def solve(ans, p, n):
if len(p) == n:
s = ""
for v in p:
s += chr(ord("a")+v)
ans.append(s)
return
for v in range(max(p)+2):
p.append(v)
solve(ans, p, n)
p.pop()
return
def main():
n = int(input())
ans = []
p = [0]
solve(an... | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 524,703 | 524,704 | u071680334 | python |
p02744 | import sys
sys.setrecursionlimit(1000000)
n=int(input())
def dfs(s,x):
if len(s)==n:
print(s)
else:
for i in range(x):
dfs(s+chr(ord("a")+i),i+1)
dfs(s+chr(ord("a")+x),x+1)
dfs("a",1)
| import sys
sys.setrecursionlimit(1000000)
n=int(input())
def dfs(s,x):
if len(s)==n:
print(s)
else:
for i in range(x):
dfs(s+chr(ord("a")+i),x)
dfs(s+chr(ord("a")+x),x+1)
dfs("a",1)
| [
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 524,707 | 524,708 | u519968172 | python |
p02744 | def getN():
return int(input())
def getNM():
return map(int, input().split())
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(input()) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
return random.randint(ran1,... | def getN():
return int(input())
def getNM():
return map(int, input().split())
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(input()) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
return random.randint(ran1,... | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 524,713 | 524,714 | u145231176 | python |
p02744 | n = int(input())
alp = [chr(i) for i in range(97, 97+26)]
def dfs(i):
if i == 1:
return [("a", 1)]
else:
ret = []
for i in dfs(i-1):
nowstr, nowmax = i
for j in range(nowmax+1):
ret.append((nowstr+alp[j], max(j,nowmax)))
return ret
ans =... | n = int(input())
alp = [chr(i) for i in range(97, 97+26)]
def dfs(i):
if i == 1:
return [("a", 1)]
else:
ret = []
for i in dfs(i-1):
nowstr, nowmax = i
for j in range(nowmax+1):
ret.append((nowstr+alp[j], max(j+1,nowmax)))
return ret
ans... | [
"call.arguments.add"
] | 524,715 | 524,716 | u855831834 | python |
p02744 | import sys
sys.setrecursionlimit(10 ** 8)
n = int(input())
alp = "abcdefghijklmnopqrstuvwxyz"
permutations = []
def dfs(a, size):
if len(a) == size:
global permutations
permutations.append(a)
return
for i in range(1, a[-1] + 2):
dfs(a + [i], size)
dfs([1], n)
for i in permutati... | import sys
sys.setrecursionlimit(10 ** 8)
n = int(input())
alp = "abcdefghijklmnopqrstuvwxyz"
permutations = []
def dfs(a, size):
if len(a) == size:
global permutations
permutations.append(a)
return
for i in range(1, max(a) + 2):
dfs(a + [i], size)
dfs([1], n)
for i in permutat... | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 524,720 | 524,721 | u067694718 | python |
p02744 | import sys
sys.setrecursionlimit(10**7)
readline = sys.stdin.buffer.readline
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print('\n'.join(map(str,x)... | import sys
sys.setrecursionlimit(10**7)
readline = sys.stdin.buffer.readline
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print('\n'.join(map(str,x)... | [
"call.remove"
] | 524,724 | 524,725 | u190405389 | python |
p02744 | def dfs(i,sent):
if len(sent)==N:
print(sent)
return
if i>N:
return
for j in range(i+1):
dfs(max(i,j),sent+chara[j])
return
N=int(input())
chara=["a","b","c","d","e","f","g","h","i","j"]
chara=chara[:N]
dfs(1,"a") | def dfs(i,sent):
if len(sent)==N:
print(sent)
return
if i>N:
return
for j in range(i+1):
dfs(max(i,j+1),sent+chara[j])
return
N=int(input())
chara=["a","b","c","d","e","f","g","h","i","j"]
chara=chara[:N]
ans=[]
dfs(1,"a") | [
"expression.operation.binary.add",
"assignment.add"
] | 524,728 | 524,729 | u703528810 | python |
p02744 | from itertools import combinations_with_replacement
N = int(input())
C = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j']
DP = [set() for _ in range(N)]
DP[0].add((1, 'a'))
for i in range(1, N):
for num, s in DP[i-1]:
for j in range(num):
DP[i].add((num, s + C[j]))
DP[i].add((num + 1... | from itertools import combinations_with_replacement
N = int(input())
C = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j']
DP = [set() for _ in range(N)]
DP[0].add((1, 'a'))
for i in range(1, N):
for num, s in DP[i-1]:
for j in range(num):
DP[i].add((num, s + C[j]))
DP[i].add((num + 1... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 524,730 | 524,731 | u038021590 | python |
p02744 | n = int(input())
def dfs(s, mx):
if len(s) == n:
print(s)
else:
for i in range(0, mx +1):
c = chr(ord('a')+i)
dfs(s+c, mx +1) if i == mx else dfs(s+c, mx)
df('', 0) | n = int(input())
def dfs(s, mx):
if len(s) == n:
print(s)
else:
for i in range(0, mx +1):
c = chr(ord('a')+i)
dfs(s+c, mx +1) if i == mx else dfs(s+c, mx)
dfs('', 0) | [
"identifier.change",
"call.function.change"
] | 524,738 | 524,739 | u289102924 | python |
p02744 | import queue
n = int(input())
alp = "abcdefghijklmn"
q = queue.Queue()
q.put("a")
while not q.empty():
qi = q.get()
if len(qi) == n:
print(qi)
elif len(qi) < n:
idx = alp.index(qi[-1])
for i in range(idx+2):
q.put(qi+alp[i])
| import queue
n = int(input())
alp = "abcdefghijklmn"
q = queue.Queue()
q.put("a")
while not q.empty():
qi = q.get()
if len(qi) == n:
print(qi)
elif len(qi) < n:
idx = alp.index(max(qi))
for i in range(idx+2):
q.put(qi+alp[i])
| [
"call.add",
"assignment.value.change",
"call.arguments.change"
] | 524,744 | 524,745 | u169350228 | python |
p02744 | import sys
from collections import deque
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N = int(readline())
if N==1:
print('a')
exit()
d = deque(['a'])
ans = []
while d:
s = d.popleft()
last = ord(... | import sys
from collections import deque
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N = int(readline())
if N==1:
print('a')
exit()
d = deque(['a'])
ans = []
while d:
s = d.popleft()
last = ord(... | [
"call.add",
"assignment.value.change",
"call.arguments.change"
] | 524,746 | 524,747 | u193264896 | python |
p02744 | import sys
import re
import math
import collections
import decimal
import bisect
import itertools
import fractions
import functools
import copy
import heapq
import decimal
import statistics
import queue
sys.setrecursionlimit(10000001)
INF = 10 ** 10
MOD = 10 ** 9 + 7
ni = lambda: int(sys.stdin.readline())
ns = lambda... | import sys
import re
import math
import collections
import decimal
import bisect
import itertools
import fractions
import functools
import copy
import heapq
import decimal
import statistics
import queue
sys.setrecursionlimit(10000001)
INF = 10 ** 10
MOD = 10 ** 9 + 7
ni = lambda: int(sys.stdin.readline())
ns = lambda... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 524,755 | 524,756 | u888337853 | python |
p02744 | n = int(input())
w = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j"]
s = {}
s["a"] = 0
ans = [s]
for i in range(2, n+1):
new_s = {}
for t in s.items():
for j in range(1, i):
if t[0][-1] == w[j-1]:
for k in range(i):
new_s[t[0] + w[k]] = max(t[1], k... | n = int(input())
w = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j"]
s = {}
s["a"] = 0
ans = [s]
for i in range(2, n+1):
new_s = {}
for t in s.items():
for j in range(1, i):
if t[0][-1] == w[j-1]:
for k in range(t[1] + 2):
new_s[t[0] + w[k]] = max(... | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 524,757 | 524,758 | u123872895 | python |
p02744 | n=int(input())
from collections import deque
d=deque(['a'])
c=[chr(i) for i in range(97, 97+26)]
ans=set([])
while d:
y=d.pop()
if len(y)==n:
ans.add(y)
now=c.index(y[-1])
for z in range(min(now+2,n+1)):
if z>-1 and len(y)<n:
d.append(y+c[z])
for z in sorted(list(ans)):
print(z) | n=int(input())
from collections import deque
d=deque(['a'])
c=[chr(i) for i in range(97, 97+26)]
ans=set([])
while d:
y=d.pop()
if len(y)==n:
ans.add(y)
now=c.index(sorted(y)[-1])
for z in range(min(now+2,n+1)):
if z>-1 and len(y)<n:
d.append(y+c[z])
for z in sorted(list(ans)):
print(z) | [
"call.add",
"call.arguments.change"
] | 524,763 | 524,764 | u769870836 | python |
p02743 | a,b,c=map(int,input().split(' '))
if 4*a*b>(c-(a+b))**2 or a+b>c:
print('No')
else:
print('Yes') | a,b,c=map(int,input().split(' '))
if 4*a*b>=(c-(a+b))**2 or a+b>c:
print('No')
else:
print('Yes') | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 524,779 | 524,780 | u474423089 | python |
p02743 | a,b,c = map(int,input().split())
d = 4 * a * b
e = (c - a - b) * (c - a - b)
if d < e or (c - a - b) < 0:
print("Yes")
else:
print("No") | a,b,c = map(int,input().split())
d = 4 * a * b
e = (c - a - b) * (c - a - b)
if d < e and 0 < (c - a - b):
print("Yes")
else:
print("No") | [
"control_flow.branch.if.condition.change"
] | 524,787 | 524,786 | u543189005 | python |
p02743 | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def resolve():
a, b, c = lr()
if a+b-c > 0:
print('No')
if (a+b-c)**2 > 4*a*b:
print('Yes')
else:
print('No')
resolve() | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def resolve():
a, b, c = lr()
if a+b-c > 0:
print('No')
elif (a+b-c)**2 > 4*a*b:
print('Yes')
else:
print('No')
resolve() | [
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 524,804 | 524,805 | u415888833 | python |
p02743 | import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
from math import gcd
from copy import deepcopy
import math
import queue
import numpy as np
#import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys
sys.setrecursi... | import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
from math import gcd
from copy import deepcopy
import math
import queue
import numpy as np
#import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys
sys.setrecursi... | [] | 524,806 | 524,807 | u928784113 | python |
p02743 | import math
a,b,c = map(int,input().split())
if (a+b-c) ** 2 - 4 * a * b > 0:
print("Yes")
else:
print("No") | import math
a,b,c = map(int,input().split())
if (a+b-c) ** 2 - 4 * a * b > 0 and a+b < c:
print("Yes")
else:
print("No")
# print((a+b-c) ** 2 - 4 * a * b ) | [
"control_flow.branch.if.condition.change"
] | 524,828 | 524,829 | u738898077 | python |
p02743 | # -*- coding: utf-8 -*-
import sys
import math
debug = False
def log(text):
if debug:
print(text)
def parse_input(lines_as_string = None):
global debug
lines = []
if lines_as_string is None:
debug = False
# for line in sys.stdin:
# lines.append(line)
lin... | # -*- coding: utf-8 -*-
import sys
import math
debug = False
def log(text):
if debug:
print(text)
def parse_input(lines_as_string = None):
global debug
lines = []
if lines_as_string is None:
debug = False
# for line in sys.stdin:
# lines.append(line)
lin... | [
"control_flow.branch.if.add"
] | 524,830 | 524,831 | u000557170 | python |
p02743 | a, b, c = [int(n) for n in input().split()]
l = 4 * a * b
r = (c - a - b) ** 2
if c <= a + b and l < r:
print('Yes')
else:
print('No') | a, b, c = [int(n) for n in input().split()]
l = 4 * a * b
r = (c - a - b) ** 2
if c > a + b and l < r:
print('Yes')
else:
print('No') | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 524,838 | 524,839 | u979684411 | python |
p02743 | a, b, c = [int(n) for n in input().split()]
l = 4 * a * b
r = (c - a - b) ** 2
if l < r:
print('Yes')
else:
print('No')
| a, b, c = [int(n) for n in input().split()]
l = 4 * a * b
r = (c - a - b) ** 2
if c > a + b and l < r:
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change"
] | 524,840 | 524,839 | u979684411 | python |
p02743 | import sys
a, b, c = map(int, sys.stdin.readline().split())
if c <= a + b:
print('No')
if 4 * a * b < (c - a - b) ** 2:
print('Yes')
else:
print('No') | import sys
a, b, c = map(int, sys.stdin.readline().split())
if c <= a + b:
print('No')
elif 4 * a * b < (c - a - b) ** 2:
print('Yes')
else:
print('No') | [
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 524,851 | 524,852 | u957316029 | python |
p02744 | N = int(input())
chl = "abcdefghijk"
chli = {
'a':0,
'b':1,
'c':2,
'd':3,
'e':4,
'f':5,
'g':6,
'h':7,
'i':8,
'j':9
}
def ret(M):
if M == 1:
return "a"
retl = []
for stra in ret(M-1):
maxi = min(chli[stra[-1]] + 2, 10)
cand = chl[:maxi]
for ch in cand:
retl.append(stra + ... | N = int(input())
chl = "abcdefghijk"
chli = {
'a':0,
'b':1,
'c':2,
'd':3,
'e':4,
'f':5,
'g':6,
'h':7,
'i':8,
'j':9
}
def ret(M):
if M == 1:
return "a"
retl = []
for stra in ret(M-1):
maxi = min(chli[sorted(stra)[-1]] + 2, 10)
cand = chl[:maxi]
for ch in cand:
retl.append... | [
"call.add",
"call.arguments.change"
] | 524,875 | 524,876 | u457901067 | python |
p02744 | from string import ascii_lowercase as alph
def gen_pattern(N, pre=""):
for c in alph[:ord(max(pre or "\x60"))-0x5f]:
pattern = pre+c
if len(pattern) == N:
yield pattern
else:
yield from gen_pattern(N, pattern)
for pattern in gen_pattern(3):
print(pattern)
| from string import ascii_lowercase as alph
def gen_pattern(N, pre=""):
for c in alph[:ord(max(pre or "\x60"))-0x5f]:
pattern = pre+c
if len(pattern) == N:
yield pattern
else:
yield from gen_pattern(N, pattern)
for pattern in gen_pattern(int(input())):
print(pattern)
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"call.arguments.add"
] | 524,877 | 524,878 | u837673618 | python |
p02744 | from string import ascii_lowercase as alph
def gen_pattern(N, pre="", m=-1):
for i, c in enumerate(alph[:m+2]):
pat = pre+c
if len(pattern) == N:
yield pattern
else:
yield from gen_pattern(N, pat, max(i,m))
for pattern in gen_pattern(int(input())):
print(pattern)
| from string import ascii_lowercase as alph
def gen_pattern(N, pre="", m=-1):
for i, c in enumerate(alph[:m+2]):
pat = pre+c
if len(pat) == N:
yield pat
else:
yield from gen_pattern(N, pat, max(i,m))
for pattern in gen_pattern(int(input())):
print(pattern)
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 524,880 | 524,881 | u837673618 | python |
p02744 | from itertools import product, combinations_with_replacement
N=int(input())
s="abcdefghij"
def get_gen(a, N):
for c in s[:s.index(max(a))+2]:
t = a+c
if len(t) == N:
print(t)
else:
get_gen(t,N)
get_gen("a", N) | from itertools import product, combinations_with_replacement
N=int(input())
s="abcdefghij"
def get_gen(a, N):
for c in s[:s.index(max(a))+2 if a else 1]:
t = a+c
if len(t) == N:
print(t)
else:
get_gen(t,N)
get_gen("", N) | [
"literal.string.change",
"call.arguments.change"
] | 524,883 | 524,884 | u837673618 | python |
p02744 | N = int(input())
alphabet_list = [chr(i) for i in range(97, 97 + N)]
import collections
previous_list = ["a"]
for i in range(1, N):
out_list = []
for a in previous_list:
# print(len(collections.Counter(a)))
for al in alphabet_list[:len(collections.Counter(a))+2]:
# print(a + al)
... | N = int(input())
alphabet_list = [chr(i) for i in range(97, 97 + N)]
import collections
previous_list = ["a"]
for i in range(1, N):
out_list = []
for a in previous_list:
# print(len(collections.Counter(a)))
for al in alphabet_list[:len(collections.Counter(a))+1]:
# print(a + al)
... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 524,893 | 524,894 | u618002097 | python |
p02744 | N = int(input())
char = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j']
def search(arr):
global N, char
if len(arr) == N:
ans = ''.join([char[x] for x in arr])
print(ans)
return
else:
for i in range(arr[-1] + 2):
arr_next = arr + [i]
search(arr_next)
search([0]) | N = int(input())
char = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j']
def search(arr):
global N, char
if len(arr) == N:
ans = ''.join([char[x] for x in arr])
print(ans)
return
else:
for i in range(max(arr) + 2):
arr_next = arr + [i]
search(arr_next)
search([0]) | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 524,895 | 524,896 | u426764965 | python |
p02744 | import sys
sys.setrecursionlimit(10**8)
alpha = "abcdefghij"
ans = []
N = int(input())
def get_right(S):
alpha_idx = 0
for i in range(len(S)):
idx = S.find(alpha[i])
if idx > 0:
alpha_idx = idx
return alpha_idx + 2
def dfs(S):
if len(S) == N:
ans.append(S)
els... | import sys
sys.setrecursionlimit(10**8)
alpha = "abcdefghij"
ans = []
N = int(input())
def get_right(S):
alpha_idx = 0
for i in range(len(S)):
flag = S.find(alpha[i])
if flag > 0:
alpha_idx = i
return alpha_idx + 2
def dfs(S):
if len(S) == N:
ans.append(S)
els... | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 524,902 | 524,903 | u707498674 | python |
p02744 | n=int(input())
a=[[] for _ in range(n)]
a[0]="a"
al=["a","b","c","d","e","f","g","h","i","j"]
b=[[] for _ in range(n)]
b[0]=[1]
for i in range(1,n):
for j in range(len(a[i-1])):
for k in range(b[i-1][j]+1):
a[i].append(a[i-1][j]+al[k])
if b[i-1][j]<=i+1:
b[i].append(b... | n=int(input())
a=[[] for _ in range(n)]
a[0]="a"
al=["a","b","c","d","e","f","g","h","i","j"]
b=[[] for _ in range(n)]
b[0]=[1]
for i in range(1,n):
for j in range(len(a[i-1])):
for k in range(b[i-1][j]+1):
a[i].append(a[i-1][j]+al[k])
if b[i-1][j]>=k+1:
b[i].append(b... | [
"control_flow.loop.for.condition.change",
"identifier.change"
] | 524,914 | 524,915 | u239653493 | python |
p02744 | import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from math import gcd
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
mod=pow(10,9)+7
n=int(input())
al=[chr(ord('a') + ... | import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from math import gcd
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
mod=pow(10,9)+7
n=int(input())
al=[chr(ord('a') + ... | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 524,928 | 524,929 | u654470292 | python |
p02744 | N = int(input())
lst = []
m = 0
temp = [[0]]
while temp:
p = temp.pop()
if len(p)==N:
lst.append(p)
else:
for i in range(p[-1]+2):
s = p[:]
s.append(i)
temp.append(s)
lst.sort()
abc = 'abcdefghij'
for l in lst:
print(*[abc[i] for i in l], sep='')
| N = int(input())
lst = []
m = 0
temp = [[0]]
while temp:
p = temp.pop()
if len(p)==N:
lst.append(p)
else:
for i in range(max(p)+2):
s = p[:]
s.append(i)
temp.append(s)
lst.sort()
abc = 'abcdefghij'
for l in lst:
print(*[abc[i] for i in l], sep='')
| [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 524,932 | 524,933 | u185948224 | python |
p02744 | n = int(input())
def dfs(s):
if len(s) == n:
print(s)
else:
for i in range(ord(s[len(s) - 1]) - ord('a') + 2):
dfs(s + chr(i + ord('a')))
s = 'a'
dfs(s) | n = int(input())
def dfs(s):
if len(s) == n:
print(s)
else:
for i in range(ord(max(s)) - ord('a') + 2):
dfs(s + chr(i + ord('a')))
s = 'a'
dfs(s) | [
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 524,942 | 524,943 | u135961419 | python |
p02744 | def f(n, count=0, i=0, lst=[]):
global ans
if count == n:
s = ""
for j in range(count):
s += chr(ord("a") + lst[j])
ans.append(s)
return
if i == 0:
lst.append(i)
f(n, count + 1, i=i+1, lst=lst)
else:
for j in range(i + 1):
f... | def f(n, count=0, i=0, lst=[]):
global ans
if count == n:
s = ""
for j in range(count):
s += chr(ord("a") + lst[j])
ans.append(s)
return
if i == 0:
lst.append(i)
f(n, count + 1, i=i+1, lst=lst)
else:
for j in range(i + 1):
f... | [
"expression.operation.binary.add"
] | 524,952 | 524,953 | u586368075 | python |
p02744 | N = int(input())
ans = []
def next_chr(ch):
res = []
g = ord(ch) - ord("a") + 2
for i in range(g):
res.append(chr(ord("a")+i))
return res
def answer(s, i):
if i == N:
ch = next_chr(max(s))
for m in ch:
ans.append("".join([s, m]))
else:
i += 1
... | N = int(input())
ans = []
def next_chr(ch):
res = []
g = ord(ch) - ord("a") + 2
for i in range(g):
res.append(chr(ord("a")+i))
return res
def answer(s, i):
if i == N:
ch = next_chr(max(s))
for m in ch:
ans.append("".join([s, m]))
else:
i += 1
... | [
"call.add",
"assignment.value.change",
"call.arguments.change"
] | 524,954 | 524,955 | u224353074 | python |
p02744 | N = int(input())
answer = [(97, 'a')]
for _ in range(N - 1):
new_answer = []
for i, j in answer:
for k in range(97, i + 1):
new_answer.append((k, j + chr(k)))
new_answer.append((i+1,j+chr(i+1)))
answer = new_answer[:]
answer = [j for _, j in answer]
answer.sort()
print('\n'.joi... | N = int(input())
answer = [(97, 'a')]
for _ in range(N - 1):
new_answer = []
for i, j in answer:
for k in range(97, i + 1):
new_answer.append((i, j + chr(k)))
new_answer.append((i+1,j+chr(i+1)))
answer = new_answer[:]
answer = [j for _, j in answer]
answer.sort()
print('\n'.joi... | [
"identifier.change",
"call.arguments.change"
] | 524,956 | 524,957 | u945181840 | python |
p02744 | alpha_small_ = [chr(i) for i in range(97, 97+26)] #アルファベッドの小文字
n = int(input())
ans = []
def solve(now,i):
if len(now) == n:
ans.append(now)
return
for j in range(i+1):
solve(now+alpha_small_[j],j+1)
solve("a",1)
for x in sorted(ans):
print(x) | alpha_small_ = [chr(i) for i in range(97, 97+26)] #アルファベッドの小文字
n = int(input())
ans = []
def solve(now,i):
if len(now) == n:
ans.append(now)
return
for j in range(i+1):
solve(now+alpha_small_[j],max(i,j+1))
solve("a",1)
for x in sorted(ans):
print(x) | [
"call.add",
"call.arguments.change"
] | 524,963 | 524,962 | u923279197 | python |
p02744 | import string
def generate(n, res, cur = None, alphabet = None):
if cur is None:
cur = []
if alphabet is None:
alphabet = list(string.ascii_lowercase)[::-1]
if n == 0:
res.append(''.join(cur))
return
for i in range(len(cur)):
cur.append(cur[i])
generate(n... | import string
def generate(n, res, cur = None, alphabet = None):
if cur is None:
cur = []
if alphabet is None:
alphabet = list(string.ascii_lowercase)[::-1]
if n == 0:
res.append(''.join(cur))
return
for i in range(len(cur)):
cur.append(cur[i])
generate(n... | [
"call.add",
"call.arguments.change"
] | 524,966 | 524,967 | u123525541 | python |
p02744 | import string
def generate(n, res, cur = None, alphabet = None):
if cur is None:
cur = []
if alphabet is None:
alphabet = list(string.ascii_lowercase)[::-1]
if n == 0:
res.append(''.join(cur))
return
for i in range(len(cur)):
cur.append(cur[i])
generate(n... | import string
def generate(n, res, cur = None, alphabet = None):
if cur is None:
cur = []
if alphabet is None:
alphabet = list(string.ascii_lowercase)[::-1]
if n == 0:
res.append(''.join(cur))
return
for i in range(len(cur)):
cur.append(cur[i])
generate(n... | [
"call.add"
] | 524,968 | 524,967 | u123525541 | python |
p02744 | N = int(input())
W = 'abcdefghij'
ans = set()
for i in range(1,N+1):
if i == 1:
ans.add('a')
else:
tmp = set()
for a in ans:
index = W.index(sorted(list(a))[-1])
for i in range(index+2):
tmp.add(a+W[i])
ans = tmp
for a in ans:
print(a) | N = int(input())
W = 'abcdefghij'
ans = set()
for i in range(1,N+1):
if i == 1:
ans.add('a')
else:
tmp = set()
for a in ans:
index = W.index(sorted(list(a))[-1])
for i in range(index+2):
tmp.add(a+W[i])
ans = tmp
for a in sorted(ans):
print(a) | [
"call.add",
"call.arguments.change"
] | 524,969 | 524,970 | u086503932 | python |
p02744 | def main(n):
if n == 1:
return ['a']
else:
ans = []
for a in main(n-1):
b = '`'
while b <= a[-1]:
b = chr(ord(b) + 1)
ans.append(a + str(b))
return ans
N = int(input())
L = main(N)
for i in L:
print(i)
| def main(n):
if n == 1:
return ['a']
else:
ans = []
for a in main(n-1):
b = '`'
while b <= max(a):
b = chr(ord(b) + 1)
ans.append(a + str(b))
return ans
N = int(input())
L = main(N)
for i in L:
print(i)
| [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 524,971 | 524,972 | u534953209 | python |
p02744 | from collections import deque
N = int(input())
alpha = ['a','b','c','d','e','f','g','h','i','j']
ans = []
stack = deque(['a'])
while stack:
if len(stack[-1]) == N:
break
s = stack.pop()
s_list = list(s)
index = alpha.index(s_list[-1])
for i in range(index+2):
stack.appendleft(s+alp... | from collections import deque
N = int(input())
alpha = ['a','b','c','d','e','f','g','h','i','j']
ans = []
stack = deque(['a'])
while stack:
if len(stack[-1]) == N:
break
s = stack.pop()
s_list = sorted(list(s))
index = alpha.index(s_list[-1])
for i in range(index+2):
stack.appendle... | [
"call.add",
"call.arguments.change"
] | 524,979 | 524,980 | u231189826 | python |
p02744 | from string import ascii_lowercase
def resolve():
n = int(input())
l = [[0]]
for i in range(1, n):
ll = []
for j in l:
for k in range(j[-1] + 2):
ll.append(j + [k])
l = ll
for i in l:
print("".join([ascii_lowercase[x] for x in i]))
if __name_... | from string import ascii_lowercase
def resolve():
n = int(input())
l = [[0]]
for i in range(1, n):
ll = []
for j in l:
for k in range(max(j) + 2):
ll.append(j + [k])
l = ll
for i in l:
print("".join([ascii_lowercase[x] for x in i]))
if __name... | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 524,985 | 524,986 | u762540523 | python |
p02744 | n = int(input())
strings = ["a"]
for i in range(n-1):
newstrings = []
for s in strings:
mx = ord('a')
for char in s:
mx = max(mx, ord(char))
for c in range(ord('a'),mx+2):
newstrings.append(s+chr(c))
strings = newstrings
print(strings) | n = int(input())
strings = ["a"]
for i in range(n-1):
newstrings = []
for s in strings:
mx = ord('a')
for char in s:
mx = max(mx, ord(char))
for c in range(ord('a'),mx+2):
newstrings.append(s+chr(c))
strings = newstrings
for s in strings:
... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 524,991 | 524,992 | u034170391 | python |
p02744 | import random as rng
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)
def dump_impl(*objects):
print(*objects, file=sys.stderr)
def dump_dummy(*objects):
pass
dump = dump_impl if "DEBUG" in sys.argv else dump_dummy
def f(s, m, ... | import random as rng
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)
def dump_impl(*objects):
print(*objects, file=sys.stderr)
def dump_dummy(*objects):
pass
dump = dump_impl if "DEBUG" in sys.argv else dump_dummy
def f(s, m, ... | [
"expression.operation.binary.add"
] | 525,008 | 525,009 | u465699806 | python |
p02744 | n = int(input())
def print_from_l(l):
print(''.join(map(lambda s:chr(97+s), l)))
def g(l):
if len(l) == n:
print_from_l(l)
else:
for i in range(l[-1]+2):
g(l + [i])
g([0]) | n = int(input())
def print_from_l(l):
print(''.join(map(lambda s:chr(97+s), l)))
def g(l):
if len(l) == n:
print_from_l(l)
else:
for i in range(max(l)+2):
g(l + [i])
g([0]) | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 525,010 | 525,011 | u384094369 | python |
p02744 | n = int(input())
a = [0]*n
def print_str():
for i in reversed(a):
print(chr(97+i), end='')
print()
print_str()
while True:
for i in range(n-1):
if a[i] <= a[i+1]:
a[i] += 1
for j in range(i):
a[j] = 0
print_str()
break
els... | n = int(input())
a = [0]*n
def print_str():
for i in reversed(a):
print(chr(97+i), end='')
print()
print_str()
while True:
for i in range(n-1):
if a[i] <= max(a[i+1:]):
a[i] += 1
for j in range(i):
a[j] = 0
print_str()
break
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 525,012 | 525,013 | u318127926 | python |
p02744 | # -*- coding: utf-8 -*-
from collections import deque
import copy
str_list_befor = ['0', '1', '2','3','4','5', '6', '7','8','9']
str_list_after = ['a', 'b', 'c','d','e','f', 'g', 'h','i','j']
n = int(input())
dq = deque()
dq.append([0])
if n > 1:
for i in range(n-1):
# print("i: " + str(i))
for j ... | # -*- coding: utf-8 -*-
from collections import deque
import copy
str_list_befor = ['0', '1', '2','3','4','5', '6', '7','8','9']
str_list_after = ['a', 'b', 'c','d','e','f', 'g', 'h','i','j']
n = int(input())
dq = deque()
dq.append([0])
if n > 1:
for i in range(n-1):
# print("i: " + str(i))
for j ... | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 525,018 | 525,019 | u326245870 | python |
p02744 | import math
N = int(input())
ZL = [[] for _ in range(N)]
ZL[0].append([0])
for i in range(1, N):
for szl in ZL[i - 1]:
n1 = szl[-1]
for j in range(n1 + 2):
ZL[i].append(szl + [j])
def func(i):
if i == 0:
return "a"
if i == 1:
return "b"
if i == 2:
r... | import math
N = int(input())
ZL = [[] for _ in range(N)]
ZL[0].append([0])
for i in range(1, N):
for szl in ZL[i - 1]:
n1 = max(szl)
for j in range(n1 + 2):
ZL[i].append(szl + [j])
def func(i):
if i == 0:
return "a"
if i == 1:
return "b"
if i == 2:
... | [
"call.add",
"assignment.value.change"
] | 525,020 | 525,021 | u672220554 | python |
p02744 | N = int(input())
az = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
def norm(n, in_list):
out_list = []
for line in in_list:
for i in range(len(set(line))+1):
new_line = line + alphabet[i]
out_list.append(new_line)
return ou... | N = int(input())
az = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
def norm(n, in_list):
out_list = []
for line in in_list:
for i in range(len(set(line))+1):
new_line = line + az[i]
out_list.append(new_line)
return out_list... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 525,024 | 525,023 | u975820355 | python |
p02744 | n=int(input())
tree = [[0,1]]
for _ in range(n-1):
tree = [ t+[i] for t in tree for i in range(1,t[-1]+2) ]
for t in tree:
print( "".join([chr(ord("a")+tt-1) for tt in t[1:] ] ) ) | n=int(input())
tree = [[0,1]]
for _ in range(n-1):
tree = [ t+[i] for t in tree for i in range(1,max(t)+2) ]
for t in tree:
print( "".join([chr(ord("a")+tt-1) for tt in t[1:] ] ) ) | [
"call.add",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 525,031 | 525,032 | u586759271 | python |
p02744 | l = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n"]
n = int(input())
ans = [[] for i in range(n)]
ans[0].append("a")
for i in range(1,n):
print(ans)
for j in ans[i-1]:
a = 0
for k in j:
a = max(a,ord(k)-ord("a"))
for k in range(a+2):
an = j + l[k]
... | l = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n"]
n = int(input())
ans = [[] for i in range(n)]
ans[0].append("a")
for i in range(1,n):
for j in ans[i-1]:
a = 0
for k in j:
a = max(a,ord(k)-ord("a"))
for k in range(a+2):
an = j + l[k]
ans... | [
"call.remove"
] | 525,042 | 525,043 | u368796742 | python |
p02744 | import sys
sys.setrecursionlimit(10**5+10)
alp = 'abcdefghij'
N = int(input())
ans = []
def an(i,now,s):
global ans
if i == N:
ans.append(s)
else:
for j in range(i+1):
if j > now+1:
continue
an(i+1,j,s+alp[j])
an(0,0,'')
ans.sort()
for i in an... | import sys
sys.setrecursionlimit(10**5+10)
alp = 'abcdefghij'
N = int(input())
ans = []
def an(i,now,s):
global ans
if i == N:
ans.append(s)
else:
for j in range(i+1):
if j > now+1:
continue
an(i+1,max(j,now),s+alp[j])
an(0,0,'')
ans.sort()
fo... | [
"call.add",
"call.arguments.add"
] | 525,044 | 525,045 | u540761833 | python |
p02744 | import sys
n = int(input())
memo_ls = [{i : [] for i in range(11)} for j in range(11)]
alpha = "abcdefghijklmnopqrstuvwxyz"
#memo_ls[i][j] : i個をjに分ける方法
memo_ls[1][1] = ["a"]
for i in range(1,10):
for j in range(11):
if j > i:
continue
else:
for v in memo_ls[i][j]:
... | import sys
n = int(input())
memo_ls = [{i : [] for i in range(11)} for j in range(11)]
alpha = "abcdefghijklmnopqrstuvwxyz"
#memo_ls[i][j] : i個をjに分ける方法
memo_ls[1][1] = ["a"]
for i in range(1,10):
for j in range(11):
if j > i:
continue
else:
for v in memo_ls[i][j]:
... | [
"call.add",
"call.arguments.change"
] | 525,046 | 525,047 | u190406011 | python |
p02744 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
from collections import deque, Counter
def getN():
return int(input())
def getList():
return list(map(int, input().split()))
import math
def res(n, cur, ln, k):
if ln == n:
print(cur)
return
for i in range(k+2):
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
from collections import deque, Counter
def getN():
return int(input())
def getList():
return list(map(int, input().split()))
import math
def res(n, cur, ln, k):
if ln == n:
print(cur)
return
for i in range(k+2):
... | [
"call.add",
"call.arguments.change"
] | 525,048 | 525,049 | u827202523 | python |
p02744 | N = int(input())
my_list = []
for i in range(N):
if i == 0:
my_list.append("a")
continue
new_list = []
while my_list:
s = my_list.pop(0)
for j in range(ord("a"), ord(s[-1]) + 2):
new_list.append(s + chr(j))
my_list += new_list
my_list.sort()
[print(s) for s ... | N = int(input())
my_list = []
for i in range(N):
if i == 0:
my_list.append("a")
continue
new_list = []
while my_list:
s = my_list.pop(0)
for j in range(ord("a"), ord(max(s)) + 2):
new_list.append(s + chr(j))
my_list += new_list
my_list.sort()
[print(s) for s... | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 525,050 | 525,051 | u712284046 | python |
p02744 | N = int(input())
L = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j"]
ans = []
def f(List, n):
if n == N:
s = ""
for l in List:
s += L[l]
ans.append(s)
return None
for i in range(List[-1]+2):
f(List+[i], n+1)
f([0], 1)
ans.sort()
for a in ans:
... | N = int(input())
L = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j"]
ans = []
def f(List, n):
if n == N:
s = ""
for l in List:
s += L[l]
ans.append(s)
return None
for i in range(max(List)+2):
f(List+[i], n+1)
f([0], 1)
ans.sort()
for a in ans:
... | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 525,066 | 525,067 | u504836877 | python |
p02744 | N = input()
def DFS(s, mx):
if len(s) == N:
print(s)
return
c = 'a'
while c <= chr(ord(mx)+1):
t = s + c
DFS(t, chr(max(ord(c), ord(mx))))
c = chr(ord(c) + 1)
DFS("", chr(ord('a')-1))
| N = int(input())
def DFS(s, mx):
if len(s) == N:
print(s)
return
c = 'a'
while c <= chr(ord(mx)+1):
t = s + c
DFS(t, chr(max(ord(c), ord(mx))))
c = chr(ord(c) + 1)
DFS("", chr(ord('a')-1))
| [
"call.add",
"call.arguments.change"
] | 525,070 | 525,071 | u171077406 | python |
p02744 | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline(... | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline(... | [
"call.add",
"call.arguments.change"
] | 525,082 | 525,083 | u941753895 | python |
p02744 | # coding: utf-8
n = int(input())
alphas = "abcdefghij"
init_str = ""
def standard(moji, x):
if len(moji) == n:
print(moji)
else:
for j in range(x):
if j == x:
standard(moji + alphas[j], i + 1)
else:
standard(moji + alphas[j], i)
standar... | # coding: utf-8
n = int(input())
alphas = "abcdefghij"
init_str = ""
def standard(moji, x):
# print("standard({},{})".format(moji,x))
if len(moji) == n:
print(moji)
else:
for j in range(x+1):
if j == x:
# print("j == x")
standard(moji + alphas[j]... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 525,092 | 525,093 | u007627455 | python |
p02744 | al=[chr(ord('a') + i) for i in range(26)]
def dfs2(N, f):
if len(f) == N:
return f
else:
result = ""
f_index = [al.index(i) for i in f]
for i in range(max(f_index) +1 + 1):#追加できるのは(f+1) + 1
result +=dfs(N, f + al[i])
return result
N = int(input())
ans = dfs2... | al=[chr(ord('a') + i) for i in range(26)]
def dfs(N, f):
if len(f) == N:
return f
else:
result = ""
f_index = [al.index(i) for i in f]
for i in range(max(f_index) +1 + 1):#追加できるのは(f+1) + 1
result +=dfs(N, f + al[i])
return result
N = int(input())
ans = dfs(N... | [
"identifier.change",
"assignment.value.change",
"call.function.change"
] | 525,104 | 525,105 | u990300472 | python |
p02744 | import copy
n = int(input())
ary_list = []
def f(ary, max_num):
if len(ary) == n:
ary_list.append(ary)
return
for i in range(max_num + 2):
next_ary = copy.copy(ary)
next_ary.append(i)
f(next_ary, max_num + 1 if i == max_num + 1 else 0)
f([], -1)
str_list = []
for i in... | import copy
n = int(input())
ary_list = []
def f(ary, max_num):
if len(ary) == n:
ary_list.append(ary)
return
for i in range(max_num + 2):
next_ary = copy.copy(ary)
next_ary.append(i)
f(next_ary, max_num + (1 if i == max_num + 1 else 0))
f([], -1)
str_list = []
for i ... | [
"call.arguments.change"
] | 525,108 | 525,109 | u816587940 | python |
p02744 | import copy
n = int(input())
ary_list = []
def f(ary, max_num):
if len(ary) == n:
ary_list.append(ary)
return
for i in range(max_num + 2):
next_ary = copy.copy(ary)
next_ary.append(i)
f(next_ary, max_num + 1 if i == max_num else 0)
f([], -1)
str_list = []
for i in ran... | import copy
n = int(input())
ary_list = []
def f(ary, max_num):
if len(ary) == n:
ary_list.append(ary)
return
for i in range(max_num + 2):
next_ary = copy.copy(ary)
next_ary.append(i)
f(next_ary, max_num + (1 if i == max_num + 1 else 0))
f([], -1)
str_list = []
for i ... | [
"call.arguments.change"
] | 525,110 | 525,109 | u816587940 | python |
p02744 | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 # 998244353
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n = int(input())
n -= 1
now = ['a']
for _ in range(n):
next = []
for S in now:
d = ord(min(S)) - ord('a')
for i in range... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 # 998244353
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n = int(input())
n -= 1
now = ['a']
for _ in range(n):
next = []
for S in now:
d = ord(max(S)) - ord('a')
for i in range... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 525,121 | 525,122 | u440566786 | python |
p02744 | N = input()
mojis = ["a","b","c","d","e","f","g","h","i","j"]
def append_m(moji):
arr = []
for i in mojis[:len(set(moji))+1]:
arr.append(moji+i)
return arr
arr = ["a"]
for i in range(N-1):
tmp = []
for j in arr:
tmp += append_m(j)
arr = tmp
for i in arr:
print(i) | N = int(input())
mojis = ["a","b","c","d","e","f","g","h","i","j"]
def append_m(moji):
arr = []
for i in mojis[:len(set(moji))+1]:
arr.append(moji+i)
return arr
arr = ["a"]
for i in range(N-1):
tmp = []
for j in arr:
tmp += append_m(j)
arr = tmp
for i in arr:
print(i) | [
"call.add",
"call.arguments.change"
] | 525,125 | 525,126 | u703742468 | python |
p02744 | import string
n = int(input())
cs = string.ascii_lowercase
cm = {cs[i]:i for i in range(len(cs))}
t = 1
def rec(st):
global t
if (len(st) >= n):
print(t, ":", st)
t += 1
return 0
k = max(cm[st[i]]+1 for i in range(len(st)))
for c in cs[: k + 1]:
rec(st+c)
rec('a... | import string
n = int(input())
cs = string.ascii_lowercase
cm = {cs[i]:i for i in range(len(cs))}
t = 1
def rec(st):
global t
if (len(st) >= n):
print(st)
t += 1
return 0
k = max(cm[st[i]]+1 for i in range(len(st)))
for c in cs[: k + 1]:
rec(st+c)
rec('a') | [
"call.arguments.change"
] | 525,129 | 525,130 | u131946248 | python |
p02744 | n=int(input())
ans=[]
def rec(i,s):
if i == n:
print(s)
return
else:
for j in range(len(set(s)) + 1):
rec(i+1,s+chr(old("a")+j))
rec(1,"a") | n=int(input())
ans=[]
def rec(i,s):
if i == n:
print(s)
return
else:
for j in range(len(set(s)) + 1):
rec(i+1,s+chr(ord("a")+j))
rec(1,"a") | [
"call.arguments.change",
"expression.operation.binary.change"
] | 525,133 | 525,134 | u752907966 | python |
p02744 | # D - String Equivalence
from string import ascii_lowercase
def dfs(n: int) -> list:
if n == 1:
return ["a"]
cur = dfs(n - 1)
result = []
for s in cur:
for c in ascii_lowercase[: len(s) + 1]:
result.append(s + c)
return result
def main():
N = int(input())
resu... | # D - String Equivalence
from string import ascii_lowercase
def dfs(n: int) -> list:
if n == 1:
return ["a"]
cur = dfs(n - 1)
result = []
for s in cur:
for c in ascii_lowercase[: len(set(s)) + 1]:
result.append(s + c)
return result
def main():
N = int(input())
... | [
"call.add",
"call.arguments.change"
] | 525,141 | 525,142 | u077291787 | python |
p02744 | import sys
sys.setrecursionlimit(10**7)
N = int(input())
N -= 1
S = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n"]
def dfs(s, depth, maxS):
if depth == N:
print(s)
return
for i in range(maxS+1):
if i == maxS:
dfs(s + S[i], depth+1, i+1)
el... | import sys
sys.setrecursionlimit(10**7)
N = int(input())
N -= 1
S = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n"]
def dfs(s, depth, maxS):
if depth == N:
print(s)
return
for i in range(maxS+1):
if i == maxS:
dfs(s + S[i], depth+1, maxS+1)
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 525,145 | 525,146 | u121192152 | python |
p02744 | import string
N = int(input())
S = string.ascii_letters[:N]
S_idx = {s:i for i, s in enumerate(S)}
def main(s, n):
if n >= N:
return print(s)
idx = S_idx[s[-1]]
for i in S[:idx+2]:
main(s+i, n+1)
main('a', 1) | import string
N = int(input())
S = string.ascii_letters[:N]
S_idx = {s:i for i, s in enumerate(S)}
def main(s, n):
if n >= N:
return print(s)
idx = S_idx[max(s)]
for i in S[:idx+2]:
main(s+i, n+1)
main('a', 1) | [
"call.add",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 525,147 | 525,148 | u268318377 | python |
p02744 | n = int(input())
def dfs(s, mx):
if len(s) == n:
print(s)
else:
for c in [chr(ord('a') + i) for i in range(ord(mx) - ord('a') + 1)]:
dfs(s + c, chr(ord(mx) + 1) if c == mx else mx)
dfx('', 'a') | n = int(input())
def dfs(s, mx):
if len(s) == n:
print(s)
else:
for c in [chr(ord('a') + i) for i in range(ord(mx) - ord('a') + 1)]:
dfs(s + c, chr(ord(mx) + 1) if c == mx else mx)
dfs('', 'a') | [
"identifier.change",
"call.function.change"
] | 525,155 | 525,156 | u062655521 | python |
p02744 | #!/usr/bin/env python3
import sys
from itertools import combinations
def solve(N: int):
d = {n:[] for n in range(1, N+1)}
d[1] = [[1]]
for n in range(1, N):
for lst in d[n]:
last_element = lst[-1]
for new_element in range(1, last_element+2):
d[... | #!/usr/bin/env python3
import sys
from itertools import combinations
def solve(N: int):
d = {n:[] for n in range(1, N+1)}
d[1] = [[1]]
for n in range(1, N):
for lst in d[n]:
last_element = lst[-1]
for new_element in range(1, max(lst)+2):
d[n+1]... | [
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 525,165 | 525,166 | u544587633 | python |
p02744 | n = int(input())
alpha_dict = {}
for i,c in enumerate(range(ord('A'),ord('Z')+1)):
alpha_dict[i] = str(chr(c)).lower()
ans = []
def dfs(s, mx, ans):
if len(s) == n:
ans += [s]
return
else:
for i in range(mx+1):
dfs(s+alpha_dict[i], max(i, mx+1), ans)
dfs("", 0, ans)
ans = sorted(ans)
for a i... | n = int(input())
alpha_dict = {}
for i,c in enumerate(range(ord('A'),ord('Z')+1)):
alpha_dict[i] = str(chr(c)).lower()
ans = []
def dfs(s, mx, ans):
if len(s) == n:
ans += [s]
return
else:
for i in range(mx+1):
dfs(s+alpha_dict[i], max(i+1, mx), ans)
dfs("", 0, ans)
ans = sorted(ans)
for a i... | [
"call.arguments.change",
"call.arguments.add"
] | 525,169 | 525,170 | u844646164 | python |
p02744 | n = int(input())
alpha_dict = {}
for i,c in enumerate(range(ord('A'),ord('Z')+1)):
alpha_dict[i] = str(chr(c)).lower()
ans = []
def dfs(s, mx, ans):
if len(s) == n:
ans += [s]
return
else:
for i in range(mx+1):
dfs(s+alpha_dict[i], max(i, mx+1), ans)
dfs("", 0, ans)
ans = sorted(ans)
for a i... | n = int(input())
alpha_dict = {}
for i,c in enumerate(range(ord('A'),ord('Z')+1)):
alpha_dict[i] = str(chr(c)).lower()
ans = []
def dfs(s, mx, ans):
if len(s) == n:
ans += [s]
return
else:
for i in range(mx+2):
dfs(s+alpha_dict[i], max(i, mx), ans)
dfs("", -1, ans)
ans = sorted(ans)
for a in... | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove",
"expression.operation.unary.add"
] | 525,169 | 525,171 | u844646164 | python |
p02744 | N = int(input())
w = ["a"]
l = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j"]
for i in range(N - 1):
w_init = w
w = []
for j in range(len(w_init)):
for k in range(i + 2):
if w_init[j][-1] == l[k]:
for m in range(k + 2):
w.append(w_init[j] + l[m])
for i in range(len(w)):
print(... | N = int(input())
w = ["a"]
l = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j"]
for i in range(N - 1):
w_init = w
w = []
for j in range(len(w_init)):
for k in range(i + 2):
if max(w_init[j]) == l[k]:
for m in range(k + 2):
w.append(w_init[j] + l[m])
for i in range(len(w)):
print... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 525,174 | 525,175 | u359837458 | python |
p02744 | N = int(input())
import copy
def nex(lis):
li = copy.copy(lis)
if len(li) == N:
print(''.join([chr(97+i) for i in li]))
return
for x in range(li[-1]+2):
li2 = copy.copy(li)
li2.append(x)
nex(li2)
nex([0]) | N = int(input())
import copy
def nex(lis):
li = copy.copy(lis)
if len(li) == N:
print(''.join([chr(97+i) for i in li]))
return
for x in range(max(li)+2):
li2 = copy.copy(li)
li2.append(x)
nex(li2)
nex([0]) | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 525,176 | 525,177 | u150787983 | python |
p02744 | l = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
#print([chr(i) for i in range(97, 97+26)])
def adder(n, s, index):
if (n == 0):
print(s)
else:
#if(n == 1):
for i in range(index +2):
adder... | l = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
#print([chr(i) for i in range(97, 97+26)])
def adder(n, s, index):
if (n == 0):
print(s)
else:
#if(n == 1):
for i in range(index +2):
adder... | [
"call.add",
"call.arguments.add"
] | 525,180 | 525,181 | u693933222 | python |
p02744 | N=int(input())
A=[]
B=[[] for i in range(N+1)]
B[0].append("")
for i in range(N):
A.append(chr(97+i))
for j in B[i]:
for k in A:
B[i+1].append(j+k)
for i in B[N]:
count=ord("a")
yes=1
for j in range(N):
if ord(i[j])<=count+1:
count=max(count,ord(i[j]))
... | N=int(input())
A=[]
B=[[] for i in range(N+1)]
B[0].append("")
for i in range(N):
A.append(chr(97+i))
for j in B[i]:
for k in A:
B[i+1].append(j+k)
for i in B[N]:
count=ord("a")
yes=1
for j in range(N):
if ord(i[j])<=count+1:
count=max(count,ord(i[j]))
... | [] | 525,184 | 525,185 | u054274920 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.