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 |
|---|---|---|---|---|---|---|---|
p02695 | import itertools
n, m, q = map(int, input().split())
abcd = [list(map(int, input().split())) for _ in range(q)]
A_list = list(itertools.combinations_with_replacement(range(1,m),n))
ans = 0
for A in A_list:
sum = 0
for a,b,c,d in abcd:
if A[b-1] - A[a-1] == c:
sum += d
ans = max(ans, s... | import itertools
n, m, q = map(int, input().split())
abcd = [list(map(int, input().split())) for _ in range(q)]
A_list = list(itertools.combinations_with_replacement(range(1,m+1),n))
ans = 0
for A in A_list:
sum = 0
for a,b,c,d in abcd:
if A[b-1] - A[a-1] == c:
sum += d
ans = max(ans,... | [
"control_flow.loop.range.bounds.upper.change",
"assignment.change"
] | 441,120 | 441,121 | u548976218 | python |
p02695 | import itertools
import numpy as np
N,M,Q = map(int, input().split())
a = range(1,M+1)
arr = np.asarray(list(itertools.combinations_with_replacement(a,M))) #重複組み合わせ
#print(arr)
sc = np.zeros(arr.shape[0],dtype=int)
#print(sc)
for i in range(Q):
abcd = list(map(int, input().split()))
f = (arr[:,abcd[1]-1]-arr[:,... | import itertools
import numpy as np
N,M,Q = map(int, input().split())
a = range(1,M+1)
arr = np.asarray(list(itertools.combinations_with_replacement(a,N))) #重複組み合わせ
#print(arr)
sc = np.zeros(arr.shape[0],dtype=int)
#print(sc)
for i in range(Q):
abcd = list(map(int, input().split()))
f = (arr[:,abcd[1]-1]-arr[:,... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 441,145 | 441,146 | u537142137 | python |
p02695 | import itertools
import numpy as np
N,M,Q = map(int, input().split())
a = range(1,M+1)
arr = np.asarray(list(itertools.combinations_with_replacement(a,M))) #重複組み合わせ
#print(arr)
sc = np.zeros(arr.shape[0],dtype=int)
#print(sc)
for i in range(Q):
abcd = list(map(int, input().split()))
f = (arr[:,abcd[1]]-arr[:,ab... | import itertools
import numpy as np
N,M,Q = map(int, input().split())
a = range(1,M+1)
arr = np.asarray(list(itertools.combinations_with_replacement(a,N))) #重複組み合わせ
#print(arr)
sc = np.zeros(arr.shape[0],dtype=int)
#print(sc)
for i in range(Q):
abcd = list(map(int, input().split()))
f = (arr[:,abcd[1]-1]-arr[:,... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 441,147 | 441,146 | u537142137 | python |
p02695 | N ,M ,Q = map(int,input().split())
l = [list(map(int,input().split())) for i in range(Q)]
ans=[]
score = 0
for i1 in range(1,M+1):
for i2 in range(i1,M+1):
for i3 in range(i2,M+1):
for i4 in range(i3,M+1):
for i5 in range(i4,M+1):
for i6 in range(i5,M+1):
... | N ,M ,Q = map(int,input().split())
l = [list(map(int,input().split())) for i in range(Q)]
ans=[]
score = 0
for i1 in range(1,M+1):
for i2 in range(i1,M+1):
for i3 in range(i2,M+1):
for i4 in range(i3,M+1):
for i5 in range(i4,M+1):
for i6 in range(i5,M+1):
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 441,151 | 441,152 | u924717835 | python |
p02695 | from itertools import combinations_with_replacement
N, M, Q = map(int, input().split())
L = []
for _ in range(Q):
L.append(tuple(map(int, input().split())))
ans = 0
_N = N
if N < M:
_N = M
for A in combinations_with_replacement(range(1, M + 1), _N):
tmp = 0
for a, b, c, d in L:
if a < _N and ... | from itertools import combinations_with_replacement
N, M, Q = map(int, input().split())
L = []
for _ in range(Q):
L.append(tuple(map(int, input().split())))
ans = 0
_N = N
if N < M:
_N = M
for A in combinations_with_replacement(range(1, M + 1), _N):
tmp = 0
for a, b, c, d in L:
if a <= _N and... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 441,159 | 441,160 | u577170763 | python |
p02695 | import itertools
n, m, q = map(int, input().split())
abcd = [tuple(map(int, input().split())) for _ in range(Q)]
ans = 0
for com in itertools.combinations_with_replacement(range(1, M + 1), N):
score = sum([d for a, b, c, d in abcd if com[b-1] - com[a-1] == c])
if ans < score:
ans = score
print(ans)
| import itertools
n, m, q = map(int, input().split())
abcd = [tuple(map(int, input().split())) for _ in range(q)]
ans = 0
for com in itertools.combinations_with_replacement(range(1, m + 1), n):
score = sum([d for a, b, c, d in abcd if com[b-1] - com[a-1] == c])
if ans < score:
ans = score
print(ans)
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.change"
] | 441,173 | 441,174 | u279266699 | python |
p02695 | import itertools
N,M,Q = map(int,input().split())
L = [list(map(int,input().split())) for _ in range(Q)]
data = list(range(1,M+1))
A=list(itertools.combinations_with_replacement(data,N))
max_score = 0
for Ai in A:
x = 0
for a,b,c,d in L:
if Ai[b] - Ai[a] == c:
x += d
max_score = max(max_score,x)
print... | import itertools
N,M,Q = map(int,input().split())
L = [list(map(int,input().split())) for _ in range(Q)]
data = list(range(1,M+1))
A=list(itertools.combinations_with_replacement(data,N))
max_score = 0
for Ai in A:
x = 0
for a,b,c,d in L:
if Ai[b-1] - Ai[a-1] == c:
x += d
max_score = max(max_score,x)
p... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 441,182 | 441,183 | u316649390 | python |
p02695 | import itertools
N,M,Q = map(int,input().split())
L = [list(map(int,input().split())) for _ in range(Q)]
date = list(range(1,M+1))
A=list(itertools.combinations_with_replacement(data,N))
max_score = 0
for Ai in A:
x = 0
for a,b,c,d in L:
if Ai[b] - Ai[a] == c:
x += d
max_score = max(max_score,x)
pri... | import itertools
N,M,Q = map(int,input().split())
L = [list(map(int,input().split())) for _ in range(Q)]
data = list(range(1,M+1))
A=list(itertools.combinations_with_replacement(data,N))
max_score = 0
for Ai in A:
x = 0
for a,b,c,d in L:
if Ai[b-1] - Ai[a-1] == c:
x += d
max_score = max(max_score,x)
p... | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 441,184 | 441,183 | u316649390 | python |
p02695 | #!/usr/bin/env python3
n, m, q = map(int, input().split())
abcd = [tuple(map(int, input().split())) for i in range(q)]
ans = 0
def check(A):
global ans
max_ = 0
# 点数計算
for (a, b, c, d) in abcd:
if A[b-1] - A[a-1] == c:
max_ += d
# 最大値更新
ans = max(ans, max_)
def suretu(... | #!/usr/bin/env python3
n, m, q = map(int, input().split())
abcd = [tuple(map(int, input().split())) for i in range(q)]
ans = 0
def check(A):
global ans
max_ = 0
# 点数計算
for (a, b, c, d) in abcd:
if A[b-1] - A[a-1] == c:
max_ += d
# 最大値更新
ans = max(ans, max_)
def suretu(... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,197 | 441,198 | u671446913 | python |
p02695 | #!/usr/bin/env python3
n, m, q = map(int, input().split())
abcd = [tuple(map(int, input().split())) for i in range(q)]
ans = 0
def check(A):
global ans
max_ = 0
# 点数計算
for (a, b, c, d) in abcd:
if A[b-1] - A[a-1] == c:
max_ += d
# 最大値更新
ans = max(ans, max_)
def suretu(... | #!/usr/bin/env python3
n, m, q = map(int, input().split())
abcd = [tuple(map(int, input().split())) for i in range(q)]
ans = 0
def check(A):
global ans
max_ = 0
# 点数計算
for (a, b, c, d) in abcd:
if A[b-1] - A[a-1] == c:
max_ += d
# 最大値更新
ans = max(ans, max_)
def suretu(... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 441,199 | 441,198 | u671446913 | python |
p02695 | import sys
n,m,q=map(int,input().split())
a=[]
b=[]
c=[]
d=[]
for i in range(0,q):
ay,by1,cy,dy=map(int,input().split())
a.append(ay)
b.append(by1)
c.append(cy)
d.append(dy)
s=0
smax=-100
sys.setrecursionlimit(3000)
def dfs(h):
global smax
if len(h)==n+1:
s=0
for j in r... | import sys
n,m,q=map(int,input().split())
a=[]
b=[]
c=[]
d=[]
for i in range(0,q):
ay,by1,cy,dy=map(int,input().split())
a.append(ay)
b.append(by1)
c.append(cy)
d.append(dy)
s=0
smax=-100
sys.setrecursionlimit(3000)
def dfs(h):
global smax
if len(h)==n+1:
s=0
for j in r... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 441,200 | 441,201 | u992471673 | python |
p02695 | import sys
n,m,q=map(int,input().split())
a=[]
b=[]
c=[]
d=[]
for i in range(0,q):
ay,by,cy,dy=map(int,input().split())
a.append(ay)
b.append(by)
c.append(cy)
d.append(dy)
s=0
smax=-100
sys.setrecursionlimit(3000)
def dfs(h):
global smax
if len(h)==n+1:
s=0
for j in ran... | import sys
n,m,q=map(int,input().split())
a=[]
b=[]
c=[]
d=[]
for i in range(0,q):
ay,by1,cy,dy=map(int,input().split())
a.append(ay)
b.append(by1)
c.append(cy)
d.append(dy)
s=0
smax=-100
sys.setrecursionlimit(3000)
def dfs(h):
global smax
if len(h)==n+1:
s=0
for j in r... | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"literal.number.integer.change",
"assignment.value.change"
] | 441,202 | 441,201 | u992471673 | python |
p02695 | import sys
n,m,q=map(int,input().split())
a=[]
b=[]
c=[]
d=[]
for i in range(0,q):
ay,by,cy,dy=map(int,input().split())
a.append(ay)
b.append(by)
c.append(cy)
d.append(dy)
s=0
smax=-100
sys.setrecursionlimit(3000)
def dfs(h):
global smax
if len(h)==n+1:
s=0
for j in ran... | import sys
n,m,q=map(int,input().split())
a=[]
b=[]
c=[]
d=[]
for i in range(0,q):
ay,by1,cy,dy=map(int,input().split())
a.append(ay)
b.append(by1)
c.append(cy)
d.append(dy)
s=0
smax=-100
sys.setrecursionlimit(3000)
def dfs(h):
global smax
if len(h)==n+1:
s=0
for j in r... | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"literal.number.integer.change",
"assignment.value.change"
] | 441,203 | 441,201 | u992471673 | python |
p02695 | #dfs試す
n,m,q=map(int, input().split( ))
qs=tuple(tuple(map(int, input().split( ))) for _ in range(q))
def dfs(ll):
if len(ll)==n+1:
sm=0
for ai,bi,ci,di in qs:
if ll[bi]-ll[ai]==ci:
sm+=di
return sm
res=[]
for i in range(ll[-1]+1,m+1):#+1
ll2=ll+[... | #dfs試す
n,m,q=map(int, input().split( ))
qs=tuple(tuple(map(int, input().split( ))) for _ in range(q))
def dfs(ll):
if len(ll)==n+1:
sm=0
for ai,bi,ci,di in qs:
if ll[bi]-ll[ai]==ci:
sm+=di
return sm
res=[]
for i in range(ll[-1],m):#+1
ll2=ll+[i]
... | [
"expression.operation.binary.remove"
] | 441,204 | 441,205 | u520276780 | python |
p02695 | #dfs試す
#挙動追うのきつい
n,m,q=map(int, input().split( ))
qs=tuple(tuple(map(int, input().split( ))) for _ in range(q))
def dfs(ll):
if len(ll)==n+1:
sm=0
for ai,bi,ci,di in qs:
if ll[bi]-ll[ai]==ci:
sm+=di
return sm
res=[]
for i in range(ll[-1],m+1):
ll2... | #dfs試す
n,m,q=map(int, input().split( ))
qs=tuple(tuple(map(int, input().split( ))) for _ in range(q))
def dfs(ll):
if len(ll)==n+1:
sm=0
for ai,bi,ci,di in qs:
if ll[bi]-ll[ai]==ci:
sm+=di
return sm
res=[]
for i in range(ll[-1],m):#+1
ll2=ll+[i]
... | [
"expression.operation.binary.remove"
] | 441,206 | 441,205 | u520276780 | python |
p02695 | #20C10のcombinatrics全探索？
#本番でCでこれ見たら凍るw
n,m,q=map(int, input().split( ))
qs=tuple(tuple(map(int, input().split( ))) for _ in range(q))
import itertools
ans=0
for comb in itertools.combinations(range(1,n+m+1),n):
tmp=0
comb2=[comb[i]-i for i in range(n)]
for ai,bi,ci,di in qs:
if comb2[bi-1]-comb2[ai-... | #20C10のcombinatrics全探索？
#本番でCでこれ見たら凍るw
#少なくとも combinatrics が組込みでなかったら C問題 じゃないな
n,m,q=map(int, input().split( ))
qs=tuple(tuple(map(int, input().split( ))) for _ in range(q))
import itertools
ans=0
for comb in itertools.combinations(range(1,n+m),n):##+1ない?
tmp=0
comb2=[comb[i]-i for i in range(n)]
for ai,bi... | [
"expression.operation.binary.remove"
] | 441,207 | 441,208 | u520276780 | python |
p02695 | import itertools
#19 choose 9
#92378
def main():
N, M, Q = map(int, input().split())
Q = []
final_score = 0
for i in range(Q):
Q.append(list(map(int, input().split())))
for A in itertools.combinations_with_replacement(range(1, M+1), N):
score = 0
for q in Q:
if ... | import itertools
#19 choose 9
#92378
def main():
N, M, Q = map(int, input().split())
Q_l = []
final_score = 0
for i in range(Q):
Q_l.append(list(map(int, input().split())))
for A in itertools.combinations_with_replacement(range(1, M+1), N):
score = 0
for q in Q_l:
... | [
"assignment.variable.change",
"identifier.change"
] | 441,213 | 441,214 | u571395477 | python |
p02695 | from collections import deque
de = deque()
n,m,q = map(int,input().split())
queries = []
for i in range(q):
a,b,c,d = map(int,input().split())
queries.append((a,b,c,d))
de.append([1])
maxscore = 0
while de:
li = de.popleft()
if len(li) < m:
for i in range(li[-1],11):
new_li = li + [... | from collections import deque
de = deque()
n,m,q = map(int,input().split())
queries = []
for i in range(q):
a,b,c,d = map(int,input().split())
queries.append((a,b,c,d))
de.append([1])
maxscore = 0
while de:
li = de.popleft()
if len(li) < n:
for i in range(li[-1],m+1):
new_li = li + ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,215 | 441,216 | u201928947 | python |
p02695 | from collections import deque
de = deque()
n,m,q = map(int,input().split())
queries = []
for i in range(q):
a,b,c,d = map(int,input().split())
queries.append((a,b,c,d))
de.append([1])
maxscore = 0
while de:
li = de.popleft()
if len(li) < n:
for i in range(li[-1],11):
new_li = li + [... | from collections import deque
de = deque()
n,m,q = map(int,input().split())
queries = []
for i in range(q):
a,b,c,d = map(int,input().split())
queries.append((a,b,c,d))
de.append([1])
maxscore = 0
while de:
li = de.popleft()
if len(li) < n:
for i in range(li[-1],m+1):
new_li = li + ... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,217 | 441,216 | u201928947 | python |
p02695 | from collections import deque
de = deque()
n,m,q = map(int,input().split())
queries = []
for i in range(q):
a,b,c,d = map(int,input().split())
queries.append((a,b,c,d))
de.append([1])
maxscore = 0
while de:
li = de.popleft()
if len(li) < n:
for i in range(li[-1],11):
new_li = li + [... | from collections import deque
de = deque()
n,m,q = map(int,input().split())
queries = []
for i in range(q):
a,b,c,d = map(int,input().split())
queries.append((a,b,c,d))
de.append([1])
maxscore = 0
while de:
li = de.popleft()
if len(li) < n:
for i in range(li[-1],m+1):
new_li = li + ... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,218 | 441,216 | u201928947 | python |
p02695 | import itertools
n,m,q = map(int,input().split())
array = []
A = [i for i in range(1,m+1)]
A_list = list(itertools.combinations(A,n))
max_sum = [0]*len(A_list)
for i in range(q):
a,b,c,d = map(int,input().split())
for j in range(len(A_list)):
if A_list[j][b-1]-A_list[j][a-1] == c:
max_sum[j... | import itertools
n,m,q = map(int,input().split())
array = []
A = [i for i in range(1,m+1)]
A_list = list(itertools.combinations_with_replacement(A,n))
max_sum = [0]*len(A_list)
for i in range(q):
a,b,c,d = map(int,input().split())
for j in range(len(A_list)):
if A_list[j][b-1]-A_list[j][a-1] == c:
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 441,221 | 441,222 | u551109821 | python |
p02695 | import itertools
n,m,q = map(int,input().split())
array = []
A = [i for i in range(1,m+1)]
A_list = list(itertools.combinations(A,n))
max_sum = [0]*len(A_list)
for i in range(q):
a,b,c,d = map(int,input().split())
for j in range(len(A_list)):
if A_list[j][b-1]-A_list[j][a-1] == c:
max_sum[j... | import itertools
n,m,q = map(int,input().split())
array = []
A = [i for i in range(1,m+1)]
A_list = list(itertools.combinations_with_replacement(A,n))
max_sum = [0]*len(A_list)
for i in range(q):
a,b,c,d = map(int,input().split())
for j in range(len(A_list)):
if A_list[j][b-1]-A_list[j][a-1] == c:
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 441,223 | 441,222 | u551109821 | python |
p02695 | import itertools
n,m,q=map(int,input().split())
abcd=[None]*q
for i in range(q):
abcd[i]=list(map(int,input().split()))
num=0
for l in list(map(list, itertools.combinations(range(1,m+1), n))):
num_ = 0
for x in abcd:
if l[x[1]-1]-l[x[0]-1] == x[2]:
num_ += x[3]
num = max(num ,num_)
p... | import itertools
n,m,q=map(int,input().split())
abcd=[None]*q
for i in range(q):
abcd[i]=list(map(int,input().split()))
num=0
for l in list(map(list, itertools.combinations_with_replacement(range(1,m+1), n))):
num_ = 0
for x in abcd:
if l[x[1]-1]-l[x[0]-1] == x[2]:
num_ += x[3]
num =... | [
"identifier.change",
"call.arguments.change"
] | 441,224 | 441,225 | u698849142 | python |
p02695 | import itertools
N,M,Q=map(int,input().split())
a=[]
for _ in range(Q):
b=list(map(int,input().split()))
a.append(b)
s=[]
for i in range(M+1):
s.append(i)
alist=list(itertools.combinations_with_replacement(s, r=N+1))
tmp=0
for j in alist:
s=0
for i in range(Q):
j=list(j)
if j[a[i][... | import itertools
N,M,Q=map(int,input().split())
a=[]
for _ in range(Q):
b=list(map(int,input().split()))
a.append(b)
s=[]
for i in range(1,M+1):
s.append(i)
alist=list(itertools.combinations_with_replacement(s, r=N+1))
tmp=0
for j in alist:
s=0
for i in range(Q):
j=list(j)
if j[a[i... | [
"call.arguments.add"
] | 441,230 | 441,231 | u581636201 | python |
p02695 | import itertools
N,M,Q=map(int,input().split())
a=[]
for _ in range(Q):
b=list(map(int,input().split()))
a.append(b)
s=[]
for i in range(M+1):
s.append(i)
alist=list(itertools.combinations(s, r=N+1))
tmp=0
for j in alist:
s=0
for i in range(Q):
j=list(j)
if j[a[i][1]]-j[a[i][0]]==a... | import itertools
N,M,Q=map(int,input().split())
a=[]
for _ in range(Q):
b=list(map(int,input().split()))
a.append(b)
s=[]
for i in range(1,M+1):
s.append(i)
alist=list(itertools.combinations_with_replacement(s, r=N+1))
tmp=0
for j in alist:
s=0
for i in range(Q):
j=list(j)
if j[a[i... | [
"call.arguments.add",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 441,233 | 441,231 | u581636201 | python |
p02695 | n,m,q = map(int,input().split())
a = [0 for i in range(q)]
for i in range(q):
a[i] = list(map(int,input().split()))
for i in range(1,m+1):
for j in range(i,m+1):
for k in range(j,m+1):
for s in range(k,m+1):
for p in range(s,m+1):
for l in range(p,m+1):
... | n,m,q = map(int,input().split())
a = [0 for i in range(q)]
ans = 0
for i in range(q):
a[i] = list(map(int,input().split()))
for i in range(1,m+1):
for j in range(i,m+1):
for k in range(j,m+1):
for s in range(k,m+1):
for p in range(s,m+1):
for l in range(p,... | [
"assignment.value.change",
"identifier.change"
] | 441,234 | 441,235 | u342563578 | python |
p02695 | from itertools import combinations_with_replacement
n, m, q = map(int,input().split())
l = []
s = []
for _ in range(q):
a, b, c, d = map(int,input().split())
l.append([a, b, c, d])
ps = list(combinations_with_replacement(range(2, m+1), n-1))
n_p = len(ps)
for i in range(n_p):
ns = [1] + list(ps[i])
s... | from itertools import combinations_with_replacement
n, m, q = map(int,input().split())
l = []
s = []
for _ in range(q):
a, b, c, d = map(int,input().split())
l.append([a, b, c, d])
ps = list(combinations_with_replacement(range(1, m+1), n-1))
n_p = len(ps)
for i in range(n_p):
ns = [1] + list(ps[i])
s... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 441,244 | 441,245 | u337713602 | python |
p02695 | import itertools
n, m, q = map(int, input().split())
q_list = [list(map(int, input().split())) for _ in range(q)]
ans = 0
seleted = [x for x in range(1, m+1)]
A_list = list(itertools.combinations(seleted, n))
# print(A_list)
for A in A_list:
tmp = 0
for q in q_list:
if A[q[1]-1] - A[q[0]-1] == q[2]:
... | import itertools
n, m, q = map(int, input().split())
q_list = [list(map(int, input().split())) for _ in range(q)]
ans = 0
seleted = [x for x in range(1, m+1)]
A_list = list(itertools.combinations_with_replacement(seleted, n))
for A in A_list:
tmp = 0
for q in q_list:
if A[q[1]-1] - A[q[0]-1] == q[2]:
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 441,250 | 441,251 | u319345083 | python |
p02695 | import itertools as itr
N,M,Q = map(int,input().split())
sheat = list()
for i in range(Q):
sheat.append(list(map(int,input().split())))
comb = tuple(itr.combinations(range(1,M+1),N))
Maxsum = 0
# print(sheat)
# print(comb)
sumd = 0
for i in range(len(comb)):
ansum = 0
for j in range(Q):
if(comb[i][... | import itertools as itr
N,M,Q = map(int,input().split())
sheat = list()
for i in range(Q):
sheat.append(list(map(int,input().split())))
comb = tuple(itr.combinations_with_replacement(range(1,M+1),N))
Maxsum = 0
# print(sheat)
# print(comb)
sumd = 0
for i in range(len(comb)):
ansum = 0
for j in range(Q):
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 441,255 | 441,256 | u802234211 | python |
p02695 | import copy
n, m, q = map(int, input().split())
a = []
b = []
c = []
d = []
for i in range(q):
_a, _b, _c, _d = map(int, input().split())
a.append(_a)
b.append(_b)
c.append(_c)
d.append(_d)
seq = [[] for i in range(n)]
for i in range(1, m + 1):
seq[0].append([i])
for i in range(1, n):
for j in range... | import copy
n, m, q = map(int, input().split())
a = []
b = []
c = []
d = []
for i in range(q):
_a, _b, _c, _d = map(int, input().split())
a.append(_a)
b.append(_b)
c.append(_c)
d.append(_d)
seq = [[] for i in range(n)]
for i in range(1, m + 1):
seq[0].append([i])
for i in range(1, n):
for j in range... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 441,257 | 441,258 | u671455949 | python |
p02695 | n, m, q = input().split()
n = int( n )
m = int( m )
q = int( q )
a = []
b = []
c = []
d = []
for i in range( int( q ) ):
a_i, b_i, c_i, d_i = input().split()
a.append( int( a_i ) )
b.append( int( b_i ) )
c.append( int( c_i ) )
d.append( int( d_i ) )
array = [ 1 ] * n
array_list = [ array ]
i = 0
w... | n, m, q = input().split()
n = int( n )
m = int( m )
q = int( q )
a = []
b = []
c = []
d = []
for i in range( int( q ) ):
a_i, b_i, c_i, d_i = input().split()
a.append( int( a_i ) )
b.append( int( b_i ) )
c.append( int( c_i ) )
d.append( int( d_i ) )
array = [ 1 ] * n
array_list = [ array ]
i = 0
w... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 441,261 | 441,260 | u836004075 | python |
p02695 | n, m, q = input().split()
n = int( n )
m = int( m )
q = int( q )
a = []
b = []
c = []
d = []
for i in range( int( q ) ):
a_i, b_i, c_i, d_i = input().split()
a.append( int( a_i ) )
b.append( int( b_i ) )
c.append( int( c_i ) )
d.append( int( d_i ) )
array = [ 1 ] * n
array_list = [ array ]
i = 0
w... | n, m, q = input().split()
n = int( n )
m = int( m )
q = int( q )
a = []
b = []
c = []
d = []
for i in range( int( q ) ):
a_i, b_i, c_i, d_i = input().split()
a.append( int( a_i ) )
b.append( int( b_i ) )
c.append( int( c_i ) )
d.append( int( d_i ) )
array = [ 1 ] * n
array_list = [ array ]
i = 0
w... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 441,262 | 441,260 | u836004075 | python |
p02695 | n, m, q = input().split()
n = int( n )
m = int( m )
q = int( q )
a = []
b = []
c = []
d = []
for i in range( int( q ) ):
a_i, b_i, c_i, d_i = input().split()
a.append( int( a_i ) )
b.append( int( b_i ) )
c.append( int( c_i ) )
d.append( int( d_i ) )
array = [ 1 ] * n
array_list = [ array ]
i = 0
w... | n, m, q = input().split()
n = int( n )
m = int( m )
q = int( q )
a = []
b = []
c = []
d = []
for i in range( int( q ) ):
a_i, b_i, c_i, d_i = input().split()
a.append( int( a_i ) )
b.append( int( b_i ) )
c.append( int( c_i ) )
d.append( int( d_i ) )
array = [ 1 ] * n
array_list = [ array ]
i = 0
w... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 441,263 | 441,260 | u836004075 | python |
p02695 | N, M, Q = map(int, input().split())
X = []
for _ in range(Q):
a, b, c, d = map(int, input().split())
X.append((a, b, c, d))
def calc(L):
s = 0
for a, b, c, d in X:
if L[b] - L[a] == c: s += d
return s
def rec(L):
if len(L) == N + 1:
return calc(L)
ma = 0
for i in range(... | N, M, Q = map(int, input().split())
X = []
for _ in range(Q):
a, b, c, d = map(int, input().split())
X.append((a, b, c, d))
def calc(L):
s = 0
for a, b, c, d in X:
if L[b] - L[a] == c: s += d
return s
def rec(L):
if len(L) == N + 1:
return calc(L)
ma = 0
for i in range(... | [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 441,268 | 441,269 | u864197622 | python |
p02695 | N, M, Q = map(int, input().split())
X = []
for _ in range(Q):
a, b, c, d = map(int, input().split())
X.append((a, b, c, d))
def calc(L):
s = 0
for a, b, c, d in X:
if L[b] - L[a] == c: s += d
return s
def rec(L):
if len(L) == N + 1:
return calc(L)
ma = 0
for i in range(... | N, M, Q = map(int, input().split())
X = []
for _ in range(Q):
a, b, c, d = map(int, input().split())
X.append((a, b, c, d))
def calc(L):
s = 0
for a, b, c, d in X:
if L[b] - L[a] == c: s += d
return s
def rec(L):
if len(L) == N + 1:
return calc(L)
ma = 0
for i in range(... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"literal.number.integer.change",
"io.output.change"
] | 441,270 | 441,269 | u864197622 | python |
p02695 | import itertools
def main():
N, M, Q = map(int, input().split())
a = [0 for _ in range(Q)]
b = [0 for _ in range(Q)]
c = [0 for _ in range(Q)]
d = [0 for _ in range(Q)]
for i in range(Q):
a[i], b[i], c[i], d[i] = map(int, input().split())
seq = [i for i in range(1, max(11, M+1))]
... | import itertools
def main():
N, M, Q = map(int, input().split())
a = [0 for _ in range(Q)]
b = [0 for _ in range(Q)]
c = [0 for _ in range(Q)]
d = [0 for _ in range(Q)]
for i in range(Q):
a[i], b[i], c[i], d[i] = map(int, input().split())
seq = [i for i in range(1, min(11, M+1))]
... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,271 | 441,272 | u337751290 | python |
p02695 | from itertools import *
from more_itertools import *
n,m,q=map(int,input().split())
aaa=[]
for i in range(m):
aaa.append(i+1)
l=[]
for i in range(q):
a=list(map(int,input().split()))
l.append(a)
a=list(combinations_with_replacement(aaa,n))
ans=0
for i in a:
aa=0
for j in l:
if i[j[1]-1]-... | from itertools import *
n,m,q=map(int,input().split())
aaa=[]
for i in range(m):
aaa.append(i+1)
l=[]
for i in range(q):
a=list(map(int,input().split()))
l.append(a)
a=list(combinations_with_replacement(aaa,n))
ans=0
for i in a:
aa=0
for j in l:
if i[j[1]-1]-i[j[0]-1]==j[2]:
... | [] | 441,277 | 441,278 | u449473917 | python |
p02695 | #import numpy as np
import math
#from fractions import gcd
def check_Q(current_list,Qset):
sum_d = 0
for i in range(len(Qset)):
current_Qset = Qset[i]
if (current_list[current_Qset[1]-1]-current_list[current_Qset[0]-1])==current_Qset[2]:
sum_d = sum_d+current_Qset[3]
return su... | #import numpy as np
import math
#from fractions import gcd
def check_Q(current_list,Qset):
sum_d = 0
for i in range(len(Qset)):
current_Qset = Qset[i]
#print(current_Qset)
#print(current_list)
#print(sum_d)
if (current_list[current_Qset[1]-1]-current_list[current_Qset[0... | [
"expression.operation.binary.remove"
] | 441,299 | 441,300 | u222185706 | python |
p02695 |
maxscore = 0
def solve():
ans = [-1]*n
ans[-1] = m
rek(ans, m, 1)
return
def rek(ans, m, rekdepth):
global maxscore
curr_ans = ans.copy()
for i in range(m+1):
curr_ans[-rekdepth-1] = i
if rekdepth == n-1:
score = get_score(curr_ans)
maxscore = max... |
maxscore = 0
def solve():
ans = [-1]*n
ans[-1] = m
rek(ans, m, 1)
return
def rek(ans, m, rekdepth):
global maxscore
curr_ans = ans.copy()
for i in range(1, m+1):
curr_ans[-rekdepth-1] = i
if rekdepth == n-1:
score = get_score(curr_ans)
maxscore = ... | [
"call.arguments.add"
] | 441,303 | 441,304 | u618101737 | python |
p02695 | import itertools
N,M,Q = map(int, input().split())
x = [list(map(int, input().split(" "))) for i in range(Q)]
list = list(itertools.combinations(range(1,M+1),N))
tmp = 0
mx = 0
for k in range(len(list)):
#print(list[k])
for i in range(Q):
a = x[i][0]
b = x[i][1]
c = x[i][2]
d = ... | import itertools
N,M,Q = map(int, input().split())
x = [list(map(int, input().split(" "))) for i in range(Q)]
list = list(itertools.combinations_with_replacement(range(1,M+1),N))
tmp = 0
mx = 0
for k in range(len(list)):
for i in range(Q):
a = x[i][0]
b = x[i][1]
c = x[i][2]
d = x... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 441,305 | 441,306 | u451206510 | python |
p02695 | def main():
n,m,q = map(int,input().split())
a = [1]*n
a_list = []
while True:
a_list.append([0, a[:]])
end = True
for i in range(n):
index = n-1-i
if a[index] < m-i:
a[index] = a[index] + 1
for j in range(i):
a[index+1+j] = a[index]
end = False
... | def main():
n,m,q = map(int,input().split())
a = [1]*n
a_list = []
while True:
a_list.append([0, a[:]])
end = True
for i in range(n):
index = n-1-i
if a[index] < m:
a[index] = a[index] + 1
for j in range(i):
a[index+1+j] = a[index]
end = False
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 441,309 | 441,310 | u122216125 | python |
p02695 | N, M, Q=map(int, input().split())
abcd=[list(map(int, input().split())) for _ in range(Q)]
def f(nums):
out=0
for samp in abcd:
if nums[samp[1]-1]-nums[samp[0]-1]==samp[2]:
out+=samp[3]
return out
def g(nums):
if nums[-1]<M:
nums[-1]+=1
return nums, False
i=N-1
while i>=0 and nums[i]=... | N, M, Q=map(int, input().split())
abcd=[list(map(int, input().split())) for _ in range(Q)]
def f(nums):
out=0
for samp in abcd:
if nums[samp[1]-1]-nums[samp[0]-1]==samp[2]:
out+=samp[3]
return out
def g(nums):
if nums[-1]<M:
nums[-1]+=1
return nums, False
i=N-1
while i>=0 and nums[i]=... | [
"call.remove"
] | 441,317 | 441,318 | u095021077 | python |
p02695 | import itertools
n, m, q = list(map(int, input().split()))
queries = [list(map(int, input().split())) for _ in range(q)]
nums = [i for i in range(1, 10)]
ans = 0
for nums in itertools.combinations_with_replacement(nums, r=n):
tmp = 0
for query in queries:
if nums[query[1] - 1] - nums[query[0] - 1] == query[2]:
... | import itertools
n, m, q = list(map(int, input().split()))
queries = [list(map(int, input().split())) for _ in range(q)]
nums = [i for i in range(1, m + 1)]
ans = 0
for nums in itertools.combinations_with_replacement(nums, r=n):
tmp = 0
for query in queries:
if nums[query[1] - 1] - nums[query[0] - 1] == query[2]:
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,319 | 441,320 | u653807637 | python |
p02695 | import itertools
n, m, q = list(map(int, input().split()))
queries = [list(map(int, input().split())) for _ in range(q)]
nums = [i for i in range(10)]
ans = 0
for nums in itertools.combinations_with_replacement(nums, r=n):
tmp = 0
for query in queries:
if nums[query[1] - 1] - nums[query[0] - 1] == query[2]:
tmp... | import itertools
n, m, q = list(map(int, input().split()))
queries = [list(map(int, input().split())) for _ in range(q)]
nums = [i for i in range(1, m + 1)]
ans = 0
for nums in itertools.combinations_with_replacement(nums, r=n):
tmp = 0
for query in queries:
if nums[query[1] - 1] - nums[query[0] - 1] == query[2]:
... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 441,321 | 441,320 | u653807637 | python |
p02695 | import itertools
N, M, Q = map(int, input().split())
list_q = []
for i in range(Q):
list_q.append(list(map(int, input().split())))
ans = 0
for A_ in itertools.combinations([i for i in range(1, M+1)], N):
A = list(A_)
tmp_ans = 0
for i in range(Q):
if A[list_q[i][1]-1] - A[list_q[i][0]-1] == li... | import itertools
N, M, Q = map(int, input().split())
list_q = []
for i in range(Q):
list_q.append(list(map(int, input().split())))
ans = 0
for A_ in itertools.combinations_with_replacement([i for i in range(1, M+1)], N):
A = list(A_)
tmp_ans = 0
for i in range(Q):
if A[list_q[i][1]-1] - A[list... | [
"identifier.change"
] | 441,322 | 441,323 | u427819770 | python |
p02695 | import sys
sys.setrecursionlimit(1000000000)
input = sys.stdin.readline
n,m,q=map(int,input().split())
x=[list(map(int,input().split())) for i in range(q)]
for i in range(q):
for j in range(2):
x[i][j]-=1
a=[]
def dfs(v):
if len(v)>n:
return
if len(v)==n:
a.append(v)
for i in ran... | import sys
sys.setrecursionlimit(1000000000)
input = sys.stdin.readline
n,m,q=map(int,input().split())
x=[list(map(int,input().split())) for i in range(q)]
for i in range(q):
for j in range(2):
x[i][j]-=1
a=[]
def dfs(v):
if len(v)>n:
return
if len(v)==n:
a.append(v)
for i in ran... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,345 | 441,346 | u225388820 | python |
p02695 | import itertools
def check(lis, a):
return sum((i[3] for i in a if lis[i[1]-1]-lis[i[0]-1]==i[2]))
n, m, q = map(int, input().split())
a = ((int(i) for i in input().split(" ")) for j in range(q))
ans = 0
for i in itertools.combinations_with_replacement(range(m), n):
ans = max(ans, check(i, a))
print(ans) | import itertools
def check(lis, a):
return sum((i[3] for i in a if lis[i[1]-1]-lis[i[0]-1]==i[2]))
n, m, q = map(int, input().split())
a = [[int(i) for i in input().split(" ")] for j in range(q)]
ans = 0
for i in itertools.combinations_with_replacement(range(m), n):
ans = max(ans, check(i, a))
print(ans) | [
"assignment.value.change"
] | 441,347 | 441,348 | u486065927 | python |
p02695 | import itertools
def check(lis, a):
return sum((i[3] for i in a if lis[i[1]-1]-lis[i[0]-1]==i[2]))
n, m, q = map(int, input().split())
a = ((int(i) for i in input().split(" ")) for j in range(q))
ans = 0
for i in itertools.combinations_with_replacement(range(m), n):
ans = max(ans, check(i, a))
print(ans) | import itertools
def check(lis, a):
return sum((i[3] for i in a if lis[i[1]-1]-lis[i[0]-1]==i[2]))
n, m, q = map(int, input().split())
a = tuple(tuple(int(i) for i in input().split(" ")) for j in range(q))
ans = 0
for i in itertools.combinations_with_replacement(range(m), n):
ans = max(ans, check(i, a))
pr... | [
"call.add"
] | 441,347 | 441,349 | u486065927 | python |
p02695 | import sys
sys.setrecursionlimit(10**7)
n, m, q = map(int, input().split())
query = [list(map(int, input().split())) for _ in range(q)]
def dfs(k, x):
global mx
if k == n:
v = 0
for line in query:
a, b, c, d = line
if x[b] - x[a] == c: v += d
if mx < v: mx = v
... | import sys
sys.setrecursionlimit(10**7)
n, m, q = map(int, input().split())
query = [list(map(int, input().split())) for _ in range(q)]
def dfs(k, x):
global mx
if k == n:
v = 0
for line in query:
a, b, c, d = line
if x[b] - x[a] == c: v += d
if mx < v: mx = v
... | [
"literal.number.integer.change",
"call.arguments.change"
] | 441,352 | 441,353 | u921168761 | python |
p02695 | # -*- coding: utf-8 -*-
"""
Created on Sat May 2 20:59:14 2020
"""
import sys
#import numpy as np
import itertools
sys.setrecursionlimit(10 ** 9)
N, M, Q = map(int,input().split())
abcd = [list(map(int,input().split())) for _ in range(Q)]
A = itertools.combinations_with_replacement([i for i in range(1,M)],N)
ans =... | # -*- coding: utf-8 -*-
"""
Created on Sat May 2 20:59:14 2020
"""
import sys
#import numpy as np
import itertools
sys.setrecursionlimit(10 ** 9)
N, M, Q = map(int,input().split())
abcd = [list(map(int,input().split())) for _ in range(Q)]
A = itertools.combinations_with_replacement([i for i in range(1,M+1)],N)
ans... | [
"control_flow.loop.range.bounds.upper.change",
"assignment.change"
] | 441,369 | 441,370 | u060938295 | python |
p02695 | import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa ... | import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa ... | [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 441,372 | 441,373 | u535423069 | python |
p02695 | import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa ... | import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa ... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,374 | 441,375 | u535423069 | python |
p02695 | from itertools import combinations_with_replacement as cmb
n,m,q=map(int,input().split())
abcd=[]
for i in range(q):
ll=map(int,input().split())
ll=[ww-1 for ww in ll]
abcd.append(ll)
ans=0
for li in cmb(range(1,m+1),n):
kari=0
for i in abcd:
if li[i[1]]-li[i[0]]==i[2]+1:
kari+=... | from itertools import combinations_with_replacement as cmb
n,m,q=map(int,input().split())
abcd=[]
for i in range(q):
ll=map(int,input().split())
ll=[ww-1 for ww in ll]
abcd.append(ll)
ans=0
for li in cmb(range(1,m+1),n):
kari=0
for i in abcd:
if li[i[1]]-li[i[0]]==i[2]+1:
kari+=... | [
"call.remove"
] | 441,378 | 441,379 | u177388368 | python |
p02695 | import itertools
N,M,Q = map(int,input().split())
a=[]
b=[]
c=[]
d=[]
for i in range(0,Q,1):
tmp = list(map(int,input().split()))
a.append(tmp[0])
b.append(tmp[1])
c.append(tmp[2])
d.append(tmp[3])
max_score = -1
for i in itertools.combinations_with_replacement(range(1,M,1),N):
score = 0
f... | import itertools
N,M,Q = map(int,input().split())
a=[]
b=[]
c=[]
d=[]
for i in range(0,Q,1):
tmp = list(map(int,input().split()))
a.append(tmp[0])
b.append(tmp[1])
c.append(tmp[2])
d.append(tmp[3])
max_score = -1
for i in itertools.combinations_with_replacement(range(1,M+1,1),N):
score = 0
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 441,382 | 441,383 | u364862909 | python |
p02695 | N, M, Q = map(int, input().split())
query = []
for i in range(Q):
a, b, c, d = map(int, input().split())
query.append([a, b, c, d])
def calcPoint(num):
ret = 0
for q in range(Q):
if num[query[q][1] - 1] - num[query[q][0] - 1] == query[q][2]:
ret += query[q][3]
return ret
an... | N, M, Q = map(int, input().split())
query = []
for i in range(Q):
a, b, c, d = map(int, input().split())
query.append([a, b, c, d])
def calcPoint(num):
ret = 0
for q in range(Q):
if num[query[q][1] - 1] - num[query[q][0] - 1] == query[q][2]:
ret += query[q][3]
return ret
an... | [
"call.remove"
] | 441,407 | 441,408 | u910426639 | python |
p02695 | N, M, Q = map(int, input().split())
query = []
for i in range(Q):
a, b, c, d = map(int, input().split())
query.append([a, b, c, d])
def calcPoint(num):
ret = 0
for q in range(Q):
if num[query[q][1] - 1] - num[query[q][0] - 1] == query[q][2]:
ret += query[q][3]
return ret
an... | N, M, Q = map(int, input().split())
query = []
for i in range(Q):
a, b, c, d = map(int, input().split())
query.append([a, b, c, d])
def calcPoint(num):
ret = 0
for q in range(Q):
if num[query[q][1] - 1] - num[query[q][0] - 1] == query[q][2]:
ret += query[q][3]
return ret
an... | [
"expression.operation.binary.remove"
] | 441,409 | 441,408 | u910426639 | python |
p02695 | def dfs(nums, length, min_lim):
ans = 0
if length == n:
score_ret = 0
for a,b,c,d in req:
if nums[b] - nums[a] == c:
score_ret += d
return score_ret
else:
for nu in range(min_lim, m+1):
new_nums = nums + [nu]
score = df... | def dfs(nums, length, min_lim):
ans = 0
if length == n:
score_ret = 0
for a,b,c,d in req:
if nums[b] - nums[a] == c:
score_ret += d
return score_ret
else:
for nu in range(min_lim, m+1):
new_nums = nums + [nu]
score = df... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change"
] | 441,413 | 441,414 | u672475305 | python |
p02695 | n,m,q = map(int,input().split())
arr = [list(map(int,input().split())) for _ in range(q)]
ans = 0
for i1 in range(1, m+1):
for i2 in range(i1, m+1):
for i3 in range(i2, m+1):
for i4 in range(i3, m+1):
for i5 in range(i4, m+1):
for i6 in range(i5, m+1):
... | n,m,q = map(int,input().split())
arr = [list(map(int,input().split())) for _ in range(q)]
ans = 0
for i1 in range(1, m+1):
for i2 in range(i1, m+1):
for i3 in range(i2, m+1):
for i4 in range(i3, m+1):
for i5 in range(i4, m+1):
for i6 in range(i5, m+1):
... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 441,415 | 441,416 | u672475305 | python |
p02695 | from itertools import combinations_with_replacement
N, M, Q = map(int, input().split())
abcd = [tuple(map(int, input().split())) for i in range(Q)]
ans = 0
for x in combinations_with_replacement(range(1, 11), 10):
tmp = 0
for a, b, c, d in abcd:
a -= 1
b -= 1
if x[a] + c == x[b]:
... | from itertools import combinations_with_replacement
N, M, Q = map(int, input().split())
abcd = [tuple(map(int, input().split())) for i in range(Q)]
ans = 0
for x in combinations_with_replacement(range(1, M+1), 10):
tmp = 0
for a, b, c, d in abcd:
a -= 1
b -= 1
if x[a] + c == x[b]:
... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,417 | 441,418 | u814986259 | python |
p02695 | N,M,Q=map(int,input().split())
a=[]
b=[]
c=[]
d=[]
for i in range(Q):
ta,tb,tc,td=map(int,input().split())
a+=[ta]
b+=[tb]
c+=[tc]
d+=[td]
maxs=0
A=[0 for i in range(N)]
for i in intertools.combination_with_replacement(A,N):
s=0
for k in range(Q):
if i[b[k]-1]-i[a[k]-1]==c[k]:
s+=d[k]
maxs=max... | import itertools
N,M,Q=map(int,input().split())
a=[]
b=[]
c=[]
d=[]
for i in range(Q):
ta,tb,tc,td=map(int,input().split())
a+=[ta]
b+=[tb]
c+=[tc]
d+=[td]
maxs=0
A=[i for i in range(M)]
for i in itertools.combinations_with_replacement(A,N):
s=0
for k in range(Q):
if i[b[k]-1]-i[a[k]-1]==c[k]:
s... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,421 | 441,420 | u692311686 | python |
p02695 | def dfs(A):
global ans
if len(A)==N:
now=0
for i in l:
if A[i[1]-1]-A[i[0]-1]==i[2]:
now+=i[3]
ans=max(ans,now)
return A
A.append(A[-1])
while A[-1]<=M:
dfs(A)
A[-1]+=1
N,M,Q=[int(x) for x in input().rstrip().split()]
A=[1]
l=[]
ans=0
for i in range(Q):
... | def dfs(A):
global ans
if len(A)==N:
now=0
for i in l:
if A[i[1]-1]-A[i[0]-1]==i[2]:
now+=i[3]
ans=max(ans,now)
return A
A.append(A[-1])
while A[-1]<=M:
dfs(A[:])
A[-1]+=1
N,M,Q=[int(x) for x in input().rstrip().split()]
A=[1]
l=[]
ans=0
for i in range(Q):
abcd=... | [] | 441,422 | 441,423 | u235376569 | python |
p02695 | n,m,q=map(int,input().split())
abcd=[]
for _ in range(q):
a,b,c,d=map(int,input().split())
abcd.append((a,b,c,d))
ans=0
p=[]
sys.setrecursionlimit(10**6)
def dfs(x):
if len(x)==n:
p.append(x)
else:
for i in range(m-x[-1]+1):
dfs(x+[x[-1]+i])
dfs([1])
# import itertools
# p=itertools.combinations_with_replace... | n,m,q=map(int,input().split())
abcd=[]
for _ in range(q):
a,b,c,d=map(int,input().split())
abcd.append((a,b,c,d))
ans=0
p=[]
import sys
sys.setrecursionlimit(10**6)
def dfs(x):
if len(x)==n:
p.append(x)
else:
for i in range(m-x[-1]+1):
dfs(x+[x[-1]+i])
dfs([1])
# import itertools
# p=itertools.combinations_w... | [] | 441,428 | 441,429 | u296150111 | python |
p02695 | n,m,q=map(int,input().split())
abcd=[]
for _ in range(q):
a,b,c,d=map(int,input().split())
abcd.append((a,b,c,d))
ans=0
p=[]
sys.setrecursionlimit(10**6)
def dfs(x):
if len(x)==n:
p.append(x)
else:
for i in range(n-x[-1]+1):
dfs(x+[x[-1]+i])
dfs([1])
# import itertools
# p=itertools.combinations_with_replace... | n,m,q=map(int,input().split())
abcd=[]
for _ in range(q):
a,b,c,d=map(int,input().split())
abcd.append((a,b,c,d))
ans=0
p=[]
import sys
sys.setrecursionlimit(10**6)
def dfs(x):
if len(x)==n:
p.append(x)
else:
for i in range(m-x[-1]+1):
dfs(x+[x[-1]+i])
dfs([1])
# import itertools
# p=itertools.combinations_w... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,430 | 441,429 | u296150111 | python |
p02695 | from collections import deque
N, M, Q = map(int, input().split(" "))
que = deque()
for i in range(1, M + 1):
que.append([i])
while True:
now = que.popleft()
if len(now) == N:
que.append(now)
break
last = now[-1] if len(now) > 0 else 1
for i in range(last, M + 1):
que.appen... | from collections import deque
N, M, Q = map(int, input().split(" "))
que = deque()
for i in range(1, M + 1):
que.append([i])
while True:
now = que.popleft()
if len(now) == N:
que.append(now)
break
last = now[-1] if len(now) > 0 else 1
for i in range(last, M + 1):
que.appen... | [
"call.remove"
] | 441,433 | 441,434 | u198062737 | python |
p02695 | import sys
sys.setrecursionlimit(10 ** 9)
n,m,q = map(int,input().split())
abcd = []
for i in range(q):
abcd.append(tuple(map(int,input().split())))
ans = -1
def dfs(l):
global ans
if len(l) == n:
ans = max(check(l),ans)
else:
if len(l) == 0:
mx = 1
else:
mx = l[-1]
for i in range(... | import sys
sys.setrecursionlimit(10 ** 9)
n,m,q = map(int,input().split())
abcd = []
for i in range(q):
abcd.append(tuple(map(int,input().split())))
ans = 0
def dfs(l):
global ans
if len(l) == n:
ans = max(check(l),ans)
else:
if len(l) == 0:
mx = 1
else:
mx = l[-1]
for i in range(m... | [
"assignment.value.change",
"expression.operation.unary.remove",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,456 | 441,457 | u009348313 | python |
p02695 | import sys
sys.setrecursionlimit(10 ** 9)
n,m,q = map(int,input().split())
abcd = []
for i in range(q):
abcd.append(tuple(map(int,input().split())))
ans = 0
def dfs(l):
global ans
if len(l) == n:
ans = max(check(l),ans)
else:
if len(l) == 0:
mx = 1
else:
mx = l[-1]
for i in range(m... | import sys
sys.setrecursionlimit(10 ** 9)
n,m,q = map(int,input().split())
abcd = []
for i in range(q):
abcd.append(tuple(map(int,input().split())))
ans = 0
def dfs(l):
global ans
if len(l) == n:
ans = max(check(l),ans)
else:
if len(l) == 0:
mx = 1
else:
mx = l[-1]
for i in range(m... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,458 | 441,457 | u009348313 | python |
p02695 | def judge():
global num, a, b, c, d, q
point = 0
for i in range(q):
if (num[b[i]] - num[a[i]] == c[i]):
point += d[i]
return point
def mk_num(i):
global mx_p
for j in range(num[i-1], 10):
num[i] = j
if (i == n):
tmp = judge()
if (mx_p... | def judge():
global num, a, b, c, d, q
point = 0
for i in range(q):
if (num[b[i]] - num[a[i]] == c[i]):
point += d[i]
return point
def mk_num(i):
global mx_p
global m
for j in range(num[i-1], m):
num[i] = j
if (i == n):
tmp = judge()
... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,459 | 441,460 | u731603651 | python |
p02695 | def judge():
global num, a, b, c, d, q
point = 0
for i in range(q):
if (num[b[i]] - num[a[i]] == c[i]):
point += d[i]
return point
def mk_num(i):
global mx_p
for j in range(num[i-1], 11):
num[i] = j
if (i == n):
tmp = judge()
if (mx_p... | def judge():
global num, a, b, c, d, q
point = 0
for i in range(q):
if (num[b[i]] - num[a[i]] == c[i]):
point += d[i]
return point
def mk_num(i):
global mx_p
global m
for j in range(num[i-1], m):
num[i] = j
if (i == n):
tmp = judge()
... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 441,461 | 441,460 | u731603651 | python |
p02695 | import itertools
n,m,q = map(int,input().split())
li=[list(map(int,input().split())) for i in range(q)]
ans = 0
num_li = itertools.combinations_with_replacement(range(1,m+1),n)
for i in num_li:
temp = 0
for j in li:
a,b,c,d = j
if i[b-1] - i[a-1] == c:
temp += d
ans = max(ans,... | import itertools
n,m,q = map(int,input().split())
li=[list(map(int,input().split())) for i in range(q)]
ans = 0
num_li = itertools.combinations_with_replacement(range(1,m+1),n)
for i in num_li:
temp = 0
for j in li:
a,b,c,d = j
if i[b-1] - i[a-1] == c:
temp += d
ans = max(ans,... | [
"call.remove"
] | 441,488 | 441,489 | u152614052 | python |
p02695 | [n, m, q] = [int(x) for x in input().split(' ')]
a = []
b = []
c = []
d = []
for _ in range(q):
tmp = [int(x) for x in input().split(' ')]
a.append(tmp[0]-1)
b.append(tmp[1]-1)
c.append(tmp[2])
d.append(tmp[3])
x = [1] * 10
def next(x):
for i in range(9, -1, -1):
if x[i] != 10:
x[i] += 1
... | [n, m, q] = [int(x) for x in input().split(' ')]
a = []
b = []
c = []
d = []
for _ in range(q):
tmp = [int(x) for x in input().split(' ')]
a.append(tmp[0]-1)
b.append(tmp[1]-1)
c.append(tmp[2])
d.append(tmp[3])
x = [1] * n
def next(x):
for i in range(n-1, -1, -1):
if x[i] != m:
x[i] += 1
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,493 | 441,494 | u536407305 | python |
p02695 | N, M, Q = (int(i) for i in input().split())
ABCD = []
ans = -1
for _ in range(Q):
ABCD.append([int(i) for i in input().split()] )
comb_list = []
import sys
sys.setrecursionlimit(100000000)
def recur(N, lis, c):
if len(lis) == N:
comb_list.append(lis)
return
if lis == []:
for i in range(1, N+1):
... | N, M, Q = (int(i) for i in input().split())
ABCD = []
ans = -1
for _ in range(Q):
ABCD.append([int(i) for i in input().split()] )
comb_list = []
import sys
sys.setrecursionlimit(100000000)
def recur(N, lis, c):
if len(lis) == N:
comb_list.append(lis)
return
if lis == []:
for i in range(1, M+1):
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,497 | 441,498 | u909991537 | python |
p02695 | import itertools
n,m,q = map(int,input().split())
mylist = [list(map(int, input().split())) for i in range(q)]
#print(mylist)
kouho = []
for i in range(1, m+1):
kouho.append(i)
#print(kouho)
A = list(itertools.combinations(kouho,n))
#print(A)
point = 0
maxp = 0
for a in A:
point = 0
#print(a)
for my in myli... | import itertools
n,m,q = map(int,input().split())
mylist = [list(map(int, input().split())) for i in range(q)]
#print(mylist)
kouho = []
for i in range(1, m+1):
kouho.append(i)
#print(kouho)
A = list(itertools.combinations_with_replacement(kouho,n))
#print(A)
point = 0
maxp = 0
for a in A:
point = 0
#print(a)... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 441,501 | 441,502 | u562791958 | python |
p02695 | from itertools import combinations_with_replacement as c
n, m, q = [int(i) for i in input().split()]
abc = [[int(i) for i in input().split()] for _ in range(q)]
aa = list(range(1,m+1))
ans = 0
for bb in c(aa,m):
cc = 0
for a, b, c, d in abc:
if bb[b-1] - bb[a-1] == c:
cc += d
ans = max(a... | from itertools import combinations_with_replacement as c
n, m, q = [int(i) for i in input().split()]
abc = [[int(i) for i in input().split()] for _ in range(q)]
aa = list(range(1,m+1))
ans = 0
for bb in c(aa, n):
cc = 0
for a, b, c, d in abc:
if bb[b-1] - bb[a-1] == c:
cc += d
ans = max(... | [
"identifier.change",
"call.arguments.change"
] | 441,505 | 441,506 | u571969099 | python |
p02695 | import itertools
n,m,q = map(int,input().split())
qset = [list(map(int, input().split())) for i in range(q)]
aa=list(itertools.combinations(range(1,m+1), r=n))
ans=0
for i in range(len(aa)):
score = 0
for n in range(len(qset)):
a=aa[i]
abcd=qset[n]
if a[abcd[1]-1]-a[abcd[0]-1]==abcd[2]:
score=s... | import itertools
n,m,q = map(int,input().split())
qset = [list(map(int, input().split())) for i in range(q)]
aa=list(itertools.combinations_with_replacement(range(1,m+1), r=n))
ans=0
for i in range(len(aa)):
score = 0
for n in range(len(qset)):
a=aa[i]
abcd=qset[n]
if a[abcd[1]-1]-a[abcd[0]-1]==abcd[... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 441,516 | 441,517 | u262244504 | python |
p02695 | import itertools
n, m, q = map(int, input().split())
abcd = []
a_pre = []
for i in range(q):
abcd.append(list(map(int, input().split())))
lis = [i for i in range(1,m+1)]
for pair in itertools.combinations(lis, n):
a_pre.append(list(pair))
sum = 0
for i in range(len(a_pre)):
sum_pre = 0
for j in range(len(... | import itertools
n, m, q = map(int, input().split())
abcd = []
a_pre = []
for i in range(q):
abcd.append(list(map(int, input().split())))
lis = [i for i in range(1, m + 1)]
for pair in itertools.combinations_with_replacement(lis, n):
a_pre.append(list(pair))
sum = 0
for i in range(len(a_pre)):
sum_pre = 0
... | [
"identifier.change"
] | 441,528 | 441,529 | u101785141 | python |
p02695 | import itertools
N, M, Q = list(map(int,input().split()))
numbers = [i for i in range(1, M+1)]
array = itertools.combinations_wih_replacement(numbers, N)
input_data = [list(map(int,input().split())) for _ in range(Q)]
max_score = 0
for A in array:
score = 0
for _ in range(Q):
a, b, c, d = input_data[... | import itertools
N, M, Q = list(map(int,input().split()))
numbers = [i for i in range(1, M+1)]
array = itertools.combinations_with_replacement(numbers, N)
input_data = [list(map(int,input().split())) for _ in range(Q)]
max_score = 0
for A in array:
score = 0
for _ in range(Q):
a, b, c, d = input_data... | [
"assignment.value.change",
"identifier.change"
] | 441,530 | 441,531 | u693007703 | python |
p02695 | import sys
N, M, Q = map(int, sys.stdin.readline().strip().split())
con = [] # condition
for i in range(Q):
con.append(list(map(int, sys.stdin.readline().strip().split())))
dig = N + 1 # dig -1 桁の数字を作る
A = [1] * dig
point = 0
def make(min=1, digit=1):
global point
for i in range(min, 11):
A[di... | import sys
N, M, Q = map(int, sys.stdin.readline().strip().split())
con = [] # condition
for i in range(Q):
con.append(list(map(int, sys.stdin.readline().strip().split())))
dig = N + 1 # dig -1 桁の数字を作る
A = [1] * dig
point = 0
def make(min=1, digit=1):
global point
for i in range(min, M + 1):
A... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,538 | 441,539 | u135454978 | python |
p02695 | import sys
N, M, Q = map(int, sys.stdin.readline().strip().split())
con = [] # condition
for i in range(Q):
con.append(list(map(int, sys.stdin.readline().strip().split())))
dig = N + 1 # dig -1 桁の数字を作る
A = [1] * dig
point = 0
def make(min=1, digit=1):
global point
for i in range(min, 11):
A[di... | import sys
N, M, Q = map(int, sys.stdin.readline().strip().split())
con = [] # condition
for i in range(Q):
con.append(list(map(int, sys.stdin.readline().strip().split())))
dig = N + 1 # dig -1 桁の数字を作る
A = [1] * dig
point = 0
def make(min=1, digit=1):
global point
for i in range(min, M + 1):
A... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,540 | 441,539 | u135454978 | python |
p02695 | import itertools
n, m, q = map(int, input().split())
queries = []
for i in range(q):
a, b, c, d = map(int, input().split())
queries.append((a, b, c, d))
max_score = 0
p = [1] * n
cur = n-1
while cur >= 0:
score = 0
for a, b, c, d in queries:
if p[b - 1] - p[a - 1] == c:
score += d
... | import itertools
n, m, q = map(int, input().split())
queries = []
for i in range(q):
a, b, c, d = map(int, input().split())
queries.append((a, b, c, d))
max_score = 0
p = [1] * n
cur = n-1
while cur >= 0:
score = 0
for a, b, c, d in queries:
if p[b - 1] - p[a - 1] == c:
score += d
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 441,551 | 441,552 | u039623862 | python |
p02695 | import itertools
N,M,Q = map(int, input().split())
series = list()
for i in range(Q):
series.append(list(map(int,input().split())))
A = [x for x in range(1,M+1)]
max_score = 0
for a in itertools.combinations(A,N):
score = 0
for s in series:
if (a[s[1]-1] - a[s[0]-1]) == s[2]:
score += s[3]
if score > m... | import itertools
N,M,Q = map(int, input().split())
series = list()
for i in range(Q):
series.append(list(map(int,input().split())))
A = [x for x in range(1,M+1)]
max_score = 0
for a in itertools.combinations_with_replacement(A,N):
score = 0
for s in series:
if (a[s[1]-1] - a[s[0]-1]) == s[2]:
score += s[3]
... | [
"identifier.change"
] | 441,560 | 441,561 | u009885900 | python |
p02695 | import itertools
N, M, Q = list(map(int, input().split()))
a = []
b = []
c = []
d = []
for i in range(Q):
aa, bb, cc, dd = list(map(int, input().split()))
a.append(aa)
b.append(bb)
c.append(cc)
d.append(dd)
Ms = [i for i in range(1, M+1)]
res = 0
for s in itertools.combinations(Ms, N):
sum_ = 0
for j i... | import itertools
N, M, Q = list(map(int, input().split()))
a = []
b = []
c = []
d = []
for i in range(Q):
aa, bb, cc, dd = list(map(int, input().split()))
a.append(aa)
b.append(bb)
c.append(cc)
d.append(dd)
Ms = [i for i in range(1, M+1)]
res = 0
for s in itertools.combinations_with_replacement(Ms, N):
... | [
"identifier.change"
] | 441,566 | 441,567 | u379716238 | python |
p02695 | import itertools
n,m,q = map(int,input().split())
m_li = []
for i in range(1,m+1):
m_li.append(i)
li = []
mx = 0
for i in range(q):
a,b,c,d = map(int,input().split())
li.append((a,b,c,d))
for v in itertools.combinations(m_li,n):
buf = 0
for i in range(q):
a = li[i][0]
b = li[i][... | import itertools
n,m,q = map(int,input().split())
m_li = []
for i in range(1,m+1):
m_li.append(i)
li = []
mx = 0
for i in range(q):
a,b,c,d = map(int,input().split())
li.append((a,b,c,d))
for v in itertools.combinations_with_replacement(m_li,n):
buf = 0
for i in range(q):
a = li[i][0]
... | [
"identifier.change"
] | 441,571 | 441,572 | u996434204 | python |
p02695 | N, M, Q = map(int, input().split())
b = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
import itertools
a = range(1, M+1)
for set_A in itertools.combinations_with_replacement(a, N):
A = list(set_A)
print(A)
n = 0
for i in range(Q):
if A[b[i][1]-1] - A[b[i][0]-1] == b[i][2]:
... | N, M, Q = map(int, input().split())
b = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
import itertools
a = range(1, M+1)
for set_A in itertools.combinations_with_replacement(a, N):
A = list(set_A)
n = 0
for i in range(Q):
if A[b[i][1]-1] - A[b[i][0]-1] == b[i][2]:
n += b[i... | [
"call.remove"
] | 441,590 | 441,591 | u870841038 | python |
p02695 | def make_arr(x, arr):
if len(arr) == n:
pattern.append(arr)
else:
for i in range(x, 11):
make_arr(i, arr + [i])
n, m, q = map(int, input().split())
query = [list(map(int, input().split())) for _ in range(q)]
pattern = []
for i in range(1, m + 1):
make_arr(i, [i])
ans = 0
for p... | def make_arr(x, arr):
if len(arr) == n:
pattern.append(arr)
else:
for i in range(x, m + 1):
make_arr(i, arr + [i])
n, m, q = map(int, input().split())
query = [list(map(int, input().split())) for _ in range(q)]
pattern = []
for i in range(1, m + 1):
make_arr(i, [i])
ans = 0
fo... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,594 | 441,595 | u803617136 | python |
p02695 | import itertools
n, m, q = map(int, input().split())
l = []
for i in range(q):
a, b, c, d = map(int, input().split())
l.append([a-1, b-1, c, d])
ll = [i for i in range(1, 11)]
h = itertools.combinations_with_replacement(ll, n)
ans = 0
for v in h:
vl = list(v)
cnt = 0
for i in range(q):
ai, b... | import itertools
n, m, q = map(int, input().split())
l = []
for i in range(q):
a, b, c, d = map(int, input().split())
l.append([a-1, b-1, c, d])
ll = [i for i in range(1, m+1)]
h = itertools.combinations_with_replacement(ll, n)
ans = 0
for v in h:
vl = list(v)
cnt = 0
for i in range(q):
ai, ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,598 | 441,599 | u506086925 | python |
p02695 | import itertools
N, M, Q = map(int, input().split())
abcd = [list(map(int, input().split())) for _ in range(Q)]
M_chr = []
for i in range(1,M+1):
M_chr.append(str(i))
As = list(itertools.combinations(M_chr, N))
pointA_max = 0
for i, A in enumerate(As):
pointA = 0
for i in range(Q):
a = abcd[i][0]
... | import itertools
N, M, Q = map(int, input().split())
abcd = [list(map(int, input().split())) for _ in range(Q)]
M_chr = []
for i in range(1,M+1):
M_chr.append(str(i))
As = list(itertools.combinations_with_replacement(M_chr, N))
pointA_max = 0
for i, A in enumerate(As):
pointA = 0
for i in range(Q):
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 441,608 | 441,609 | u107798522 | python |
p02695 | import itertools
N, M, Q = map(int, input().split())
a = [list(map(int, input().split())) for l in range(Q)]
b = [1]*N
c = 0
for i in range(Q):
if b[a[i][2]-1]-b[a[i][1]-1] == a[i][3]:
c += a[i][4]
C = c
for k in range(1,M):
nums = [i for i in range(N-1)]
for balls in itertools.combinations_with_replacement(n... | import itertools
N, M, Q = map(int, input().split())
a = [list(map(int, input().split())) for l in range(Q)]
b = [1]*N
c = 0
for i in range(Q):
if b[a[i][1]-1]-b[a[i][0]-1] == a[i][2]:
c += a[i][3]
C = c
for k in range(1,M):
nums = [i for i in range(N-1)]
for balls in itertools.combinations_with_replacement(n... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"literal.number.integer.change",
"variable_access.subscript.index.change"
] | 441,610 | 441,611 | u944390835 | python |
p02695 | n, m, q = map(int, input().split())
a, b, c, d = [[0]*q for i in range(4)]
for i in range(q):
a[i], b[i], c[i], d[i] = map(int, input().split())
a[i] -= 1
b[i] -= 1
def dfs(vec, mx, cnt):
if cnt:
tmp = 0
for i in range(mx, m+1):
tmp = max(tmp, dfs(vec+[i], i, cnt-1))
... | n, m, q = map(int, input().split())
a, b, c, d = [[0]*q for i in range(4)]
for i in range(q):
a[i], b[i], c[i], d[i] = map(int, input().split())
a[i] -= 1
b[i] -= 1
def dfs(vec, mx, cnt):
if cnt:
tmp = 0
for i in range(mx, m+1):
tmp = max(tmp, dfs(vec+[i], i, cnt-1))
... | [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 441,623 | 441,624 | u242031676 | python |
p02695 | from itertools import combinations_with_replacement
N, M, Q = [int(x) for x in input().split()]
lst = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
for seq in combinations_with_replacement(range(1, M+1), N):
print(seq)
tmp = 0
for a, b, c, d in lst:
if (seq[b-1] - seq[a-1] == c):
... | from itertools import combinations_with_replacement
N, M, Q = [int(x) for x in input().split()]
lst = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
for seq in combinations_with_replacement(range(1, M+1), N):
tmp = 0
for a, b, c, d in lst:
if (seq[b-1] - seq[a-1] == c):
tmp += d... | [
"call.remove"
] | 441,649 | 441,650 | u439009525 | python |
p02695 | import os
from functools import reduce
from operator import mul
import itertools
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
def ncr(n, r, mod=None):
"""
組み合わせの数 nCr
:param... | import os
from functools import reduce
from operator import mul
import itertools
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
def ncr(n, r, mod=None):
"""
組み合わせの数 nCr
:param... | [
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 441,651 | 441,652 | u389910364 | python |
p02695 | import os
from functools import reduce
from operator import mul
import itertools
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
def ncr(n, r, mod=None):
"""
組み合わせの数 nCr
:param... | import os
from functools import reduce
from operator import mul
import itertools
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
def ncr(n, r, mod=None):
"""
組み合わせの数 nCr
:param... | [
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove",
"literal.number.integer.change",
"control_flow.loop.range.bounds.lower.change",
"identifier.change"
] | 441,653 | 441,652 | u389910364 | python |
p02695 | n,m,q=map(int, input().split())
abcd=[list(map(int, input().split())) for i in range(q)]
from itertools import combinations_with_replacement
data=list(range(1,11))
prep=combinations_with_replacement(data, n)
ans=0
for p in prep:
tmp=0
p=sorted(list(p))
for i in range(q):
if p[abcd[i][1]-1]-p[abcd[i]... | n,m,q=map(int, input().split())
abcd=[list(map(int, input().split())) for i in range(q)]
from itertools import combinations_with_replacement
data=list(range(1,m+1))
prep=combinations_with_replacement(data, n)
ans=0
for p in prep:
tmp=0
p=sorted(list(p))
for i in range(q):
if p[abcd[i][1]-1]-p[abcd[i... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,656 | 441,657 | u260216890 | python |
p02695 | def Int():
return int(input())
def Ints():
return map(int,input().split())
def IntList():
return list(Ints())
def IntMat(N):
return [IntList() for i in range(N)]
N,M,Q = Ints()
List = []
for i in range(Q):
a,b,c,d = Ints()
List.append([a,b,c,d])
import itertools
Num = [i for i in range(N+... | def Int():
return int(input())
def Ints():
return map(int,input().split())
def IntList():
return list(Ints())
def IntMat(N):
return [IntList() for i in range(N)]
N,M,Q = Ints()
List = []
for i in range(Q):
a,b,c,d = Ints()
List.append([a,b,c,d])
import itertools
Num = [i for i in range(N+... | [
"control_flow.loop.range.bounds.upper.change",
"assignment.change"
] | 441,676 | 441,677 | u980322611 | python |
p02695 | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return... | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 441,684 | 441,685 | u423585790 | python |
p02695 | def cur(x):
if len(x)<m+1:
ans=0
for i in range(x[-1],m+1):
ans=max(ans,cur(x+[i]))
else:
ans=0
for i in range(q):
[a,b,c,d]=l[i]
if x[b]-x[a]==c: ans+=d
return ans
n,m,q=map(int,input().split())
l=[list(map(int,input().split())) for i in... | def cur(x):
if len(x)<n+1:
ans=0
for i in range(x[-1],m+1):
ans=max(ans,cur(x+[i]))
else:
ans=0
for i in range(q):
[a,b,c,d]=l[i]
if x[b]-x[a]==c: ans+=d
return ans
n,m,q=map(int,input().split())
l=[list(map(int,input().split())) for i in... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 441,695 | 441,696 | u197300773 | python |
p02695 | import itertools
n,m,q = map(int,input().split())
sc = []
for i in range(q):
a,b,c,d = map(int,input().split())
sc.append([a,b,c,d])
nums = [(i+1) for i in range(m+1)]
ans = 0
for balls in itertools.combinations_with_replacement(nums, n):
tp = 0
for i in range(q):
if balls[sc[i][1]-1]-balls[sc... | import itertools
n,m,q = map(int,input().split())
sc = []
for i in range(q):
a,b,c,d = map(int,input().split())
sc.append([a,b,c,d])
nums = [(i+1) for i in range(m)]
ans = 0
for balls in itertools.combinations_with_replacement(nums, n):
tp = 0
# print(balls)
for i in range(q):
if balls[sc[... | [
"expression.operation.binary.remove"
] | 441,701 | 441,702 | u231685196 | python |
p02695 | n, m, q = map(int, input().split())
check = [list(map(int, input().split())) for _ in range(q)]
def calc(r):
res = 0
for a, b, c, d in check:
if r[b-1] - r[a-1] == c:
res += d
return res
def dfs(t):
if len(t) == n:
return calc(t)
res = [dfs(t + [i]) for i in range(t[... | n, m, q = map(int, input().split())
check = [list(map(int, input().split())) for _ in range(q)]
def calc(r):
res = 0
for a, b, c, d in check:
if r[b-1] - r[a-1] == c:
res += d
return res
def dfs(t):
if len(t) == n:
return calc(t)
res = [dfs(t + [i]) for i in range(t[... | [
"call.arguments.add"
] | 441,710 | 441,711 | u595289165 | python |
p02695 | ans = []
def dfs(li):
if len(li) == n:
ans.append(li)
return
else:
for i in range(li[-1], m + 1):
dfs(li + [i])
n, m, q = map(int, input().split())
info = [list(map(int, input().split())) for i in range(q)]
for i in range(1, m):
dfs([i])
# print(ans)
res = 0
for pt... | ans = []
def dfs(li):
if len(li) == n:
ans.append(li)
return
else:
for i in range(li[-1], m + 1):
dfs(li + [i])
n, m, q = map(int, input().split())
info = [list(map(int, input().split())) for i in range(q)]
for i in range(1, m + 1):
dfs([i])
# print(ans)
res = 0
fo... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 441,724 | 441,725 | u794173881 | python |
p02695 | from itertools import combinations_with_replacement
n,m,q=map(int,input().split())
l=[list(map(int,input().split())) for i in range(q)]
ans=0
for i in combinations_with_replacement([i for i in range(1,11)], n):
tmp=0
for a,b,c,d in l:
if i[b-1]-i[a-1]==c:
tmp+=d
ans=max(ans,tmp)
print(an... | from itertools import combinations_with_replacement
n,m,q=map(int,input().split())
l=[list(map(int,input().split())) for i in range(q)]
ans=0
for i in combinations_with_replacement([i for i in range(1,m+1)], n):
tmp=0
for a,b,c,d in l:
if i[b-1]-i[a-1]==c:
tmp+=d
ans=max(ans,tmp)
print(a... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,728 | 441,729 | u065446124 | python |
p02695 | import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
return [ int(input()) for _ in range(n)]
# 改行またはスペース... | import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
return [ int(input()) for _ in range(n)]
# 改行またはスペース... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,749 | 441,750 | u407160848 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.