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 |
|---|---|---|---|---|---|---|---|
p02661 | n=int(input())
l=[list(map(int,input().split())) for i in range(n)]
work1=[x[0] for x in l]
work2=[x[1] for x in l]
if n%2==1 :
mmin=work1[n//2]
mmax=work2[n//2]
else:
mmin=work1[n//2]+work1[n//2-1]
mmax=work2[n//2]+work2[n//2-1]
print(mmax-mmin+1) | n=int(input())
l=[list(map(int,input().split())) for i in range(n)]
work1=sorted([x[0] for x in l])
work2=sorted([x[1] for x in l])
if n%2==1 :
mmin=work1[n//2]
mmax=work2[n//2]
else:
mmin=work1[n//2]+work1[n//2-1]
mmax=work2[n//2]+work2[n//2-1]
print(mmax-mmin+1) | [
"call.add",
"call.arguments.change"
] | 385,779 | 385,780 | u489691149 | python |
p02661 | N = int(input())
A = []
B = []
for i in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
A.sort()
B.sort()
if(N%2 != 0):
print(B[N//2+1]-A[N//2+1]+1)
else:
print(B[N//2]+B[N//2-1] - A[N//2]-A[N//2-1] + 1) | N = int(input())
A = []
B = []
for i in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
A.sort()
B.sort()
if(N%2 != 0):
print(B[N//2]-A[N//2]+1)
else:
print(B[N//2]+B[N//2-1] - A[N//2]-A[N//2-1] + 1) | [
"expression.operation.binary.remove"
] | 385,788 | 385,789 | u995062424 | python |
p02661 | N = int(input())
A = []
B = []
for i in range(N):
a,b = map(input().split())
A.append(a)
B.append(b)
A = sorted(A)
B = sorted(B)
if N%2==1:
print(B[N//2] - A[N//2] + 1)
else:
print( (B[N//2-1]+B[N//2]) - (A[N//2-1]+A[N//2]) + 1 ) | N = int(input())
A = []
B = []
for i in range(N):
a,b = map(int, input().split())
A.append(a)
B.append(b)
A = sorted(A)
B = sorted(B)
if N%2==1:
print(B[N//2] - A[N//2] + 1)
else:
print( (B[N//2-1]+B[N//2]) - (A[N//2-1]+A[N//2]) + 1 )
| [
"call.arguments.add"
] | 385,798 | 385,799 | u882616665 | python |
p02661 | def main():
n = int(input())
A = [0]*n
B = [0]*n
for i in range(n):
a,b = map(int,input().split())
A[i] = a
B[i] = b
A.sort()
B.sort()
if n%2 == 0:
m1 = (A[n//2-1]+A[n//2])//2
m2 = (B[n//2-1]+B[n//2])//2
print(2*(m2-m1)+1)
else:
pri... | def main():
n = int(input())
A = [0]*n
B = [0]*n
for i in range(n):
a,b = map(int,input().split())
A[i] = a
B[i] = b
A.sort()
B.sort()
if n%2 == 0:
m1 = (A[n//2-1]+A[n//2])/2
m2 = (B[n//2-1]+B[n//2])/2
print(int(2*(m2-m1))+1)
else:
... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.add",
"call.arguments.change"
] | 385,814 | 385,815 | u538381817 | python |
p02661 | from statistics import median
n = int(input())
a = [None] * n
b = [None] * n
for i in range(n):
a[i], b[i] = map(int, input().split())
if n % 2 == 1:
print(median(b) - median(a) + 1)
else:
print(int(median(b) - median(a)) * 2 + 1)
| from statistics import median
n = int(input())
a = [None] * n
b = [None] * n
for i in range(n):
a[i], b[i] = map(int, input().split())
if n % 2 == 1:
print(median(b) - median(a) + 1)
else:
print(int((median(b) - median(a)) * 2) + 1) | [
"call.arguments.change"
] | 385,816 | 385,817 | u377989038 | python |
p02661 | import sys
n = int(sys.stdin.readline())
xs = []
for _ in range(n):
v = [int(x) for x in sys.stdin.readline().split(" ")]
xs.append(v) ... | import sys
n = int(sys.stdin.readline())
xs = []
for _ in range(n):
v = [int(x) for x in sy... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 385,818 | 385,819 | u200916944 | python |
p02661 | def main():
N = int(input())
A,B = [],[]
for _ in range(N):
a,b = [int(x) for x in input().split()]
A.append(a)
B.append(b)
A.sort()
B.sort()
if N % 2 == 1:
minMed = A[N/2]
maxMed = B[N/2]
print(int(maxMed-minMed)+1)
else:
minMed = A[N/... | def main():
N = int(input())
A,B = [],[]
for _ in range(N):
a,b = [int(x) for x in input().split()]
A.append(a)
B.append(b)
A.sort()
B.sort()
if N % 2 == 1:
minMed = A[N//2]
maxMed = B[N//2]
print(int(maxMed-minMed)+1)
else:
minMed = A[... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 385,824 | 385,825 | u373442126 | python |
p02661 | def solve(N, As, Bs):
# print(N)
# print(As)
# print(Bs)
As.sort()
Bs.sort()
ans = 0
# N が奇数の場合
if N % 2 == 1:
x = (N + 1) // 2 - 1
ans = Bs[x] - As[x] + 1
# N が偶数の場合
else:
lowx = N // 2 - 1
highx = N // 2
ans = (As[highx] + Bs[highx]) - (A... | # 解説を参考に作成
def solve(N, As, Bs):
As.sort()
Bs.sort()
ans = 0
# N が奇数の場合
if N % 2 == 1:
x = (N + 1) // 2 - 1
ans = Bs[x] - As[x] + 1
# N が偶数の場合
else:
lowx = N // 2 - 1
highx = N // 2
ans = (Bs[lowx] + Bs[highx]) - (As[lowx] + As[highx]) + 1
print(... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 385,828 | 385,829 | u945228737 | python |
p02661 | import statistics
import math
n = int(input())
a = []
for _ in range(n):
a.append(list(map(int,input().split())))
b = [[],[]]
for i in range(n):
b[0].append(a[i][0])
b[1].append(a[i][1])
x = statistics.median(b[0])
y = statistics.median(b[1])
if n % 2 != 0:
ans = y - x + 1
else:
ans = round(y... | import statistics
import math
n = int(input())
a = []
for _ in range(n):
a.append(list(map(int,input().split())))
b = [[],[]]
for i in range(n):
b[0].append(a[i][0])
b[1].append(a[i][1])
x = statistics.median(b[0])
y = statistics.median(b[1])
if n % 2 != 0:
ans = y - x + 1
else:
ans = round((... | [
"call.arguments.change"
] | 385,839 | 385,840 | u593019570 | python |
p02661 | n = int(input())
ab = [list(map(int, input().split())) for _ in range(n)]
ab_a = sorted(ab, key=lambda x:int(x[1]))
ab_b = sorted(ab, key=lambda x:int(x[1]))
if n%2 == 1:
print(ab_b[n//2][1]-ab_a[n//2][0]+1)
else:
print(int(((ab_b[n//2][1]+ab_b[n//2-1][1])/2.0-(ab_a[n//2][0]+ab_a[n//2-1][0])/2.0)*2+1)) | n = int(input())
ab = [list(map(int, input().split())) for _ in range(n)]
ab_a = sorted(ab, key=lambda x:int(x[0]))
ab_b = sorted(ab, key=lambda x:int(x[1]))
if n%2 == 1:
print(ab_b[n//2][1]-ab_a[n//2][0]+1)
else:
print(int(((ab_b[n//2][1]+ab_b[n//2-1][1])/2.0-(ab_a[n//2][0]+ab_a[n//2-1][0])/2.0)*2+1)) | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 385,843 | 385,844 | u207097826 | python |
p02661 | from statistics import median
def main():
N = int(input())
A = [None] * N
B = [None] * N
for i in range(N):
A[i], B[i] = map(int, input().split())
min_median = median(A)
max_median = median(B)
if N % 2 == 1:
print(max_median - min_median + 1)
else:
print(round(m... | from statistics import median
def main():
N = int(input())
A = [None] * N
B = [None] * N
for i in range(N):
A[i], B[i] = map(int, input().split())
min_median = median(A)
max_median = median(B)
if N % 2 == 1:
print(max_median - min_median + 1)
else:
print(round((... | [
"call.arguments.change"
] | 385,847 | 385,848 | u479719434 | python |
p02661 | n = int(input())
minnums = [[] for _ in range(n)]
maxnums = [[] for _ in range(n)]
for i in range(n):
minnums[i], maxnums[i] = map(int, input().split())
minnums.sort()
maxnums.sort()
if n % 2:
minmedian = minnums[n // 2]
maxmedian = maxnums[n // 2]
print(maxmedian - minmedian + 1)
else:
minmedian = (minn... | n = int(input())
minnums = [[] for _ in range(n)]
maxnums = [[] for _ in range(n)]
for i in range(n):
minnums[i], maxnums[i] = map(int, input().split())
minnums.sort()
maxnums.sort()
if n % 2:
minmedian = minnums[n // 2]
maxmedian = maxnums[n // 2]
print(maxmedian - minmedian + 1)
else:
minmedian = (minn... | [
"call.remove"
] | 385,851 | 385,852 | u932291797 | python |
p02661 | n = int( input() )
A = []
B = []
for i in range( n ):
a, b = map( int, input().split() )
A.append( a )
B.append( b )
A = sorted( A )
B = sorted( B )
if n % 2 == 0:
i = n // 2
print(( B[ i ] + B[ i - 1 ] ) - ( A[ i ] + A [ i - 1 ] ) + 1 )
else:
i = ( n + 1 ) // 2
print( B[ i ] - A[ i ] + 1 )
| n = int( input() )
A = []
B = []
for i in range( n ):
a, b = map( int, input().split() )
A.append( a )
B.append( b )
A = sorted( A )
B = sorted( B )
if n % 2 == 0:
i = n // 2
print(( B[ i ] + B[ i - 1 ] ) - ( A[ i ] + A [ i - 1 ] ) + 1 )
else:
i = ( n + 1 ) // 2 - 1
print( B[ i ] - A[ i ] + 1 )
| [
"assignment.change"
] | 385,867 | 385,868 | u699008198 | python |
p02661 | n = int( input() )
A = []
B = []
for i in range( n ):
a, b = map( int, input().split() )
A.append( a )
B.append( b )
A = sorted( A )
B = sorted( B )
if n % 2 == 0:
i = n // 2
print(( B[ i ] + B[ i - 1 ] ) - ( A[ i ] - A [ i - 1 ] ) + 1 )
else:
i = ( n + 1 ) // 2
print( B[ i ] - A[ i ] + 1 ) | n = int( input() )
A = []
B = []
for i in range( n ):
a, b = map( int, input().split() )
A.append( a )
B.append( b )
A = sorted( A )
B = sorted( B )
if n % 2 == 0:
i = n // 2
print(( B[ i ] + B[ i - 1 ] ) - ( A[ i ] + A [ i - 1 ] ) + 1 )
else:
i = ( n + 1 ) // 2 - 1
print( B[ i ] - A[ i ] + 1 )
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 385,869 | 385,868 | u699008198 | python |
p02661 | N=int(input())
a=[]
b=[]
for _ in range(N):
A,B=map(int,input().split())
a.append(A)
b.append(B)
a=sorted(a)
b=sorted(b)
if N%2==1:
print(b[N//2]-a[N//2]+1)
else:
print(int((b[N//2-1]+b[N//2])/2-(a[N//2-1]+a[N//2])/2)*2+1) | N=int(input())
a=[]
b=[]
for _ in range(N):
A,B=map(int,input().split())
a.append(A)
b.append(B)
a=sorted(a)
b=sorted(b)
if N%2==1:
print(b[N//2]-a[N//2]+1)
else:
print(int(((b[N//2-1]+b[N//2])/2-(a[N//2-1]+a[N//2])/2)*2+1)) | [
"call.arguments.change"
] | 385,927 | 385,928 | u970449052 | python |
p02661 | import bisect
n = int(input())
l = []
r = []
for i in range(n):
a, b = map(int, input().split())
l.append(a)
r.append(b)
l.sort()
r.sort(reverse=True)
if n%2 == 1:
print(r[(n-1)//2]-l[(n-1)//2]+1)
else:
l1, l2 = l[(n-2)//2], l[(n-2)//2+1]
r1, r2 = r[(n-2)//2+1], r[(n-2)//2]
d1, d2 = r1-... | import bisect
n = int(input())
l = []
r = []
for i in range(n):
a, b = map(int, input().split())
l.append(a)
r.append(b)
l.sort()
r.sort(reverse=True)
if n%2 == 1:
print(r[(n-1)//2]-l[(n-1)//2]+1)
else:
l1, l2 = l[(n-2)//2], l[(n-2)//2+1]
r1, r2 = r[(n-2)//2+1], r[(n-2)//2]
d1, d2 = r1-... | [
"expression.operation.binary.add"
] | 385,943 | 385,944 | u419877586 | python |
p02661 | # E
N = int(input())
AandB = [list(map(int, input().split())) for _ in range(N)]
A = [AandB[i][0] for i in range(N)]
B = [AandB[i][1] for i in range(N)]
A_sorted = sorted(A)
B_sorted = sorted(B)
if N % 2 != 0:
n = N // 2
a = A_sorted[n]
b = B_sorted[-(n+1)]
print(b-a+1)
else:
n = N // 2
a1 = A... | # E
N = int(input())
AandB = [list(map(int, input().split())) for _ in range(N)]
A = [AandB[i][0] for i in range(N)]
B = [AandB[i][1] for i in range(N)]
A_sorted = sorted(A)
B_sorted = sorted(B)
if N % 2 != 0:
n = N // 2
a = A_sorted[n]
b = B_sorted[-(n+1)]
print(b-a+1)
else:
n = N // 2
a1 = A... | [
"expression.operation.binary.remove"
] | 385,947 | 385,948 | u194297606 | python |
p02661 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from collections import defaultdict
def main():
n = int(input().strip())
diff_a = defaultdict(int)
diff_b = defaultdict(int)
for _ in range(n):
a, b = map(int, input().split())
diff_a[a] += 1
diff_b[b] += 1
cur = 0
for i ... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from collections import defaultdict
def main():
n = int(input().strip())
diff_a = defaultdict(int)
diff_b = defaultdict(int)
for _ in range(n):
a, b = map(int, input().split())
diff_a[a] += 1
diff_b[b] += 1
cur = 0
for i ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 385,955 | 385,956 | u388370899 | python |
p02661 | import numpy as np
N = int(input())
AB = [list(map(int, input().split())) for _ in range(N)]
AB = np.array(AB)
# 取りうる最小の中央値と最大の中央値を計算
# 偶数のときは0.5, 奇数のときは1
m = np.median(AB[:, 0])
M = np.median(AB[:, 1])
if N % 2 == 0:
print(int(M - m) * 2 + 1)
else:
print(int(M - m) + 1)
| import numpy as np
N = int(input())
AB = [list(map(int, input().split())) for _ in range(N)]
AB = np.array(AB)
# 取りうる最小の中央値と最大の中央値を計算
m = np.median(AB[:, 0])
M = np.median(AB[:, 1])
if N % 2 == 0:
print(int((M - m) * 2 + 1))
else:
print(int(M - m + 1))
| [
"call.arguments.change"
] | 385,967 | 385,968 | u815878613 | python |
p02661 | n = int(input())
AB = [tuple(map(int, input().split())) for i in range(n)]
A = [AB[i][0] for i in range(n)]
B = [AB[i][1] for i in range(n)]
# A = [(AB[i][0], i) for i in range(n)]
# B = [(AB[i][1], i) for i in range(n)]
A.sort()
B.sort()
if n % 2 == 1:
print(B[n // 2] - A[n // 2] + 1)
print(A, B)
if n % 2 == 0... | n = int(input())
AB = [tuple(map(int, input().split())) for i in range(n)]
A = [AB[i][0] for i in range(n)]
B = [AB[i][1] for i in range(n)]
# A = [(AB[i][0], i) for i in range(n)]
# B = [(AB[i][1], i) for i in range(n)]
A.sort()
B.sort()
if n % 2 == 1:
print(B[n // 2] - A[n // 2] + 1)
if n % 2 == 0:
# x = ... | [
"call.remove"
] | 385,969 | 385,970 | u731368968 | python |
p02661 | N = int(input())
A = dict()
B = dict()
for i in range(N):
a, b = map(int, input().split())
A[i] = a
B[i] = b
A_sort = sorted(A.items(), key=lambda x:x[1])
B_sort = sorted(B.items(), key=lambda x:x[1])
if N % 2 == 1:
print(B_sort[(N+1)//2-1][1]-A_sort[(N+1)//2-1][1]+1)
else:
B_min = B_sort[N//2-1][1... | N = int(input())
A = dict()
B = dict()
for i in range(N):
a, b = map(int, input().split())
A[i] = a
B[i] = b
A_sort = sorted(A.items(), key=lambda x:x[1])
B_sort = sorted(B.items(), key=lambda x:x[1])
if N % 2 == 1:
print(B_sort[(N+1)//2-1][1]-A_sort[(N+1)//2-1][1]+1)
else:
B_min = B_sort[N//2-1][1... | [
"expression.operation.unary.add",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"io.output.change"
] | 385,973 | 385,974 | u068944955 | python |
p02661 | from operator import itemgetter
import copy
n = int(input())
ab = sorted([list(map(int, input().split())) for i in range(n)])
abr = copy.copy(ab)
abr.sort(key=itemgetter(1))
if n % 2:
a1,b1 = ab[n//2]
a2,b2 = abr[n//2]
ans = b2 - a1 + 1
else:
a1,b1 = ab[n//2-1]
a2,b2 = abr[n//2-1]
a3,b3 = ab[n/... | from operator import itemgetter
import copy
n = int(input())
ab = sorted([list(map(int, input().split())) for i in range(n)])
abr = copy.copy(ab)
abr.sort(key=itemgetter(1))
if n % 2:
a1,b1 = ab[n//2]
a2,b2 = abr[n//2]
ans = b2 - a1 + 1
else:
a1,b1 = ab[n//2-1]
a2,b2 = abr[n//2-1]
a3,b3 = ab[n/... | [
"assignment.value.change",
"identifier.change"
] | 385,975 | 385,976 | u102960641 | python |
p02661 | n = int(input())
min = []
max = []
for i in range(n):
a, b = map(int, input().split())
min.append(a)
max.append(b)
min.sort()
max.sort()
if n%2 == 0:
print((max[n//2] + max[n//2 - 1]) -(min[n//2] + min[n//2 - 1])+ 1)
else:
print(max[n//2]-min[n//2]+1)
print(min) | n = int(input())
min = []
max = []
for i in range(n):
a, b = map(int, input().split())
min.append(a)
max.append(b)
min.sort()
max.sort()
if n%2 == 0:
print((max[n//2] + max[n//2 - 1]) -(min[n//2] + min[n//2 - 1])+ 1)
else:
print(max[n//2]-min[n//2]+1) | [
"call.remove"
] | 385,982 | 385,983 | u169696482 | python |
p02661 | n = int(input())
a_list = []
b_list = []
for _ in range(n):
a, b = map(int,input().split())
a_list.append(a)
b_list.append(b)
a_list.sort()
b_list.sort()
if n%2==0:
half = int(n/2)
first = (a_list[half]+a_list[half])/2
last = (b_list[half]+b_list[half])/2
print(int((last-first)/0.5)+1)
els... | n = int(input())
a_list = []
b_list = []
for _ in range(n):
a, b = map(int,input().split())
a_list.append(a)
b_list.append(b)
a_list.sort()
b_list.sort()
if n%2==0:
half = int(n/2)
first = (a_list[half-1]+a_list[half])/2
last = (b_list[half-1]+b_list[half])/2
print(int((last-first)/0.5)+1... | [
"assignment.change"
] | 385,988 | 385,989 | u711245972 | python |
p02661 | import statistics
N = int(input())
P = [[int(i) for i in input().split()] for _ in range(N)]
left = []
right = []
for i in range(N):
left.append(P[i][0])
right.append(P[i][1])
lmed = statistics.median(left)
rmed = statistics.median(right)
if N % 2 == 0:
print(int(rmed - lmed) * 2 + 1)
else:
print(... | import statistics
N = int(input())
P = [[int(i) for i in input().split()] for _ in range(N)]
left = []
right = []
for i in range(N):
left.append(P[i][0])
right.append(P[i][1])
lmed = statistics.median(left)
rmed = statistics.median(right)
if N % 2 == 0:
print(int((rmed - lmed) * 2 + 1))
else:
prin... | [
"call.arguments.change"
] | 385,990 | 385,991 | u069172538 | python |
p02661 | import sys
import math
import itertools
import collections
import heapq
import numpy as np
rl = sys.stdin.readline
n = int(rl())
a = []
b = []
for _ in range(n):
aa, bb = map(int, rl().split())
a.append(aa)
b.append(bb)
def heapsort(iterable):
h = []
for value in iterable:
heapq.heappush(h... | import sys
import math
import itertools
import collections
import heapq
import numpy as np
rl = sys.stdin.readline
n = int(rl())
a = []
b = []
for _ in range(n):
aa, bb = map(int, rl().split())
a.append(aa)
b.append(bb)
def heapsort(iterable):
h = []
for value in iterable:
heapq.heappush(h... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.add",
"call.arguments.change"
] | 385,992 | 385,993 | u823885866 | python |
p02661 | import sys
input = lambda: sys.stdin.readline().rstrip()
n = int(input())
a = []
b = []
for _ in range(n):
a_, b_ = map(int, input().split())
a.append(a_)
b.append(b_)
a.sort()
b.sort()
if n % 2 == 1:
a_m = a[n // 2]
b_m = b[n // 2]
print(b_m - a_m + 1)
else:
a_m = (a[n // 2 - 1] + a[n // 2... | import sys
input = lambda: sys.stdin.readline().rstrip()
n = int(input())
a = []
b = []
for _ in range(n):
a_, b_ = map(int, input().split())
a.append(a_)
b.append(b_)
a.sort()
b.sort()
if n % 2 == 1:
a_m = a[n // 2]
b_m = b[n // 2]
print(b_m - a_m + 1)
else:
a_m = (a[n // 2 - 1] + a[n // 2... | [
"expression.operation.binary.remove"
] | 386,010 | 386,011 | u609061751 | python |
p02661 | import statistics
import math
N = int(input())
A_B = [[int(i) for i in input().split(' ')] for n in range(N)]
t = list(zip(*A_B))
A_sta = statistics.median(t[0])
B_sta = statistics.median(t[1])
if N % 2 == 0:
count = 2 * (B_sta - A_sta + 1)
else:
count = B_sta - A_sta + 1
print(count) | import statistics
import math
N = int(input())
A_B = [[int(i) for i in input().split(' ')] for n in range(N)]
t = list(zip(*A_B))
A_sta = statistics.median(t[0])
B_sta = statistics.median(t[1])
if N % 2 == 0:
count = int(2 * (B_sta - A_sta) + 1)
else:
count = B_sta - A_sta + 1
print(count) | [
"call.add",
"call.arguments.change"
] | 386,014 | 386,015 | u067986021 | python |
p02661 | N = int(input())
listA = [0] * N
listB = [0] * N
idx = 0
for i in range(N):
listA[idx],listB[idx] = map(int, input().split())
idx += 1
medianA = 0
medianB = 0
ans = 0
if N%2 == 0:
medianA = statistics.median(listA)
medianB = statistics.median(listB)
ans = (medianB - medianA) * 2 + 1
else:
medianA = statist... | import statistics
import math
N = int(input())
listA = [0] * N
listB = [0] * N
idx = 0
for i in range(N):
listA[idx],listB[idx] = map(int, input().split())
idx += 1
medianA = 0
medianB = 0
ans = 0
if N%2 == 0:
medianA = statistics.median(listA)
medianB = statistics.median(listB)
ans = (medianB - medianA) * ... | [] | 386,036 | 386,037 | u909514237 | python |
p02661 | N=int(input())
A=[]
B=[]
for i in range(N):
a,b=map(int,input().split())
A.append(a)
B.append(b)
A.sort()
B.sort()
if N%2!=0:
n=(N+1)//2
ans=B[n-1]-A[n-1]+1
else:
n=N//2
ans1=(A[n-1]+A[n])//2
ans2=(B[n-1]+B[n])//2
ans=(ans2-ans1)*2+1
print(ans) | N=int(input())
A=[]
B=[]
for i in range(N):
a,b=map(int,input().split())
A.append(a)
B.append(b)
A.sort()
B.sort()
if N%2!=0:
n=(N+1)//2
ans=B[n-1]-A[n-1]+1
else:
n=N//2
ans1=(A[n-1]+A[n])/2
ans2=(B[n-1]+B[n])/2
ans=(ans2-ans1)*2+1
print(int(ans)) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.add",
"call.arguments.change"
] | 386,046 | 386,045 | u265506056 | python |
p02661 | n = int(input())
x = [list(map(int, input().split())) for _ in range(n)]
y = sorted(x)
z = sorted(x, key=lambda x: x[1])
if n % 2 == 1:
print(z[n//2][1] - y[n//2][0] + 1)
else:
a = y[n//2-1][0]
b = y[n//2][1]
c = z[n//2-1][0]
d = z[n//2][1]
e = (b + d) / 2
f = (a + c) / 2
print(int((e -... | n = int(input())
x = [list(map(int, input().split())) for _ in range(n)]
y = sorted(x)
z = sorted(x, key=lambda x: x[1])
if n % 2 == 1:
print(z[n//2][1] - y[n//2][0] + 1)
else:
a = y[n//2-1][0]
b = y[n//2][0]
c = z[n//2-1][1]
d = z[n//2][1]
e = (c + d) / 2
f = (a + b) / 2
print(int((e -... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"identifier.change",
"expression.operation.binary.change"
] | 386,080 | 386,081 | u653837719 | python |
p02661 | n = int(input())
x = [list(map(int, input().split())) for _ in range(n)]
y = sorted(x)
z = sorted(x, key=lambda x: x[1])
if n % 2 == 1:
print(z[n//2][1] - y[n//2][0] + 1)
else:
a = y[n//2-1][0]
b = y[n//2][0]
c = z[n//2-1][1]
d = z[n//2][1]
e = (b + d) / 2
f = (a + c) / 2
print(int((e -... | n = int(input())
x = [list(map(int, input().split())) for _ in range(n)]
y = sorted(x)
z = sorted(x, key=lambda x: x[1])
if n % 2 == 1:
print(z[n//2][1] - y[n//2][0] + 1)
else:
a = y[n//2-1][0]
b = y[n//2][0]
c = z[n//2-1][1]
d = z[n//2][1]
e = (c + d) / 2
f = (a + b) / 2
print(int((e -... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 386,082 | 386,081 | u653837719 | python |
p02661 | n=int(input())
alis=[]
blis=[]
for i in range(n):
a,b=map(int,input().split())
alis.ppend(a)
blis.append(b)
alis=sorted(alis)
blis=sorted(blis)
if n%2!=0:
print(blis[int((n-1)/2)]-alis[int((n-1)/2)]+1)
else:
bb=(blis[int(n/2)-1]+blis[int(n/2)])
aa=(alis[int(n/2)-1]+alis[int(n/2)])
print(bb-aa+1) | n=int(input())
alis=[]
blis=[]
for i in range(n):
a,b=map(int,input().split())
alis.append(a)
blis.append(b)
alis=sorted(alis)
blis=sorted(blis)
if n%2!=0:
print(blis[int((n-1)/2)]-alis[int((n-1)/2)]+1)
else:
bb=(blis[int(n/2)-1]+blis[int(n/2)])
aa=(alis[int(n/2)-1]+alis[int(n/2)])
print(bb-aa+1) | [
"identifier.change"
] | 386,106 | 386,107 | u201986772 | python |
p02661 | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n=int(input())
A,B=[0]*n,[0]*n
for i in range(n):
A[i],B[i]=map(int,input().split())
A.sort()
B.sort()
if n%2==1:
print(B[n//2]-A[n//2]+1)
else:
print(max(0,int((B[n//2-1]+B[n//2])/2-(A[n//2-1]+A... | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n=int(input())
A,B=[0]*n,[0]*n
for i in range(n):
A[i],B[i]=map(int,input().split())
A.sort()
B.sort()
if n%2==1:
print(B[n//2]-A[n//2]+1)
else:
print(int(((B[n//2-1]+B[n//2])/2-(A[n//2-1]+A[n//2... | [
"call.remove",
"call.arguments.change"
] | 386,124 | 386,125 | u810356688 | python |
p02661 | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n=int(input())
A,B=[0]*n,[0]*n
for i in range(n):
A[i],B[i]=map(int,input().split())
A.sort()
B.sort()
if n%2==1:
print(B[n//2]-A[n//2]+1)
else:
print(int((B[n//2-1]+B[n//2])/2-(A[n//2-1]+A[n//2]... | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n=int(input())
A,B=[0]*n,[0]*n
for i in range(n):
A[i],B[i]=map(int,input().split())
A.sort()
B.sort()
if n%2==1:
print(B[n//2]-A[n//2]+1)
else:
print(int(((B[n//2-1]+B[n//2])/2-(A[n//2-1]+A[n//2... | [
"call.arguments.change"
] | 386,126 | 386,125 | u810356688 | python |
p02661 | N = int(input())
A_list = [0]*N
B_list = [0]*N
for i in range(N):
A_list[i],B_list[i] = map(int,input().split())
A_list.sort()
B_list.sort()
if N%2 == 1:
print(B_list[(N+1)//2] - A_list[(N+1)//2] + 1)
else:
big = (B_list[N//2] + B_list[N//2-1])/2
small = (A_list[N//2] + A_list[N//2-1])/2
print(int... | N = int(input())
A_list = [0]*N
B_list = [0]*N
for i in range(N):
A_list[i],B_list[i] = map(int,input().split())
A_list.sort()
B_list.sort()
if N%2 == 1:
print(B_list[(N-1)//2] - A_list[(N-1)//2] + 1)
else:
big = (B_list[N//2] + B_list[N//2-1])/2
small = (A_list[N//2] + A_list[N//2-1])/2
print(int... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 386,128 | 386,129 | u698919163 | python |
p02661 | N = int(input())
A = [0] * N
B = [0] * N
for i in range(N):
A[i], B[i] = map(int, input().split())
A.sort()
B.sort()
print(A, B)
if N % 2 == 0:
n1 = N // 2 - 1
n2 = N // 2
ans = B[n1] - A[n1] + B[n2] - A[n2] + 1
print(ans)
else:
n = N // 2
ans = B[n] - A[n] + 1
print(ans) | N = int(input())
A = [0] * N
B = [0] * N
for i in range(N):
A[i], B[i] = map(int, input().split())
A.sort()
B.sort()
if N % 2 == 0:
n1 = N // 2 - 1
n2 = N // 2
ans = B[n1] - A[n1] + B[n2] - A[n2] + 1
print(ans)
else:
n = N // 2
ans = B[n] - A[n] + 1
print(ans) | [
"call.remove"
] | 386,159 | 386,160 | u364774090 | python |
p02661 | import numpy as np
N = int(input())
table = np.array([list(map(int, input().split())) for _ in range(N)])
inf, sup = np.median(table, axis=0)
diff = int(sup - inf)
if N % 2 == 0:
diff *= 2
print(diff + 1) | import numpy as np
N = int(input())
table = np.array([list(map(int, input().split())) for _ in range(N)])
inf, sup = np.median(table, axis=0)
diff = sup - inf
if N % 2 == 0:
diff *= 2
print(int(diff + 1)) | [
"call.remove",
"call.arguments.change",
"call.add"
] | 386,171 | 386,172 | u322229918 | python |
p02661 | N = int(input())
import numpy as np
A = [0]*N
B = [0]*N
for i in range(N):
A[i], B[i] = map(int,input().split())
na = np.median(A)
nb = np.median(B)
if N%2 == 1:
ans = int(nb - na + 1)
print(ans)
exit()
else:
ans = 2*int(nb - na) + 1
print(ans)
exit()
| N = int(input())
import numpy as np
A = [0]*N
B = [0]*N
for i in range(N):
A[i], B[i] = map(int,input().split())
na = np.median(A)
nb = np.median(B)
if N%2 == 1:
ans = int(nb - na + 1)
print(ans)
exit()
else:
ans = int(2*(nb - na)) + 1
print(ans)
exit()
| [
"call.add",
"call.arguments.change"
] | 386,175 | 386,176 | u503228842 | python |
p02661 | n = int(input())
a = []
b = []
for i in range(n):
ai,bi = [int(j) for j in input().split()]
a.append(ai)
b.append(bi)
a.sort()
b.sort()
if n == 1:
ans = b[0] - a[0] + 1
elif n % 2 == 1:
tg = (n+1) // 2
ans = b[-tg] + a[tg-1] + 1
else:
tg = n//2
ans = b[-tg] + b[-tg-1] - a[tg-1] - a[tg] +1
print(... | n = int(input())
a = []
b = []
for i in range(n):
ai,bi = [int(j) for j in input().split()]
a.append(ai)
b.append(bi)
a.sort()
b.sort()
if n == 1:
ans = b[0] - a[0] + 1
elif n % 2 == 1:
tg = (n+1) // 2
ans = b[-tg] - a[tg-1] + 1
else:
tg = n//2
ans = b[-tg] + b[-tg-1] - a[tg-1] - a[tg] +1
print(... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 386,184 | 386,185 | u025463382 | python |
p02661 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, co... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, co... | [
"expression.operation.binary.remove"
] | 386,190 | 386,191 | u499381410 | python |
p02661 | import sys
def input():
return sys.stdin.readline()[:-1]
n = int(input())
seg = [list(map(int, input().split())) for _ in range(n)]
a = [x[0] for x in seg]
b = [x[1] for x in seg]
a.sort()
b.sort()
if n%2 == 1:
print(b[n//2] - a[n//2] + 1)
else:
print(b[n//2] + a[n//2] - b[n//2-1] - a[n//2-1] + 1) | import sys
def input():
return sys.stdin.readline()[:-1]
n = int(input())
seg = [list(map(int, input().split())) for _ in range(n)]
a = [x[0] for x in seg]
b = [x[1] for x in seg]
a.sort()
b.sort()
if n%2 == 1:
print(b[n//2] - a[n//2] + 1)
else:
print(b[n//2] - a[n//2] + b[n//2-1] - a[n//2-1] + 1) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 386,192 | 386,193 | u218843509 | python |
p02661 | n = int(input())
bounds = [list(map(int, input().split())) for _ in range(n)]
upper = [b[1] for b in bounds]
lower = [b[0] for b in bounds]
if n % 2 == 0:
u_mid2 = upper[n // 2 - 1] + upper[n // 2]
l_mid2 = lower[n // 2 - 1] + lower[n // 2]
print(u_mid2 - l_mid2 + 1)
else:
print(upper[n // 2] - lower[n // 2] + 1)
| n = int(input())
bounds = [list(map(int, input().split())) for _ in range(n)]
upper = sorted([b[1] for b in bounds])
lower = sorted([b[0] for b in bounds])
if n % 2 == 0:
u_mid2 = upper[n // 2 - 1] + upper[n // 2]
l_mid2 = lower[n // 2 - 1] + lower[n // 2]
print(u_mid2 - l_mid2 + 1)
else:
print(upper[n // 2] - low... | [
"call.add",
"call.arguments.change"
] | 386,200 | 386,201 | u653807637 | python |
p02661 | n,*ab = map(int,open(0).read().split())
a = ab[::2]
b = ab[1::2]
a.sort()
b.sort(reverse=True)
if n%2 == 1:
med_min = a[(n-1)//2]
med_max = b[(n-1)//2]
ans = med_max - med_min + 1
else:
med_min = (a[n//2-1] + a[n//2] ) //2
med_max = (b[n//2-1] + b[n//2] ) //2
ans = (med_max - med_min)*2 + 1
pr... | n,*ab = map(int,open(0).read().split())
a = ab[::2]
b = ab[1::2]
a.sort()
b.sort(reverse=True)
if n%2 == 1:
med_min = a[(n-1)//2]
med_max = b[(n-1)//2]
ans = med_max - med_min + 1
else:
med_min = (a[n//2-1] + a[n//2] ) /2
med_max = (b[n//2-1] + b[n//2] ) /2
ans = (med_max - med_min)*2 + 1
prin... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.add",
"call.arguments.change"
] | 386,208 | 386,207 | u867320886 | python |
p02661 | import math
import fractions
import collections
import itertools
import pprint
N=int(input())
l=[list(map(int,input().split())) for _ in range(N)]
l1=[]
l2=[]
for i in range(N):
l1.append(l[i][0])
l2.append(l[i][1])
l1.sort()
l2.sort()
if N%2==0:
minmed=(l1[N//2]+l1[N//2-1])//2
maxmed=(l2[N//2]+l2[N//2-... | import math
import fractions
import collections
import itertools
import pprint
N=int(input())
l=[list(map(int,input().split())) for _ in range(N)]
l1=[]
l2=[]
for i in range(N):
l1.append(l[i][0])
l2.append(l[i][1])
l1.sort()
l2.sort()
if N%2==0:
minmed=(l1[N//2]+l1[N//2-1])/2
maxmed=(l2[N//2]+l2[N//2-1... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.add",
"call.arguments.change"
] | 386,211 | 386,212 | u995004106 | python |
p02661 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**7)
from pprint import pprint as pp
from pprint import pformat as pf
# @pysnooper.snoop()
#import pysnooper # debug
import math
#from sortedcontainers import SortedList, SortedDict, SortedSet # no in atcoder
import bisect
if __name__ ... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**7)
from pprint import pprint as pp
from pprint import pformat as pf
# @pysnooper.snoop()
#import pysnooper # debug
import math
#from sortedcontainers import SortedList, SortedDict, SortedSet # no in atcoder
import bisect
if __name__ ... | [
"assignment.change"
] | 386,221 | 386,222 | u060894033 | python |
p02661 | def resolve():
n = int(input())
low = []
high = []
for i in range(n):
a,b = map(int, input().split())
low.append(a)
high.append(b)
low.sort()
high.sort()
if n % 2:
print(high[(n+1)//2-1] - low[(n+1)//2-1] + 1)
else:
hh = (high[(n)//2-1] + high[(n)... | def resolve():
n = int(input())
low = []
high = []
for i in range(n):
a,b = map(int, input().split())
low.append(a)
high.append(b)
low.sort()
high.sort()
if n % 2:
print(high[(n+1)//2-1] - low[(n+1)//2-1] + 1)
else:
hh = (high[(n)//2-1] + high[(n)... | [
"call.arguments.change"
] | 386,227 | 386,228 | u298297089 | python |
p02661 | def getN():
return int(input())
def getNM():
return map(int, input().split())
def getList():
return list(map(int, input().split()))
from collections import defaultdict, deque
from sys import exit
import math
import copy
from bisect import bisect_left, bisect_right
from heapq import *
import sys
# sys.setre... | def getN():
return int(input())
def getNM():
return map(int, input().split())
def getList():
return list(map(int, input().split()))
from collections import defaultdict, deque
from sys import exit
import math
import copy
from bisect import bisect_left, bisect_right
from heapq import *
import sys
# sys... | [
"call.arguments.change"
] | 386,233 | 386,234 | u827202523 | python |
p02661 | def getN():
return int(input())
def getNM():
return map(int, input().split())
def getList():
return list(map(int, input().split()))
from collections import defaultdict, deque
from sys import exit
import math
import copy
from bisect import bisect_left, bisect_right
from heapq import *
import sys
# sys.setre... | def getN():
return int(input())
def getNM():
return map(int, input().split())
def getList():
return list(map(int, input().split()))
from collections import defaultdict, deque
from sys import exit
import math
import copy
from bisect import bisect_left, bisect_right
from heapq import *
import sys
# sys... | [
"call.arguments.change"
] | 386,235 | 386,234 | u827202523 | python |
p02661 | N = int(input())
A = [tuple(map(int, input().split())) for _ in range(N)]
B = A[:]
A.sort(key=lambda x: x[0])
B.sort(key=lambda x: x[1])
if N%2:
print(B[N//2][1] - A[N//2][0] + 1)
else:
print((A[N//2][1] + B[N//2-1][1]) - (B[N//2][0] + A[N//2-1][0])+1) |
N = int(input())
A = [tuple(map(int, input().split())) for _ in range(N)]
B = A[:]
A.sort(key=lambda x: x[0])
B.sort(key=lambda x: x[1])
if N%2:
print(B[N//2][1] - A[N//2][0] + 1)
else:
print((B[N//2][1] + B[N//2-1][1]) - (A[N//2][0] + A[N//2-1][0])+1) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 386,245 | 386,246 | u735891571 | python |
p02661 | N = int(input())
A, B = [], []
for i in range(N):
tm, p = map(int, input().split())
A.append(tm), B.append(p)
A.sort(), B.sort()
a = A[N // 2] * 2 if N % 2 == 1 else A[N // 2 - 1] + A[N // 2]
b = B[N // 2] * 2 if N % 2 == 1 else B[N // 2 - 1] + B[N // 2]
print(b - a + 1 if N % 2 == 1 else b - a + 1)
| N = int(input())
A, B = [], []
for i in range(N):
tm, p = map(int, input().split())
A.append(tm), B.append(p)
A.sort(), B.sort()
a = A[N // 2] * 2 if N % 2 == 1 else A[N // 2 - 1] + A[N // 2]
b = B[N // 2] * 2 if N % 2 == 1 else B[N // 2 - 1] + B[N // 2]
print((b - a) // 2 + 1 if N % 2 == 1 else b - a + 1)
| [
"call.arguments.change"
] | 386,247 | 386,248 | u651109406 | python |
p02661 | import sys
input = sys.stdin.readline
n = int(input())
a = []
b = []
for i in range(n):
ai, bi = map(int, input().split())
a.append(ai)
b.append(bi)
a.sort()
b.sort()
if n % 2 == 1:
am = a[n // 2]
bm = b[n // 2]
ans = abs(bm - am) + 1
else:
am1 = a[n // 2 - 1]
am2 = a[n//2]
bm1 = b[n... | import sys
input = sys.stdin.readline
n = int(input())
a = []
b = []
for i in range(n):
ai, bi = map(int, input().split())
a.append(ai)
b.append(bi)
a.sort()
b.sort()
if n % 2 == 1:
am = a[n // 2]
bm = b[n // 2]
ans = abs(bm - am) + 1
else:
am1 = a[n // 2 - 1]
am2 = a[n//2]
bm1 = b[n... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 386,253 | 386,254 | u891217808 | python |
p02661 | N = int(input())
A = []
B = []
for _ in range(N):
a,b = map(int,input().split())
A.append(a)
B.append(b)
A.sort()
B.sort(reverse=True)
#print(A,B)
if N % 2 == 1:
x = (N+1) // 2
ans = B[x-1] - A[x-1] + 1
else:
x = N // 2
ans = (B[x-1]-B[x]) - (A[x-1]-A[x]) + 1
print(ans) | N = int(input())
A = []
B = []
for _ in range(N):
a,b = map(int,input().split())
A.append(a)
B.append(b)
A.sort()
B.sort(reverse=True)
#print(A,B)
if N % 2 == 1:
x = (N+1) // 2
ans = B[x-1] - A[x-1] + 1
else:
x = N // 2
ans = (B[x-1] + B[x]) - (A[x] + A[x-1]) + 1
print(ans) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 386,257 | 386,258 | u183896397 | python |
p02661 | N = int(input())
A = []
B = []
for i in range(N):
a,b = map(int,input().split())
A.append(a)
B.append(b)
A.sort()
B.sort()
if N%2==1:
min_X = A[(N+1)//2-1]
max_X = B[(N+1)//2-1]
print(max_X - min_X + 1)
else:
min_X = (A[N//2-1] + A[N//2])//2
max_X = (B[N//2-1] + B[N//2])//2
print(... | N = int(input())
A = []
B = []
for i in range(N):
a,b = map(int,input().split())
A.append(a)
B.append(b)
A.sort()
B.sort()
if N%2==1:
min_X = A[(N+1)//2-1]
max_X = B[(N+1)//2-1]
print(max_X - min_X + 1)
else:
min_X = (A[N//2-1] + A[N//2])/2
max_X = (B[N//2-1] + B[N//2])/2
print(in... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.add",
"call.arguments.change"
] | 386,259 | 386,260 | u139682473 | python |
p02661 | #!/usr/bin/env python3
def main():
N = int(input())
A = [None] * N
B = [None] * N
for i in range(N):
A[i], B[i] = map(int, input().split())
A.sort()
B.sort()
if N % 2 == 1:
print(B[(N-1)//2] - A[(N-1)//2] + 1)
else:
print(B[N//2]+A[N//2] - B[N//2-1] - A[N//2-1] ... | #!/usr/bin/env python3
def main():
N = int(input())
A = [None] * N
B = [None] * N
for i in range(N):
A[i], B[i] = map(int, input().split())
A.sort()
B.sort()
if N % 2 == 1:
print(B[(N-1)//2] - A[(N-1)//2] + 1)
else:
print(B[N//2]-A[N//2] +B[N//2-1]-A[N//2-1] + 1... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 386,263 | 386,264 | u086503932 | python |
p02661 | n = int(input())
la = []
lb = []
for i in range(n):
a,b = map(int,input().split())
la.append(a)
lb.append(b)
la.sort()
lb.sort()
if n % 2 != 0:
left = la[n//2]
right = lb[n//2]
print(right-left+1)
else:
left = (la[n//2]+la[n//2-1])/2
right = (lb[n//2]+lb[n//2-1])/2
print(int(right-l... | n = int(input())
la = []
lb = []
for i in range(n):
a,b = map(int,input().split())
la.append(a)
lb.append(b)
la.sort()
lb.sort()
if n % 2 != 0:
left = la[n//2]
right = lb[n//2]
print(right-left+1)
else:
left = (la[n//2]+la[n//2-1])/2
right = (lb[n//2]+lb[n//2-1])/2
print(int((right-... | [
"call.arguments.change"
] | 386,265 | 386,266 | u368796742 | python |
p02661 | import sys
def solve_even(n, aaa, bbb):
li = n // 2 - 1
ri = n // 2
aaa.sort()
bbb.sort()
ll = aaa[li]
lr = aaa[ri]
rl = bbb[li]
rr = bbb[ri]
return (rr + lr) - (rl + ll) + 1
def solve_odd(n, aaa, bbb):
k = n // 2
aaa.sort()
bbb.sort()
return bbb[k] - aaa[k] + 1
... | import sys
def solve_even(n, aaa, bbb):
li = n // 2 - 1
ri = n // 2
aaa.sort()
bbb.sort()
ll = aaa[li]
lr = aaa[ri]
rl = bbb[li]
rr = bbb[ri]
return (rl + rr) - (lr + ll) + 1
def solve_odd(n, aaa, bbb):
k = n // 2
aaa.sort()
bbb.sort()
return bbb[k] - aaa[k] + 1
... | [
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 386,288 | 386,289 | u340781749 | python |
p02661 | def examA():
A, B = LI()
ans = A*B
print(ans)
return
def examB():
N = I()
A = LI()
for a in A:
if a==0:
print(0)
return
ans = 1
for a in A:
ans *= a
if ans>10**18:
print(-1)
return
print(ans)
return
def... | def examA():
A, B = LI()
ans = A*B
print(ans)
return
def examB():
N = I()
A = LI()
for a in A:
if a==0:
print(0)
return
ans = 1
for a in A:
ans *= a
if ans>10**18:
print(-1)
return
print(ans)
return
def... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.add",
"call.arguments.change"
] | 386,292 | 386,293 | u638795007 | python |
p02661 | n = int(input())
a = []
b = []
for i in range(n):
x,y = map(int, input().split())
a.append(x)
b.append(y)
a.sort()
b.sort()
if n%2:
mid_min = a[n//2]
mid_max = b[n//2]
print(mid_max-mid_min+1)
else:
mid_min = (a[n//2-1]+a[n//2])/2
mid_max = (b[n//2-1]+b[n//2])/2
print(int(mid_max-mid... | n = int(input())
a = []
b = []
for i in range(n):
x,y = map(int, input().split())
a.append(x)
b.append(y)
a.sort()
b.sort()
if n%2:
mid_min = a[n//2]
mid_max = b[n//2]
print(mid_max-mid_min+1)
else:
mid_min = (a[n//2-1]+a[n//2])/2
mid_max = (b[n//2-1]+b[n//2])/2
print(int((mid_max-mi... | [
"call.arguments.change"
] | 386,296 | 386,297 | u923279197 | python |
p02661 | N = int(input())
A, B = [], []
for _ in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
if N%2==1:
n = N//2
print(sorted(B, reverse=True)[n]-sorted(A)[n]+1)
exit()
l, r = (N-2)//2, N//2
A.sort()
B.sort()
print(A[r]-A[l]+B[r]-B[l]+1)
| N = int(input())
A, B = [], []
for _ in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
if N%2==1:
n = N//2
print(sorted(B, reverse=True)[n]-sorted(A)[n]+1)
exit()
l, r = (N-2)//2, N//2
A.sort()
B.sort()
print(-A[r]-A[l]+B[r]+B[l]+1)
| [
"expression.operation.unary.add",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"io.output.change"
] | 386,300 | 386,301 | u467736898 | python |
p02662 | import numpy as np
import sys
input = sys.stdin.readline
def main():
n, s = map(int, input().split())
A = [int(i) for i in input().split()]
MOD = 998244353
dp = np.zeros(s + 1, dtype="int32")
dp[0] = 1
for a in A:
p = (dp * 2) % MOD
p %= MOD
p[a:] += dp[:a]
d... | import numpy as np
import sys
input = sys.stdin.readline
def main():
n, s = map(int, input().split())
A = np.array([int(i) for i in input().split()])
MOD = 998244353
dp = np.zeros(s + 1, dtype="int32")
dp[0] = 1
for a in A:
p = (dp * 2) % MOD
p %= MOD
p[a:] += dp[:-a... | [
"call.add",
"call.arguments.change",
"expression.operation.unary.add"
] | 386,423 | 386,424 | u307622233 | python |
p02662 | import numpy as np
import sys
input = sys.stdin.readline
def main():
n, s = map(int, input().split())
A = [int(i) for i in input().split()]
MOD = 998244353
dp = np.zeros(s + 1, dtype="int32")
dp[0] = 1
for a in A:
p = (dp * 2) % MOD
p %= MOD
p[a:] += dp[:a]
d... | import numpy as np
import sys
input = sys.stdin.readline
def main():
n, s = map(int, input().split())
A = [int(i) for i in input().split()]
MOD = 998244353
dp = np.zeros(s + 1, dtype="int32")
dp[0] = 1
for a in A:
p = (dp * 2) % MOD
p %= MOD
p[a:] += dp[:-a]
... | [
"expression.operation.unary.add"
] | 386,423 | 386,425 | u307622233 | python |
p02662 | import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bise... | import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bise... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 386,502 | 386,503 | u201387466 | python |
p02662 | import numpy as np
n,s,*a=map(int,open(0).read().split())
mod=998244353
d=np.zeros(s+1,dtype=np.int64)
d[0]=1
for x in a:
p=d*2
p[x:]+=d[:s-x+1]
p%=mod
d=p
print(d[-1]) | import numpy as np
n,s,*a=map(int,open(0).read().split())
mod=998244353
d=np.zeros(s+1,dtype=np.int64)
d[0]=1
for x in a:
p=d*2
if x<=s:
p[x:]+=d[:s-x+1]
p%=mod
d=p
print(d[-1]) | [
"control_flow.branch.if.add"
] | 386,524 | 386,525 | u670180528 | python |
p02662 | mod = 998244353
n, s = map(int, input().split())
dp = np.zeros((n+1, s+1), dtype=int)
dp[0, 0] = 1
for i, a in enumerate(map(int, input().split())):
dp[i+1] = dp[i] * 2 % mod
dp[i+1][a:] = (dp[i+1][a:] + dp[i][:-a]) % mod
print(dp[-1, -1]) | import numpy as np
mod = 998244353
n, s = map(int, input().split())
dp = np.zeros((n+1, s+1), dtype=int)
dp[0, 0] = 1
for i, a in enumerate(map(int, input().split())):
dp[i+1] = dp[i] * 2 % mod
dp[i+1][a:] = (dp[i+1][a:] + dp[i][:-a]) % mod
print(dp[-1, -1]) | [] | 386,565 | 386,566 | u686230543 | python |
p02662 | import sys
from collections import defaultdict
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in ran... | import sys
from collections import defaultdict
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in ran... | [
"assignment.change"
] | 386,583 | 386,584 | u353797797 | python |
p02662 | def resolve():
n, s = map(int, input().split())
a = list(map(int, input().split()))
mod = 998244353
dp = [0] * (s + 1)
dp[0] = 1
for i in a:
for j in range(s - i, -1, -1):
dp[j + i] = dp[j + i] * 2 + dp[j]
dp[j + i] %= mod
for j in range(min(i, s + 2)):
... | def resolve():
n, s = map(int, input().split())
a = list(map(int, input().split()))
mod = 998244353
dp = [0] * (s + 1)
dp[0] = 1
for i in a:
for j in range(s - i, -1, -1):
dp[j + i] = dp[j + i] * 2 + dp[j]
dp[j + i] %= mod
for j in range(min(i, s + 1)):
... | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 386,620 | 386,621 | u762540523 | python |
p02662 | import sys
input=sys.stdin.readline
def calc():
mod=998244353
n,s=map(int,input().split())
arr=list(map(int,input().split()))
dp=[0]*(s+1)
dp[0]=1
ans=0
for i in range(1,n+1):
val=arr[i-1]
for k in range(s,-1,-1):
dp[k]*=2
dp[k]%=mod
if k>=val and dp[k-val]!=0:
dp[k]+=dp... | import sys
input=sys.stdin.readline
def calc():
mod=998244353
n,s=map(int,input().split())
arr=list(map(int,input().split()))
dp=[0]*(s+1)
dp[0]=1
ans=0
for i in range(1,n+1):
val=arr[i-1]
for k in range(s,-1,-1):
dp[k]*=2
dp[k]%=mod
if k>=val and dp[k-val]!=0:
dp[k]+=dp... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 386,631 | 386,632 | u163320134 | python |
p02662 | n, s = map(int, input().split())
a = list(map(int, input().split()))
mod = 998244353
pows = [1]
for i in range(10000):
pows.append((pows[-1] * 2) % mod)
dp = [0] * (s + 1)
dp[0] = 1
if a[0] <= s:
dp[a[0]] = 1
for i in range(1, n):
dp_new = [0] * (s + 1)
dp_new[0] = 1
for j in range(1, s + 1):
... | n, s = map(int, input().split())
a = list(map(int, input().split()))
mod = 998244353
pows = [1]
for i in range(10000):
pows.append((pows[-1] * 2) % mod)
dp = [0] * (s + 1)
dp[0] = 1
if a[0] <= s:
dp[a[0]] = 1
for i in range(1, n):
dp_new = [0] * (s + 1)
dp_new[0] = 1
for j in range(1, s + 1):
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 386,633 | 386,634 | u470542271 | python |
p02662 | MOD = 998244353
N, S = map(int, input().split())
A = list(map(int, input().split()))
dp = [[0 for j in range(S+1)] for i in range(N+1)] #dp[i][j] = i番目まで見て重さjのものを取る方法
dp[0][0] = 1
# for i in range(N):
# for j in range(S+1):
# dp[i+1][j] += 2*dp[i][j]
# dp[i+1][j] %= MOD
# if j + A[i] <= S:... | MOD = 998244353
N, S = map(int, input().split())
A = list(map(int, input().split()))
dp = [[0 for j in range(S+1)] for i in range(N+1)] #dp[i][j] = i番目まで見て重さjのものを取る方法
dp[0][0] = 1
# for i in range(N):
# for j in range(S+1):
# dp[i+1][j] += 2*dp[i][j]
# dp[i+1][j] %= MOD
# if j + A[i] <= S:... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 386,758 | 386,759 | u539969758 | python |
p02662 | class Inv:
def __init__(s, mod):
s.MOD = mod
def modpow(s, a, n):
res = 1
while n > 0:
if n & 1:
res = res * a % s.MOD
a = a * a % s.MOD
n >>= 1
return res
def invx(s, a):
return s.modpow(a, s.MOD - 2)
def invpowL(s, a, n): # a^-x (0 <= x <= n)リスト
ia = s.invx(a)... | class Inv:
def __init__(s, mod):
s.MOD = mod
def modpow(s, a, n):
res = 1
while n > 0:
if n & 1:
res = res * a % s.MOD
a = a * a % s.MOD
n >>= 1
return res
def invx(s, a):
return s.modpow(a, s.MOD - 2)
def invpowL(s, a, n): # a^-x (0 <= x <= n)リスト
ia = s.invx(a)... | [
"control_flow.continue.add"
] | 386,782 | 386,783 | u456353530 | python |
p02662 | # -*- coding: utf-8 -*-
import sys
import numpy as np
N,S, *A = map(int, sys.stdin.buffer.read().split())
mod = 998244353
A = sorted(A)
answer = np.zeros(S+1).astype(np.int64) # [0 for _ in range(S+1)]
power2 = 1
total = 0
for a in A:
total = min(S,a+total)
answer[a+1:total+1] = (2*answer[a+1:total+1]+answer[1:t... | # -*- coding: utf-8 -*-
import sys
import numpy as np
N,S, *A = map(int, sys.stdin.buffer.read().split())
mod = 998244353
A = sorted(A)
answer = np.zeros(3002).astype(np.int64)
power2 = 1
total = 0
for a in A:
total = min(3001,a+total)
answer[a+1:total+1] = (2*answer[a+1:total+1]+answer[1:total-a+1])%mod
answe... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 386,798 | 386,799 | u249218427 | python |
p02662 | n,s,*a=map(int,open().read().split());d=[0]*-~s;m=998244353;v=pow(2,m-2,m);d[0]=pow(2,n,m)
for i in a:
for j in range(s,i-1,-1):d[j]+=(d[j-i]*v)%m
print(d[s]) | n,s,*a=map(int,open(0).read().split());d=[0]*-~s;m=998244353;v=pow(2,m-2,m);d[0]=pow(2,n,m)
for i in a:
for j in range(s,i-1,-1):d[j]+=(d[j-i]*v)%m
print(d[s]%m) | [
"call.arguments.change"
] | 386,812 | 386,813 | u227082700 | python |
p02660 | from collections import defaultdict
N = int(input())
d = defaultdict(int)
tmp = N
for i in range(2, int(math.sqrt(N))+1):
while tmp % i == 0:
d[i] += 1
tmp /= i
if tmp > 1:
d[tmp] += 1
ans = 0
for key, value in d.items():
i = value
j = 1
while value >= j:
ans += 1
valu... | import math
from collections import defaultdict
N = int(input())
d = defaultdict(int)
tmp = N
for i in range(2, int(math.sqrt(N))+1):
while tmp % i == 0:
d[i] += 1
tmp /= i
if tmp > 1:
d[tmp] += 1
ans = 0
for key, value in d.items():
i = value
j = 1
while value >= j:
ans += 1... | [] | 386,844 | 386,845 | u514401521 | python |
p02660 | def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
cnt += 1
temp //= i
arr.append([i, cnt])
if temp != 1:
arr.append([temp, 1])
if arr ==... | def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
cnt += 1
temp //= i
arr.append([i, cnt])
if temp != 1:
arr.append([temp, 1])
if arr ==... | [
"call.remove"
] | 386,848 | 386,849 | u880400515 | python |
p02660 | #import math
#=input()
n=int(input())
#a,b=map(float,input().split())
#=list(map(int,input().split()))
#=[list(map(int,input().split())) for _ in range()]
import collections
def pf(x):
a = []
while x % 2 == 0:
a.append(2)
x //= 2
f = 3
while f ** 2 <= x:
if x % f == 0:
... | #import math
#=input()
n=int(input())
#a,b=map(float,input().split())
#=list(map(int,input().split()))
#=[list(map(int,input().split())) for _ in range()]
import collections
def pf(x):
a = []
while x % 2 == 0:
a.append(2)
x //= 2
f = 3
while f ** 2 <= x:
if x % f == 0:
... | [
"literal.number.integer.change",
"assignment.value.change"
] | 386,858 | 386,859 | u957098479 | python |
p02660 | from math import floor,sqrt
N=int(input())
p = [1]*floor(sqrt(10**6))
p[0]=p[1]=0
prime=[]
for i in range(2,len(p)):
if p[i]==0:
continue
prime.append(i)
for j in range(i*2,len(p),i):
p[j]=0
ans=0
for x in prime:
if N%x!=0:
continue
cnt=0
while N%x==0:
cnt+=1
... | from math import floor,sqrt
N=int(input())
p = [1]*floor((10**6))
p[0]=p[1]=0
prime=[]
for i in range(2,len(p)):
if p[i]==0:
continue
prime.append(i)
for j in range(i*2,len(p),i):
p[j]=0
ans=0
for x in prime:
if N%x!=0:
continue
cnt=0
while N%x==0:
cnt+=1
... | [
"call.arguments.change"
] | 386,860 | 386,861 | u667854389 | python |
p02660 | # ANSHUL GAUTAM
# IIIT-D
from math import *
from copy import * # ll = deepcopy(l)
from heapq import * # heappush(hp,x)
from string import * # alpha = ascii_lowercase
from random import * # l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from bisect import * # bisect_left(arr,x,st... | # ANSHUL GAUTAM
# IIIT-D
from math import *
from copy import * # ll = deepcopy(l)
from heapq import * # heappush(hp,x)
from string import * # alpha = ascii_lowercase
from random import * # l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from bisect import * # bisect_left(arr,x,st... | [
"control_flow.loop.condition.change"
] | 386,862 | 386,863 | u056977516 | python |
p02660 | def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr... | def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 386,864 | 386,865 | u291028869 | python |
p02660 | import collections
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if a... | def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 386,866 | 386,865 | u291028869 | python |
p02660 | def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr... | def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 386,873 | 386,874 | u155604571 | python |
p02660 | #素因数分解
# order O(log(N)*N**0.5)?
def fact(A): #fact(int A)
c0 = A
r = 2
lis = []
count = 1
while A != 1:
if A%r == 0:
A = A//r
lis.append(r)
r = 2
else:
r += 1
if r > int(pow(c0,0.5))+1:
lis.append(A)
bre... | #素因数分解
# order O(log(N)*N**0.5)?
def fact(A): #fact(int A)
c0 = A
r = 2
lis = []
count = 1
while A != 1:
if A%r == 0:
A = A//r
lis.append(r)
r = 2
else:
r += 1
if r > int(pow(c0,0.5))+1:
lis.append(A)
bre... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 386,886 | 386,887 | u614181788 | python |
p02660 | import sys
if __name__ == '__main__':
val = int(input().strip())
arr = []
i = 2
while i < int(val ** 0.5 + 1):
if val % i == 0:
arr.append(i)
val //= i
continue
i += 1
arr.append(val)
count = 0
cur_val = 0
for e in arr:
... | import sys
if __name__ == '__main__':
val = int(input().strip())
arr = []
i = 2
while i < int(val ** 0.5 + 1):
if val % i == 0:
arr.append(i)
val //= i
continue
i += 1
if val != 1:
arr.append(val)
count = 0
cur_val = 0
... | [
"control_flow.branch.if.add"
] | 386,890 | 386,891 | u806698335 | python |
p02660 | n=int(input())
#xの約数を列挙する
def divisor(x):
ans=set([])
i=2
while(i*i<=x):
if(x%i==0):
ans.add(i)
ans.add(x//i)
i+=1
ans=sorted(list(ans))
return ans
div_n=divisor(n)
#print(div_n)
prime_n=[]
isprime=[True for _ in range(len(div_n))]
for i in range(len(div_n)... | n=int(input())
#xの約数を列挙する
def divisor(x):
ans=set([])
i=1
while(i*i<=x):
if(x%i==0):
ans.add(i)
ans.add(x//i)
i+=1
ans=sorted(list(ans))
return ans
div_n=divisor(n)[1:]
#print(div_n)
prime_n=[]
isprime=[True for _ in range(len(div_n))]
for i in range(len(di... | [
"literal.number.integer.change",
"assignment.value.change"
] | 386,903 | 386,904 | u010090035 | python |
p02660 | N = int(input())
import collections
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
c = c... | N = int(input())
import collections
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
c = c... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 386,905 | 386,906 | u761638117 | python |
p02660 | def fa(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n,... | def fa(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n,... | [
"call.arguments.change",
"identifier.change",
"io.output.change"
] | 386,917 | 386,918 | u968846084 | python |
p02660 | def prime(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return list(set(a))
x=int(input())
p=prime(x)
s=0
for j in p:
... | def prime(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return list(set(a))
x=int(input())
p=prime(x)
s=0
for j in p:
... | [
"call.remove"
] | 386,919 | 386,920 | u263753244 | python |
p02663 | h = list(map(int, input().split()))
if h[1] > h[3]:
print((h[2]-h[0])*60+h[3]-h[1]-h[4])
else:
print((h[2]-h[0]-1)*60+60-h[3]+h[1]-h[4])
| h = list(map(int, input().split()))
if h[1] < h[3]:
print((h[2]-h[0])*60+h[3]-h[1]-h[4])
else:
print((h[2]-h[0]-1)*60+60-h[1]+h[3]-h[4])
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 386,928 | 386,929 | u289288647 | python |
p02663 | H1, M1, H2, M2, K = map(int, input())
m1 = 60*H1 + M1
m2 = 60*H2 + M2
print(m2-m1-K)
| H1, M1, H2, M2, K = map(int, input().split())
m1 = 60*H1 + M1
m2 = 60*H2 + M2
print(m2-m1-K)
| [
"call.add"
] | 386,932 | 386,933 | u874320250 | python |
p02663 | h1,m1,h2,m2,k = map(int, input().split())
print(max(h2*60+m2 - h1*60+m1 - k, 0)) | h1,m1,h2,m2,k = map(int, input().split())
print(max((h2*60+m2) - (h1*60+m1) - k, 0)) | [
"call.arguments.change"
] | 386,934 | 386,935 | u618251217 | python |
p02663 | a,b,c,d,e = map(int,input().split())
x = abs(a - c) * 60 - e
if x < 0:
print(0)
else:
print(x) | a,b,c,d,e = map(int,input().split())
x = abs(a - c) * 60 - b + d - e
if x < 0:
print(0)
else:
print(x) | [
"assignment.change"
] | 386,942 | 386,943 | u369630760 | python |
p02663 | h1, m1, h2, m2, k = map(int, input().split())
h = h2 - h1
if m1>m2:
h-=1
m = m2 - m1 + 60
else:
m = m2 - m1
l = h*60 + m - k | h1, m1, h2, m2, k = map(int, input().split())
h = h2 - h1
if m1>m2:
h-=1
m = m2 - m1 + 60
else:
m = m2 - m1
l = h*60 + m - k
print(l) | [
"call.add"
] | 386,950 | 386,951 | u773081031 | python |
p02663 | h1, m1, h2, m2, k = map(int, input().split())
l = (60 * h2 + m2) -(60 * h1 + m2)
ans = l - k
print(ans) | h1, m1, h2, m2, k = map(int, input().split())
l = (60 * h2 + m2) -(60 * h1 + m1)
ans = l - k
print(ans) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 386,952 | 386,953 | u078276601 | python |
p02663 | i = list(map(int, input().split()))
print((i[2]-i[0])*60-(i[3]-i[1])-i[4]) | i = list(map(int, input().split()))
print((i[2]-i[0])*60+(i[3]-i[1])-i[4]) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 386,963 | 386,964 | u578501242 | python |
p02663 | def resolve():
h1,m1,h2,m2,k = map(int,input().split())
T = h2*60 + m2 - (h1*60 - m1)
print(T-k)
resolve() |
def resolve():
h1,m1,h2,m2,k = map(int,input().split())
T = h2*60 + m2 - (h1*60 + m1)
print(T-k)
resolve() | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 386,968 | 386,969 | u307592354 | python |
p02663 | string = input()
nums = string.split(' ')
hour = int(nums[2]) - int(nums[0])
minute = int(nums[1]) - int(nums[3])
time = hour * 60 + minute - int(nums[4])
print(time) | string = input()
nums = string.split(' ')
hour = int(nums[2]) - int(nums[0])
minute = int(nums[3]) - int(nums[1])
time = hour * 60 + minute - int(nums[4])
print(time)
| [
"expression.operation.binary.remove"
] | 386,970 | 386,971 | u912147518 | python |
p02663 | def solve():
H1, M1, H2, M2, K = map(int, input().split())
print((H2*60 + M2) - (H1*60 + M2) - K)
if __name__ == '__main__':
solve()
| def solve():
H1, M1, H2, M2, K = map(int, input().split())
print((H2*60 + M2) - (H1*60 + M1) - K)
if __name__ == '__main__':
solve()
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 386,974 | 386,975 | u739360929 | python |
p02663 | H1, M1, H2, M2, K = list(map(int,input().split()))
a = 60*H1 + M1
b = 60*H2 + M2
print(b - a - p) | H1, M1, H2, M2, K = list(map(int,input().split()))
a = 60*H1 + M1
b = 60*H2 + M2
print(b - a - K) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 386,988 | 386,989 | u699944218 | python |
p02662 | import sys
import numpy as np
n, s, *aaa = map(int, sys.stdin.buffer.read().split())
MOD = 998244353
dp = np.zeros(s + 1, np.int64)
dp[0] = 1
for a in aaa:
ndp = dp * 2 % MOD
if a > s:
continue
ndp[a:] += dp[:-a]
dp = ndp % MOD
print(dp[s])
| import sys
import numpy as np
n, s, *aaa = map(int, sys.stdin.buffer.read().split())
MOD = 998244353
dp = np.zeros(s + 1, np.int64)
dp[0] = 1
for a in aaa:
ndp = dp * 2 % MOD
if a <= s:
ndp[a:] += dp[:-a]
dp = ndp % MOD
print(dp[s])
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 387,002 | 387,003 | u340781749 | python |
p02662 | n,s = map(int,input().split())
a = list(map(int,input().split()))
mod = 998244353
dp = [[0] * (s+1) for _ in range(n+1)]
dp[0][0] = 1
for i in range(1,n+1):
for j in range(0,s+1):
dp[i][j] += dp[i-1][j]
if(j>=a[i-1]):
dp[i][j] += dp[i-1][j-a[i-1]]
dp[i][j] %= mod
print(dp[-1][... | n,s = map(int,input().split())
a = list(map(int,input().split()))
mod = 998244353
dp = [[0] * (s+1) for _ in range(n+1)]
dp[0][0] = 1
for i in range(1,n+1):
for j in range(0,s+1):
dp[i][j] += dp[i-1][j] * 2
if(j>=a[i-1]):
dp[i][j] += dp[i-1][j-a[i-1]]
dp[i][j] %= mod
print(dp[... | [
"expression.operation.binary.add"
] | 387,006 | 387,007 | u490642448 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.