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 |
|---|---|---|---|---|---|---|---|
p02622 | S, T = input().split()
leng = len(S)
count = 0
for i in range(len(S)):
if S[i] != T[i]:
count += 1
print(count) | S = input()
T = input()
leng = len(S)
count = 0
for i in range(len(S)):
if S[i] != T[i]:
count += 1
print(count) | [
"call.add",
"call.remove"
] | 331,086 | 331,087 | u586639900 | python |
p02622 | S = input()
T = input()
ans = 0
for i in range(len(S)-1):
if S[i] != T[i]:
ans += 1
print(ans) | S = input()
T = input()
ans = 0
for i in range(len(S)):
if S[i] != T[i]:
ans += 1
print(ans) | [
"expression.operation.binary.remove"
] | 331,088 | 331,089 | u382639013 | python |
p02622 | A=input()
B=input()
C=0
for i in range(N):
if A[i] != B[i]:
C+=1
print(C) | A=input()
B=input()
C=0
for i in range(len(A)):
if A[i] != B[i]:
C+=1
print(C)
| [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 331,094 | 331,095 | u185806788 | python |
p02622 | import os
str = input()
str2 = input()
count = 0
for i in range(1, len(str)):
if str[i] != str2[i]:
count = count + 1
print(count)
| import os
str = input()
str2 = input()
count = 0
for i in range(0, len(str)):
if str[i] != str2[i]:
count = count + 1
print(count)
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 331,098 | 331,099 | u554237650 | python |
p02622 | s = input()
t = input()
count = 0
for i in len(s):
if s[i] != t[i]:
count += 1
print(count)
| s = input()
t = input()
count = 0
for i in range(len(s)):
if s[i] != t[i]:
count += 1
print(count) | [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 331,108 | 331,109 | u933929042 | python |
p02622 | S=input()
T=input()
cnt=0
for i in len(S):
if(S[i]==T[i]):
cnt+=1
print(cnt) | S=input()
T=input()
cnt=0
for i in range(len(S)):
if(S[i]!=T[i]):
cnt+=1
print(cnt) | [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 331,110 | 331,111 | u789436713 | python |
p02622 | s = input()
t = input()
cnt = 0
for i in len(s):
if s[i] != t[i]:
cnt += 1
print(cnt) | s = input()
t = input()
cnt = 0
for i in range(len(s)):
if s[i] != t[i]:
cnt += 1
print(cnt) | [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 331,124 | 331,125 | u798260206 | python |
p02622 | from sys import stdin,stdout
LI=lambda:list(map(int,input().split()))
MAP=lambda:map(int,input().split())
IN=lambda:int(input())
S=lambda:input()
import math
def p(a):print(" ".join(list(map(str,a))))
from collections import Counter
s=S()
t=t()
x=0
for i in range(len(s)):
if s[i]!=t[i]:x+=1
print(x) | from sys import stdin,stdout
LI=lambda:list(map(int,input().split()))
MAP=lambda:map(int,input().split())
IN=lambda:int(input())
S=lambda:input()
import math
def p(a):print(" ".join(list(map(str,a))))
from collections import Counter
s=S()
t=S()
x=0
for i in range(len(s)):
if s[i]!=t[i]:x+=1
print(x)
| [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 331,126 | 331,127 | u024343432 | python |
p02622 | s = input()
t = input()
ans = 0
for S, T in zip(s, t):
if S == T:
ans += 1
print(ans) | s = input()
t = input()
ans = 0
for S, T in zip(s, t):
if S != T:
ans += 1
print(ans)
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 331,132 | 331,133 | u959340534 | python |
p02622 | s = input()
c=0
for i in range(len(s)):
if s[i] != t[i]:
c += 1
print(c) | s = input()
t = input()
c=0
for i in range(len(s)):
if s[i] != t[i]:
c += 1
print(c) | [
"assignment.add"
] | 331,140 | 331,141 | u250061066 | python |
p02623 | n,m,k = map(int,input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A,B = [0],[0]
for i in range(n):
A.append(a[i] + A[i])
for i in range(m):
B.append(b[i] + B[i])
num,x = 0,m
for i in range(len(a)-1):
if A[i] > k:
break
while A[i] + B[x] > k:
x -= 1
num = ma... | n,m,k = map(int,input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A,B = [0],[0]
for i in range(n):
A.append(a[i] + A[i])
for i in range(m):
B.append(b[i] + B[i])
num,x = 0,m
for i in range(len(A)):
if A[i] > k:
break
while A[i] + B[x] > k:
x -= 1
num = max(... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 331,146 | 331,147 | u548272916 | python |
p02623 | n,m,k = map(int,input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A,B = [0],[0]
for i in range(n):
A.append(a[i] + A[i])
for i in range(m):
B.append(b[i] + B[i])
num,x = 0,m
for i in range(len(a)):
if A[i] > k:
break
while A[i] + B[x] > k:
x -= 1
num = max(num... | n,m,k = map(int,input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
A,B = [0],[0]
for i in range(n):
A.append(a[i] + A[i])
for i in range(m):
B.append(b[i] + B[i])
num,x = 0,m
for i in range(len(A)):
if A[i] > k:
break
while A[i] + B[x] > k:
x -= 1
num = max(... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 331,148 | 331,147 | u548272916 | python |
p02623 | n, m, k = map(int, input().split())
aa = list(map(int, input().split()))
bb = list(map(int, input().split()))
asum = [0]
bsum = [0]
for i in range(len(aa)):
asum.append(asum[i]+aa[i])
for i in range(len(bb)):
bsum.append(bsum[i]+bb[i])
j = len(bsum)-1
ans = 0
for i in range(len(asum)):
while j > 0:
... | n, m, k = map(int, input().split())
aa = list(map(int, input().split()))
bb = list(map(int, input().split()))
asum = [0]
bsum = [0]
for i in range(len(aa)):
asum.append(asum[i]+aa[i])
for i in range(len(bb)):
bsum.append(bsum[i]+bb[i])
j = len(bsum)-1
ans = 0
for i in range(len(asum)):
while j >= 0:
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change"
] | 331,163 | 331,164 | u643679148 | python |
p02623 | n, m, k = map(int, input().split())
aa = list(map(int, input().split()))
bb = list(map(int, input().split()))
asum = [0]
bsum = [0]
for i in range(len(aa)):
asum.append(asum[i]+aa[i])
for i in range(len(bb)):
bsum.append(bsum[i]+bb[i])
j = len(bsum)-1
ans = 0
for i in range(len(asum)):
while j > 0:
... | n, m, k = map(int, input().split())
aa = list(map(int, input().split()))
bb = list(map(int, input().split()))
asum = [0]
bsum = [0]
for i in range(len(aa)):
asum.append(asum[i]+aa[i])
for i in range(len(bb)):
bsum.append(bsum[i]+bb[i])
j = len(bsum)-1
ans = 0
for i in range(len(asum)):
while j >= 0:
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 331,165 | 331,164 | u643679148 | python |
p02623 | def getmax(x,y):
if x>y:
return x
else:
return y
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
a,b = [0],[0]
for i in range(N): #a[i]にはAの本をi冊読んだ時の時間がそれぞれ保存されている．
a.append(a[i]+A[i]) #計算量を減らすため，a[i]（1冊前までにかかる時間）を用いる
for i in range(M... | def getmax(x,y):
if x>y:
return x
else:
return y
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
a,b = [0],[0]
for i in range(N): #a[i]にはAの本をi冊読んだ時の時間がそれぞれ保存されている．
a.append(a[i]+A[i]) #計算量を減らすため，a[i]（1冊前までにかかる時間）を用いる
for i in range(M... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 331,194 | 331,195 | u981747421 | python |
p02623 | def getmax(x,y):
if x>y:
return x
else:
return y
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
a,b = [0],[0]
for i in range(N): #a[i]にはAの本をi冊読んだ時の時間がそれぞれ保存されている．
a.append(a[i]+A[i]) #計算量を減らすため，a[i]（1冊前までにかかる時間）を用いる
for i in range(M... | def getmax(x,y):
if x>y:
return x
else:
return y
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
a,b = [0],[0]
for i in range(N): #a[i]にはAの本をi冊読んだ時の時間がそれぞれ保存されている．
a.append(a[i]+A[i]) #計算量を減らすため，a[i]（1冊前までにかかる時間）を用いる
for i in range(M... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 331,196 | 331,195 | u981747421 | python |
p02623 | #C
n,m,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
asum=[0]
bsum=[0]
for i in range(n):
asum.append(asum[-1]+a[i])
for i in range(m):
bsum.append(bsum[-1+b[i]])
ans=0
for i in range(n+1):
if asum[i]>0:
break
while asum[i]+bsum[m]>0 and m>0:
... | n,m,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
asum=[0]
bsum=[0]
for i in range(n):
asum.append(asum[-1]+a[i])
for i in range(m):
bsum.append(bsum[-1]+b[i])
ans=0
for i in range(n+1):
if asum[i]>k:
break
while asum[i]+bsum[m]>k and m>0:
m... | [
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.condition.change",
"call.add"
] | 331,208 | 331,209 | u163543660 | python |
p02623 | n,m,k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = [0]*(n+1)
d = [0]*(m+1)
for i in range(n):
c[i+1] = a[i]+c[i]
for i in range(m):
d[i+1] = b[i]+d[i]
for i in range(m+1)[::-1]:
if d[i] <= k:
x = i
break
ans = 0
for i in range(1,n+1):
... | n,m,k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = [0]*(n+1)
d = [0]*(m+1)
for i in range(n):
c[i+1] = a[i]+c[i]
for i in range(m):
d[i+1] = b[i]+d[i]
for i in range(m+1)[::-1]:
if d[i] <= k:
x = i
break
ans = x
for i in range(1,n+1):
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 331,212 | 331,213 | u357751375 | python |
p02623 | from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))
from bisect import bisect_right
from itertools import accumulate
n,m,k=nii()
a=lnii()
b=lnii()
ar=[0]+list(accumulate(a))
br=list(accumulate(b))
ans=0
for i in range(n+1):
time=ar[i]
if time>k:
... | from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))
from bisect import bisect_right
from itertools import accumulate
n,m,k=nii()
a=lnii()
b=lnii()
ar=[0]+list(accumulate(a))
br=list(accumulate(b))
ans=0
for i in range(n+1):
time=ar[i]
if time>k:
... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 331,214 | 331,215 | u094191970 | python |
p02623 | from bisect import *
n,m,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
a_b=[0]
for i in range(1,n+1):
a_b.append(a_b[i-1]+a[i-1])
b_b=[0]
for i in range(1,m+1):
b_b.append(b_b[i-1]+b[i-1])
ans=0
for i in range(n+1):
t_ans=i
if t_ans>k:
break
t_ans+=bisect... | from bisect import *
n,m,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
a_b=[0]
for i in range(1,n+1):
a_b.append(a_b[i-1]+a[i-1])
b_b=[0]
for i in range(1,m+1):
b_b.append(b_b[i-1]+b[i-1])
ans=0
for i in range(n+1):
t_ans=i
if a_b[i]>k:
break
t_ans+=bisec... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 331,216 | 331,217 | u094191970 | python |
p02623 | from itertools import accumulate
from bisect import bisect
def main():
n, m, k = map(int, input().split())
a = tuple(map(int, input().split()))
b = tuple(map(int, input().split()))
aa = tuple(accumulate(a))
ba = tuple(accumulate(b))
r = 0
for i1 in range(n):
if aa[i1] > k:
... | from itertools import accumulate
from bisect import bisect
def main():
n, m, k = map(int, input().split())
a = tuple(map(int, input().split()))
b = tuple(map(int, input().split()))
aa = tuple(accumulate(a))
ba = tuple(accumulate(b))
r = 0
for i1 in range(n):
if aa[i1] > k:
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 331,228 | 331,229 | u072717685 | python |
p02623 | def judge(n,array1,array2,K):
for i in range(n):
if len(array1) > i and len(array2) > n-i:
sum = array1[i] + array2[n-i]
if sum <= K:
return True
return False
N, M, K = list(map(int,input().split()))
As = list(map(int,input().split()))
Bs = list(map(int,input().s... | def judge(n,array1,array2,K):
for i in range(n+1):
if len(array1) > i and len(array2) > n-i:
sum = array1[i] + array2[n-i]
if sum <= K:
return True
return False
N, M, K = list(map(int,input().split()))
As = list(map(int,input().split()))
Bs = list(map(int,input()... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 331,242 | 331,243 | u367794409 | python |
p02623 | n, m, k = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
As = [0] * (n + 1)
Bs = [0] * (m + 1)
for i in range(n):
As[i + 1] = A[i] + As[i - 1]
for i in range(m):
Bs[i + 1] = B[i] + Bs[i - 1]
l = 0
r = n + m + 1
while r - l > 1:
p = (l + r) // 2
best = k + 1
... | n, m, k = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
As = [0] * (n + 1)
Bs = [0] * (m + 1)
for i in range(n):
As[i + 1] = A[i] + As[i]
for i in range(m):
Bs[i + 1] = B[i] + Bs[i]
l = 0
r = n + m + 1
while r - l > 1:
p = (l + r) // 2
best = k + 1
for i i... | [
"expression.operation.binary.remove"
] | 331,255 | 331,256 | u170183831 | python |
p02623 | N, M, K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
Asum = [0]
Bsum = [0]
a = 0
b = 0
for i in range(N):
a += A[i]
Asum.append(a)
for i in range(M):
b += B[i]
Bsum.append(b)
Asum.append(0)
Bsum.append(0)
res, j = 0, 0
for i in range(N+1):
if Asum[... | N, M, K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
Asum = [0]
Bsum = [0]
a = 0
b = 0
for i in range(N):
a += A[i]
Asum.append(a)
for i in range(M):
b += B[i]
Bsum.append(b)
Asum.append(0)
Bsum.append(0)
res, j = 0, M
for i in range(N+1):
if Asum[... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 331,277 | 331,278 | u345621867 | python |
p02623 | N, M, K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
Asum = [0]
Bsum = [0]
a = 0
b = 0
for i in range(N):
a += A[i]
Asum.append(a)
for i in range(M):
b += B[i]
Bsum.append(b)
Asum.append(0)
Bsum.append(0)
res, j = 0, 0
for i in range(N+1):
if Asum[... | N, M, K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
Asum = [0]
Bsum = [0]
a = 0
b = 0
for i in range(N):
a += A[i]
Asum.append(a)
for i in range(M):
b += B[i]
Bsum.append(b)
Asum.append(0)
Bsum.append(0)
res, j = 0, M
for i in range(N+1):
if Asum[... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"expression.operator.change",
"expression.operation.binary.remove"
] | 331,279 | 331,278 | u345621867 | python |
p02623 | N, M, K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
Asum = [0]
Bsum = [0]
a = 0
b = 0
for i in range(N):
a += A[i]
Asum.append(a)
for i in range(M):
b += B[i]
Bsum.append(b)
Asum.append(0)
Bsum.append(0)
res, j = 0, 0
for i in range(N+1):
if Asum[... | N, M, K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
Asum = [0]
Bsum = [0]
a = 0
b = 0
for i in range(N):
a += A[i]
Asum.append(a)
for i in range(M):
b += B[i]
Bsum.append(b)
Asum.append(0)
Bsum.append(0)
res, j = 0, M
for i in range(N+1):
if Asum[... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operator.change"
] | 331,280 | 331,278 | u345621867 | python |
p02623 | n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 0
ia = 0
ib = 0
nowtime = 0
cnt = 0
for i in range(n):
if nowtime + a[i] <= k:
nowtime += a[i]
cnt += 1
ia = i
else:
break
ans = cnt
for i in range(m):
while ... | n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 0
ia = -1
ib = -1
nowtime = 0
cnt = 0
for i in range(n):
if nowtime + a[i] <= k:
nowtime += a[i]
cnt += 1
ia = i
else:
break
ans = cnt
# print(ans, nowtime)
for i ... | [
"assignment.value.change",
"expression.operation.unary.add"
] | 331,283 | 331,284 | u102126195 | python |
p02623 | def main():
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
cum_A = [0]
for a in A:
if a + cum_A[-1] <= K:
cum_A.append(a + cum_A[-1])
cum_B = [0]
for b in B:
if b + cum_B[-1] <= K:
cum_B.appe... | def main():
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
cum_A = [0]
for a in A:
if a + cum_A[-1] <= K:
cum_A.append(a + cum_A[-1])
else:
break
cum_B = [0]
for b in B:
if b + cum_B[... | [
"control_flow.break.add"
] | 331,287 | 331,288 | u243535639 | python |
p02623 | import bisect
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ra = [0] * (n + 1)
rb = [0] * (m + 1)
for i in range(n):
ra[i + 1] = a[i] + ra[i]
for j in range(m):
rb[j + 1] = b[j] + rb[j]
ans = 0
for i in range(1, n + 1):
zan = k - ra[i]
if ... | import bisect
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ra = [0] * (n + 1)
rb = [0] * (m + 1)
for i in range(n):
ra[i + 1] = a[i] + ra[i]
for j in range(m):
rb[j + 1] = b[j] + rb[j]
ans = 0
for i in range(n + 1):
zan = k - ra[i]
if zan... | [
"call.arguments.change"
] | 331,305 | 331,306 | u743164083 | python |
p02623 | n,m,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
aa,bb=[0],[0]
for i in range(n):
aa.append(aa[-1]+a[i])
for i in range(m):
bb.append(bb[-1]+b[i])
ans,j=0,m
for i in range(n+1):
if a[i]>k:
break
while b[j]>k-a[i]:
j-=1
ans=max(ans,i+j)
... | n,m,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
aa,bb=[0],[0]
for i in range(n):
aa.append(aa[-1]+a[i])
for i in range(m):
bb.append(bb[-1]+b[i])
ans,j=0,m
for i in range(n+1):
if aa[i]>k:
break
while bb[j]>k-aa[i]:
j-=1
ans=max(ans,i+... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.condition.change"
] | 331,312 | 331,313 | u910632349 | python |
p02623 | import bisect
n, m, k = list(map(int, input().split()))
book_a = list(map(int, input().split()))
book_b = list(map(int, input().split()))
a_time_sum = [0]
b_time_sum = []
for i in range(n):
if i == 0:
a_time_sum.append(book_a[0])
else:
a_time_sum.append(a_time_sum[i-1]+book_a[i])
for i in ran... | import bisect
n, m, k = list(map(int, input().split()))
book_a = list(map(int, input().split()))
book_b = list(map(int, input().split()))
a_time_sum = [0]
b_time_sum = []
for i in range(n):
if i == 0:
a_time_sum.append(book_a[0])
else:
a_time_sum.append(a_time_sum[i]+book_a[i])
for i in range... | [
"expression.operation.binary.remove"
] | 331,322 | 331,323 | u917872021 | python |
p02623 | # ABC C-Tsundoku
n,m,k = map(int,input().split())
an = list(map(int,input().split()))
bn = list(map(int,input().split()))
suma = [0]
sumb = [0]
a = 0
b = 0
for i in an:
a += i
suma.append(a)
for i in bn:
b += i
sumb.append(b)
res = [0]
l = m
for j in range(n+1):
if k-suma[j] < 0:
break
... | # ABC C-Tsundoku
n,m,k = map(int,input().split())
an = list(map(int,input().split()))
bn = list(map(int,input().split()))
suma = [0]
sumb = [0]
a = 0
b = 0
for i in an:
a += i
suma.append(a)
for i in bn:
b += i
sumb.append(b)
res = [0]
l = m
for j in range(n+1):
if k-suma[j] < 0:
break
... | [
"expression.operation.binary.remove"
] | 331,375 | 331,376 | u731436822 | python |
p02623 | N, M, K = map(int, input().split())
INF = int(1e18)
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A = A[:]
B = B[:]
i, j = 0, 0
mcnt = 0
tmp = M+1
ccnt = 0
while tmp != 0:
ccnt += 1
tmp //= 2
LA = [0 for _ in range(N+1)]
LB = [0 for _ in range(M+1)]
for i in range(N):
LA[i+1] = LA[i] + A... | N, M, K = map(int, input().split())
INF = int(1e18)
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A = A[:]
B = B[:]
i, j = 0, 0
mcnt = 0
tmp = M+1
ccnt = 0
while tmp != 0:
ccnt += 1
tmp //= 2
LA = [0 for _ in range(N+1)]
LB = [0 for _ in range(M+1)]
for i in range(N):
LA[i+1] = LA[i] + A... | [
"call.remove"
] | 331,381 | 331,382 | u984276646 | python |
p02623 | def judge(num):
if num>n+m:
return False
for i in range(max(0,num-m),min(n,num)+1):
if a_cumsum[i] + b_cumsum[num-i]<=k:
return True
return False
n,m,k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a_cumsum = [0]
b_cumsum = [0]
for i in a:
a_cum... | def judge(num):
if num>n+m:
return False
for i in range(max(0,num-m),min(n,num)+1):
if a_cumsum[i] + b_cumsum[num-i]<=k:
return True
return False
n,m,k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a_cumsum = [0]
b_cumsum = [0]
for i in a:
a_c... | [
"expression.operation.binary.remove"
] | 331,394 | 331,395 | u555311916 | python |
p02623 | N, M, K = map(int, input().split(' '))
A_ls = [0] + list(map(int, input().split(' ')))
for i in range(N):
A_ls[i + 1] += A_ls[i]
B_ls = [0] + list(map(int, input().split(' ')))
for i in range(M):
B_ls[i + 1] = B_ls[i]
b_cnt, rst = M, 0
for a_cnt in range(N + 1):
if A_ls[a_cnt] > K:
break
while... | N, M, K = map(int, input().split(' '))
A_ls = [0] + list(map(int, input().split(' ')))
for i in range(N):
A_ls[i + 1] += A_ls[i]
B_ls = [0] + list(map(int, input().split(' ')))
for i in range(M):
B_ls[i + 1] += B_ls[i]
b_cnt, rst = M, 0
for a_cnt in range(N + 1):
if A_ls[a_cnt] > K:
break
while ... | [
"assignment.value.change"
] | 331,398 | 331,399 | u418149936 | python |
p02623 | N, M, K = map(int, input().split(' '))
A_ls = [0] + list(map(int, input().split(' ')))
for i in range(N):
A_ls[i + 1] += A_ls[i]
B_ls = [0] + list(map(int, input().split(' ')))
for i in range(M):
B_ls[i + 1] = B_ls[i]
b_cnt, rst = M, 0
for a_cnt in range(N + 1):
if A_ls[a_cnt] > K:
break
while... | N, M, K = map(int, input().split(' '))
A_ls = [0] + list(map(int, input().split(' ')))
for i in range(N):
A_ls[i + 1] += A_ls[i]
B_ls = [0] + list(map(int, input().split(' ')))
for i in range(M):
B_ls[i + 1] += B_ls[i]
b_cnt, rst = M, 0
for a_cnt in range(N + 1):
if A_ls[a_cnt] > K:
break
while... | [
"assignment.value.change"
] | 331,398 | 331,402 | u418149936 | python |
p02623 | N, M, K = map(int, input().split(' '))
A_ls = [0] + list(map(int, input().split(' ')))
for i in range(len(A_ls) - 1):
A_ls[i + 1] += A_ls[i]
B_ls = [0] + list(map(int, input().split(' ')))
for i in range(len(B_ls) - 1):
B_ls[i + 1] += B_ls[i]
b_cnt,result = M, 0
for a_cnt in range(N):
if A_ls[a_cnt] > K:
... | N, M, K = map(int, input().split(' '))
A_ls = [0] + list(map(int, input().split(' ')))
for i in range(len(A_ls) - 1):
A_ls[i + 1] += A_ls[i]
B_ls = [0] + list(map(int, input().split(' ')))
for i in range(len(B_ls) - 1):
B_ls[i + 1] += B_ls[i]
b_cnt,result = M, 0
for a_cnt in range(N + 1):
if A_ls[a_cnt] >... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 331,403 | 331,404 | u418149936 | python |
p02623 | n,m,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
sa=[]
sma=0
for i in range(n):
sma+=a[i]
sa.append(sma)
sb=[]
smb=0
for i in range(m):
smb+=b[i]
sb.append(smb)
import bisect
lain=bisect.bisect_right(sa,k)-1
if lain<0:
sm=0
else:
sm=a[lain]
stin=bi... | n,m,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
sa=[]
sma=0
for i in range(n):
sma+=a[i]
sa.append(sma)
sb=[]
smb=0
for i in range(m):
smb+=b[i]
sb.append(smb)
import bisect
lain=bisect.bisect_right(sa,k)-1
if lain<0:
sm=0
else:
sm=sa[lain]
stin=b... | [
"assignment.value.change",
"identifier.change"
] | 331,411 | 331,412 | u216752093 | python |
p02623 | n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
sum_a = [0]
for i in range(n):
sum_a.append(sum_a[i] + a[i])
sum_b = [0]
for i in range(m):
sum_b.append(sum_b[i] + b[i])
a_i = 0
b_i = 0
for i in range(n+1):
if sum_a[i] > k:
break
... | n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
sum_a = [0]
for i in range(n):
sum_a.append(sum_a[i] + a[i])
sum_b = [0]
for i in range(m):
sum_b.append(sum_b[i] + b[i])
a_i = 0
b_i = 0
for i in range(n+1):
if sum_a[i] > k:
break
... | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.unary.add",
"control_flow.loop.range.bounds.step.change"
] | 331,417 | 331,418 | u235027735 | python |
p02623 | n,m,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[0]
d=[0]
for i in range(n):
c.append(c[-1]+a[i])
for j in range(m):
d.append(d[-1]+b[j])
ans=0
for x in range(n):
l=c[x]
B=0
if l<=k:
h=k-l
mi=0
ma=m+1
while ma-mi>1:
mid=(mi+ma)//2
... | n,m,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[0]
d=[0]
for i in range(n):
c.append(c[-1]+a[i])
for j in range(m):
d.append(d[-1]+b[j])
ans=0
for x in range(n+1):
l=c[x]
B=0
if l<=k:
h=k-l
mi=0
ma=m+1
while ma-mi>1:
mid=(mi+ma)//... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 331,461 | 331,462 | u516554284 | python |
p02623 | import bisect
n,m,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
A,B=[0],[0]
for i in range(n):
A.append(a[i]+A[i])
for i in range(m):
B.append(b[i]+B[i])
for j in range(n+1):
K=k-A[j]
if K<0:
break
else:
ans=max(ans,bisect.bisect_left(B,K)+j-1)
pr... | import bisect
n,m,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
A,B=[0],[0]
for i in range(n):
A.append(a[i]+A[i])
for i in range(m):
B.append(b[i]+B[i])
for j in range(n+1):
K=k-A[j]
if K<0:
break
else:
ans=max(ans,bisect.bisect_right(B,K)+j-1)
p... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 331,466 | 331,467 | u492910842 | python |
p02623 | N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
T = 0
###Aだけなら何冊読めるか
a = 0
for i in range(N):
if T + A[i]> K:
break
T += A[i]
a += 1
m = a
count = a
num = 0
while a >= 0 and num < M:
#print(m,a,T)
while num < M and K-T >= B[num]:
... | N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
T = 0
###Aだけなら何冊読めるか
a = 0
for i in range(N):
if T + A[i] > K:
break
T += A[i]
a += 1
m = a
count = a
num = 0
while a >= 0 and num < M:
#print(m,a,T)
while num < M and K-T >= B[num]:
... | [] | 331,482 | 331,483 | u512007680 | python |
p02623 | n,m,k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
for i in range(1,n):
a[i] += a[i-1]
for i in range(1,m):
b[i] += b[i-1]
a = [0]+a
b = [0]+b
ans = 0
ALL = 0
from bisect import bisect
for i in range(1,n+1):
ALL = a[i]
if ALL > k:
continue
... | n,m,k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
for i in range(1,n):
a[i] += a[i-1]
for i in range(1,m):
b[i] += b[i-1]
a = [0]+a
b = [0]+b
ans = 0
ALL = 0
from bisect import bisect
for i in range(n+1):
ALL = a[i]
if ALL > k:
continue
e... | [
"call.arguments.change"
] | 331,486 | 331,487 | u252828980 | python |
p02623 | n,m,k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
for i in range(1,n):
a[i] += a[i-1]
for i in range(1,m):
b[i] += b[i-1]
a = [0]+a
b = [0]+b
ans = 0
ALL = 0
from bisect import bisect
for i in range(1,n+1):
ALL = a[i]
if ALL > k:
continue
... | n,m,k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
for i in range(1,n):
a[i] += a[i-1]
for i in range(1,m):
b[i] += b[i-1]
a = [0]+a
b = [0]+b
ans = 0
ALL = 0
from bisect import bisect
for i in range(n+1):
ALL = a[i]
if ALL > k:
continue
e... | [
"call.arguments.change"
] | 331,488 | 331,487 | u252828980 | python |
p02623 | import typing
def binary_serch(x:int, b_sum:list):
l = 0
r = len(b_sum) - 1
mid = (l + r + 1) // 2
res = mid
while True:
if x == b_sum[mid]:
return mid
elif x < b_sum[mid]:
res = mid - 1
r = mid
mid = (l + r + 1) // 2
elif b_su... | import typing
def binary_serch(x:int, b_sum:list):
l = 0
r = len(b_sum) - 1
mid = (l + r + 1) // 2
res = mid
while True:
if x == b_sum[mid]:
return mid
elif x < b_sum[mid]:
res = mid - 1
r = mid
mid = (l + r + 1) // 2
elif b_su... | [
"control_flow.break.add"
] | 331,504 | 331,505 | u699296734 | python |
p02623 | from itertools import groupby, accumulate, product, permutations, combinations
def solve():
ans = 0
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A = [0]+list(accumulate(A))
B = [0]+list(accumulate(B))
b = M
for a in range(N+1... | from itertools import groupby, accumulate, product, permutations, combinations
def solve():
ans = 0
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A = [0]+list(accumulate(A))
B = [0]+list(accumulate(B))
b = M
for a in range(N+1... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 331,509 | 331,510 | u678167152 | python |
p02623 | from itertools import groupby, accumulate, product, permutations, combinations
def solve():
ans = 0
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A = [0]+list(accumulate(A))
B = [0]+list(accumulate(B))
b = M
for a in range(N+1... | from itertools import groupby, accumulate, product, permutations, combinations
def solve():
ans = 0
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A = [0]+list(accumulate(A))
B = [0]+list(accumulate(B))
b = M
for a in range(N+1... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 331,509 | 331,512 | u678167152 | python |
p02623 | from bisect import *
def solve():
ans = 0
N, M, K = map(int, input().split())
A = list(map(int, input().split()))+[float('inf')]
B = list(map(int, input().split()))+[float('inf')]
cumA = [0]*(N+1)
cumB = [0]*(M+1)
for i in range(N):
cumA[i+1] = cumA[i]+A[i]
for i in range(M):
... | from bisect import *
def solve():
ans = 0
N, M, K = map(int, input().split())
A = list(map(int, input().split()))+[float('inf')]
B = list(map(int, input().split()))+[float('inf')]
cumA = [0]*(N+1)
cumB = [0]*(M+1)
for i in range(N):
cumA[i+1] = cumA[i]+A[i]
for i in range(M):
... | [] | 331,513 | 331,514 | u678167152 | python |
p02623 | n, m, k = map(int, input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
for i in range(1,n):
A[i] += A[i-1]
for i in range(1,m):
B[i] += B[i-1]
A.insert(0,0)
B.insert(0,0)
j = m
ans = 0
for i in range(m):
if A[i] > k:
break
while B[j] > k-A[i]:
j ... | n, m, k = map(int, input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
for i in range(1,n):
A[i] += A[i-1]
for i in range(1,m):
B[i] += B[i-1]
A.insert(0,0)
B.insert(0,0)
j = m
ans = 0
for i in range(n+1):
if A[i] > k:
break
while B[j] > k-A[i]:
... | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 331,543 | 331,544 | u191680842 | python |
p02623 | #!/usr/bin/python3
# -*- coding:utf-8 -*-
import numpy
def main():
_, _, k = map(int, input().strip().split())
la = numpy.cumsum(list(map(int, input().strip().split())))
lb = numpy.cumsum([0] + list(map(int, input().strip().split())) + [10**9+5])
def bs(x):
s, t = 0, len(lb) - 1
while t > s + 1:
... | #!/usr/bin/python3
# -*- coding:utf-8 -*-
import numpy
def main():
_, _, k = map(int, input().strip().split())
la = numpy.cumsum([0] + list(map(int, input().strip().split())))
lb = numpy.cumsum([0] + list(map(int, input().strip().split())) + [10**9+5])
def bs(x):
s, t = 0, len(lb) - 1
while t > s +... | [
"call.arguments.change"
] | 331,560 | 331,561 | u210440747 | python |
p02623 | def main():
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
a.append(b[i] + B[i])
ans, j = 0, M
for i in range(N + 1):
if a[i]... | def main():
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
ans, j = 0, M
for i in range(N + 1):
if a[i]... | [
"identifier.change"
] | 331,584 | 331,585 | u359358631 | python |
p02623 | from bisect import bisect_left as bl
from itertools import accumulate as ac
n,m,k=map(int,input().split())
a=list(ac([0]+list(map(int,input().split()))))
b=list(ac([0]+list(map(int,input().split()))))
l=0
for i in range(n+1):
if k<a[i]:
break
else:
l=max(l,i+bl(b,k-a[i])-1)
print(l) | from bisect import bisect_right as br
from itertools import accumulate as ac
n,m,k=map(int,input().split())
a=list(ac([0]+list(map(int,input().split()))))
b=list(ac([0]+list(map(int,input().split()))))
l=0
for i in range(n+1):
if k<a[i]:
break
else:
l=max(l,i+br(b,k-a[i])-1)
print(l) | [
"identifier.change",
"assignment.value.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 331,591 | 331,592 | u619819312 | python |
p02616 | N,K=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
a,b,i=0,-1,0
mod=10**9+7
ans=1
while i<K-1:
if A[a]*A[a+1]>A[-b]*A[-b-1]:
ans*=A[a]*A[a+1]
ans%=mod
a+=2
i+=2
else:
ans*=A[-b]
ans%=mod
b+=1
i+=1
if i==K-1:
ans*=A[-b]
ans%=mod
if A[-1]<0 and K%2==1:
ans=1
... | N,K=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
a,b,i=0,1,0
mod=10**9+7
ans=1
while i<K-1:
if A[a]*A[a+1]>A[-b]*A[-b-1]:
ans*=A[a]*A[a+1]
ans%=mod
a+=2
i+=2
else:
ans*=A[-b]
ans%=mod
b+=1
i+=1
if i==K-1:
ans*=A[-b]
ans%=mod
if A[-1]<0 and K%2==1:
ans=1
... | [
"expression.operation.unary.arithmetic.remove"
] | 331,620 | 331,621 | u917558625 | python |
p02616 | N, K = map(int, input().split())
mod = 10**9 + 7
nums = []
p_cnt = 0
for i in list(map(int, input().split())):
if i >= 0:
nums.append((i, True))
p_cnt += 1
else:
nums.append((-i, False))
nums.sort()
if p_cnt == 0 and K%2!=0:
ans = 1
for k in range(K):
ans *= -nums[k][0]
... | N, K = map(int, input().split())
mod = 10**9 + 7
nums = []
p_cnt = 0
for i in list(map(int, input().split())):
if i >= 0:
nums.append((i, True))
p_cnt += 1
else:
nums.append((-i, False))
nums.sort()
if p_cnt == 0 and K%2!=0:
ans = 1
for k in range(K):
ans *= -nums[k][0]
... | [] | 331,640 | 331,641 | u219417113 | python |
p02616 | mod = 10**9+7
N, K = map(int,input().split())
A = sorted(list(map(int,input().split())))
p = 1
n = 0
ans = 1
cnt = 0
while cnt < K-1:
if A[n]*A[n+1] > A[-p]*A[-p-1]:
ans = ans*A[n]*A[n+1]%mod
n += 2
cnt += 2
else:
ans = ans*A[-p]%mod
p += 1
cnt += 1
if cnt == K-1:
ans = ans*A[-p... | mod = 10**9+7
N, K = map(int,input().split())
A = sorted(list(map(int,input().split())))
p = 1
n = 0
ans = 1
cnt = 0
while cnt < K-1:
if A[n]*A[n+1] > A[-p]*A[-p-1]:
ans = ans*A[n]*A[n+1]%mod
n += 2
cnt += 2
else:
ans = ans*A[-p]%mod
p += 1
cnt += 1
if cnt == K-1:
ans = ans*A[-p... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 331,659 | 331,660 | u686036872 | python |
p02616 | mod = 10**9+7
N, K = map(int,input().split())
A = sorted(list(map(int,input().split())))
p = 1
n = 0
ans = 1
cnt = 0
while cnt < K-1:
if A[n]*A[n+1] > A[-p]*A[-p-1]:
ans = ans*A[n]*A[n+1]%mod
n += 2
cnt += 2
else:
ans = ans*A[-p]%mod
p += 1
cnt += 1
if i == K-1:
ans = ans*A[-p]%... | mod = 10**9+7
N, K = map(int,input().split())
A = sorted(list(map(int,input().split())))
p = 1
n = 0
ans = 1
cnt = 0
while cnt < K-1:
if A[n]*A[n+1] > A[-p]*A[-p-1]:
ans = ans*A[n]*A[n+1]%mod
n += 2
cnt += 2
else:
ans = ans*A[-p]%mod
p += 1
cnt += 1
if cnt == K-1:
ans = ans*A[-p... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 331,661 | 331,660 | u686036872 | python |
p02616 | mod = 10**9+7
N, K = map(int,input().split())
A = sorted(list(map(int,input().split())))
p = 1
n = 0
ans = 1
cnt = 0
while cnt < K-1:
if A[n]*A[n+1] > A[-p]*A[-p-1]:
ans = ans*A[ni]*A[n+1]%mod
n += 2
cnt += 2
else:
ans = ans*A[-p]%mod
p += 1
cnt += 1
if i == K-1:
ans = ans*A[-p]... | mod = 10**9+7
N, K = map(int,input().split())
A = sorted(list(map(int,input().split())))
p = 1
n = 0
ans = 1
cnt = 0
while cnt < K-1:
if A[n]*A[n+1] > A[-p]*A[-p-1]:
ans = ans*A[n]*A[n+1]%mod
n += 2
cnt += 2
else:
ans = ans*A[-p]%mod
p += 1
cnt += 1
if cnt == K-1:
ans = ans*A[-p... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 331,662 | 331,660 | u686036872 | python |
p02616 | mod = 10**9+7
N, K = map(int,input().split())
A = sorted(list(map(int,input().split())))
p = 1
n = 0
ans = 1
cnt = 0
while cnt < K-1:
if A[n]*A[n+1] > A[-p]*A[-p-1]:
ans = ans*A[ni]*A[ni+1]%mod
n += 2
cnt += 2
else:
ans = ans*A[-p]%mod
p += 1
cnt += 1
if i == K-1:
ans = ans*A[-p... | mod = 10**9+7
N, K = map(int,input().split())
A = sorted(list(map(int,input().split())))
p = 1
n = 0
ans = 1
cnt = 0
while cnt < K-1:
if A[n]*A[n+1] > A[-p]*A[-p-1]:
ans = ans*A[n]*A[n+1]%mod
n += 2
cnt += 2
else:
ans = ans*A[-p]%mod
p += 1
cnt += 1
if cnt == K-1:
ans = ans*A[-p... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 331,663 | 331,660 | u686036872 | python |
p02616 | n,k = map(int, input().split())
a =list(map(int, input().split()))
ans =1
if n == k:
for i in a:
ans *= i
if abs(ans) >10**9+7:
ans = ans%(10**9+7)
elif all(i <= 0 for i in a) and k%2 ==1:
a.sort(reverse = True)
for i in range(k):
ans *= a[i]
if abs(ans) > 10 ** 9 +... | n,k = map(int, input().split())
a =list(map(int, input().split()))
ans =1
if n == k:
for i in a:
ans *= i
if abs(ans) >10**9+7:
ans = ans%(10**9+7)
elif all(i <= 0 for i in a) and k%2 ==1:
a.sort(reverse = True)
for i in range(k):
ans *= a[i]
if abs(ans) > 10 ** 9 +... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 331,688 | 331,689 | u881675205 | python |
p02616 | MOD = 10**9+7
N, K = map(int, input().split())
*A, = map(int, input().split())
allm = True
for a in A:
if a > 0:
allm = False
break
if N == K:
ans = 1
for a in A:
ans = (ans*a) % MOD
print(ans)
elif allm and K % 2 == 1:
A.sort()
A.reverse()
ans = 1
for a in A[:K... | MOD = 10**9+7
N, K = map(int, input().split())
*A, = map(int, input().split())
allm = True
for a in A:
if a > 0:
allm = False
break
if N == K:
ans = 1
for a in A:
ans = (ans*a) % MOD
print(ans)
elif allm and K % 2 == 1:
A.sort()
A.reverse()
ans = 1
for a in A[:K... | [
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 331,705 | 331,706 | u342869120 | python |
p02616 | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
import collections, heapq, itertools, bisect
import math, fractions
from functools import reduce, lru_cache
import sys, copy
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI1(): return [int(x) - 1 for x in sys... | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
import collections, heapq, itertools, bisect
import math, fractions
from functools import reduce, lru_cache
import sys, copy
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI1(): return [int(x) - 1 for x in sys... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 331,741 | 331,742 | u481187938 | python |
p02623 | import bisect
from itertools import accumulate
N , M , K = map(int , input().split())
a = list(map(int , input().split()))
b = list(map(int , input().split()))
a = list(accumulate(a))
b = list(accumulate(b))
a.insert(0,0)
ans = 0
for i in range(N + 1):
if a[i] > K:
break
ans = max(ans , bisect.bisect_... | import bisect
from itertools import accumulate
N , M , K = map(int , input().split())
a = list(map(int , input().split()))
b = list(map(int , input().split()))
a = list(accumulate(a))
b = list(accumulate(b))
a.insert(0,0)
ans = 0
for i in range(N + 1):
if a[i] > K:
break
ans = max(ans , i + bisect.bis... | [
"assignment.change"
] | 331,838 | 331,839 | u284045566 | python |
p02623 | N,M,K=map(int,input().split())
A =list(map(int,input().split()))
B =list(map(int,input().split()))
Sum = 0
Al = [0]
Bl = [0]
for i in range(N):
Sum += A[i]
Al.append(Sum)
Sum = 0
for j in range(M):
Sum += B[i]
Bl.append(Sum)
ans, j = 0, M
for i in range(N+1):
if Al[i] > K:
break
while Bl... | N,M,K=map(int,input().split())
A =list(map(int,input().split()))
B =list(map(int,input().split()))
Sum = 0
Al = [0]
Bl = [0]
for i in range(N):
Sum += A[i]
Al.append(Sum)
Sum = 0
for j in range(M):
Sum += B[j]
Bl.append(Sum)
ans, j = 0, M
for i in range(N+1):
if Al[i] > K:
break
while Bl... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 331,843 | 331,844 | u973972117 | python |
p02623 | n,m,k = map(int,input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for _ in range(n):
acum1.append(acum1[-1] + arr1[_])
acum2 = [0]
for _ in range(m):
acum2.append(acum2[-1] + arr2[_])
ans = 0
j = m
for i in range(n):
if acum1[i]>k:
break
... | n,m,k = map(int,input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append( acum1[-1] + arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1] + arr2[i])
ans = 0
j = m
for i in range(n+1):
if acum1[i]>k:
break
... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 331,856 | 331,857 | u114099505 | python |
p02623 | n,m,k = map(int,input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append(acum1[-1]+arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans = 0
j = m
for i in range(n):
if acum1[i]>k:
break
whil... | n,m,k = map(int,input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append( acum1[-1] + arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1] + arr2[i])
ans = 0
j = m
for i in range(n+1):
if acum1[i]>k:
break
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 331,858 | 331,857 | u114099505 | python |
p02623 | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( arr1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( arr2... | n,m,k = map(int,input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append( acum1[-1] + arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1] + arr2[i])
ans = 0
j = m
for i in range(n+1):
if acum1[i]>k:
break
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 331,859 | 331,857 | u114099505 | python |
p02623 | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( arr1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( arr2... | n,m,k = map(int,input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append( acum1[-1] + arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1] + arr2[i])
ans = 0
j = m
for i in range(n+1):
if acum1[i]>k:
break
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 331,860 | 331,857 | u114099505 | python |
p02623 | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( arr1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( arr2... | n,m,k = map(int,input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append( acum1[-1] + arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1] + arr2[i])
ans = 0
j = m
for i in range(n+1):
if acum1[i]>k:
break
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 331,861 | 331,857 | u114099505 | python |
p02623 | n,m,k = map(int,input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append(acum1[-1]+arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans = 0
j = m
for i in range(n):
if acum1[i]>k:
break
whil... | n,m,k = map(int,input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for _ in range(n):
acum1.append(acum1[-1] + arr1[_])
acum2 = [0]
for _ in range(m):
acum2.append(acum2[-1] + arr2[_])
ans = 0
j = m
for i in range(n+1):
if acum1[i]>k:
break
... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 331,858 | 331,862 | u114099505 | python |
p02623 | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( arr1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( arr2... | n,m,k = map(int,input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for _ in range(n):
acum1.append(acum1[-1] + arr1[_])
acum2 = [0]
for _ in range(m):
acum2.append(acum2[-1] + arr2[_])
ans = 0
j = m
for i in range(n+1):
if acum1[i]>k:
break
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 331,859 | 331,862 | u114099505 | python |
p02623 | n,m,k = map(int,input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append(acum1[-1]+arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans = 0
j = m
for i in range(n):
if acum1[i]>k:
break
whil... | n,m,k = map(int, input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append(acum1[-1]+arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans = 0
j = m
for i in range(n+1):
if acum1[i]>k:
break
w... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 331,858 | 331,863 | u114099505 | python |
p02623 | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( arr1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( arr2... | n,m,k = map(int, input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append(acum1[-1]+arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans = 0
j = m
for i in range(n+1):
if acum1[i]>k:
break
w... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 331,859 | 331,863 | u114099505 | python |
p02623 | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( arr1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( arr2... | n,m,k = map(int, input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append(acum1[-1]+arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans = 0
j = m
for i in range(n+1):
if acum1[i]>k:
break
w... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 331,860 | 331,863 | u114099505 | python |
p02623 | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( arr1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( arr2... | n,m,k = map(int, input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append(acum1[-1]+arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans = 0
j = m
for i in range(n+1):
if acum1[i]>k:
break
w... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 331,861 | 331,863 | u114099505 | python |
p02623 | n,m,k = map(int,input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append(acum1[-1]+arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans = 0
j = m
for i in range(n):
if acum1[i]>k:
break
whil... | n,m,k = map(int,input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append(acum1[-1]+arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans = 0
j = m
for i in range(n+1):
if acum1[i]>k:
break
wh... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 331,858 | 331,864 | u114099505 | python |
p02623 | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( arr1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( arr2... | n,m,k = map(int,input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append(acum1[-1]+arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans = 0
j = m
for i in range(n+1):
if acum1[i]>k:
break
wh... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 331,859 | 331,864 | u114099505 | python |
p02623 | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( arr1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( arr2... | n,m,k = map(int,input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append(acum1[-1]+arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans = 0
j = m
for i in range(n+1):
if acum1[i]>k:
break
wh... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 331,860 | 331,864 | u114099505 | python |
p02623 | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( arr1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( arr2... | n,m,k = map(int,input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append(acum1[-1]+arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans = 0
j = m
for i in range(n+1):
if acum1[i]>k:
break
wh... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 331,861 | 331,864 | u114099505 | python |
p02623 | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( arr1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( arr2... | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
n, m, k = map(int, input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append(acum1[-1]+arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans = 0
j=m
for i in range... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 331,859 | 331,865 | u114099505 | python |
p02623 | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( arr1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( arr2... | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
n, m, k = map(int, input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append(acum1[-1]+arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans = 0
j=m
for i in range... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 331,860 | 331,865 | u114099505 | python |
p02623 | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( arr1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( arr2... | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
n, m, k = map(int, input().split())
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append(acum1[-1]+arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1]+arr2[i])
ans = 0
j=m
for i in range... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 331,861 | 331,865 | u114099505 | python |
p02623 | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( arr1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( arr2... | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( acum1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( acu... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 331,859 | 331,866 | u114099505 | python |
p02623 | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( arr1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( arr2... | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( acum1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( acu... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 331,860 | 331,866 | u114099505 | python |
p02623 | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( arr1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( arr2... | # 変数 n, m, k, arr1, arr2, acum1, acum2, ans
#累積和二つ
#aを回して
#bから条件をみたさないものを引いていく
n, m, k = map(int, input().split())
arr1 = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
acum1 = [0]
for i in range(n):
acum1.append( acum1[-1] + arr1[i] )
acum2 = [0]
for i in range(m):
acum2.append( acu... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 331,861 | 331,866 | u114099505 | python |
p02623 | def strToList(str,offset=0):
res = [];
for el in str.split(" "):
if el!='':
res.append(int(el)+offset)
return res
[N,M,K] = strToList(input())
A = strToList(input())
B = strToList(input())
current_time = 0
current_value = 0
iA = 0
iB = 0
while iA<N:
if current_time+A[iA]<=K:
... | def strToList(str,offset=0):
res = [];
for el in str.split(" "):
if el!='':
res.append(int(el)+offset)
return res
[N,M,K] = strToList(input())
A = strToList(input())
B = strToList(input())
current_time = 0
current_value = 0
iA = 0
iB = 0
while iA<N:
if current_time+A[iA]<=K:
... | [
"expression.operation.unary.add",
"control_flow.loop.condition.change"
] | 331,915 | 331,916 | u414040236 | python |
p02623 | import sys
N, M, K = [int(s) for s in sys.stdin.readline().split()]
n = 0
A = [0]
for s in sys.stdin.readline().split():
n = n + int(s)
A.append(n)
n = 0
B = [0]
for s in sys.stdin.readline().split():
n = n + int(s)
B.append(n)
ans = 0
for i in range(N + 1):
if A[i] > K:
break
for j i... | import sys
N, M, K = [int(s) for s in sys.stdin.readline().split()]
n = 0
A = [0]
for s in sys.stdin.readline().split():
n = n + int(s)
A.append(n)
n = 0
B = [0]
for s in sys.stdin.readline().split():
n = n + int(s)
B.append(n)
ans = 0
for i in range(N + 1):
if A[i] > K:
break
for j i... | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.unary.add",
"control_flow.loop.range.bounds.step.change",
"control_flow.break.add"
] | 331,971 | 331,970 | u081141316 | python |
p02623 | N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
totalA = [0]
totalB = [0]
sumA = 0
for i in range(N):
sumA += A[0]
totalA.append(sumA)
sumB = 0
for i in range(M):
sumB += B[0]
totalB.append(sumB)
iB = M
countMax = 0
for iA in range(N+1):
if... | N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
totalA = [0]
totalB = [0]
sumA = 0
for i in range(N):
sumA += A[i]
totalA.append(sumA)
sumB = 0
for i in range(M):
sumB += B[i]
totalB.append(sumB)
iB = M
countMax = 0
for iA in range(N+1):
if... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 331,985 | 331,986 | u310709512 | python |
p02623 | N, M, K = map(int, input().split())
A_temp = [int(i) for i in input().split()]
B_temp = [int(i) for i in input().split()]
A, B = [0]*(N+1), [0]*(M+1)
for i in range(1, N):
A[i] = A[i-1] + A_temp[i-1]
for j in range(1, M):
B[j] = B[j-1] + B_temp[j-1]
ans = 0
for a in range(N+1):
if A[a] > K:
... | N, M, K = map(int, input().split())
A_temp = [int(i) for i in input().split()]
B_temp = [int(i) for i in input().split()]
A, B = [0]*(N+1), [0]*(M+1)
for i in range(1, N+1):
A[i] = A[i-1] + A_temp[i-1]
for j in range(1, M+1):
B[j] = B[j-1] + B_temp[j-1]
ans = 0
for a in range(N+1):
if A[a] > K:
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 332,031 | 332,032 | u884323674 | python |
p02623 | import sys
readline = sys.stdin.readline
N,M,K = map(int,readline().split())
A = [0] + list(map(int,readline().split()))
B = [0] + list(map(int,readline().split()))
for i in range(1, len(A)):
A[i] += A[i - 1]
for i in range(1, len(B)):
B[i] += B[i - 1]
import bisect
ans = 0
for i in range(len(A)):
rest = ... | import sys
readline = sys.stdin.readline
N,M,K = map(int,readline().split())
A = [0] + list(map(int,readline().split()))
B = [0] + list(map(int,readline().split()))
for i in range(1, len(A)):
A[i] += A[i - 1]
for i in range(1, len(B)):
B[i] += B[i - 1]
import bisect
ans = 0
for i in range(len(A)):
rest = ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.continue.add"
] | 332,040 | 332,041 | u936985471 | python |
p02623 | n,m,k=map(int,input().split())
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
ans=chk=w=0
for i in range(n):
if k>=a[i]:
chk+=1
k-=a[i]
w=i
ans=max(ans,chk)
else:
break
for i in range(m):
if k<b[i]:
while w>=0:
if k>=b[i]:... | n,m,k=map(int,input().split())
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
ans=chk=0
w=-1
for i in range(n):
if k>=a[i]:
chk+=1
k-=a[i]
w=i
ans=max(ans,chk)
else:
break
for i in range(m):
if k<b[i]:
while w>=0:
if k>=b[... | [
"assignment.value.change",
"expression.operation.unary.add"
] | 332,073 | 332,074 | u123756661 | python |
p02623 | import sys
input = sys.stdin.readline
n,m,k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
if a[0] > k:
res = 0
for i in range(m):
if b[i] <= k:
k -= b[i]
res += 1
else:
break
print(res)
else:
cnt = 0... | import sys
input = sys.stdin.readline
n,m,k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
if a[0] > k:
res = 0
for i in range(m):
if b[i] <= k:
k -= b[i]
res += 1
else:
break
print(res)
else:
cnt = 0... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 332,084 | 332,083 | u284854859 | python |
p02623 | import sys
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
de... | import sys
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
de... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 332,123 | 332,124 | u190850294 | python |
p02623 | n,m,k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
asum = [0]*(n+1)
bsum = [0]*(m+1)
for i in range(n):
asum[i+1] = a[i] + asum[i]
for j in range(m):
bsum[i+1] = b[j] + bsum[j]
j = m
res = 0
for i in range(n+1):
if asum[i] > k:
break
while asum[i] + bsum[j] > k... | n,m,k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
asum = [0]*(n+1)
bsum = [0]*(m+1)
for i in range(n):
asum[i+1] = a[i] + asum[i]
for j in range(m):
bsum[j+1] = b[j] + bsum[j]
j = m
res = 0
for i in range(n+1):
if asum[i] > k:
break
while asum[i] + bsum[j] > k... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 332,125 | 332,126 | u638970023 | python |
p02623 | n,m,k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
sum_a = [0]
sum_b = [0]
for i in range(n):
sum_a.append(sum_a[i] + a[i])
for j in range(m):
sum_b.append(sum_b[j] + b[j])
temp = 0
j = m
ans = 0
for i in range(n+1):
if sum_a[i] > k:
temp = i... | n,m,k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
sum_a = [0]
sum_b = [0]
for i in range(n):
sum_a.append(sum_a[i] + a[i])
for j in range(m):
sum_b.append(sum_b[j] + b[j])
temp = 0
j = m
ans = 0
for i in range(n+1):
if sum_a[i] > k:
temp = i... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 332,127 | 332,128 | u110311725 | python |
p02623 | A,B,K=map(int,input().split())
List_A = list(map(int, input().split()))
List_B = list(map(int, input().split()))
SumListA=[]
SumListA.append(0)
SumListB=[]
SumListB.append(0)
res =0
a=0
for i in range(A):
SumListA.append(SumListA[i]+List_A[i])
for i in range(B):
SumListB.append(SumListB[i]+List_B[i])
j=B
for i in ... | A,B,K=map(int,input().split())
List_A = list(map(int, input().split()))
List_B = list(map(int, input().split()))
SumListA=[]
SumListA.append(0)
SumListB=[]
SumListB.append(0)
res =0
a=0
for i in range(A):
SumListA.append(SumListA[i]+List_A[i])
for i in range(B):
SumListB.append(SumListB[i]+List_B[i])
j=B
for i in ... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 332,131 | 332,132 | u113255362 | python |
p02623 | import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
n,m,k = map(int,readline().split())
a = list(map(int,readline().split()))
b = list(map(int,readline().split()))
csuma = [0]
csumb = [0]
for ai in a:
csuma.append(csuma[-1]+ai)
for bi in b... | import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
n,m,k = map(int,readline().split())
a = list(map(int,readline().split()))
b = list(map(int,readline().split()))
csuma = [0]
csumb = [0]
for ai in a:
csuma.append(csuma[-1]+ai)
for bi in b... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 332,133 | 332,134 | u747602774 | python |
p02623 | import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
n,m,k = map(int,readline().split())
a = list(map(int,readline().split()))
b = list(map(int,readline().split()))
csuma = [0]
csumb = [0]
for ai in a:
csuma.append(csuma[-1]+ai)
for bi in b... | import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
n,m,k = map(int,readline().split())
a = list(map(int,readline().split()))
b = list(map(int,readline().split()))
csuma = [0]
csumb = [0]
for ai in a:
csuma.append(csuma[-1]+ai)
for bi in b... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 332,135 | 332,134 | u747602774 | python |
p02623 | import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
n,m,k = map(int,readline().split())
a = list(map(int,readline().split()))
b = list(map(int,readline().split()))
csuma = [0]
csumb = [0]
for ai in a:
csuma.append(csuma[-1]+ai)
for bi in b... | import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
n,m,k = map(int,readline().split())
a = list(map(int,readline().split()))
b = list(map(int,readline().split()))
csuma = [0]
csumb = [0]
for ai in a:
csuma.append(csuma[-1]+ai)
for bi in b... | [
"assignment.value.change",
"expression.operation.unary.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 332,136 | 332,134 | u747602774 | python |
p02623 | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
index_a = -1
index_b = 0
num_books = 0
now_times = 0
for a in A :
if now_times + a <= K :
num_books += 1
now_times += a
index_a += 1
temp_books = num_books
temp_times = now_times
while i... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
index_a = -1
index_b = 0
num_books = 0
now_times = 0
for a in A :
if now_times + a <= K :
num_books += 1
now_times += a
index_a += 1
else :
break
temp_books = num_books
temp_times = n... | [
"control_flow.break.add"
] | 332,141 | 332,142 | u027547861 | python |
p02623 | import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce
rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: ... | import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce
rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 332,165 | 332,166 | u823885866 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.