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 | n, m, q = map(int, input().split())
lis = [list(map(int, input().split())) for _ in range(q)]
import itertools
seq = list(range(1,m+1))
lis_p = list(itertools.combinations(seq, n))
ans = 0
ans_max = 0
for li_p in lis_p:
for li in lis:
if li_p[li[1]-1] - li_p[li[0]-1] == li[2]:
ans += li[3]
... | n, m, q = map(int, input().split())
lis = [list(map(int, input().split())) for _ in range(q)]
import itertools
seq = list(range(1,m+1))
lis_p = list(itertools.combinations_with_replacement(seq, n))
ans = 0
ans_max = 0
for li_p in lis_p:
for li in lis:
if li_p[li[1]-1] - li_p[li[0]-1] == li[2]:
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 441,753 | 441,754 | u665452497 | python |
p02695 | import itertools
def nasu(s, l):
n = N - 2
T = []
for i in range(s, l + 1):
T.append(i)
L = list(itertools.combinations_with_replacement(T, n))
ans = 0
for i in L:
P = [s] + list(i) + [l]
ans = max(ans, honya(P))
return ans
def honya(L):
ans = 0
for a, b, c, d in abcd:
a -= 1
b -=... | import itertools
def nasu(s, l):
n = N - 2
T = []
for i in range(s, l + 1):
T.append(i)
L = list(itertools.combinations_with_replacement(T, n))
ans = 0
for i in L:
P = [s] + list(i) + [l]
ans = max(ans, honya(P))
return ans
def honya(L):
ans = 0
for a, b, c, d in abcd:
a -= 1
b -=... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,755 | 441,756 | u456353530 | python |
p02695 | N,M,Q=map(int,input().split())
s=[list(map(int, input().split())) for i in range(Q)]
def ju(N,a,l):
k=[]
if N==1:
for i in range(a,M+1):
k+=[l+[i]]
else:
for i in range(a,M+1):
k+=ju(N-1,i,l+[i])
return k
l=ju(N,0,[])
a=0
for i in l:
t=0
for j in s:
... | N,M,Q=map(int,input().split())
s=[list(map(int, input().split())) for i in range(Q)]
def ju(N,a,l):
k=[]
if N==1:
for i in range(a,M+1):
k+=[l+[i]]
else:
for i in range(a,M+1):
k+=ju(N-1,i,l+[i])
return k
l=ju(N,1,[])
a=0
for i in l:
t=0
for j in s:
... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change"
] | 441,757 | 441,758 | u187516587 | python |
p02695 | n, m, q = list(map(int, input().split(' ')))
aq = [None] * q
bq = [None] * q
cq = [None] * q
dq = [None] * q
for i in range(q):
aq[i], bq[i], cq[i], dq[i] = list(map(int, input().split(' ')))
result = 0
def dfs(i, ary):
global result
if i == n:
val = 0
for j in range(q):
if ar... | n, m, q = list(map(int, input().split(' ')))
aq = [None] * q
bq = [None] * q
cq = [None] * q
dq = [None] * q
for i in range(q):
aq[i], bq[i], cq[i], dq[i] = list(map(int, input().split(' ')))
result = 0
def dfs(i, ary):
global result
if i == n:
val = 0
for j in range(q):
if ar... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 441,761 | 441,762 | u940743763 | python |
p02695 | n , m , q = map(int,input().split())
p = []
for i in range(q):
a , b , c , d = map(int,input().split())
p.append([a,b,c,d])
ans = 0
for a1 in range(1,m+1):
for a2 in range(a1,m+1):
for a3 in range(a2,m+1):
for a4 in range(a3,m+1):
for a5 in range(a4,m+1):
... | n , m , q = map(int,input().split())
p = []
for i in range(q):
a , b , c , d = map(int,input().split())
p.append([a,b,c,d])
ans = 0
for a1 in range(1,m+1):
for a2 in range(a1,m+1):
for a3 in range(a2,m+1):
for a4 in range(a3,m+1):
for a5 in range(a4,m+1):
... | [] | 441,763 | 441,764 | u306950978 | python |
p02695 | import itertools
n,m,q=map(int,input().split())
abcd=[list(map(int,input().split())) for _ in range(q)]
l=list(range(1,m+1))
l=list(itertools.combinations_with_replacement(l,m))
ans=0
for i in l:
kari=0
for j in range(q):
if i[abcd[j][1]-1]-i[abcd[j][0]-1]==abcd[j][2]:
kari+=abcd[j][3]
ans=max(ans,kari)... | import itertools
n,m,q=map(int,input().split())
abcd=[list(map(int,input().split())) for _ in range(q)]
l=list(range(1,m+1))
l=list(itertools.combinations_with_replacement(l,n))
ans=0
for i in l:
kari=0
for j in range(q):
if i[abcd[j][1]-1]-i[abcd[j][0]-1]==abcd[j][2]:
kari+=abcd[j][3]
ans=max(ans,kari)... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 441,776 | 441,777 | u385309449 | python |
p02695 | import itertools
n,m,q=map(int,input().split())
abcd=[list(map(int,input().split())) for _ in range(q)]
l=list(range(1,m+1))
l=list(itertools.combinations_with_replacement(l,4))
ans=0
for i in l:
kari=0
for j in range(q):
if i[abcd[j][1]-1]-i[abcd[j][0]-1]==abcd[j][2]:
kari+=abcd[j][3]
ans=max(ans,kari)... | import itertools
n,m,q=map(int,input().split())
abcd=[list(map(int,input().split())) for _ in range(q)]
l=list(range(1,m+1))
l=list(itertools.combinations_with_replacement(l,n))
ans=0
for i in l:
kari=0
for j in range(q):
if i[abcd[j][1]-1]-i[abcd[j][0]-1]==abcd[j][2]:
kari+=abcd[j][3]
ans=max(ans,kari)... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 441,778 | 441,777 | u385309449 | python |
p02695 | N, M, Q = map(int, input().split())
ts = [tuple(map(int, input().split())) for _ in range(Q)]
As = [0] * N
def next(ls):
if ls[-1] < M:
ls[-1] += 1
else:
for i, elem in reversed(list(enumerate(ls))):
if elem < M:
for j in range(i, N):
ls[j] = ele... | N, M, Q = map(int, input().split())
ts = [tuple(map(int, input().split())) for _ in range(Q)]
As = [1] * N
def next(ls):
if ls[-1] < M:
ls[-1] += 1
else:
for i, elem in reversed(list(enumerate(ls))):
if elem < M:
for j in range(i, N):
ls[j] = ele... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 441,790 | 441,791 | u034128150 | python |
p02695 | from itertools import (
accumulate, # 累積和のイテレータ
groupby, # 値をkey,同じ値の集まりをgroup
permutations, # 順列
combinations, # 組み合わせ
product, # 重複あり順列（直積, 深いネストにも使える）
combinations_with_replacement, # 重複あり組み合わせ
)
N, M, Q = map(int, input().split())
q = []
for _ in range(Q):
q.append(list(map(int, i... | from itertools import (
accumulate, # 累積和のイテレータ
groupby, # 値をkey,同じ値の集まりをgroup
permutations, # 順列
combinations, # 組み合わせ
product, # 重複あり順列（直積, 深いネストにも使える）
combinations_with_replacement, # 重複あり組み合わせ
)
N, M, Q = map(int, input().split())
q = []
for _ in range(Q):
q.append(list(map(int, i... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 441,794 | 441,795 | u896726004 | python |
p02695 | import itertools
N, M, Q = map(int, input().split())
abcd = [list(map(int, input().split())) for i in range(Q)]
A_itr = itertools.combinations(range(1, M+1), N)
max_score = 0
for A in A_itr:
score = 0
for j_abcd in abcd:
if A[j_abcd[1]-1]-A[j_abcd[0]-1] == j_abcd[2]:
score += j_abcd[3]
m... | import itertools
N, M, Q = map(int, input().split())
abcd = [list(map(int, input().split())) for i in range(Q)]
A_itr = itertools.combinations_with_replacement(range(1, M+1), N)
max_score = 0
for A in A_itr:
score = 0
for j_abcd in abcd:
if A[j_abcd[1]-1]-A[j_abcd[0]-1] == j_abcd[2]:
score +... | [
"assignment.value.change",
"identifier.change"
] | 441,796 | 441,797 | u567430603 | python |
p02695 | N, M, Q = map(int, input().split())
X=[0]*Q
for i in range(Q):
X[i] = list(map(int, input().split()))
from itertools import combinations_with_replacement
def solve(N,M,Q,X):
ans = 0
for c in combinations_with_replacement(range(1,11), N-1):
A = [1]+list(c)
score = 0
for x in X:
... | N, M, Q = map(int, input().split())
X=[0]*Q
for i in range(Q):
X[i] = list(map(int, input().split()))
from itertools import combinations_with_replacement
def solve(N,M,Q,X):
ans = 0
for c in combinations_with_replacement(range(1,M+1), N-1):
A = [1]+list(c)
score = 0
for x in X:
... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,802 | 441,803 | u678167152 | python |
p02695 | import sys
sys.setrecursionlimit(10**8)
N,M,Q = map(int ,input().split())
ls = [0]*Q
for i in range(Q):
a,b,c,d = map(int, input().split())
ls[i] = (a,b,c,d)
def f(l,cnt):
if cnt>0:
j = l[-1]
ans = 0
for i in range(j,M+1):
ans = max(f(l+[i],cnt-1),ans)
return ans
else:
m = 0
for ... | import sys
sys.setrecursionlimit(10**8)
N,M,Q = map(int ,input().split())
ls = [0]*Q
for i in range(Q):
a,b,c,d = map(int, input().split())
ls[i] = (a,b,c,d)
def f(l,cnt):
if cnt>0:
j = l[-1]
ans = 0
for i in range(j,M+1):
ans = max(f(l+[i],cnt-1),ans)
return ans
else:
m = 0
for ... | [
"call.arguments.add"
] | 441,823 | 441,824 | u476604182 | python |
p02695 | import sys
sys.setrecursionlimit(10**8)
N,M,Q = map(int ,input().split())
ls = [0]*Q
for i in range(Q):
a,b,c,d = map(int, input().split())
ls[i] = (a,b,c,d)
def f(l,cnt):
if cnt>0:
j = l[-1]
ans = -1
for i in range(j,M+1):
ans = max(f(l+[i],cnt-1),ans)
return ans
else:
m = 0
for... | import sys
sys.setrecursionlimit(10**8)
N,M,Q = map(int ,input().split())
ls = [0]*Q
for i in range(Q):
a,b,c,d = map(int, input().split())
ls[i] = (a,b,c,d)
def f(l,cnt):
if cnt>0:
j = l[-1]
ans = 0
for i in range(j,M+1):
ans = max(f(l+[i],cnt-1),ans)
return ans
else:
m = 0
for ... | [
"assignment.value.change",
"expression.operation.unary.remove",
"call.arguments.add"
] | 441,825 | 441,824 | u476604182 | python |
p02695 | N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(Q)]
A_cand = []
max_score = 0
def gen(mae):
global A_cand
if len(mae)==N:
A_cand.append(mae)
return 0
for one in range(mae[-1], 11):
gen(mae+[one])
for i in range(1,M+1):
gen([i])
fo... | N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(Q)]
A_cand = []
max_score = 0
def gen(mae):
global A_cand
if len(mae)==N:
A_cand.append(mae)
return 0
for one in range(mae[-1], M+1):
gen(mae+[one])
for i in range(1,M+1):
gen([i])
f... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,826 | 441,827 | u090266528 | python |
p02695 | N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(Q)]
A_cand = []
max_score = 0
def gen(mae):
global A_cand
if len(mae)==N:
A_cand.append(mae)
return 0
for one in range(mae[-1], 11):
gen(mae+[one])
for i in range(1,11):
gen([i])
fo... | N, M, Q = list(map(int, input().split()))
abcd = [list(map(int, input().split())) for _ in range(Q)]
A_cand = []
max_score = 0
def gen(mae):
global A_cand
if len(mae)==N:
A_cand.append(mae)
return 0
for one in range(mae[-1], M+1):
gen(mae+[one])
for i in range(1,M+1):
gen([i])
f... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,828 | 441,827 | u090266528 | python |
p02695 | N, M, Q = [int(n) for n in input().split()]
a = [0] * Q
b = [0] * Q
c = [0] * Q
d = [0] * Q
for i in range(Q):
a[i],b[i],c[i],d[i] = [int(n) for n in input().split()]
def gen(i, n, m):
if n == 0:
yield []
return
for f in range(i, m - n + 2):
for rest in gen(f, n - 1, m):
... | N, M, Q = [int(n) for n in input().split()]
a = [0] * Q
b = [0] * Q
c = [0] * Q
d = [0] * Q
for i in range(Q):
a[i],b[i],c[i],d[i] = [int(n) for n in input().split()]
def gen(i, n, m):
if n == 0:
yield []
return
for f in range(i, m + 1):
for rest in gen(f, n - 1, m):
y... | [
"expression.operation.binary.remove",
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,853 | 441,854 | u979684411 | python |
p02695 | #!/usr/bin/env python3
import sys
def solve(N: int, M: int, Q: int, a: "List[int]", b: "List[int]", c: "List[int]", d: "List[int]"):
from itertools import combinations_with_replacement
answer = 0
for AA in combinations_with_replacement(range(0,M+1),r=N):
tmp_ans = 0
for q in range(Q):
... | #!/usr/bin/env python3
import sys
def solve(N: int, M: int, Q: int, a: "List[int]", b: "List[int]", c: "List[int]", d: "List[int]"):
from itertools import combinations_with_replacement
answer = 0
for AA in combinations_with_replacement(range(1,M+1),r=N):
tmp_ans = 0
for q in range... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 441,857 | 441,858 | u020390084 | python |
p02695 | import sys
sys.setrecursionlimit(10**5)
N,M,Q=map(int,input().split())
a=[0]*(Q)
b=[0]*(Q)
c=[0]*(Q)
d=[0]*(Q)
for i in range(Q):
A,B,C,D=map(int,input().split())
a[i]=A;b[i]=B;c[i]=C;d[i]=D
r=[]
def dfs(i,depth,b,h):
if depth==0:
b.append(h)
return
for j in range(i,M):
nh=h[:]
... | import sys
sys.setrecursionlimit(10**5)
N,M,Q=map(int,input().split())
a=[0]*(Q)
b=[0]*(Q)
c=[0]*(Q)
d=[0]*(Q)
for i in range(Q):
A,B,C,D=map(int,input().split())
a[i]=A;b[i]=B;c[i]=C;d[i]=D
r=[]
def dfs(i,depth,b,h):
if depth==0:
b.append(h)
return
for j in range(i,M+1):
nh=h[:]... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 441,861 | 441,862 | u521602455 | python |
p02695 | import sys
sys.setrecursionlimit(10**5)
N,M,Q=map(int,input().split())
a=[0]*(Q)
b=[0]*(Q)
c=[0]*(Q)
d=[0]*(Q)
for i in range(Q):
A,B,C,D=map(int,input().split())
a[i]=A;b[i]=B;c[i]=C;d[i]=D
r=[]
def dfs(i,depth,b,h):
if depth==0:
b.append(h)
return
for j in range(i,11):
nh=h[:]
... | import sys
sys.setrecursionlimit(10**5)
N,M,Q=map(int,input().split())
a=[0]*(Q)
b=[0]*(Q)
c=[0]*(Q)
d=[0]*(Q)
for i in range(Q):
A,B,C,D=map(int,input().split())
a[i]=A;b[i]=B;c[i]=C;d[i]=D
r=[]
def dfs(i,depth,b,h):
if depth==0:
b.append(h)
return
for j in range(i,M+1):
nh=h[:]... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,863 | 441,862 | u521602455 | python |
p02695 | a = input().split()
N = int(a[0])
M = int(a[1])
Q = int(a[2])
current = []
for i in range(Q):
e = input().split()
f = [int(i) for i in e]
current.append(f)
import itertools
c = list(itertools.combinations_with_replacement(range(1, M + 1), N))
value_list = []
for item in c:
value = 0
for k in curren... | a = input().split()
N = int(a[0])
M = int(a[1])
Q = int(a[2])
current = []
for i in range(Q):
e = input().split()
f = [int(i) for i in e]
current.append(f)
import itertools
c = list(itertools.combinations_with_replacement(range(1, M + 1), N))
value_list = []
for item in c:
value = 0
for k in curren... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 441,887 | 441,888 | u876295560 | python |
p02695 | import sys
input = sys.stdin.readline
import numpy as np
from itertools import combinations_with_replacement as CwR
n, m, q = map(int, input().split())
Lis = [[int(e) for e in input().split()] for _ in range(q)]
Tables = list(CwR(range(1,M+1),N))
Sum_cor = []
for Table in Tables:
d_sum = 0
for l in Lis:
... | import sys
input = sys.stdin.readline
import numpy as np
from itertools import combinations_with_replacement as CwR
n, m, q = map(int, input().split())
Lis = [[int(e) for e in input().split()] for _ in range(q)]
Tables = list(CwR(range(1,m+1),n))
Sum_cor = []
for Table in Tables:
d_sum = 0
for l in Lis:
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 441,909 | 441,910 | u561862393 | python |
p02695 |
def main():
N, M, Q = [int(x) for x in input().split()]
queries = [[int(x) for x in input().split()] for _ in range(Q)]
ans = float("-inf")
def dfs(A: list):
nonlocal ans
if len(A) == N:
s = sum(d for a, b, c, d in queries if A[b-1]-A[a-1] == c)
ans = max(ans,... |
def main():
N, M, Q = [int(x) for x in input().split()]
queries = [[int(x) for x in input().split()] for _ in range(Q)]
ans = float("-inf")
def dfs(A: list):
nonlocal ans
if len(A) == N:
s = sum(d for a, b, c, d in queries if A[b-1]-A[a-1] == c)
ans = max(ans,... | [
"literal.number.integer.change",
"assignment.value.change"
] | 441,917 | 441,918 | u185034753 | python |
p02695 | import sys
readline = sys.stdin.readline
from itertools import combinations_with_replacement
def main():
N, M, Q = map(int, readline().rstrip().split())
P = [tuple(map(int, readline().rstrip().split())) for _ in range(Q)]
ans = 0
for pair in combinations_with_replacement([i for i in range(1, M+1)],... | import sys
readline = sys.stdin.readline
from itertools import combinations_with_replacement
def main():
N, M, Q = map(int, readline().rstrip().split())
P = [tuple(map(int, readline().rstrip().split())) for _ in range(Q)]
ans = 0
for pair in combinations_with_replacement([i for i in range(1, M+1)],... | [
"identifier.change",
"call.arguments.change"
] | 441,923 | 441,924 | u969850098 | python |
p02695 | # ABC165 C
import itertools
def main():
n, m, q = map(int, input().split())
List = []
for i in range(q):
a, b, c, d = map(int, input().split())
List.append([a, b, c, d])
max_total = 0
for A in list(itertools.combinations(range(1, m+1),n)):
total = 0
for abcd i... | # ABC165 C
import itertools
def main():
n, m, q = map(int, input().split())
List = []
for i in range(q):
a, b, c, d = map(int, input().split())
List.append([a, b, c, d])
max_total = 0
for A in list(itertools.combinations_with_replacement(range(1, m+1),n)):
total = 0
... | [
"identifier.change",
"call.arguments.change"
] | 441,925 | 441,926 | u998679483 | python |
p02695 | import itertools
N,M,Q = map(int,(input().split()))
a = [0]*Q
b = [0]*Q
c = [0]*Q
d = [0]*Q
for i in range(Q):
a[i],b[i],c[i],d[i] = map(int,(input().split()))
l = list(itertools.combinations_with_areplacement(range(1,M+1), N))
nax = 0
for x in l:
score = 0
for i in range(Q):
if int(x[b[i]-1]) - ... | import itertools
N,M,Q = map(int,(input().split()))
a = [0]*Q
b = [0]*Q
c = [0]*Q
d = [0]*Q
for i in range(Q):
a[i],b[i],c[i],d[i] = map(int,(input().split()))
l = list(itertools.combinations_with_replacement(range(1,M+1), N))
nax = 0
for x in l:
score = 0
for i in range(Q):
if int(x[b[i]-1]) - i... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 441,927 | 441,928 | u397384480 | python |
p02695 | from itertools import combinations as c
n, m, q = map(int, input().split())
arr = []
for i in range(q):
l = [*map(int, input().split())]
arr.append(l)
res = 0
for g in c(list(range(1, m+1)), n):
f = 0
for h in arr:
if g[h[1]-1] - g[h[0]-1] == h[2]:
f += h[3]
res = max(r... | from itertools import combinations_with_replacement as c
n, m, q = map(int, input().split())
arr = []
for i in range(q):
l = [*map(int, input().split())]
arr.append(l)
res = 0
for g in c(list(range(1, m+1)), n):
f = 0
for h in arr:
if g[h[1]-1] - g[h[0]-1] == h[2]:
f += h[3]... | [
"identifier.change"
] | 441,929 | 441,930 | u469936642 | python |
p02695 | from collections import Counter
import sys
sys.setrecursionlimit(200000)
def read():
N, M, Q = map(int, input().split())
ABCD = []
for i in range(Q):
a, b, c, d = map(int, input().split())
ABCD.append((a, b, c, d))
return N, M, Q, ABCD
def check(N, M, Q, ABCD, x):
score = 0
f... | from collections import Counter
import sys
sys.setrecursionlimit(200000)
def read():
N, M, Q = map(int, input().split())
ABCD = []
for i in range(Q):
a, b, c, d = map(int, input().split())
ABCD.append((a, b, c, d))
return N, M, Q, ABCD
def check(N, M, Q, ABCD, x):
score = 0
f... | [
"call.arguments.add"
] | 441,933 | 441,934 | u257162238 | python |
p02695 | from collections import Counter
import sys
sys.setrecursionlimit(200000)
def read():
N, M, Q = map(int, input().split())
ABCD = []
for i in range(Q):
a, b, c, d = map(int, input().split())
ABCD.append((a, b, c, d))
return N, M, Q, ABCD
def check(N, M, Q, ABCD, x):
score = 0
f... | from collections import Counter
import sys
sys.setrecursionlimit(200000)
def read():
N, M, Q = map(int, input().split())
ABCD = []
for i in range(Q):
a, b, c, d = map(int, input().split())
ABCD.append((a, b, c, d))
return N, M, Q, ABCD
def check(N, M, Q, ABCD, x):
score = 0
f... | [
"call.arguments.add",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 441,935 | 441,934 | u257162238 | python |
p02695 | #import numpy as np
N,M,Q=map(int, input().split())
matrix=[]
for _ in range(Q):
c=list(map(int, input().split()))
matrix.append(c)
#matrix = np.array(matrix)
import itertools
ansscore = 0
combi = list(combinations_with_replacement(range(1,M+1),N))
for i in combi:
i = list(i)
i.sort()
score=0
fo... | #import numpy as np
N,M,Q=map(int, input().split())
matrix=[]
for _ in range(Q):
c=list(map(int, input().split()))
matrix.append(c)
#matrix = np.array(matrix)
import itertools
ansscore = 0
combi = list(itertools.combinations_with_replacement(range(1,M+1),N))
for i in combi:
i = list(i)
i.sort()
scor... | [] | 441,938 | 441,939 | u595905528 | python |
p02695 | import itertools
import numpy as np
N, M, Q = map(int, input().split())
A = np.array(list(itertools.combinations_with_replacemeent(range(1, M+1), N)))
s = np.zeros(len(A), np.int32)
for i in range(Q):
a, b, c, d = map(int, input().split())
s += d * (A[:, b-1] - A[:, a-1] == c)
print(s.max()) | import itertools
import numpy as np
N, M, Q = map(int, input().split())
A = np.array(list(itertools.combinations_with_replacement(range(1, M+1), N)))
s = np.zeros(len(A), np.int32)
for i in range(Q):
a, b, c, d = map(int, input().split())
s += d * (A[:, b-1] - A[:, a-1] == c)
print(s.max()) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 441,952 | 441,953 | u276204978 | python |
p02695 | import itertools
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
N,M,Q = map(int, input().split())
L = []
for i in range(1,M+1,1):
L.append(i)
A = []
B = []
C = []
D = []
for _ in range(Q):
a,b,c,d = map(int, input().split())
A.append(a)
B.ap... | import itertools
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
N,M,Q = map(int, input().split())
L = []
for i in range(1,M+1,1):
L.append(i)
A = []
B = []
C = []
D = []
for _ in range(Q):
a,b,c,d = map(int, input().split())
A.append(a)
B.ap... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 441,956 | 441,957 | u492447501 | python |
p02695 | from itertools import combinations_with_replacement
from math import factorial
n,m,q=map(int,input().split())
lst=[list(map(int,input().split())) for i in range(q)]
total=[]
for a in combinations_with_replacement(range(1,m+1),n):
ans=0
for j in range(q):
if int(a[lst[j][1]-1])-int(a[lst[j][0]-1])==lst[j][2]:
... | from itertools import combinations_with_replacement
from math import factorial
n,m,q=map(int,input().split())
lst=[list(map(int,input().split())) for i in range(q)]
total=[]
for a in combinations_with_replacement(range(1,m+1),n):
ans=0
for j in range(q):
if int(a[lst[j][1]-1])-int(a[lst[j][0]-1])==lst[j][2]:
... | [
"call.remove"
] | 441,963 | 441,964 | u482743994 | python |
p02695 | N, M, Q = map(int, input().split())
s = list(list(map(int, input().split())) for _ in range(Q))
mx = 0
a = [1]*10
for s1 in range(1, M+1):
a[0] = s1
for s2 in range(s1, M+1):
a[1] = s2
for s3 in range(s2, M+1):
a[2] = s3
for s4 in range(s3, M+1):
a[3] = ... | N, M, Q = map(int, input().split())
s = list(list(map(int, input().split())) for _ in range(Q))
mx = 0
a = [1]*10
for s1 in range(1, M+1):
a[0] = s1
for s2 in range(s1, M+1):
a[1] = s2
for s3 in range(s2, M+1):
a[2] = s3
for s4 in range(s3, M+1):
a[3] = ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 441,975 | 441,976 | u431573188 | python |
p02695 | ### ----------------
### ここから
### ----------------
import sys
from io import StringIO
import unittest
import itertools
sys.setrecursionlimit(500*500)
def yn(b):
print("Yes" if b==1 else "No")
return
def resolve():
readline=sys.stdin.readline
n,m,q=map(int, readline().rstrip().split())
aa=[0]*q... | ### ----------------
### ここから
### ----------------
import sys
from io import StringIO
import unittest
import itertools
sys.setrecursionlimit(500*500)
def yn(b):
print("Yes" if b==1 else "No")
return
def resolve():
readline=sys.stdin.readline
n,m,q=map(int, readline().rstrip().split())
aa=[0]*q... | [
"identifier.change",
"call.arguments.change"
] | 441,984 | 441,985 | u697696097 | python |
p02695 | def main():
n, m, q = map(int, input().split())
abcd = [list(map(int, input().split())) for _ in [0]*q]
que = [[0]]
for _ in range(n):
que2 = []
for qq in que:
i = qq[-1]
for j in range(i, m+1):
que2.append(qq+[j])
que = que2
ans = 0
... | def main():
n, m, q = map(int, input().split())
abcd = [list(map(int, input().split())) for _ in [0]*q]
que = [[1]]
for _ in range(n):
que2 = []
for qq in que:
i = qq[-1]
for j in range(i, m+1):
que2.append(qq+[j])
que = que2
ans = 0
... | [
"literal.number.integer.change",
"assignment.value.change"
] | 441,986 | 441,987 | u532966492 | python |
p02695 | def main():
n, m, q = map(int, input().split())
abcd = [list(map(int, input().split())) for _ in [0]*q]
que = [[0]]
for _ in range(n):
que2 = []
for qq in que:
i = qq[-1]
for j in range(i, m+1):
que2.append(qq+[j])
que = que2
ans = 0
... | def main():
n, m, q = map(int, input().split())
abcd = [list(map(int, input().split())) for _ in [0]*q]
que = [[1]]
for _ in range(n):
que2 = []
for qq in que:
i = qq[-1]
for j in range(i, m+1):
que2.append(qq+[j])
que = que2
ans = 0
... | [
"literal.number.integer.change",
"assignment.value.change"
] | 441,986 | 441,988 | u532966492 | python |
p02695 | from itertools import combinations
n,m,q = map(int, input().split())
abcd = [list(map(int, input().split())) for _ in range(q)]
ans = 0
for case in combinations([i for i in range(1,n+m+1)],n):
now = 0
A = [x-i for i,x in enumerate(case)]
for i in range(q):
a,b,c,d = abcd[i]
if A[b-1]-A[a-1]... | from itertools import combinations
n,m,q = map(int, input().split())
abcd = [list(map(int, input().split())) for _ in range(q)]
ans = 0
for case in combinations([i for i in range(1,n+m)],n):
now = 0
A = [x-i for i,x in enumerate(case)]
for i in range(q):
a,b,c,d = abcd[i]
if A[b-1]-A[a-1] =... | [
"expression.operation.binary.remove"
] | 441,991 | 441,992 | u923279197 | 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):
for i7 in range(i6,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):
for i7 in range(i6,m+1):
... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 441,999 | 442,000 | u163320134 | python |
p02695 | import itertools
def c165(n, m, q, adli):
ans = 0
li = list(itertools.combinations_with_replacement(range(1,M+1), n))
for i in li:
count = 0
for a, b, c, d in adli:
if i[b-1] - i[a-1] == c:
count += d
ans = max(ans, count)
return ans
def main():
... | import itertools
def c165(n, m, q, adli):
ans = 0
li = list(itertools.combinations_with_replacement(range(1,m+1), n))
for i in li:
count = 0
for a, b, c, d in adli:
if i[b-1] - i[a-1] == c:
count += d
ans = max(ans, count)
return ans
def main():
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 442,002 | 442,003 | u488934106 | python |
p02695 | import itertools
def c165(n, m, q, adli):
ans = 0
li = list(itertools.combinations_with_replacement((1, m+1), n))
for i in li:
count = 0
for a, b, c, d in adli:
if i[b-1] - i[a-1] == c:
count += d
ans = max(ans, count)
return ans
def main():
n,... | import itertools
def c165(n, m, q, adli):
ans = 0
li = list(itertools.combinations_with_replacement(range(1,m+1), n))
for i in li:
count = 0
for a, b, c, d in adli:
if i[b-1] - i[a-1] == c:
count += d
ans = max(ans, count)
return ans
def main():
... | [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 442,004 | 442,003 | u488934106 | python |
p02695 | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i... | [
"assignment.add"
] | 442,013 | 442,014 | u744920373 | python |
p02695 | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i... | [
"assignment.change"
] | 442,015 | 442,016 | u744920373 | python |
p02695 | # -*- coding: utf-8 -*-
n,m,q = list(map(int,input().split()))
abcd = [list(map(int,input().split())) for i in range(q)]
def dfs(x,y,z,que):
ret = 0
if x == 0:
for a,b,c,d in abcd:
if que[b-1] - que[a-1]==c:
ret+=d
return ret
for i in range(y,z+1):
ret ... | # -*- coding: utf-8 -*-
n,m,q = list(map(int,input().split()))
abcd = [list(map(int,input().split())) for i in range(q)]
def dfs(x,y,z,que):
ret = 0
if x == 0:
for a,b,c,d in abcd:
if que[b-1] - que[a-1]==c:
ret+=d
return ret
for i in range(y,z+1):
ret ... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"io.output.change"
] | 442,021 | 442,022 | u704001626 | python |
p02695 | n, m, q = map(int, input().split())
tokutens = [list(input().split()) for i in range(q)]
import itertools
l = range(1, m+1)
sums = [0]
for v in itertools.combinations(l, n):
v = list(v)
sum = 0
for a, b, c, d in tokutens:
if v[int(b)-1] - v[int(a)-1] == int(c):
sum+=int(d)
sums.append(sum)
sums.sort... | n, m, q = map(int, input().split())
tokutens = [list(input().split()) for i in range(q)]
import itertools
l = range(1, m+1)
sums = [0]
for v in itertools.combinations_with_replacement(l, n):
v = list(v)
sum = 0
for a, b, c, d in tokutens:
if v[int(b)-1] - v[int(a)-1] == int(c):
sum+=int(d)
sums.appen... | [
"identifier.change"
] | 442,051 | 442,052 | u760130918 | python |
p02695 | from itertools import combinations_with_replacement
N, M, Q = map(int, input().split())
ts = []
for _ in range(Q):
ts.append(tuple(map(int, input().split())))
print(ts)
scores = []
for A in combinations_with_replacement(range(1, M + 1), N):
score = 0
for t in ts:
a, b, c, d = t
if A[b - 1]... | from itertools import combinations_with_replacement
N, M, Q = map(int, input().split())
ts = []
for _ in range(Q):
ts.append(tuple(map(int, input().split())))
scores = []
for A in combinations_with_replacement(range(1, M + 1), N):
score = 0
for t in ts:
a, b, c, d = t
if A[b - 1] - A[a - 1... | [
"call.remove"
] | 442,056 | 442,057 | u663767599 | python |
p02695 | import itertools
n,m,q = map(int,input().split())
abcd = [list(map(int,input().split())) for _ in range(q)]
# abcd.sort(key=lambda x:x[3],reverse=True)
# for x in abcd:
# print("")
# for v in x:
# print(v,end=" ")
arr = [i for i in range(1,11)]
ans = 0
for per in itertools.combinations_with_replaceme... | import itertools
n,m,q = map(int,input().split())
abcd = [list(map(int,input().split())) for _ in range(q)]
# abcd.sort(key=lambda x:x[3],reverse=True)
# for x in abcd:
# print("")
# for v in x:
# print(v,end=" ")
arr = [i for i in range(1,m+1)]
ans = 0
for per in itertools.combinations_with_replacem... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 442,062 | 442,063 | u024383312 | python |
p02695 | n,m,q = map(int ,input().split())
lst = [list(map(int, input().split())) for _ in range(q)]
import itertools
l = [i+1 for i in range(m)]
lst2 = [com for com in itertools.combinations_with_replacement(l, n)]
res = 0
for com in lst2:
score = 0
for l in lst:
if com[l[1]-1] - com[l[0]-1] == l[2]:
... | n,m,q = map(int ,input().split())
lst = [list(map(int, input().split())) for _ in range(q)]
import itertools
l = [i+1 for i in range(m)]
lst2 = [com for com in itertools.combinations_with_replacement(l, n)]
res = 0
for com in lst2:
score = 0
for l in lst:
if com[l[1]-1] - com[l[0]-1] == l[2]:
... | [
"call.remove"
] | 442,072 | 442,073 | u591524911 | python |
p02695 | n,m,q = map(int ,input().split())
lst = [list(map(int, input().split())) for _ in range(q)]
import itertools
l = [i+1 for i in range(m)]
lst2 = [com for com in itertools.combinations(l, n)]
res = 0
for com in lst2:
score = 0
for l in lst:
if com[l[1]-1] - com[l[0]-1] == l[2]:
score += l[3]
... | n,m,q = map(int ,input().split())
lst = [list(map(int, input().split())) for _ in range(q)]
import itertools
l = [i+1 for i in range(m)]
lst2 = [com for com in itertools.combinations_with_replacement(l, n)]
res = 0
for com in lst2:
score = 0
for l in lst:
if com[l[1]-1] - com[l[0]-1] == l[2]:
... | [
"assignment.value.change",
"identifier.change"
] | 442,074 | 442,073 | u591524911 | python |
p02695 | import itertools
N, M, Q = map(int, input().split())
ABCD = []
for _ in range(Q):
ABCD.append(list(map(int, input().split())))
M_list = [i+1 for i in range(M)]
N_list = itertools.combinations(M_list, N)
max_point = 0
for n in N_list:
point = 0
for abcd in ABCD:
if n[abcd[1]-1] - n[abcd[0]-1] == abc... | import itertools
N, M, Q = map(int, input().split())
ABCD = []
for _ in range(Q):
ABCD.append(list(map(int, input().split())))
M_list = [i+1 for i in range(M)]
N_list = itertools.combinations_with_replacement(M_list, N)
max_point = 0
for n in N_list:
point = 0
for abcd in ABCD:
if n[abcd[1]-1] - n[... | [
"assignment.value.change",
"identifier.change"
] | 442,083 | 442,084 | u022846086 | python |
p02695 | from itertools import combinations_with_replacement
n, m, q = list(map(int,input().split()))
A = [list(map(int,input().split())) for i in range(q)]
def keisan(tup):
ans_keisan = 0
print(tup)
for j in A:
if tup[j[1]-1] - tup[j[0]-1] == j[2]:
ans_keisan += j[3]
return ans_keisan
ans =... | from itertools import combinations_with_replacement
n, m, q = list(map(int,input().split()))
A = [list(map(int,input().split())) for i in range(q)]
def keisan(tup):
ans_keisan = 0
for j in A:
if tup[j[1]-1] - tup[j[0]-1] == j[2]:
ans_keisan += j[3]
return ans_keisan
ans = 0
for i in com... | [
"call.remove"
] | 442,087 | 442,088 | u736641785 | python |
p02695 | import sys
import math
input = lambda:sys.stdin.readline().strip()
n,m,q = map(int,input().split())
score = 0
def calc_score(arr):
val = 0
for i in qs:
a,b,c,d = i
if arr[b-1]-arr[a-1]==c:
val+=d
return val
def f(i,ne,arr):
if i==n:
global score
score = max(... | import sys
import math
input = lambda:sys.stdin.readline().strip()
n,m,q = map(int,input().split())
score = 0
def calc_score(arr):
val = 0
for i in qs:
a,b,c,d = i
if arr[b-1]-arr[a-1]==c:
val+=d
return val
def f(i,ne,arr):
if i==n:
global score
score = max(... | [
"literal.number.integer.change",
"call.arguments.change"
] | 442,094 | 442,095 | u431658223 | python |
p02695 | def resolve():
n, m, q = map(int, input().split())
queue = []
for i in range(q):
queue.append(list(map(int, input().split())))
ans = 0
import itertools
l = list(itertools.combinations(range(1, n + m), m))
for i in l:
a = [x - y for y, x in enumerate(i)]
x = 0
... | def resolve():
n, m, q = map(int, input().split())
queue = []
for i in range(q):
queue.append(list(map(int, input().split())))
ans = 0
import itertools
l = itertools.combinations(range(1, n + m), n)
for i in l:
a = [x - y for y, x in enumerate(i)]
x = 0
for j ... | [
"call.remove",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 442,100 | 442,101 | u762540523 | python |
p02695 | from itertools import combinations_with_replacement
n,m,q=map(int,input().split())
l=list(combinations_with_replacement(range(1,m+1),n))
res=0
lt=[list(map(int,input().split())) for _ in range(q)]
for j in range(len(l)):
tmp=0
for i in range(len(lt)):
a,b,c,d = lt[i][0],lt[i][1],lt[i][2],lt[i][3]
... | from itertools import combinations_with_replacement
n,m,q=map(int,input().split())
l=list(combinations_with_replacement(range(1,m+1),n))
res=0
lt=[list(map(int,input().split())) for _ in range(q)]
for j in range(len(l)):
tmp=0
for i in range(len(lt)):
a,b,c,d = lt[i][0],lt[i][1],lt[i][2],lt[i][3]
... | [
"call.remove"
] | 442,103 | 442,104 | u947327691 | python |
p02695 | #!/usr/bin/env python
import sys
from collections import Counter
from itertools import permutations, combinations_with_replacement
#from fractions import gcd
from math import gcd
from math import ceil, floor
import bisect
sys.setrecursionlimit(10 ** 6)
inf = float("inf")
def input():
return sys.stdin.readline()[:-... | #!/usr/bin/env python
import sys
from collections import Counter
from itertools import permutations, combinations_with_replacement
#from fractions import gcd
from math import gcd
from math import ceil, floor
import bisect
sys.setrecursionlimit(10 ** 6)
inf = float("inf")
def input():
return sys.stdin.readline()[:-... | [
"call.remove"
] | 442,114 | 442,115 | u580920947 | python |
p02695 | import itertools
N,M,Q = map(int,input().split())
arr = []
for _ in range(Q):
arr.append(list(map(int,input().split())))
ans = 0
nums = range(1,M+1)
arrs = itertools.combinations(nums, N)
for a in arrs:
_sum = 0
a = list(a)
for b in arr:
if a[b[1]-1]-a[b[0]-1]==b[2]:
_sum += b[3]
ans = max(ans,_... | import itertools
N,M,Q = map(int,input().split())
arr = []
for _ in range(Q):
arr.append(list(map(int,input().split())))
ans = 0
nums = range(1,M+1)
arrs = itertools.combinations_with_replacement(nums, N)
for a in arrs:
_sum = 0
a = list(a)
for b in arr:
if a[b[1]-1]-a[b[0]-1]==b[2]:
_sum += b[3]
... | [
"assignment.value.change",
"identifier.change"
] | 442,116 | 442,117 | u268181283 | python |
p02695 | #!/usr/bin/env python3
import sys
import itertools
def chkA(A, Q, a, b, c, d):
ret=0
for i in range(Q):
ret += d[i] if A[b[i]-1] - A[a[i]-1] == c[i] else 0
return ret
def solve(N: int, M: int, Q: int, a: "List[int]", b: "List[int]", c: "List[int]", d: "List[int]"):
P=[i+1 for i in ... | #!/usr/bin/env python3
import sys
import itertools
#sys.setrecursionlimit(150000)
def chkA(A, Q, a, b, c, d):
ret=0
for i in range(Q):
ret += d[i] if A[b[i]-1] - A[a[i]-1] == c[i] else 0
return ret
def solve(N: int, M: int, Q: int, a: "List[int]", b: "List[int]", c: "List[int]", d: "L... | [
"control_flow.loop.range.bounds.upper.change",
"assignment.change"
] | 442,118 | 442,119 | u090649502 | python |
p02695 | 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)
import itertools
ANS = []
for i in list(itertools.combinations_with_replacement([i for i in range(1, 11)], n)):
L = list(i)... | 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)
import itertools
ANS = []
for i in list(itertools.combinations_with_replacement([i for i in range(1, m+1)], n)):
L = list(i... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 442,122 | 442,123 | u549579601 | python |
p02695 | N, M, Q = map(int, input().split())
abcd = [list(map(int, input().split())) for _ in range(Q)]
ans = set()
def point(x):
temp = 0
for i in range(Q):
a, b, c, d = abcd[i]
if x[b-1] - x[a-1] == c:
temp += d
return temp
def maker(x):
dig = len(x)
if dig == N:
ans.... | N, M, Q = map(int, input().split())
abcd = [list(map(int, input().split())) for _ in range(Q)]
ans = set()
def point(x):
temp = 0
for i in range(Q):
a, b, c, d = abcd[i]
if x[b-1] - x[a-1] == c:
temp += d
return temp
def maker(x):
dig = len(x)
if dig == N:
ans.... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 442,132 | 442,133 | u551909378 | python |
p02695 | N,M,Q = map(int,input().split())
ab = [list(map(int,input().split())) for i in range(Q)]
ans = 0
for i in range(2**(N+M)):
cnt = 0
mm = bin(i)
for j in list(str(mm)):
if j=="1":
cnt += 1
if cnt != M:
continue
li = [0]
mm2 = 1
for j in range(N+M):
if ... | N,M,Q = map(int,input().split())
ab = [list(map(int,input().split())) for i in range(Q)]
ans = 0
for i in range(2**(N+M-1)):
cnt = 0
mm = bin(i)
for j in list(str(mm)):
if j=="1":
cnt += 1
if cnt != M-1:
continue
li = [0]
mm2 = 1
for j in range(N+M-1):
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 442,142 | 442,143 | u626468554 | python |
p02695 |
def next_A(A):
rev_A = list(reversed(A))
max_num = M
if rev_A[0] < M:
rev_A[0] = rev_A[0] + 1
return list(reversed(rev_A))
for i in range(N):
if rev_A[i] < max_num:
rev_A[i] = rev_A[i] + 1
for j in reversed(range(i)):
rev_A[j] = rev_A... |
def next_A(A):
rev_A = list(reversed(A))
max_num = M
if rev_A[0] < M:
rev_A[0] = rev_A[0] + 1
return list(reversed(rev_A))
for i in range(N):
if rev_A[i] < max_num:
rev_A[i] = rev_A[i] + 1
for j in reversed(range(i)):
rev_A[j] = rev_A... | [
"expression.operation.binary.remove"
] | 442,162 | 442,163 | u818078165 | python |
p02695 | import itertools
N,M,Q = map(int,input().split())
li = []
for i in range(Q):
li.append(list(map(int,input().split())))
li.sort(key = lambda x:x[3])
num = [i for i in range(1,M+1)]
l = list(itertools.combinations_with_replacement(num, M))
max_sum=-1
for i in range(len(l)):
s = 0
for j in range(Q):
if l[i][l... | import itertools
N,M,Q = map(int,input().split())
li = []
for i in range(Q):
li.append(list(map(int,input().split())))
li.sort(key = lambda x:x[3])
num = [i for i in range(1,M+1)]
l = list(itertools.combinations_with_replacement(num, N))
max_sum=-1
for i in range(len(l)):
s = 0
for j in range(Q):
if l[i][l... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 442,164 | 442,165 | u250828304 | python |
p02695 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import combinations_with_replacement, accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from s... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import combinations_with_replacement, accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from s... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 442,170 | 442,171 | u279493135 | python |
p02695 | import itertools
n,m,q=map(int,input().split())
lis=[i for i in range(1,m+1)]
lis=list(itertools.combinations(lis,n))
box=[0 for j in range(len(lis))]
for i in range(q):
que=list(map(int,input().split()))
for j in range(len(lis)):
if lis[j][que[1]-1]-lis[j][que[0]-1]==que[2]:
box[j]+=que[3]... | import itertools
n,m,q=map(int,input().split())
lis=[i for i in range(1,m+1)]
lis=list(itertools.combinations_with_replacement(lis,n))
box=[0 for j in range(len(lis))]
for i in range(q):
que=list(map(int,input().split()))
for j in range(len(lis)):
if lis[j][que[1]-1]-lis[j][que[0]-1]==que[2]:
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 442,198 | 442,199 | u901598613 | python |
p02695 | import numpy as np
import itertools
N, M, Q = map(int, input().split(" "))
vals = []
for i in range(Q):
vals.append([list(map(int, input().split(" ")))])
maxv = 0
cand = list(itertools.combinations_with_replacement(range(1, M+1), N))
for c in cand:
sumv = 0
for v in vals:
if (c[v[1]-1] - c[v... | import numpy as np
import itertools
N, M, Q = map(int, input().split(" "))
vals = []
for i in range(Q):
vals.append(list(map(int, input().split(" "))))
maxv = 0
cand = list(itertools.combinations_with_replacement(range(1, M+1), N))
for c in cand:
sumv = 0
for v in vals:
if (c[v[1]-1] - c[v[0... | [
"call.arguments.change"
] | 442,200 | 442,201 | u881195671 | python |
p02695 | import itertools
n,m,q=list(map(int,input().split()))
q_l=[list(map(int,input().split())) for _ in range(q)]
#print(q_l)
#bar_l = [(i,j,k) for i in range(0,m+1) for j in range(i,m+1) for k in range(j,m+1)]
bar_m = [i for i in range(m)]
#print(bar_m)
bar_l = list(itertools.combinations_with_replacement(bar_m,m))
#print(... | import itertools
n,m,q=list(map(int,input().split()))
q_l=[list(map(int,input().split())) for _ in range(q)]
#bar_l = [(i,j,k) for i in range(0,m+1) for j in range(i,m+1) for k in range(j,m+1)]
bar_m = [i for i in range(m)]
bar_l = list(itertools.combinations_with_replacement(bar_m,n))
score = 0
for bar in bar_l:
s... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 442,212 | 442,213 | u657786757 | python |
p02695 | from itertools import combinations as cmb
N, M, Q = map(int, input().split())
a = []
b = []
c = []
d = []
s = 0
for _ in range(Q):
_a, _b, _c, _d = map(int, input().split())
a.append(_a)
b.append(_b)
c.append(_c)
d.append(_d)
for A in cmb(range(1,M+1),N):
_s = 0
for q in range(Q):
... | from itertools import combinations_with_replacement as cmb
N, M, Q = map(int, input().split())
a = []
b = []
c = []
d = []
s = 0
for _ in range(Q):
_a, _b, _c, _d = map(int, input().split())
a.append(_a)
b.append(_b)
c.append(_c)
d.append(_d)
for A in cmb(range(1,M+1),N):
_s = 0
for q in ... | [
"identifier.change"
] | 442,229 | 442,230 | u189056821 | python |
p02695 | from itertools import combinations
N, M, Q = map(int,input().split())
P = [list(map(int,input().split())) for i in range(Q)]
A = list(itertools.combinations_with_replacement(range(1,M+1), N))
number = len(A)
amount = 0
max_amount = 0
for i in range(number): #A
for j in range(Q): # P
bi = P[j][1]
... | import itertools
N, M, Q = map(int,input().split())
P = [list(map(int,input().split())) for i in range(Q)]
A = list(itertools.combinations_with_replacement(range(1,M+1), N))
number = len(A)
amount = 0
max_amount = 0
for i in range(number): #A
for j in range(Q): # P
bi = P[j][1]
ai = P[j][0]
... | [] | 442,233 | 442,234 | u892308039 | python |
p02695 | #c
import itertools
n, m, q = map(int, input().split())
lslist = []
for i in range(q):
a, b, c, d = map(int, input().split())
lslist.append([a, b, c, d])
print(lslist)
# n=3
# m=4
# q=3
# ls1 = [1, 3, 3, 100]
# ls2 = [1, 2, 2, 10]
# ls3 = [1, 1, 0, 1000]
# lslist = [ls1, ls2, ls3]
acomn = list(itertools.com... | #c
import itertools
n, m, q = map(int, input().split())
lslist = []
for i in range(q):
a, b, c, d = map(int, input().split())
lslist.append([a, b, c, d])
# n=3
# m=4
# q=3
# ls1 = [1, 3, 3, 100]
# ls2 = [1, 2, 2, 10]
# ls3 = [1, 1, 0, 1000]
# lslist = [ls1, ls2, ls3]
acomn = list(itertools.combinations_with... | [
"call.remove"
] | 442,235 | 442,236 | u059238013 | python |
p02695 | from itertools import combinations_with_replacement as comb
n,m,q = map(int, input().split(' '))
lis = [list(map(int, input().split())) for _ in range(q)]
tes = comb(range(1,m))
res = 0
for i in tes:
te = 0
for a,b,c,d in lis:
if c == i[b-1] - i[a-1]:
te += d
res = max(te,res)
print(res... | from itertools import combinations_with_replacement as comb
n,m,q = map(int, input().split(' '))
lis = [list(map(int, input().split())) for _ in range(q)]
tes = comb(range(1,m+1),n)
res = 0
for i in tes:
te = 0
for a,b,c,d in lis:
if c == i[b-1] - i[a-1]:
te += d
res = max(te,res)
print... | [
"call.arguments.add"
] | 442,243 | 442,244 | u180528413 | python |
p02695 | N,M,Q=map(int,input().split())
al=list()
for i in range(Q):
a,b,c,d=map(int,input().split())
al.append([a,b,c,d])
Sum=0
Summax=0
cnt=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):
... | N,M,Q=map(int,input().split())
al=list()
for i in range(Q):
a,b,c,d=map(int,input().split())
al.append([a,b,c,d])
Sum=0
Summax=0
cnt=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):
... | [
"call.remove"
] | 442,245 | 442,246 | u457460736 | python |
p02695 | import itertools
n, m, q = [int(x) for x in input().split()]
tmp = []
for i in range(q):
a, b, c, d = [int(x) for x in input().split()]
tmp.append([a, b, c, d])
t = list(itertools.combinations_with_replacement(range(1, m + 1), m))
score = 0
for _t in t:
_s = 0
for a, b, c, d in tmp:
try:
... | import itertools
n, m, q = [int(x) for x in input().split()]
tmp = []
for i in range(q):
a, b, c, d = [int(x) for x in input().split()]
tmp.append([a, b, c, d])
t = list(itertools.combinations_with_replacement(range(1, m + 1), n))
score = 0
for _t in t:
_s = 0
for a, b, c, d in tmp:
if c ==... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 442,249 | 442,250 | u554926677 | python |
p02695 | import itertools
n, m, q = [int(x) for x in input().split()]
tmp = []
for i in range(q):
a, b, c, d = [int(x) for x in input().split()]
tmp.append([a, b, c, d])
t = list(itertools.combinations_with_replacement(range(1, m + 1), m-1))
score = 0
for _t in t:
_s = 0
for a, b, c, d in tmp:
if c ... | import itertools
n, m, q = [int(x) for x in input().split()]
tmp = []
for i in range(q):
a, b, c, d = [int(x) for x in input().split()]
tmp.append([a, b, c, d])
t = list(itertools.combinations_with_replacement(range(1, m + 1), n))
score = 0
for _t in t:
_s = 0
for a, b, c, d in tmp:
if c ==... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 442,251 | 442,250 | u554926677 | python |
p02695 | N, M, Q = map(int, input().split())
check = list()
for i in range(Q):
check.append(list(map(int, input().split())))
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())
check = list()
for i in range(Q):
check.append(list(map(int, input().split())))
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.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 442,254 | 442,255 | u114920558 | python |
p02695 | import sys
sys.setrecursionlimit(10 ** 6)
from itertools import combinations_with_replacement
def check(abcd, pattern):
result = 0
for a,b,c,d in abcd:
if (pattern[b-1] - pattern[a-1]) == c:
result += d
return result
def main():
N, M, Q = map(int, input().split())
abcd = [list(... | import sys
sys.setrecursionlimit(10 ** 6)
from itertools import combinations_with_replacement
def check(abcd, pattern):
result = 0
for a,b,c,d in abcd:
if (pattern[b-1] - pattern[a-1]) == c:
result += d
return result
def main():
N, M, Q = map(int, input().split())
abcd = [list(... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 442,263 | 442,264 | u565711859 | python |
p02695 | import itertools
N, M, Q = map(int,input().split())
ABCD = [tuple(map(int, input().split())) for _ in range(Q)]
ans = 0
for s in itertools.combinations_with_replacement(range(1,N+1),N):
temp = 0
for i in range(Q):
if s[ABCD[i][1]-1] - s[ABCD[i][0]-1] == ABCD[i][2]:
temp += ABCD[i][3]
ans... | import itertools
N, M, Q = map(int,input().split())
ABCD = [tuple(map(int, input().split())) for _ in range(Q)]
ans = 0
for s in itertools.combinations_with_replacement(range(1,M+1),N):
temp = 0
for i in range(Q):
if s[ABCD[i][1]-1] - s[ABCD[i][0]-1] == ABCD[i][2]:
temp += ABCD[i][3]
ans... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 442,272 | 442,273 | u735891571 | python |
p02695 | import itertools
N, M, Q = map(int,input().split())
L = []
for _ in range(Q):
L.append(list(map(int,input().split())))
A = itertools.combinations_with_replacement([i for i in range(1,M+1)], N)
count = []
for a in A:
temp = 0
for l in l:
if a[l[1]-1] - a[l[0]-1] == l[2]:
temp += l[3]
... | import itertools
N, M, Q = map(int,input().split())
L = []
for _ in range(Q):
L.append(list(map(int,input().split())))
A = itertools.combinations_with_replacement([i for i in range(1,M+1)], N)
count = []
for a in A:
temp = 0
for l in L:
if a[l[1]-1] - a[l[0]-1] == l[2]:
temp += l[3]
... | [
"identifier.change"
] | 442,274 | 442,275 | u740267532 | python |
p02695 | import itertools
N, M, Q = map(int, input().split())
A = []
for i in range(0, Q):
a, b, c, d = map(int,input().split())
A.append([a,b,c,d])
nums = []
for i in range(1, M+1):
nums.append(i)
ans_l = [0]
for A_n in itertools.combinations(nums, N):
ans = 0
for i in range(0, Q):
... | import itertools
N, M, Q = map(int, input().split())
A = []
for i in range(0, Q):
a, b, c, d = map(int,input().split())
A.append([a,b,c,d])
nums = []
for i in range(1, M+1):
nums.append(i)
ans_l = [0]
for A_n in itertools.combinations_with_replacement(nums, N):
# print(A_n)
ans... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 442,285 | 442,286 | u847692421 | python |
p02695 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
import itertools
def input():
return sys.stdin.readline()
def resolve():
n, m, q = map(int, input().split())
a_d_list = []
for i in range(q):
a_d_list.append(list(map(int,input().split())))
l = [i for i in range(1, m)]
combi_l... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
import itertools
def input():
return sys.stdin.readline()
def resolve():
n, m, q = map(int, input().split())
a_d_list = []
for i in range(q):
a_d_list.append(list(map(int,input().split())))
l = [i for i in range(1, m+1)]
combi... | [
"control_flow.loop.range.bounds.upper.change",
"assignment.change"
] | 442,291 | 442,292 | u458388104 | python |
p02695 | import itertools
N, M, Q = map(int, input().split())
int_tuple_list = list()
for i in range(Q):
int_tuple_list.append(tuple(map(int, input().split())))
m_list = [i for i in range(1, M + 1)]
# print(m_list)
all_sequence_list = list()
score_list = list()
for sequence in itertools.combinations(m_list, N):
# pri... | import itertools
N, M, Q = map(int, input().split())
int_tuple_list = list()
for i in range(Q):
int_tuple_list.append(tuple(map(int, input().split())))
m_list = [i for i in range(1, M + 1)]
# print(m_list)
all_sequence_list = list()
score_list = list()
for sequence in itertools.combinations_with_replacement(m... | [
"identifier.change"
] | 442,295 | 442,296 | u517682687 | python |
p02695 | import itertools
N, M, Q = map(int, input().split())
int_tuple_list = list()
for i in range(Q):
int_tuple_list.append(tuple(map(int, input().split())))
m_list = [i for i in range(1, M + 1)]
# print(m_list)
all_sequence_list = list()
score_list = list()
for sequence in itertools.permutations(m_list, N):
# pri... | import itertools
N, M, Q = map(int, input().split())
int_tuple_list = list()
for i in range(Q):
int_tuple_list.append(tuple(map(int, input().split())))
m_list = [i for i in range(1, M + 1)]
# print(m_list)
all_sequence_list = list()
score_list = list()
for sequence in itertools.combinations_with_replacement(m... | [
"identifier.change"
] | 442,297 | 442,296 | u517682687 | python |
p02695 | import sys
import itertools
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M, Q = map(int, input().split())
ABCD = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
for lst in itertools.combinations_with_replacem... | import sys
import itertools
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M, Q = map(int, input().split())
ABCD = [list(map(int, input().split())) for _ in range(Q)]
ans = 0
for lst in itertools.combinations_with_replacem... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 442,298 | 442,299 | u593567568 | python |
p02695 | def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
import itertools
N, M, Q = MAP()
a, b, c, d = [], [], [], []
for _ in range(Q):
ai, bi, ci, di = MAP()
a.append(ai-1); b.append(bi-1); c.append(ci); d.append(di)
def solve(lst):
a... | def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
import itertools
N, M, Q = MAP()
a, b, c, d = [], [], [], []
for _ in range(Q):
ai, bi, ci, di = MAP()
a.append(ai-1); b.append(bi-1); c.append(ci); d.append(di)
def solve(lst):
a... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 442,302 | 442,303 | u417220101 | python |
p02695 | import itertools
n, m, q = map(int, input().split())
I = list(range(1, m + 1))
A = list(map(list, itertools.combinations(I, n)))
l = len(A)
ans = [0 for i in range(l)]
for _ in range(q):
a, b, c, d = map(int, input().split())
for i in range(l):
if A[i][b - 1] - A[i][a - 1] == c:
ans[i] += d... | import itertools
n, m, q = map(int, input().split())
I = list(range(1, m + 1))
A = list(map(list, itertools.combinations_with_replacement(I, n)))
l = len(A)
ans = [0 for i in range(l)]
for _ in range(q):
a, b, c, d = map(int, input().split())
for i in range(l):
if A[i][b - 1] - A[i][a - 1] == c:
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 442,304 | 442,305 | u736470924 | python |
p02695 | n, m, q = map(int, input().split())
I = list(range(1, m + 1))
A = list(map(list, itertools.combinations(I, n)))
l = len(A)
ans = [0 for i in range(l)]
for _ in range(q):
a, b, c, d = map(int, input().split())
for i in range(l):
if A[i][b - 1] - A[i][a - 1] == c:
ans[i] += d
print(max(ans)) | import itertools
n, m, q = map(int, input().split())
I = list(range(1, m + 1))
A = list(map(list, itertools.combinations_with_replacement(I, n)))
l = len(A)
ans = [0 for i in range(l)]
for _ in range(q):
a, b, c, d = map(int, input().split())
for i in range(l):
if A[i][b - 1] - A[i][a - 1] == c:
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 442,306 | 442,305 | u736470924 | python |
p02695 | n, m, q = map(int, input().split())
a = [0] * q
b = [0] * q
c = [0] * q
d = [0] * q
for i in range(q):
a[i], b[i], c[i], d[i] = map(int,input().split())
A_list = []
for p in itertools.combinations_with_replacement(range(1,m+1),n):
A_list.append(p)
# print(A_list)
ans = 0
for v in A_list:
cur_score = 0
... | import itertools
n, m, q = map(int, input().split())
a = [0] * q
b = [0] * q
c = [0] * q
d = [0] * q
for i in range(q):
a[i], b[i], c[i], d[i] = map(int,input().split())
A_list = []
for p in itertools.combinations_with_replacement(range(1,m+1),n):
A_list.append(p)
# print(A_list)
ans = 0
for v in A_list:
c... | [] | 442,307 | 442,308 | u878129968 | python |
p02695 | # 2020/05/02
# AtCoder Beginner Contest 165 - C
a = list()
def mkArray(in_list, sav_val, cnt):
if cnt >= m:
a.append(in_list)
return 0
else:
for x in range(sav_val, m + 1):
wk_list = list()
wk_list.extend(in_list)
wk_list.append(x)
mkArray... | # 2020/05/02
# AtCoder Beginner Contest 165 - C
a = list()
def mkArray(in_list, sav_val, cnt):
if cnt >= n:
a.append(in_list)
return 0
else:
for x in range(sav_val, m + 1):
wk_list = list()
wk_list.extend(in_list)
wk_list.append(x)
mkArray... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 442,309 | 442,310 | u981767024 | python |
p02695 | # 2020/05/02
# AtCoder Beginner Contest 165 - C
a = list()
def mkArray(in_list, sav_val, cnt):
if cnt >= m - 1:
a.append(in_list)
return 0
else:
for x in range(sav_val, m + 1):
wk_list = list()
wk_list.extend(in_list)
wk_list.append(x)
mkA... | # 2020/05/02
# AtCoder Beginner Contest 165 - C
a = list()
def mkArray(in_list, sav_val, cnt):
if cnt >= n:
a.append(in_list)
return 0
else:
for x in range(sav_val, m + 1):
wk_list = list()
wk_list.extend(in_list)
wk_list.append(x)
mkArray... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 442,311 | 442,310 | u981767024 | python |
p02695 | import itertools
N, M, Q = map(int, input().split())
x1 = [0]*Q
x2 = [0]*Q
x3 = [0]*Q
x4 = [0]*Q
for i in range(Q):
x1[i], x2[i], x3[i], x4[i] = map(int, input().split())
score = 0
tmp = 0
lis = range(1, M+1)
A = []
for i in itertools.combinations(lis, N):
A.append(list(i))
for i in range(len(A)):
for ... | import itertools
N, M, Q = map(int, input().split())
x1 = [0]*Q
x2 = [0]*Q
x3 = [0]*Q
x4 = [0]*Q
for i in range(Q):
x1[i], x2[i], x3[i], x4[i] = map(int, input().split())
score = 0
tmp = 0
lis = range(1, M+1)
A = []
for i in itertools.combinations_with_replacement(lis, N):
A.append(list(i))
for i in range(l... | [
"identifier.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 442,317 | 442,318 | u053744958 | python |
p02695 | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(ro... | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(ro... | [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 442,319 | 442,320 | u353797797 | python |
p02695 | import itertools
N, M, Q = map(int, input().split())
a = [None] * Q
b = [None] * Q
c = [None] * Q
d = [None] * Q
for i in range(Q):
num = list(map(int, input().split()))
a[i], b[i], c[i], d[i] = num[0] - 1, num[1] - 1, num[2], num[3]
A = [i for i in range(1, M + 1)]
max_v = 0
for v in itertools.combination... | import itertools
N, M, Q = map(int, input().split())
a = [None] * Q
b = [None] * Q
c = [None] * Q
d = [None] * Q
for i in range(Q):
num = list(map(int, input().split()))
a[i], b[i], c[i], d[i] = num[0] - 1, num[1] - 1, num[2], num[3]
A = [i for i in range(1, M + 1)]
max_v = 0
for v in itertools.combinatio... | [
"identifier.change"
] | 442,321 | 442,322 | u351892848 | python |
p02695 | import itertools
s=list(map(int,input().split()))
t=[list(map(int,input().split())) for i in range(s[2])]
li=[x for x in range(1,s[0]+1)]
lity=list(itertools.combinations_with_replacement(li,s[0]))
ans=0
for k in lity:
vmax=0
for l in t:
if k[l[1]-1]-k[l[0]-1]==l[2]:
vmax+=l[3]
ans=max(ans,vmax)
print(a... | import itertools
s=list(map(int,input().split()))
t=[list(map(int,input().split())) for i in range(s[2])]
li=[x for x in range(1,s[1]+1)]
lity=list(itertools.combinations_with_replacement(li,s[0]))
ans=0
for k in lity:
vmax=0
for l in t:
if k[l[1]-1]-k[l[0]-1]==l[2]:
vmax+=l[3]
ans=max(ans,vmax)
print(a... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 442,325 | 442,326 | u917558625 | python |
p02695 | import itertools
n,m,q=map(int,input().split())
l=[list(map(int,input().split())) for _ in range(q)]
ans=0
for v in itertools.permutations(list(range(1,m+1)),n):
sub=0
for a in l:
if v[a[1]-1]-v[a[0]-1]==a[2]:
sub+=a[3]
ans=max(ans,sub)
print(ans) | import itertools
n,m,q=map(int,input().split())
l=[list(map(int,input().split())) for _ in range(q)]
ans=0
for v in itertools.combinations_with_replacement(list(range(1,m+1)),n):
sub=0
for a in l:
if v[a[1]-1]-v[a[0]-1]==a[2]:
sub+=a[3]
ans=max(ans,sub)
print(ans) | [
"identifier.change"
] | 442,329 | 442,330 | u943057856 | python |
p02696 | def main():
a, b, n = map(int, input().split())
x = min(b, n)
floor1 = int(a * x / b)
floor2 = int(x / b)
print(floor1 - floor2)
if __name__ == '__main__':
main() | def main():
a, b, n = map(int, input().split())
x = min(b - 1, n)
floor1 = int(a * x / b)
floor2 = int(x / b)
print(floor1 - floor2)
if __name__ == '__main__':
main() | [
"assignment.change"
] | 442,355 | 442,356 | u672316981 | python |
p02696 | a, b, n = map(int, input().split())
print(int((a*(max(n,b-1)%b)-(a*max(n,b-1))%b)/b))
| a, b, n = map(int, input().split())
print(int((a*(min(n,b-1)%b)-(a*min(n,b-1))%b)/b))
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 442,359 | 442,360 | u028554976 | python |
p02696 | a, b, n = map(int, input().split())
print((a*(max(n,b-1)%b)-(a*max(n,b-1))%b)/b) | a, b, n = map(int, input().split())
print(int((a*(min(n,b-1)%b)-(a*min(n,b-1))%b)/b))
| [
"call.arguments.add",
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 442,361 | 442,360 | u028554976 | python |
p02696 | A,B,N=map(int,input().split())
f=lambda x:(A*x)//B-A*(x//B)
print(f(B-1 if B-1>=N else N)) | A,B,N=map(int,input().split())
f=lambda x:(A*x)//B-A*(x//B)
print(f(B-1 if B-1<=N else N)) | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 442,362 | 442,363 | u842170774 | python |
p02696 | a,b,n = map(int,input().split())
x=max(n,b-1)
ans = (int(a*x/b) - a * int(x/b))
print(ans)
| a,b,n = map(int,input().split())
x=min(n,b-1)
ans = (int(a*x/b) - a * int(x/b))
print(ans) | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 442,364 | 442,365 | u474202990 | python |
p02696 | A,B,N=map(int,input().split())
if N<=B:
print(int(((A*N)/B)-((A*N)/B)%1-A*(N/B-(N/B)%1)))
else:
print(int(((A*(B-1))/B)-((A*(B-1))/B)%1-A*((B-1)/B-((B-1)/B)%1)))
| A,B,N=map(int,input().split())
if N<B:
print(int(((A*N)/B)-((A*N)/B)%1-A*(N/B-(N/B)%1)))
else:
print(int(((A*(B-1))/B)-((A*(B-1))/B)%1-A*((B-1)/B-((B-1)/B)%1)))
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 442,370 | 442,371 | u554784585 | python |
p02696 | def resolve():
A, B, N = list(map(int, input().split()))
x = min(B, N)
import math
print(math.floor(A*x/B))
if '__main__' == __name__:
resolve() | def resolve():
A, B, N = list(map(int, input().split()))
x = min(B-1, N)
import math
print(math.floor(A*x/B))
if '__main__' == __name__:
resolve()
| [
"assignment.change"
] | 442,377 | 442,378 | u106797249 | python |
p02696 | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
a,b,n=map(int, input().split())
if b<n:
n=b-1
print(((a*n)//b) - (a*(n//b)))
if __name__ == '__main__':
main() | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
a,b,n=map(int, input().split())
if b<=n:
n=b-1
print(((a*n)//b) - (a*(n//b)))
if __name__ == '__main__':
main() | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 442,385 | 442,386 | u836311327 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.