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 |
|---|---|---|---|---|---|---|---|
p02727 | import sys
input = sys.stdin.readline
x, y, a, b, c = map(int, input().split())
p = sorted(list(map(int, input().split())))
q = sorted(list(map(int, input().split())))
r = sorted(list(map(int, input().split())))
n = 0
np = 0
nq = 0
ans = 0
while n < x + y:
cs = []
if p and np < x:
cs.append(p[-1])
... | import sys
input = sys.stdin.readline
x, y, a, b, c = map(int, input().split())
p = sorted(list(map(int, input().split())))
q = sorted(list(map(int, input().split())))
r = sorted(list(map(int, input().split())))
n = 0
np = 0
nq = 0
ans = 0
while n < x + y:
cs = []
if p and np < x:
cs.append(p[-1])
... | [
"control_flow.branch.if.condition.change"
] | 502,998 | 502,999 | u411537765 | python |
p02727 | #import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
#import heapq
#from fractions import gcd
#input=sys.stdin.readline
import bisect
x,y,a,b,c=map(int,input().split())
p=list(map(int,input().split()))
q=list(map(int,... | #import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
#import heapq
#from fractions import gcd
#input=sys.stdin.readline
import bisect
x,y,a,b,c=map(int,input().split())
p=list(map(int,input().split()))
q=list(map(int,... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 503,004 | 503,005 | u064434060 | python |
p02727 | import sys
input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]
IN=lambda : map(int, input().split())
mod=1000000007
#+++++
def main():
#a = int(input())
x, y, a, b, c = IN()
al = list(IN())
al.sort(reverse=True)
bl = list(IN())
bl.sort(reverse = True)
cl = list(IN... | import sys
input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]
IN=lambda : map(int, input().split())
mod=1000000007
#+++++
def main():
#a = int(input())
x, y, a, b, c = IN()
al = list(IN())
al.sort(reverse=True)
bl = list(IN())
bl.sort(reverse = True)
cl = list(IN... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change"
] | 503,119 | 503,120 | u505830998 | python |
p02727 | X, Y, A, B, C = map(int, input().split())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
R = list(map(int, input().split()))
P.sort(reverse=True)
Q.sort(reverse=True)
R.sort(reverse=True)
A=P[:X]+Q[:Y]+R
A.sort(reverse=True)
print(A[X+Y]) | X, Y, A, B, C = map(int, input().split())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
R = list(map(int, input().split()))
P.sort(reverse=True)
Q.sort(reverse=True)
R.sort(reverse=True)
A=P[:X]+Q[:Y]+R
A.sort(reverse=True)
print(sum(A[:X+Y])) | [
"call.arguments.add",
"call.arguments.change"
] | 503,121 | 503,122 | u686036872 | python |
p02727 | N, Y, A, B, C = map(int, input().split())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
R = list(map(int, input().split()))
P.sort(reverse=True)
Q.sort(reverse=True)
R.sort(reverse=True)
A=P[:X]+Q[:Y]+R
A.sort(reverse=True)
print(A[X+Y]) | X, Y, A, B, C = map(int, input().split())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
R = list(map(int, input().split()))
P.sort(reverse=True)
Q.sort(reverse=True)
R.sort(reverse=True)
A=P[:X]+Q[:Y]+R
A.sort(reverse=True)
print(sum(A[:X+Y])) | [
"assignment.variable.change",
"identifier.change",
"call.add",
"call.arguments.change"
] | 503,123 | 503,122 | u686036872 | python |
p02727 | X, Y, A, B, C = map(int, input().split())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
R = list(map(int, input().split()))
P = sorted(P, reverse=True)[:X]
Q = sorted(P, reverse=True)[:Y]
R = sorted(P, reverse=True)[:X+Y]
print(sum(sorted(P+Q+R, reverse=True)[:X+Y]))
| X, Y, A, B, C = map(int, input().split())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
R = list(map(int, input().split()))
P = sorted(P, reverse=True)[:X]
Q = sorted(Q, reverse=True)[:Y]
R = sorted(R, reverse=True)[:X+Y]
print(sum(sorted(P+Q+R, reverse=True)[:X+Y]))
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 503,158 | 503,159 | u328099989 | python |
p02727 | import sys
import heapq
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
x, y, a, b, c = list(map(int, readline().split()))
p = list(map(int, readline().split()))
q = list(map(int, readline().split()))
r = [-1 * i for i in list(map(int, readline().split()))]
p.sort(rever... | import sys
import heapq
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
x, y, a, b, c = list(map(int, readline().split()))
p = list(map(int, readline().split()))
q = list(map(int, readline().split()))
r = [-1 * i for i in list(map(int, readline().split()))]
p.sort(rever... | [
"call.remove"
] | 503,166 | 503,167 | u753803401 | python |
p02727 | X, Y, A, B, C = map(int, input().split())
p = sorted(list(map(int, input().split())), reverse=True)[:A]
q = sorted(list(map(int, input().split())), reverse=True)[:B]
r = list(map(int, input().split()))
ans = sum(sorted(p + q + r, reverse=True)[:X + Y])
print(ans) | X, Y, A, B, C = map(int, input().split())
p = sorted(list(map(int, input().split())), reverse=True)[:X]
q = sorted(list(map(int, input().split())), reverse=True)[:Y]
r = list(map(int, input().split()))
ans = sum(sorted(p + q + r, reverse=True)[:X + Y])
print(ans) | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 503,170 | 503,171 | u646130340 | python |
p02727 | X, Y, A, B, C = map(int,input().split())
P = sorted(list(map(int,input().split())), reverse=True)
Q = sorted(list(map(int,input().split())), reverse=True)
R = sorted(list(map(int,input().split())), reverse=True)
P = P[:X]
Q = Q[:Y]
A = P + Q + R
A.sorted(reverse=True)
ans = sum(A[:X+Y])
print(ans) | X, Y, A, B, C = map(int,input().split())
P = sorted(list(map(int,input().split())), reverse=True)
Q = sorted(list(map(int,input().split())), reverse=True)
R = sorted(list(map(int,input().split())), reverse=True)
P = P[:X]
Q = Q[:Y]
A = P + Q + R
A.sort(reverse=True)
ans = sum(A[:X+Y])
print(ans) | [
"identifier.change"
] | 503,201 | 503,202 | u239342230 | python |
p02727 | def main():
x, y, a, b, c = map(int, input().split())
al = sorted(list(map(int, input().split())), reverse=True)[:x]
bl = sorted(list(map(int, input().split())), reverse=True)[:y]
cl = sorted(list(map(int, input().split())), reverse=True)
ans = 0
xi, yi = 0, 0
for i in cl:
if al:
... | def main():
x, y, a, b, c = map(int, input().split())
al = sorted(list(map(int, input().split())), reverse=True)[:x]
bl = sorted(list(map(int, input().split())), reverse=True)[:y]
cl = sorted(list(map(int, input().split())), reverse=True)
ans = 0
xi, yi = 0, 0
for i in cl:
if al:
... | [
"literal.number.integer.change",
"assignment.value.change"
] | 503,203 | 503,204 | u906501980 | python |
p02727 | def main():
x, y, a, b, c = map(int, input().split())
al = sorted(list(map(int, input().split())), reverse=True)[:x]
bl = sorted(list(map(int, input().split())), reverse=True)[:y]
cl = sorted(list(map(int, input().split())), reverse=True)
ans = 0
xi, yi = 0, 0
for i in cl:
if al:
... | def main():
x, y, a, b, c = map(int, input().split())
al = sorted(list(map(int, input().split())), reverse=True)[:x]
bl = sorted(list(map(int, input().split())), reverse=True)[:y]
cl = sorted(list(map(int, input().split())), reverse=True)
ans = 0
xi, yi = 0, 0
for i in cl:
if al:
... | [
"literal.number.integer.change",
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 503,205 | 503,204 | u906501980 | python |
p02727 | def merge(A,B):
C = []
i = 0
j = 0
while i < len(A) and j < len(B):
if A[i]>B[j]:
C.append(A[i])
i += 1
else:
C.append(B[j])
j += 1
if len(A)>len(B):
C.extend(A[i:])
else:
C.extend(B[j:])
return C
X,Y,A,B,C = ... | def merge(A,B):
C = []
i = 0
j = 0
while i < len(A) and j < len(B):
if A[i]>B[j]:
C.append(A[i])
i += 1
else:
C.append(B[j])
j += 1
if len(A)-i>len(B)-j:
C.extend(A[i:])
else:
C.extend(B[j:])
return C
X,Y,A,B,... | [
"control_flow.branch.if.condition.change"
] | 503,252 | 503,253 | u459554582 | python |
p02727 | X,Y,A,B,C=map(int,input().split())
p=list(map(int,input().split()))
q=list(map(int,input().split()))
r=list(map(int,input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
tot=sum(p[:X])+sum(q[:Y])
a=0
b=0
f=False
for i in r:
if f==True:
break
elif a==p and b==q:
brea... | X,Y,A,B,C=map(int,input().split())
p=list(map(int,input().split()))
q=list(map(int,input().split()))
r=list(map(int,input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
tot=sum(p[:X])+sum(q[:Y])
a=0
b=0
f=False
for i in r:
if f==True:
break
elif a==X and b==Y:
brea... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 503,308 | 503,309 | u173148629 | python |
p02727 | X, Y, A, B, C = map(int, input().split())
p = sorted(map(int, input().split()), reverse=True)[: X]
q = sorted(map(int, input().split()), reverse=True)[: Y]
r = list(map(int, input().split()))
all = p + q + r
all.sort(reverse=True)
print((all[:X + Y])) | X, Y, A, B, C = map(int, input().split())
p = sorted(map(int, input().split()), reverse=True)[: X]
q = sorted(map(int, input().split()), reverse=True)[: Y]
r = list(map(int, input().split()))
all = p + q + r
all.sort(reverse=True)
print(sum(all[:X + Y])) | [
"call.add",
"call.arguments.change"
] | 503,321 | 503,322 | u647287452 | python |
p02727 | x, y, a, b, c = map(int, input().split())
p_list = sorted(list(map(int, input().split())), reverse=True)
q_list = sorted(list(map(int, input().split())), reverse=True)
r_list = sorted(list(map(int, input().split())), reverse=True)
p_count = 0
q_count = 0
r_count = 0
total = 0
for i in range(0, x + y):
score_max = 0
... | x, y, a, b, c = map(int, input().split())
p_list = sorted(list(map(int, input().split())), reverse=True)
q_list = sorted(list(map(int, input().split())), reverse=True)
r_list = sorted(list(map(int, input().split())), reverse=True)
p_count = 0
q_count = 0
r_count = 0
total = 0
for i in range(0, x + y):
score_max = 0
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 503,331 | 503,332 | u264312747 | python |
p02727 | x,y,a,b,c = map(int,input().split())
n = a+b+c
ar = list(map(int,input().split()))
br = list(map(int,input().split()))
cr = list(map(int,input().split()))
ls = []
for i in ar:
ls.append([i,1])
for i in br:
ls.append([i,2])
for i in cr:
ls.append([i,3])
ls.sort(reverse = True)
nx = 0
ny = 0
cnt = 0
res = 0
for ite... | x,y,a,b,c = map(int,input().split())
n = a+b+c
ar = list(map(int,input().split()))
br = list(map(int,input().split()))
cr = list(map(int,input().split()))
ls = []
for i in ar:
ls.append([i,1])
for i in br:
ls.append([i,2])
for i in cr:
ls.append([i,3])
ls.sort(reverse = True)
nx = 0
ny = 0
cnt = 0
res = 0
for ite... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 503,422 | 503,423 | u563681808 | python |
p02727 | x,y,a,b,c=map(int,input().split())
p=list(map(int,input().split()))
q=list(map(int,input().split()))
r=list(map(int,input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
tmp=[]
for i in range(a):
tmp.append(p[i])
for j in range(b):
tmp.append(q[j])
for k in range(len(r)):
tmp.a... | x,y,a,b,c=map(int,input().split())
p=list(map(int,input().split()))
q=list(map(int,input().split()))
r=list(map(int,input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
tmp=[]
for i in range(x):
tmp.append(p[i])
for j in range(y):
tmp.append(q[j])
for k in range(len(r)):
tmp.a... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 503,452 | 503,453 | u511379665 | python |
p02727 | x, y, a, b, c = map(int, input().split())
red = [int(x) for x in input().split()]
green = [int(x) for x in input().split()]
red.sort(reverse=True)
green.sort(reverse=True)
candidates = [int(x) for x in input().split()] + red[x:] + green[:y]
candidates.sort(reverse=True)
print(sum(candidates[:x+y])) | x, y, a, b, c = map(int, input().split())
red = [int(x) for x in input().split()]
green = [int(x) for x in input().split()]
red.sort(reverse=True)
green.sort(reverse=True)
candidates = [int(x) for x in input().split()] + red[:x] + green[:y]
candidates.sort(reverse=True)
print(sum(candidates[:x+y])) | [] | 503,469 | 503,470 | u512212329 | python |
p02727 | x,y,a,b,c=map(int,input().split())
red=sorted(list(map(int,input().split())),reverse=True)
green=sorted(list(map(int,input().split())),reverse=True)
white=sorted(list(map(int,input().split())),reverse=True)
eat_list=sorted(red[:x]+green[:y])
for i in range(min(len(eat_list),len(white))):
if eat_list[i]<white[i]:
... | x,y,a,b,c=map(int,input().split())
red=sorted(list(map(int,input().split())),reverse=True)
green=sorted(list(map(int,input().split())),reverse=True)
white=sorted(list(map(int,input().split())),reverse=True)
eat_list=sorted(red[:x]+green[:y])
for i in range(min(len(eat_list),len(white))):
if eat_list[i]<white[i]:
... | [
"call.remove"
] | 503,484 | 503,485 | u281796054 | python |
p02727 | import sys,math,copy,queue,itertools
from math import gcd
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
INF = 10**18
MOD = 10**9 + 7
DD = ((1,0),(0,1),(-1,0),(0,-1))
X,Y,A,... | import sys,math,copy,queue,itertools
from math import gcd
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
INF = 10**18
MOD = 10**9 + 7
DD = ((1,0),(0,1),(-1,0),(0,-1))
X,Y,A,... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 503,533 | 503,534 | u703950586 | python |
p02727 | import sys,math,copy,queue,itertools
from math import gcd
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
INF = 10**18
MOD = 10**9 + 7
DD = ((1,0),(0,1),(-1,0),(0,-1))
X,Y,A,... | import sys,math,copy,queue,itertools
from math import gcd
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
INF = 10**18
MOD = 10**9 + 7
DD = ((1,0),(0,1),(-1,0),(0,-1))
X,Y,A,... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 503,535 | 503,534 | u703950586 | python |
p02727 | X, Y, A, B, C = map(int, input().split())
*P, = map(int, input().split())
*Q, = map(int, input().split())
*R, = map(int, input().split())
P, Q = sorted(P, reverse=True), sorted(Q, reverse=True)
P, Q = P[:A], Q[:B]
ans = sum(sorted(P + Q + R, reverse=True)[:A + B])
print(ans) | X, Y, A, B, C = map(int, input().split())
*P, = map(int, input().split())
*Q, = map(int, input().split())
*R, = map(int, input().split())
P, Q = sorted(P, reverse=True), sorted(Q, reverse=True)
P, Q = P[:X], Q[:Y]
ans = sum(sorted(P + Q + R, reverse=True)[:X + Y])
print(ans) | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 503,568 | 503,569 | u497046426 | python |
p02727 | X, Y, A, B, C = [int(s) for s in input().split()]
p_list = [int(s) for s in input().split()]
q_list = [int(s) for s in input().split()]
r_list = [int(s) for s in input().split()]
p_list = list(reversed(sorted(p_list)))
p_list = p_list[:X]
# print(X, p_list)
q_list = list(reversed(sorted(q_list)))
q_list = q_list[:Y]
... | X, Y, A, B, C = [int(s) for s in input().split()]
p_list = [int(s) for s in input().split()]
q_list = [int(s) for s in input().split()]
r_list = [int(s) for s in input().split()]
p_list = list(reversed(sorted(p_list)))
p_list = p_list[:X]
# print(X, p_list)
q_list = list(reversed(sorted(q_list)))
q_list = q_list[:Y]
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 503,641 | 503,642 | u813387707 | python |
p02727 | X, Y, A, B, C = map(int, input().split())
AA = list(map(int, input().split()))
BB = list(map(int, input().split()))
CC = list(map(int, input().split()))
a = sorted(AA, reverse=True)
b = sorted(BB, reverse=True)
c = sorted(CC, reverse=True)
if X < A:
del a[X:]
elif Y < B:
del b[Y:]
NEW = a + b + c
NEWnew = sorted(... | X, Y, A, B, C = map(int, input().split())
AA = list(map(int, input().split()))
BB = list(map(int, input().split()))
CC = list(map(int, input().split()))
a = sorted(AA, reverse=True)
b = sorted(BB, reverse=True)
c = sorted(CC, reverse=True)
if X < A:
del a[X:]
if Y < B:
del b[Y:]
NEW = a + b + c
NEWnew = sorted(N... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 503,673 | 503,674 | u759718348 | python |
p02727 | X,Y,A,B,C = map(int,input().split())
p = list(map(int,input().split()))
q = list(map(int,input().split()))
r = list(map(int,input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
Z = X+Y
P = p[:X]
Q = q[:Y]
R = r[:Z]
ans = 0
if X <= Y:
S = P + R
S.sort(reverse=True)
a = S[:X]
b = S[X:]... | X,Y,A,B,C = map(int,input().split())
p = list(map(int,input().split()))
q = list(map(int,input().split()))
r = list(map(int,input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
Z = X+Y
P = p[:X]
Q = q[:Y]
R = r[:Z]
ans = 0
if X <= Y:
S = P + R
S.sort(reverse=True)
a = S[:X]
b = S[X:]... | [
"call.remove"
] | 503,797 | 503,798 | u948779457 | python |
p02727 | import math
red,green,x,y,z = map(int,input().split())
red_data = list(map(int,input().split()))
green_data = list(map(int,input().split()))
blank_data = list(map(int,input().split()))
red_data.sort(reverse=True)
green_data.sort(reverse=True)
blank_data.sort(reverse=True)
# check if colourless apples are better
... | import math
red,green,x,y,z = map(int,input().split())
red_data = list(map(int,input().split()))
green_data = list(map(int,input().split()))
blank_data = list(map(int,input().split()))
red_data.sort(reverse=True)
green_data.sort(reverse=True)
blank_data.sort(reverse=True)
# check if colourless apples are better
... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 503,813 | 503,814 | u112952458 | python |
p02727 | #!usr/bin/env python3
import sys
import math
import string
import collections
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
import bisect
MOD = 10 ** 9 + 7
INF = 10 ** 18
input = lambda: sys.stdin.readline().strip()
sys.setrecurs... | #!usr/bin/env python3
import sys
import math
import string
import collections
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
import bisect
MOD = 10 ** 9 + 7
INF = 10 ** 18
input = lambda: sys.stdin.readline().strip()
sys.setrecurs... | [
"assignment.variable.change",
"identifier.change"
] | 503,824 | 503,825 | u385244248 | python |
p02727 | import heapq as hp
x,y,a,b,c = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
lp = hp.nlargest(x, p)
lq = hp.nlargest(y, q)
pq = lp + lq
lpq = hp.nlargest(x+y, pq)
lr = hp.nlargest(c, r)
d = min(len(lr),len(lpq))
for i in range(1,d)... | import heapq as hp
x,y,a,b,c = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
lp = hp.nlargest(x, p)
lq = hp.nlargest(y, q)
pq = lp + lq
lpq = hp.nlargest(x+y, pq)
lr = hp.nlargest(c, r)
d = min(len(lr),len(lpq))
for i in range(1,d+... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 503,841 | 503,842 | u589913372 | python |
p02727 | x,y,A,B,C = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
a = sorted(a)[::-1]
b = sorted(b)[::-1]
c = sorted(c)[::-1]
a = a[:x]
b = b[:y]
ans = a+b
ans = sorted(ans)
# ans = ans[::-1]
index = 0
# print(ans)
# print(c)
for i in rang... | x,y,A,B,C = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
a = sorted(a)[::-1]
b = sorted(b)[::-1]
c = sorted(c)[::-1]
a = a[:x]
b = b[:y]
ans = a+b
ans = sorted(ans)
# ans = ans[::-1]
index = 0
# print(ans)
# print(c)
for i in rang... | [
"call.remove"
] | 503,865 | 503,866 | u655347112 | python |
p02727 | X, Y, A, B, C = list(map(int, input().split()))
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
shoku=[]
for i in range(X):
shoku.append(p[i])
for j in range(Y):
shoku.append(q[j])
sh... | X, Y, A, B, C = list(map(int, input().split()))
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
shoku=[]
for i in range(X):
shoku.append(p[i])
for j in range(Y):
shoku.append(q[j])
sh... | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 503,904 | 503,905 | u489762173 | python |
p02727 | from heapq import heappush, heappop
X, Y, A, B, C = map(int, input().split())
H = []
for p in map(int, input().split()):
heappush(H, ((-p, 'r')))
for q in map(int, input().split()):
heappush(H, ((-q, 'g')))
for r in map(int, input().split()):
heappush(H, ((-r, '')))
count = X + Y
ans = 0
while count > 0:
h = ... | from heapq import heappush, heappop
X, Y, A, B, C = map(int, input().split())
H = []
for p in map(int, input().split()):
heappush(H, ((-p, 'r')))
for q in map(int, input().split()):
heappush(H, ((-q, 'g')))
for r in map(int, input().split()):
heappush(H, ((-r, '')))
count = X + Y
ans = 0
while count > 0:
h = ... | [
"control_flow.branch.if.condition.change"
] | 503,912 | 503,913 | u868600519 | python |
p02727 | x,y,a,b,c=map(int,input().split())
lia=list(map(int,input().split()))
lib=list(map(int,input().split()))
lic=list(map(int,input().split()))
lia.sort(reverse=True)
lib.sort(reverse=True)
lic.sort(reverse=True)
ans=lia[:x]+lib[:y]
ans.sort(reverse=True)
cnt=0
now=0
while cnt < a+b and now < c:
if lic[now] > ans[cnt]:
... | x,y,a,b,c=map(int,input().split())
lia=list(map(int,input().split()))
lib=list(map(int,input().split()))
lic=list(map(int,input().split()))
lia.sort(reverse=True)
lib.sort(reverse=True)
lic.sort(reverse=True)
ans=lia[:x]+lib[:y]
ans.sort()
cnt=0
now=0
while cnt < x+y and now < c:
if lic[now] > ans[cnt]:
ans[cnt]=... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 503,959 | 503,958 | u667024514 | python |
p02727 | from collections import *
from heapq import *
from itertools import *
from math import gcd
import sys
from decimal import *
import copy
from bisect import *
input=lambda :sys.stdin.readline().rstrip()
X,Y,A,B,C=map(int,input().split())
P=list(map(int,input().split()))
Q=list(map(int,input().split()))
R=list(map(int,i... | from collections import *
from heapq import *
from itertools import *
from math import gcd
import sys
from decimal import *
import copy
from bisect import *
input=lambda :sys.stdin.readline().rstrip()
X,Y,A,B,C=map(int,input().split())
P=list(map(int,input().split()))
Q=list(map(int,input().split()))
R=list(map(int,i... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.break.add"
] | 503,987 | 503,988 | u779455925 | python |
p02727 | x,y,a,b,c = map(int,input().split())
lst_r = list(map(int,input().split()))
lst_g = list(map(int,input().split()))
lst_n = list(map(int,input().split()))
lst_r = sorted(lst_r, ascending=False)[:x]
lst_g = sorted(lst_g, ascending=False)[:y]
lst_all = sorted(lst_r + lst_g + lst_n, ascending=False)[:x+y]
print(sum(lst_all... | x,y,a,b,c = map(int,input().split())
lst_r = list(map(int,input().split()))
lst_g = list(map(int,input().split()))
lst_n = list(map(int,input().split()))
lst_r = sorted(lst_r, reverse=True)[:x]
lst_g = sorted(lst_g, reverse=True)[:y]
lst_all = sorted(lst_r + lst_g + lst_n, reverse=True)[:x+y]
print(sum(lst_all)) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"call.arguments.keyword_argument.change",
"misc.opposites"
] | 504,022 | 504,023 | u435480265 | python |
p02727 | X, Y, A, B, C = map(int, input().split())
*P, = map(int, input().split())
*Q, = map(int, input().split())
*R, = map(int, input().split())
P = sorted(P, reverse=True)[:X]
Q = sorted(Q, reverse=True)[:-Y]
print(sum(sorted(P + Q + R, reverse=True)[:-(X + Y)]))
| X, Y, A, B, C = map(int, input().split())
*P, = map(int, input().split())
*Q, = map(int, input().split())
*R, = map(int, input().split())
P = sorted(P, reverse=True)[:X]
Q = sorted(Q, reverse=True)[:Y]
print(sum(sorted(P + Q + R, reverse=True)[:X + Y]))
| [
"expression.operation.unary.arithmetic.remove",
"call.arguments.change"
] | 504,030 | 504,031 | u997641430 | python |
p02727 | from heapq import heappush, heappop
x, y, a, b, c = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
hp = []
for e in p:
heappush(hp, [-e, 0])
for e in q:
heappush(hp, [-e, 1])
for e in r:
heappush(hp, [-e, 2])
ans = 0
c... | from heapq import heappush, heappop
x, y, a, b, c = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
hp = []
for e in p:
heappush(hp, [-e, 0])
for e in q:
heappush(hp, [-e, 1])
for e in r:
heappush(hp, [-e, 2])
ans = 0
c... | [] | 504,041 | 504,042 | u893063840 | python |
p02727 | def main():
x, y, a, b, c = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort()
q.sort()
for i in range(-1, -x - 1, -1):
r.append(p[i])
for i in range(-1, -y - 1, -1):
r.append(q[i]... | def main():
x, y, a, b, c = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort()
q.sort()
for i in range(-1, -x - 1, -1):
r.append(p[i])
for i in range(-1, -y - 1, -1):
r.append(q[i]... | [
"call.arguments.change"
] | 504,059 | 504,060 | u022979415 | python |
p02727 | def main():
#from sys import stdin, setrecursionlimit
#setrecursionlimit(10**9)
#r = input()
#n = int(input())
#a, b = map(int, input().split())
#s, y = input().split()
#a = input().split()
#a = list(map(int, input().split()))
#a = [list(input().split()) for i in range(n)]
#a = [... | def main():
#from sys import stdin, setrecursionlimit
#setrecursionlimit(10**9)
#r = input()
#n = int(input())
#a, b = map(int, input().split())
#s, y = input().split()
#a = input().split()
#a = list(map(int, input().split()))
#a = [list(input().split()) for i in range(n)]
#a = [... | [
"call.arguments.change"
] | 504,067 | 504,068 | u414458988 | python |
p02727 | X, Y, A, B, C = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
A_p = p[:X]
B_q = q[:Y]
C_r = r
ans = A_p + B_q + C_r
ans.sort(reverse=True)
sum(ans[: X+Y]) | X, Y, A, B, C = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
A_p = p[:X]
B_q = q[:Y]
C_r = r
ans = A_p + B_q + C_r
ans.sort(reverse=True)
print(sum(ans[: X+Y])) | [
"call.add",
"call.arguments.change"
] | 504,073 | 504,074 | u509392332 | python |
p02727 | from pprint import pprint
from bisect import bisect_left
import numpy
def read():
X, Y, A, B, C = list(map(int, input().strip().split()))
P = list(map(int, input().strip().split()))
Q = list(map(int, input().strip().split()))
R = list(map(int, input().strip().split()))
return X, Y, A, B, C, P, Q, ... | from pprint import pprint
from bisect import bisect_left
import numpy
def read():
X, Y, A, B, C = list(map(int, input().strip().split()))
P = list(map(int, input().strip().split()))
Q = list(map(int, input().strip().split()))
R = list(map(int, input().strip().split()))
return X, Y, A, B, C, P, Q, ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 504,089 | 504,090 | u257162238 | python |
p02727 | from pprint import pprint
from bisect import bisect_left
import numpy
def read():
X, Y, A, B, C = list(map(int, input().strip().split()))
P = list(map(int, input().strip().split()))
Q = list(map(int, input().strip().split()))
R = list(map(int, input().strip().split()))
return X, Y, A, B, C, P, Q, ... | from pprint import pprint
from bisect import bisect_left
import numpy
def read():
X, Y, A, B, C = list(map(int, input().strip().split()))
P = list(map(int, input().strip().split()))
Q = list(map(int, input().strip().split()))
R = list(map(int, input().strip().split()))
return X, Y, A, B, C, P, Q, ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 504,091 | 504,090 | u257162238 | python |
p02727 | X, Y, A, B, C = input().split()
P = list(map(int,input().split()))
Q = list(map(int,input().split()))
R = list(map(int,input().split()))
P.sort(reverse=True)
Q.sort(reverse=True)
R.sort(reverse=True)
ANS_list = P[:X]
ANS_list.extend(Q[:Y])
ANS_list.sort()
c = 0
for i in range(len(R)):
if ANS_list[i] >= R[i]:
... | X, Y, A, B, C = map(int,input().split())
P = list(map(int,input().split()))
Q = list(map(int,input().split()))
R = list(map(int,input().split()))
P.sort(reverse=True)
Q.sort(reverse=True)
R.sort(reverse=True)
ANS_list = P[:X]
ANS_list.extend(Q[:Y])
ANS_list.sort()
c = 0
for i in range(len(R)):
if ANS_list[i] >= R[i]... | [
"call.add",
"call.arguments.change"
] | 504,094 | 504,095 | u736641785 | python |
p02727 | # coding: utf-8
X, Y, A, B, C = map(int, input().split())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
R = list(map(int, input().split()))
P.sort(reverse=True)
Q.sort(reverse=True)
R.sort(reverse=False)
ans = 0
L = P[:X] + Q[:Y]
L.sort()
idx = 0
for i in range(X+Y):
if idx >= C:
b... | # coding: utf-8
X, Y, A, B, C = map(int, input().split())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
R = list(map(int, input().split()))
P.sort(reverse=True)
Q.sort(reverse=True)
R.sort(reverse=True)
ans = 0
L = P[:X] + Q[:Y]
L.sort()
idx = 0
for i in range(X+Y):
if idx >= C:
br... | [
"misc.opposites",
"call.arguments.change",
"call.arguments.keyword_argument.change"
] | 504,098 | 504,099 | u580697892 | python |
p02727 | x, y, a, b, c = map(int, input().split())
p = sorted(list(map(int, input().split())), reverse=True)
q = sorted(list(map(int, input().split())), reverse=True)
r = sorted(list(map(int, input().split())), reverse=True)
p = p[:x]
q = q[:x]
a = p + q + r
a = sorted(a, reverse=True)
print(sum(a[:x+y]))
| x, y, a, b, c = map(int, input().split())
p = sorted(list(map(int, input().split())), reverse=True)
q = sorted(list(map(int, input().split())), reverse=True)
r = sorted(list(map(int, input().split())), reverse=True)
p = p[:x]
q = q[:y]
a = p + q + r
a = sorted(a, reverse=True)
print(sum(a[:(x+y)])) | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 504,102 | 504,101 | u844646164 | python |
p02727 | X, Y, A, B, C = [int(x) for x in input().split()]
p = sorted([int(x) for x in input().split()], reverse=True)[:X]
q = sorted([int(x) for x in input().split()], reverse=True)[:Y]
pq = deque(sorted(p + q, reverse=True))
r = deque(sorted([int(x) for x in input().split()]))
ans = sum(pq)
for i in range(len(r)):
if r[... | from collections import deque
X, Y, A, B, C = [int(x) for x in input().split()]
p = sorted([int(x) for x in input().split()], reverse=True)[:X]
q = sorted([int(x) for x in input().split()], reverse=True)[:Y]
pq = deque(sorted(p + q, reverse=True))
r = deque(sorted([int(x) for x in input().split()]))
ans = sum(pq)
fo... | [] | 504,125 | 504,126 | u808373096 | python |
p02727 | x,y,a,b,c=map(int,input().split())
p,q,r=[reversed(sorted(list(map(int,input().split())))) for i in range(3)]
p=p[0:x]
q=q[0:y]
p.append(0)
q.append(0)
r.append(0)
s=0
i,j,k=0,0,0
for _ in range(x+y):
if p[i]>=q[j] and p[i]>=r[k]:
s+=p[i]
i+=1
elif q[j]>=r[k]:
s+=q[j]
j+=1
else:
s+=r[k]
... | x,y,a,b,c=map(int,input().split())
p,q,r=[list(reversed(sorted(list(map(int,input().split()))))) for i in range(3)]
p=p[0:x]
q=q[0:y]
p.append(0)
q.append(0)
r.append(0)
s=0
i,j,k=0,0,0
for _ in range(x+y):
if p[i]>=q[j] and p[i]>=r[k]:
s+=p[i]
i+=1
elif q[j]>=r[k]:
s+=q[j]
j+=1
else:
s+=r[k... | [
"call.add",
"call.arguments.change"
] | 504,193 | 504,194 | u960524878 | python |
p02727 | from collections import deque
X,Y,A,B,C = (int(i) for i in input().split())
P = [int(i) for i in input().split()]
Q = [int(i) for i in input().split()]
R = [int(i) for i in input().split()]
P.sort(reverse=True)
Q.sort(reverse=True)
R.sort(reverse=True)
P_deque = deque(P)
Q_deque = deque(Q)
R_deque = deque(R)
red_coun... | from collections import deque
X,Y,A,B,C = (int(i) for i in input().split())
P = [int(i) for i in input().split()]
Q = [int(i) for i in input().split()]
R = [int(i) for i in input().split()]
P.sort(reverse=True)
Q.sort(reverse=True)
R.sort(reverse=True)
P_deque = deque(P)
Q_deque = deque(Q)
R_deque = deque(R)
red_coun... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 504,199 | 504,200 | u960653324 | python |
p02727 | x, y, al, bl, cl = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
am = x-1
bm = y-1
cm = 0
while True:
#print(am)
#print(bm)
#print(cm)
if cm >= cl:
... | #E
x, y, al, bl, cl = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
a.sort(reverse=True)
b.sort(reverse=True)
c.sort(reverse=True)
am = x-1
bm = y-1
cm = 0
while True:
#print(am)
#print(bm)
#print(cm)
if cm >= cl:
... | [
"control_flow.branch.if.condition.change",
"expression.operation.unary.add"
] | 504,207 | 504,208 | u149752754 | python |
p02727 | x, y, a, b, c = map(int, input().split())
a_list = list(map(int, input().split()))
a_list.sort(reverse=True)
b_list = list(map(int, input().split()))
b_list.sort(reverse=True)
c_list = list(map(int, input().split()))
c_list.sort(reverse=True)
a_index =0
b_index =0
c_index = 0
count = 0
for i in range(x+y):
if (a_... | x, y, a, b, c = map(int, input().split())
a_list = list(map(int, input().split()))
a_list.sort(reverse=True)
b_list = list(map(int, input().split()))
b_list.sort(reverse=True)
c_list = list(map(int, input().split()))
c_list.sort(reverse=True)
a_index =0
b_index =0
c_index = 0
count = 0
for i in range(x+y):
if (a_... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 504,209 | 504,210 | u363992934 | python |
p02728 | MOD = 1000000007
M = 2*10**5 + 10
fact = [1] * M
ifact = [1] * M
for i in range(2, M):
fact[i] = fact[i - 1] * i % MOD
ifact[M - 1] = pow(fact[M - 1], MOD - 2, MOD)
for i in range(2, M - 1)[::-1]:
ifact[i] = ifact[i + 1] * (i + 1) % MOD
def comb(n, k):
if n < 0 or k > n:
return 0
return (fact[... | MOD = 1000000007
M = 2*10**5 + 10
fact = [1] * M
ifact = [1] * M
for i in range(2, M):
fact[i] = fact[i - 1] * i % MOD
ifact[M - 1] = pow(fact[M - 1], MOD - 2, MOD)
for i in range(2, M - 1)[::-1]:
ifact[i] = ifact[i + 1] * (i + 1) % MOD
def comb(n, k):
if n < 0 or k > n:
return 0
return (fact[... | [
"call.remove"
] | 504,358 | 504,359 | u324285857 | python |
p02728 | import sys
sys.setrecursionlimit(10**12)
def modinv(a,m=10**9+7):
if a==0: return 1
else:
b=m
(x, lastx) = (0, 1)
(y, lasty) = (1, 0)
while b != 0:
q = a // b
(a, b) = (b, a % b)
(x, lastx) = (lastx - q * x, x)
(y, lasty) = (lasty ... | import sys
sys.setrecursionlimit(10**7)
def modinv(a,m=10**9+7):
if a==0: return 1
else:
b=m
(x, lastx) = (0, 1)
(y, lasty) = (1, 0)
while b != 0:
q = a // b
(a, b) = (b, a % b)
(x, lastx) = (lastx - q * x, x)
(y, lasty) = (lasty -... | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 504,395 | 504,396 | u197300773 | python |
p02728 | import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
mod = 10**9+7
class PERM_COMB_MOD():
def __init__(self, max_n=510000, mod=10**9+7):
self.fac = [0]*max_n
self.finv = [0]*max_n
self.inv = [0]*max_n
self.fac[0] = self.fac[1] = 1
self.finv[0] = self.... | import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
mod = 10**9+7
class PERM_COMB_MOD():
def __init__(self, max_n=510000, mod=10**9+7):
self.fac = [0]*max_n
self.finv = [0]*max_n
self.inv = [0]*max_n
self.fac[0] = self.fac[1] = 1
self.finv[0] = self.... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 504,437 | 504,438 | u803848678 | python |
p02728 | #%%
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from collections import deque
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の... | #%%
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from collections import deque
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の... | [
"call.add",
"call.arguments.change"
] | 504,525 | 504,526 | u424768586 | python |
p02728 | #%%
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from collections import deque
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の... | #%%
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from collections import deque
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の... | [
"call.add",
"call.arguments.change"
] | 504,525 | 504,527 | u424768586 | python |
p02728 | #%%
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
def input(): ... | #%%
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
def input(): ... | [] | 504,528 | 504,529 | u424768586 | python |
p02729 | n, m = map(int, input().split())
a = n * (n - 1) // 2
b = m*(m-1)//2
print(a*b) | n, m = map(int, input().split())
a = n * (n - 1) // 2
b = m*(m-1)// 2
print(a + b) | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 504,563 | 504,564 | u468972478 | python |
p02729 | a,b = map(int,input().split())
if (a != 0) and (b != 0):
print(str(int(a*(a-1)/2 + b*(b-1)/2)))
elif (a == 0) and (b == 0):
print("0")
elif (a == 0) and (b != 0):
print(str(int(b*(b-1)/2)))
else:
print(str(inr(a*(a-1)/2))) | a,b = map(int,input().split())
if (a != 0) and (b != 0):
print(str(int(a*(a-1)/2 + b*(b-1)/2)))
elif (a == 0) and (b == 0):
print("0")
elif (a == 0) and (b != 0):
print(str(int(b*(b-1)/2)))
else:
print(str(int(a*(a-1)/2))) | [
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 504,565 | 504,566 | u763628696 | python |
p02729 | n,m=map(int,input().split())
print((n*(n-1)//2)*(m*(m-1)//2)) | n,m=map(int,input().split())
print((n*(n-1)//2)+(m*(m-1)//2)) | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 504,579 | 504,580 | u723792785 | python |
p02729 | n,m=map(int,input().split())
print((n(n-1)//2)*(m(m-1)//2)) | n,m=map(int,input().split())
print((n*(n-1)//2)+(m*(m-1)//2)) | [
"call.arguments.change",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"io.output.change"
] | 504,581 | 504,580 | u723792785 | python |
p02729 | n,m=map(int,input().split())
print((n*(n+1)//2)+(m*(m+1)//2)) | n,m=map(int,input().split())
print((n*(n-1)//2)+(m*(m-1)//2)) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 504,582 | 504,580 | u723792785 | python |
p02729 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect
from operator import itemgetter
#from heapq import heappush, heappop
#import numpy as np
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
#from scipy.sparse import csr_ma... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect
from operator import itemgetter
#from heapq import heappush, heappop
#import numpy as np
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
#from scipy.sparse import csr_ma... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 504,665 | 504,666 | u177411511 | python |
p02729 | n,m= map(int, input().split())
print(((n+(n-1))+m(m-1))/2)
| n,m= map(int, input().split())
print(int(((n*(n-1))+m*(m-1))/2)) | [
"call.arguments.add",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 504,680 | 504,679 | u428341537 | python |
p02729 | def main():
N, M = map(int, input().split())
e = N*(N-1)/2
o = M*(M-1)/2
ans = int(e + o)
print(e, o, ans)
if __name__ == '__main__':
main() | def main():
N, M = map(int, input().split())
e = N*(N-1)/2
o = M*(M-1)/2
ans = int(e + o)
print(ans)
if __name__ == '__main__':
main() | [
"call.arguments.change"
] | 504,698 | 504,699 | u878545651 | python |
p02729 | N , M = map(int,input().split())
ans += N * (N - 1) / 2
ans += M * (M - 1) / 2
print( ans ) | N , M = map(int,input().split())
ans = 0
ans += N * (N - 1) // 2
ans += M * (M - 1) // 2
print( ans ) | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 504,700 | 504,701 | u263483399 | python |
p02729 |
N, M = map(int, readline().split())
print(N * (N - 1) / 2 + M * (M - 1) /2) | N, M = map(int, input().split())
print(int(N * (N - 1) / 2 + M * (M - 1) /2)) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change",
"call.arguments.add"
] | 504,722 | 504,723 | u849756457 | python |
p02729 | def main():
n,m = map(int,input().split())
print(n + (n - 1) / 2 + m * (m - 1) / 2)
main() | def main():
n,m = map(int,input().split())
print(n * (n - 1) // 2 + m * (m - 1) // 2)
main() | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 504,726 | 504,725 | u962609087 | python |
p02729 | n,m=map(input().split())
a=n*(n-1)/2+m*(m-1)/2
print(str(a))
| n,m=map(int, input().split())
a=n*(n-1)/2+m*(m-1)/2
print(str(int(a)))
| [
"call.arguments.add",
"call.add",
"call.arguments.change"
] | 504,745 | 504,746 | u944886577 | python |
p02729 | n,m=map(int,input().split())
print(int((n*(n-1)/2 + m*(m-1)*2))) | n,m=map(int,input().split())
print(int((n*(n-1)/2 + m*(m-1)/2))) | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 504,795 | 504,796 | u627057223 | python |
p02729 | n,m=map(int,input())
print(int((n*(n-1)/2 + m*(m-1)*2))) | n,m=map(int,input().split())
print(int((n*(n-1)/2 + m*(m-1)/2))) | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 504,797 | 504,796 | u627057223 | python |
p02729 |
N,M = map(int, input().split())
print(N*(N-1)+M*(M-1)//2) |
N,M = map(int, input().split())
print((N*(N-1)+M*(M-1))//2) | [
"call.arguments.change"
] | 504,798 | 504,799 | u311961196 | python |
p02729 | N,M = map(int,input().split())
ans = (N+M)*(N+M+1)//2 - N*M
print(ans)
| N,M = map(int,input().split())
ans = (N+M)*(N+M-1)//2 - N*M
print(ans)
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 504,844 | 504,845 | u595905528 | python |
p02729 | n,m = map(int,input().split())
print(int(n(n+1)/2 + m(m+1)/2)) | n,m = map(int,input().split())
print(int(n*(n-1)/2 + m*(m-1)/2)) | [
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 504,868 | 504,869 | u749742659 | python |
p02729 | a = list(map(int, input().split()))
def a1():
if a[0] == 1 or a[0] == 0:
a[0] = 1
return a[0]
else:
return a[0] * (a[0] - 1) / 2
def b1():
if a[1] == 1 or a[1] == 0:
a[1] = 1
return a[1]
else:
return a[1] * (a[1] - 1) / 2
print(int(a1() + b1()))
| a = list(map(int, input().split()))
def a1():
if a[0] == 1 or a[0] == 0:
a[0] = 0
return a[0]
else:
return a[0] * (a[0] - 1) / 2
def b1():
if a[1] == 1 or a[1] == 0:
a[1] = 0
return a[1]
else:
return a[1] * (a[1] - 1) / 2
print(int(a1() + b1()))
| [
"literal.number.integer.change",
"assignment.value.change"
] | 504,897 | 504,898 | u689835643 | python |
p02729 | a = list(map(int, input().split()))
def a1():
if a[0] == 1 or a[0] == 0:
a[0] = 1
return a[0]
else:
return a[0] * (a[0] - 1) / 2
def b1():
if a[1] == 1 or a[1] == 0:
a[1] = 1
return a[1]
else:
return a[1] * (a[1] - 1) / 2
print(a1() + b1())
| a = list(map(int, input().split()))
def a1():
if a[0] == 1 or a[0] == 0:
a[0] = 0
return a[0]
else:
return a[0] * (a[0] - 1) / 2
def b1():
if a[1] == 1 or a[1] == 0:
a[1] = 0
return a[1]
else:
return a[1] * (a[1] - 1) / 2
print(int(a1() + b1()))
| [
"literal.number.integer.change",
"assignment.value.change",
"call.add",
"call.arguments.change"
] | 504,899 | 504,898 | u689835643 | python |
p02729 | a = list(map(int, input().split()))
def a1():
if a[0] == 1 or a[0] == 0:
a[0] = 1
return a[0]
else:
return a[0] * (a[0] - 1) / 2
def b1():
if a[1] == 1 or a[1] == 0:
a[1] = 1
return a[1]
else:
return a[1] * (a[1] - 1) / 2
print(a1() * b1())
| a = list(map(int, input().split()))
def a1():
if a[0] == 1 or a[0] == 0:
a[0] = 0
return a[0]
else:
return a[0] * (a[0] - 1) / 2
def b1():
if a[1] == 1 or a[1] == 0:
a[1] = 0
return a[1]
else:
return a[1] * (a[1] - 1) / 2
print(int(a1() + b1()))
| [
"literal.number.integer.change",
"assignment.value.change",
"call.add",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 504,900 | 504,898 | u689835643 | python |
p02729 | N,M=input().split( )
N=int(N)
M=int(M)
M2=(M*(M-1))/2 #MC2
N2=(N*(N-1))/2
A=M2+N2
A=int(A) | N,M=input().split( )
N=int(N)
M=int(M)
M2=(M*(M-1))/2 #MC2
N2=(N*(N-1))/2
A=M2+N2
A=int(A)
print(A) | [
"call.add"
] | 504,911 | 504,912 | u494295478 | python |
p02729 | def main():
import sys
input = sys.stdin.buffer.readline
n, m = map(int, input().split())
print(int(n*(n-1)/2 + m(m-1)/2))
if __name__ == '__main__':
main() | def main():
import sys
input = sys.stdin.buffer.readline
n, m = map(int, input().split())
print(int(n*(n-1)/2 + m*(m-1)/2))
if __name__ == '__main__':
main() | [
"call.arguments.change"
] | 504,942 | 504,943 | u266014018 | python |
p02729 | n,m = int(input().split())
print((n*(n-1))//2 + (m*(m-1))//2) | n,m = map(int,input().split())
print((n*(n-1))//2 + (m*(m-1))//2) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 505,023 | 505,024 | u738898077 | python |
p02729 | N, M = list(int, input().split())
print(int(N * (N - 1) / 2 + M * (M - 1) / 2))
| N, M = map(int, input().split())
print(int(N * (N - 1) / 2 + M * (M - 1) / 2))
| [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 505,033 | 505,034 | u238084414 | python |
p02729 | n, m = map(int, input().split())
if n == 1 and m == 1:
ans = 0
elif n >= 2 and m == 0:
ans = 1/2 * n * (n-1)
elif n == 0 and m >= 2:
ans = 1/2 * n * (n-1)
else:
ans =1/2*(n*(n-1)+m*(m-1))
print(int(ans)) | n, m = map(int, input().split())
if n == 1 and m == 1:
ans = 0
elif n >= 2 and m == 0:
ans = 1/2 * n * (n-1)
elif n == 0 and m >= 2:
ans = 1/2 * m * (m-1)
else:
ans =1/2*(n*(n-1)+m*(m-1))
print(int(ans)) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 505,039 | 505,040 | u769411997 | python |
p02729 | N,M=map(int,input().split())
ans=(N*N-1)/2+(M*M-1)/2
print(int(ans)) | N,M=map(int,input().split())
ans=N*(N-1)/2+M*(M-1)/2
print(int(ans)) | [] | 505,069 | 505,070 | u640922335 | python |
p02729 | N,M = map(int,input().split)
x = int( N*(N-1)/2 + M*(M-1)/2 )
print(x) | N,M = map(int,input().split())
x = int( N*(N-1)/2 + M*(M-1)/2 )
print(x)
| [
"call.add"
] | 505,091 | 505,092 | u796044734 | python |
p02729 | N, M = map(int, input().split())
print(N*(N-1)+M*(M-1)) | N, M = map(int, input().split())
print((N*(N-1)+M*(M-1))//2) | [
"call.arguments.change",
"call.arguments.add"
] | 505,142 | 505,143 | u857673087 | python |
p02729 | n,m = int(input().split())
print(n * (n-1) / 2 + m * (m-1) / 2) | n,m = map(int, input().split())
print(int(n * (n-1) / 2 + m * (m-1) / 2)) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.add",
"call.arguments.change"
] | 505,153 | 505,154 | u520331522 | python |
p02729 | N,M= map(int,input().split())
print(N*(N-1)/2+M*(M-1)) | N,M= map(int,input().split())
print(N*(N-1)//2+M*(M-1)//2) | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 505,193 | 505,192 | u036479746 | python |
p02729 | n,m = map(int,input())
print(int(n*(n-1)/2)+int(m*(m-1)/2)) | n,m = map(int,input().split())
print(int(n*(n-1)/2)+int(m*(m-1)/2))
| [
"call.add"
] | 505,198 | 505,199 | u472696272 | python |
p02729 | a = list(map(int, input().split()))
b = a[0] * a[0]-1 / 2 + a[1] * a[1] -1 / 2
print(b) | a = list(map(int, input().split()))
b = a[0] * (a[0] - 1) // 2 + a[1] * (a[1] - 1) // 2
print(b) | [
"assignment.value.change",
"expression.operation.binary.change"
] | 505,210 | 505,211 | u873839198 | python |
p02729 | #!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M = map(int, readlines().split())
x = M * (M - 1) // 2
x += N * (N - 1) // 2
print(x) | #!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M = map(int, read().split())
x = M * (M - 1) // 2
x += N * (N - 1) // 2
print(x) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 505,236 | 505,237 | u699944218 | python |
p02729 | #!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M = map(int, readlines().split())
x = M * (M - 1) // 2
x += N * (N - 1) // 2
print(x) | #!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M = map(int, readline().split())
x = M * (M - 1) // 2
x += N * (N - 1) // 2
print(x) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 505,236 | 505,238 | u699944218 | python |
p02729 | n,m=map(int,input().splt())
ans=((n*(n-1))/2)+(m*(m-1))/2
print(int(ans)) | n,m=map(int,input().split())
ans=((n*(n-1))/2)+(m*(m-1))/2
print(int(ans)) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 505,252 | 505,251 | u224119985 | python |
p02729 | n,m=map(int,input().splt())
ans=((n*(n-1))/2)+(m*(m-1))/2
print(ans) | n,m=map(int,input().split())
ans=((n*(n-1))/2)+(m*(m-1))/2
print(int(ans)) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"call.add"
] | 505,253 | 505,251 | u224119985 | python |
p02729 | n,m=map(int,input().split())
if n==0:
print(int(n*(n-1)/2))
elif m==0:
print(iint(m*(m-1)/2))
else:
print(int(n*(n-1)/2+m*(m-1)/2))
| n,m=map(int,input().split())
if n==0:
print(int(m*(m-1)/2))
elif m==0:
print(int(n*(n-1)/2))
else:
print(int(n*(n-1)/2+m*(m-1)/2))
| [
"call.add",
"call.remove"
] | 505,254 | 505,255 | u355154595 | python |
p02729 | a,b = map(int,input().split())
print((a * (a + 1) / 2) + (b * (b + 1) / 2)) | a,b = map(int,input().split())
print(int((a * (a - 1) / 2) + (b * (b - 1) / 2)))
| [
"call.arguments.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 505,281 | 505,280 | u606001175 | python |
p02729 | m,n=(int(x) for x in input().split());
even = m*(m-1)/2;
odd = n*(n-2)/2;
result = even + odd;
print(result); | m,n=(int(x) for x in input().split());
even = m*(m-1)/2;
odd = n*(n-1)/2;
result = int(even + odd);
print(result); | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.add",
"call.arguments.change"
] | 505,309 | 505,308 | u338644171 | python |
p02729 | n, m = map(int, input().split())
print(int(n * (n - 1) / 2 + m * (m + 1) / 2))
| n, m = map(int, input().split())
print(int(n * (n - 1) / 2 + m * (m - 1) / 2))
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 505,316 | 505,315 | u026862065 | python |
p02729 | i = list(map(int, input().split()))
N = i[0]
M = i[1]
guusuu = (N * N-1) // 2
kisuu = (M * M-1) // 2
print(guusuu + kisuu) | i = list(map(int, input().split()))
N = i[0]
M = i[1]
guusuu = (N * (N-1)) // 2
kisuu = (M * (M-1)) // 2
print(guusuu + kisuu) | [] | 505,319 | 505,320 | u838651937 | python |
p02729 | N,M = map(int,input().split)
a = int((N * (N-1) + M * (M-1)) / 2)
print(a)
| N, M = map(int,input().split())
a = int((N * (N-1) + M * (M-1)) / 2)
print(a)
| [
"call.add"
] | 505,345 | 505,346 | u500990280 | python |
p02729 | n, m = map(int, input().split())
print(n*(n-1) + m*(m-1)) | n, m = map(int, input().split())
print((n*(n-1) + m*(m-1))//2)
| [
"call.arguments.change",
"call.arguments.add"
] | 505,353 | 505,352 | u034128150 | python |
p02729 | n,m=map(int,input.split())
ans=n*(n-1)/2#nC2の順列を利用（n個の球から2個の玉を選択）
ans+=m*(m-1)/2
print(int(ans)) | n,m=map(int,input().split())
ans=n*(n-1)/2
ans+=m*(m-1)/2
print(int(ans)) | [
"call.add"
] | 505,371 | 505,372 | u172780602 | python |
p02729 | import sys
def choose2(x):
return x * (n - 1) // 2
n, m = map(int, sys.stdin.readline().split())
def main():
res = choose2(n) + choose2(m)
print(res)
if __name__ == '__main__':
main() | import sys
def choose2(x):
return x * (x - 1) // 2
n, m = map(int, sys.stdin.readline().split())
def main():
res = choose2(n) + choose2(m)
print(res)
if __name__ == '__main__':
main() | [
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 505,384 | 505,385 | u254871849 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.