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 |
|---|---|---|---|---|---|---|---|
p02796 | N = int(input())
XL = []
for i in range(N):
array = list(map(int, input().strip().split()))
XL.append(array)
XL = sorted(XL)
Y = 0
cnt = 0
for i in range(N):
if XL[i][0]-XL[i][1]>=Y:
cnt += 1
Y = XL[i][0]+XL[i][1]
else:
Y = min(Y,XL[i][0]+XL[i][1])
print(cnt) | N = int(input())
XL = []
for i in range(N):
array = list(map(int, input().strip().split()))
XL.append(array)
XL = sorted(XL)
Y = 0
cnt = 0
for i in range(N):
if max(XL[i][0]-XL[i][1],0)>=Y:
cnt += 1
Y = XL[i][0]+XL[i][1]
else:
Y = min(Y,XL[i][0]+XL[i][1])
print(cnt) | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 601,608 | 601,609 | u212786022 | python |
p02796 | N = int(input())
A = []
for _ in range(N):
x, l = map(int, input().split())
A.append((x+l-1, x-l+1))
A.sort()
now = A[0][0]
ans = 1
for r, l in A:
if now<l:
ans+=1
now = r
print(ans)
| N = int(input())
A = []
for _ in range(N):
x, l = map(int, input().split())
A.append((x+l, x-l+1))
A.sort()
now = A[0][0]
ans = 1
for r, l in A:
if now<l:
ans+=1
now = r
print(ans)
| [
"expression.operation.binary.remove"
] | 601,617 | 601,618 | u310678820 | python |
p02796 | n = int(input())
a = [tuple(map(int, input().split())) for _ in range(n)]
segs = sorted([(p - r + 1, p + r - 1) for p, r in a], key=lambda x: x[1])
dp = [1] + [0] * (n - 1)
for i in range(1, n):
dp[i] = dp[i - 1]
left, right = -1, i
while left + 1 < right:
mid = (left + right) >> 1
if segs[... | n = int(input())
a = [tuple(map(int, input().split())) for _ in range(n)]
segs = sorted([(p - r, p + r) for p, r in a], key=lambda x: x[1])
dp = [1] + [0] * (n - 1)
for i in range(1, n):
dp[i] = dp[i - 1]
left, right = -1, i
while left + 1 < right:
mid = (left + right) >> 1
if segs[mid][1] ... | [
"expression.operation.binary.remove"
] | 601,631 | 601,632 | u953237709 | python |
p02796 | n = int(input())
a = [tuple(map(int, input().split())) for _ in range(n)]
segs = sorted([(p - r + 1, p + r - 1) for p, r in a], key=lambda x: x[1])
dp = [1] + [0] * (n - 1)
for i in range(1, n):
dp[i] = dp[i - 1]
left, right = -1, i
while left + 1 < right:
mid = (left + right) >> 1
if segs... | n = int(input())
a = [tuple(map(int, input().split())) for _ in range(n)]
segs = sorted([(p - r, p + r) for p, r in a], key=lambda x: x[1])
dp = [1] + [0] * (n - 1)
for i in range(1, n):
dp[i] = dp[i - 1]
left, right = -1, i
while left + 1 < right:
mid = (left + right) >> 1
if segs[mid][1] ... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,633 | 601,632 | u953237709 | python |
p02796 | N = int(input())
XL = sorted([list(map(int, input().split())) for _ in range(N)])
remove = 0
reach = 0
for i in range(N):
r = XL[i]
right = r[0] + r[1]
left = r[0] - r[1]
if i == 0:
reach = right
continue
if reach > left:
reach = max(reach, right)
remove += 1
... | N = int(input())
XL = sorted([list(map(int, input().split())) for _ in range(N)])
remove = 0
reach = 0
for i in range(N):
r = XL[i]
right = r[0] + r[1]
left = r[0] - r[1]
if i == 0:
reach = right
continue
if reach > left:
reach = min(reach, right)
remove += 1
... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 601,636 | 601,637 | u596368396 | python |
p02796 | n = int(input())
itv = []
for i in range(n):
x,l = map(int, input().split())
s = x-l+1
t = x+l-1
itv.append([t,s])
itv.sort()
ass = 1
tt = itv[0][0]
for i in range(1,n):
if tt < itv[i][1]:
ass += 1
tt = itv[i][0]
print(ass)
| n = int(input())
itv = []
for i in range(n):
x, l = map(int, input().split())
s = x-l
t = x+l
itv.append([t, s])
itv.sort()
ass = 1
tt = itv[0][0]
for i in range(1, n):
if tt <= itv[i][1]:
ass += 1
tt = itv[i][0]
print(ass)
| [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,638 | 601,639 | u906428167 | python |
p02796 | def main():
N = int(input())
li = []
for _ in range(N):
a,b = [int(n) for n in input().split()]
li.append([a-b+1,a+b-1])
# li.sort(key=lambda x:x[0])
# last = (-10**10,-10**10)
res = N
# for a in li:
# if last[1] > a[1]:
# last = a
# r... | def main():
N = int(input())
li = []
for _ in range(N):
a,b = [int(n) for n in input().split()]
li.append([a-b,a+b])
# li.sort(key=lambda x:x[0])
# last = (-10**10,-10**10)
res = N
# for a in li:
# if last[1] > a[1]:
# last = a
# res-=... | [
"expression.operation.binary.remove"
] | 601,677 | 601,678 | u974620347 | python |
p02796 | N = int(input())
XL = sorted(list(map(int, input().split())) for _ in range(N))
i, j = 0, 1
count = N
while j < count:
if XL[i][0] + XL[i][1] > XL[j][0] - XL[j][1]:
if XL[i][0] + XL[i][1] < XL[j][0] + XL[j][1]:
j += 1
else:
i, j = j, j + 1
count -= 1
else:
i, j = j, j + 1
print(count)
| N = int(input())
XL = sorted(list(map(int, input().split())) for _ in range(N))
i, j = 0, 1
count = N
while j < N:
if XL[i][0] + XL[i][1] > XL[j][0] - XL[j][1]:
if XL[i][0] + XL[i][1] < XL[j][0] + XL[j][1]:
j += 1
else:
i, j = j, j + 1
count -= 1
else:
i, j = j, j + 1
print(count)
| [
"identifier.change",
"control_flow.loop.condition.change"
] | 601,693 | 601,694 | u868600519 | python |
p02796 | N = int(input())
XL = sorted(list(map(int, input().split())) for _ in range(N))
i, j = 0, 1
count = N
while i < count - 1:
if XL[i][0] + XL[i][1] > XL[j][0] - XL[j][1]:
if XL[i][0] + XL[i][1] < XL[j][0] + XL[j][1]:
j += 1
else:
i, j = j, j + 1
count -= 1
else:
i, j = j, j + 1
print(coun... | N = int(input())
XL = sorted(list(map(int, input().split())) for _ in range(N))
i, j = 0, 1
count = N
while j < N:
if XL[i][0] + XL[i][1] > XL[j][0] - XL[j][1]:
if XL[i][0] + XL[i][1] < XL[j][0] + XL[j][1]:
j += 1
else:
i, j = j, j + 1
count -= 1
else:
i, j = j, j + 1
print(count)
| [
"identifier.change",
"control_flow.loop.condition.change",
"expression.operation.binary.remove"
] | 601,695 | 601,694 | u868600519 | python |
p02796 | N = int(input())
XL = []
for n in range(N):
XL.append([int(x) for x in input().split()])
XL = sorted(XL, key=lambda x:(x[0],x[1]))
m = -float("inf")
ans = 0
for n in range(N):
if XL[n][0]-XL[n][1] >= m:
ans += 1
m = XL[n][0]+XL[n][1]
print(ans)
| N = int(input())
XL = []
for n in range(N):
XL.append([int(x) for x in input().split()])
XL = sorted(XL, key=lambda x:x[0]+x[1])
m = -float("inf")
ans = 0
for n in range(N):
if XL[n][0]-XL[n][1] >= m:
ans += 1
m = XL[n][0]+XL[n][1]
print(ans)
| [
"call.arguments.change",
"assignment.value.change"
] | 601,730 | 601,729 | u853010060 | python |
p02796 | n = int(input())
robos = []
for i in range(n):
x,l = map(int,input().split())
robos.append([x-l+1,x+l-1])
robos.sort(key= lambda x:x[1])
# print(robos)
edge = -10000000000
out = 0
for i in range(n):
if robos[i][0] > edge:
out += 1
edge = robos[i][1]
else:
continue
print(out) | n = int(input())
robos = []
for i in range(n):
x,l = map(int,input().split())
robos.append([x-l,x+l])
robos.sort(key= lambda x:x[1])
# print(robos)
edge = -10000000000000
out = 0
for i in range(n):
if robos[i][0] >= edge:
out += 1
edge = robos[i][1]
else:
continue
print(out)
| [
"expression.operation.binary.remove",
"literal.number.integer.change",
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,749 | 601,750 | u231685196 | python |
p02796 | import sys
input = sys.stdin.readline
n = int(input())
ans = 0
x = [0] * n
for i in range(n):
x[i] = tuple([int(x) for x in input().strip().split()])
x.sort()
pre = -float('inf')
for xx in x:
if pre > xx[0] - xx[1]:
if pre < xx[0] + xx[1]:
continue
else:
pre = xx[0] + xx... | import sys
input = sys.stdin.readline
n = int(input())
ans = 0
x = [0] * n
for i in range(n):
x[i] = tuple([int(x) for x in input().strip().split()])
x.sort()
pre = -float('inf')
for xx in x:
if pre > xx[0] - xx[1]:
if pre < xx[0] + xx[1]:
continue
else:
pre = xx[0] + xx... | [
"control_flow.continue.add"
] | 601,753 | 601,754 | u408620326 | python |
p02796 | n = int(input())
machine = []
machine_left = []
machine_right = []
for i in range(n):
x, l = [ int(v) for v in input().split() ]
machine.append((x-l, x+l))
machine.sort(key = lambda x: x[1])
s = machine[0][1]
ans = 1
for l, r in machine[1:]:
if l >= s:
r = s
ans += 1
print(ans) | n = int(input())
machine = []
machine_left = []
machine_right = []
for i in range(n):
x, l = [ int(v) for v in input().split() ]
machine.append((x-l, x+l))
machine.sort(key = lambda x: x[1])
s = machine[0][1]
ans = 1
for l, r in machine[1:]:
if l >= s:
s = r
ans += 1
print(ans) | [
"assignment.add",
"assignment.remove"
] | 601,782 | 601,783 | u399721252 | python |
p02796 | n = int(input())
xl = sorted([list(map(int, input().split())) for _ in range(n)], key = lambda x: x[0]+x[1])
x, l = xl[0]
ans = n
for i in range(1, n):
if x+l-1 < xl[i][0]-xl[i][1]+1:
x, l = xl[i]
else:
ans -= 1
print(ans) | n = int(input())
xl = sorted([list(map(int, input().split())) for _ in range(n)], key = lambda x: x[0]+x[1])
x, l = xl[0]
ans = n
for i in range(1, n):
if x+l-1 < xl[i][0]-xl[i][1]:
x, l = xl[i]
else:
ans -= 1
print(ans) | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 601,793 | 601,794 | u832152513 | python |
p02796 | n = int(input())
xl = sorted([list(map(int, input().split())) for _ in range(n)], key = lambda x: x[0]+x[1])
x, l = xl[0]
ans = n
for i in range(1, n):
if x+l-1 <= xl[i][0]-xl[i][1]+1:
x, l = xl[i]
else:
ans -= 1
print(ans) | n = int(input())
xl = sorted([list(map(int, input().split())) for _ in range(n)], key = lambda x: x[0]+x[1])
x, l = xl[0]
ans = n
for i in range(1, n):
if x+l-1 < xl[i][0]-xl[i][1]:
x, l = xl[i]
else:
ans -= 1
print(ans) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 601,795 | 601,794 | u832152513 | python |
p02796 | # Keyence B
N = int(input())
robot_list = []
robot_count = 0
for _ in range(N):
x, l = map(int, input().split())
robot_list.append([x - l, x + l])
robot_list.sort()
r = - 10**9 - 1
for i in range(N):
if r <= robot_list[i][0]:
robot_count += 1
r = robot_list[i][1]
print(robot_count) | # Keyence B
N = int(input())
robot_list = []
robot_count = 0
for _ in range(N):
x, l = map(int, input().split())
robot_list.append([x + l, x - l])
robot_list.sort()
r = - 10**9 - 1
for i in range(N):
if r <= robot_list[i][1]:
robot_count += 1
r = robot_list[i][0]
print(robot_count) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 601,809 | 601,810 | u998679483 | python |
p02796 | import sys
input = sys.stdin.readline
def main():
N = int( input())
X = []
for _ in range(N):
x, l = map( int, input().split())
X.append((x+l+1, x-l-1))
X.sort()
ans = 1
now = X[0][0]
for i in range(1,N):
b, a = X[i]
if now +1< a:
now = b
... | import sys
input = sys.stdin.readline
def main():
N = int( input())
X = []
for _ in range(N):
x, l = map( int, input().split())
X.append((x+l-1, x-l+1))
X.sort()
ans = 1
now = X[0][0]
for i in range(1,N):
b, a = X[i]
if now +1< a:
now = b
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 601,811 | 601,812 | u201234972 | python |
p02796 | import sys
input = sys.stdin.readline
def main():
N = int( input())
X = []
for _ in range(N):
x, l = map( int, input().split())
X.append((x+l-1, x-l+1))
X.sort()
ans = 1
now = X[0][0]
for i in range(1,N):
b, a = X[i]
if now < a:
now = b
... | import sys
input = sys.stdin.readline
def main():
N = int( input())
X = []
for _ in range(N):
x, l = map( int, input().split())
X.append((x+l-1, x-l+1))
X.sort()
ans = 1
now = X[0][0]
for i in range(1,N):
b, a = X[i]
if now +1< a:
now = b
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 601,813 | 601,812 | u201234972 | python |
p02796 | import sys
input = sys.stdin.readline
def main():
N = int( input())
X = []
for _ in range(N):
x, l = map( int, input().split())
X.append((x+l-1, x-l+1))
X.sort()
ans = 1
now = X[0][0]
for i in range(1,N):
b, a = X[i]
if now < a:
now = b
... | import sys
input = sys.stdin.readline
def main():
N = int( input())
X = []
for _ in range(N):
x, l = map( int, input().split())
X.append((x+l, x-l))
X.sort()
ans = 1
now = X[0][0]
for i in range(1,N):
b, a = X[i]
if now <= a:
now = b
an... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,813 | 601,814 | u201234972 | python |
p02796 | N=int(input())
rang=[]
for _ in range(N):
x,l=map(int,input().split())
rang.append((x-l, x+l))
rang=sorted(rang, key=lambda x: x[0])
lastright=rang[0][1]
cnt=1
for i in range(1,N):
left=rang[i][0]
right=rang[i][1]
if left>=lastright:
cnt+=1
lastright=right
print(cnt) | N=int(input())
rang=[]
for _ in range(N):
x,l=map(int,input().split())
rang.append((x-l, x+l))
rang=sorted(rang, key=lambda x: x[1])
lastright=rang[0][1]
cnt=1
for i in range(1,N):
left=rang[i][0]
right=rang[i][1]
if left>=lastright:
cnt+=1
lastright=right
print(cnt) | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 601,815 | 601,816 | u260216890 | python |
p02796 | N = int(input())
num_array = [[0]*2 for i in range(N)]
for i in range(N):
x, l = map(int, input().split())
small = x-l
if small <= 0:
small = 0
big = x+l
num_array[i][0] = small
num_array[i][1] = big
num_array.sort()
tmp_r = -(10**18)
count = 0
for l, r in num_array:
if tmp_r > l... | N = int(input())
num_array = [[0]*2 for i in range(N)]
for i in range(N):
x, l = map(int, input().split())
small = x-l
if small <= 0:
small = 0
big = x+l
num_array[i][1] = small
num_array[i][0] = big
num_array.sort()
tmp_r = -(10**18)
count = 0
for r, l in num_array:
if tmp_r > l... | [
"literal.number.integer.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 601,817 | 601,818 | u836939578 | python |
p02796 | n = int(input())
lis=[]
count=0
for i in range(n):
li=[None]*2
x, l = map(int, input().split())
li[0] = x+l
li[1] = x-l
lis.append(li)
lis.sort()
kari_r = -(10 ** 18)
print(lis)
for r, l in lis:
if kari_r > l:
continue
count+=1
kari_r = r
print(count) | n = int(input())
lis=[]
count=0
for i in range(n):
li=[None]*2
x, l = map(int, input().split())
li[0] = x+l
li[1] = x-l
lis.append(li)
lis.sort()
kari_r = -(10 ** 18)
for r, l in lis:
if kari_r > l:
continue
count+=1
kari_r = r
print(count) | [
"call.remove"
] | 601,823 | 601,824 | u272336707 | python |
p02796 | n = int(input())
x = [0]*n
l = [0]*n
for i in range(n):
x[i] , l[i] = map(int, input().split())
itv = [[0 for i in range(2)] for j in range(n)]
for i in range(n):
a = x[i]+l[i]
b = x[i]-l[i]
itv[i][0] = a
itv[i][1] = b
itv.sort()
ans = 0
curx = -1000000000
for i in range(n):
if curx <= itv[i][... | n = int(input())
x = [0]*n
l = [0]*n
for i in range(n):
x[i] , l[i] = map(int, input().split())
itv = [[0 for i in range(2)] for j in range(n)]
for i in range(n):
a = x[i]+l[i]
b = x[i]-l[i]
itv[i][0] = a
itv[i][1] = b
itv.sort()
ans = 0
curx = -10000000000
for i in range(n):
if curx <= itv[i]... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 601,830 | 601,831 | u246217175 | python |
p02796 | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return... | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return... | [
"assignment.value.change",
"expression.operation.unary.add"
] | 601,836 | 601,837 | u423585790 | python |
p02796 | N = int(input())
A = []
for i in range(a):
x, l = map(int, input().split())
A.append([x+l, x-l])
A.sort()
ans = 1
check1 = A[0]
for i in range(1, N):
check2 = A[i]
if check1[0] <= check2[1]:
ans += 1
check1 = check2
print(ans) | N = int(input())
A = []
for i in range(N):
x, l = map(int, input().split())
A.append([x+l, x-l])
A.sort()
ans = 1
check1 = A[0]
for i in range(1, N):
check2 = A[i]
if check1[0] <= check2[1]:
ans += 1
check1 = check2
print(ans) | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 601,840 | 601,841 | u327532412 | python |
p02796 | n=int(input())
l=[]
for i in range(n):
a,b=map(int,input().split())
l.append([a-b+1,a+b])
l.sort(key=lambda x: x[1])
ans=1
nl=l[0][0]
nr=l[0][1]
for i in range(1,n):
if l[i][0]<nr:
continue
else:
nr=l[i][1]
ans+=1
print(ans) | n=int(input())
l=[]
for i in range(n):
a,b=map(int,input().split())
l.append([a-b,a+b])
l.sort(key=lambda x: x[1])
ans=1
nl=l[0][0]
nr=l[0][1]
for i in range(1,n):
if l[i][0]<nr:
continue
else:
nr=l[i][1]
ans+=1
print(ans)
| [
"expression.operation.binary.remove"
] | 601,912 | 601,913 | u223904637 | python |
p02796 | n,*t=map(int,open(0).read().split())
*z,=sorted(zip(*[iter(t)]*2))
s=set()
for i in range(n-1):
if i in s:
continue
x,l=z[i]
j=i+1
while 1:
y,r=z[j]
if x+l>y-r:
if y+r<x+l:
s|={i}
else:
s|={j}
else:
break... | n,*t=map(int,open(0).read().split())
*z,=sorted(zip(*[iter(t)]*2))
s=set()
for i in range(n-1):
if i in s:
continue
x,l=z[i]
j=i+1
while 1:
y,r=z[j]
if x+l>y-r:
if y+r<x+l:
s|={i}
break
else:
s|={j}
e... | [
"control_flow.break.add"
] | 601,914 | 601,915 | u729133443 | python |
p02796 | N = int(input())
r = [list(map(int, input().split())) for _ in range(N)]
a = []
for i in r:
a.append((i[0]-i[1],i[0]+i[1]))
a.sort(key=lambda x:x[1])
ans = 0
cur = -float('inf')
for i in a:
if i[0] < cur:
continue
ans += 1
cur = i[1]
print(a)
print(ans) | N = int(input())
r = [list(map(int, input().split())) for _ in range(N)]
a = []
for i in r:
a.append((i[0]-i[1],i[0]+i[1]))
a.sort(key=lambda x:x[1])
ans = 0
cur = -float('inf')
for i in a:
if i[0] < cur:
continue
ans += 1
cur = i[1]
print(ans) | [
"call.remove"
] | 601,919 | 601,920 | u325282913 | python |
p02796 | n=int(input())
lists=[]
for i in range(n):
x,y=map(int,input().split())
lists.append((x-y,x+y))
lists=sorted(lists,key=lambda x:(x[0],x[1]))
A=1
P=lists[0]
#貪欲法
for i in range(1,len(lists)):
if lists[i][0]>=P[1]:
A+=1
P=lists[i]
print(A) | n=int(input())
lists=[]
for i in range(n):
x,y=map(int,input().split())
lists.append((x-y,x+y))
lists=sorted(lists,key=lambda x:(x[1]))
A=1
P=lists[0]
for i in range(1,len(lists)):
if lists[i][0]>=P[1]:
A+=1
P=lists[i]
print(A)
| [] | 601,921 | 601,922 | u780962115 | python |
p02796 | n=int(input())
lists=[]
for i in range(n):
x,y=map(int,input().split())
lists.append((x-y,x+y))
lists=sorted(lists,key=lambda x:(x[0],x[1]))
A=1
P=lists[0]
#貪欲法
for i in range(1,len(lists)):
if lists[i][0]>=P[1]:
A+=1
P=lists[i]
print(A) | n=int(input())
lists=[]
for i in range(n):
x,y=map(int,input().split())
lists.append((x-y,x+y))
lists=sorted(lists,key=lambda x:(x[1]))
A=1
P=lists[0]
for i in range(1,len(lists)):
if lists[i][0]>=P[1]:
A+=1
P=lists[i]
print(A) | [] | 601,921 | 601,923 | u780962115 | python |
p02796 | N = int(input())
XL = [tuple(map(int,input().split())) for i in range(N)]
XL.sort(key=lambda x: x[0]+x[1])
right = -float('inf')
ans = 0
for x,l in XL:
s,t = x-l+1, x+l-1
if s >= right:
right = t
ans += 1
print(ans) | N = int(input())
XL = [tuple(map(int,input().split())) for i in range(N)]
XL.sort(key=lambda x: x[0]+x[1])
right = -float('inf')
ans = 0
for x,l in XL:
s,t = x-l, x+l-1
if s > right:
right = t
ans += 1
print(ans) | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,933 | 601,934 | u761320129 | python |
p02796 | N = int(input())
XL = [tuple(map(int,input().split())) for i in range(N)]
XL.sort(key=lambda x: x[0]+x[1])
right = -float('inf')
ans = 0
for x,l in XL:
s,t = x-l+1, x+l-1
if s > right:
right = t
ans += 1
print(ans) | N = int(input())
XL = [tuple(map(int,input().split())) for i in range(N)]
XL.sort(key=lambda x: x[0]+x[1])
right = -float('inf')
ans = 0
for x,l in XL:
s,t = x-l, x+l-1
if s > right:
right = t
ans += 1
print(ans) | [
"expression.operation.binary.remove"
] | 601,935 | 601,934 | u761320129 | python |
p02796 | n=int(input())
list=[]
for i in range(n):
x,l=map(int,input().split())
list.append([x-l+1,x+l-1])
list=sorted(list,key=lambda x:x[1])
cnt=0
min=-10**18
for r,l in list:
if min<r:
cnt+=1
min=l
print(cnt) | n=int(input())
list=[]
for i in range(n):
x,l=map(int,input().split())
list.append([x-l,x+l])
list=sorted(list,key=lambda x:x[1])
cnt=0
min=-10**18
for r,l in list:
if min<=r:
cnt+=1
min=l
print(cnt) | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,938 | 601,939 | u094191970 | python |
p02796 | n=int(input())
list=[]
for i in range(n):
x,l=map(int,input().split())
list.append([x-l+1,x+l-1])
list=sorted(list,key=lambda x:x[1])
cnt=0
min=-10**10
for r,l in list:
if min<r:
cnt+=1
min=l
print(cnt) | n=int(input())
list=[]
for i in range(n):
x,l=map(int,input().split())
list.append([x-l,x+l])
list=sorted(list,key=lambda x:x[1])
cnt=0
min=-10**18
for r,l in list:
if min<=r:
cnt+=1
min=l
print(cnt) | [
"expression.operation.binary.remove",
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,940 | 601,939 | u094191970 | python |
p02796 | n=int(input())
list=[]
for i in range(n):
x,l=map(int,input().split())
list.append([x-l+1,x+l-1])
list=sorted(list,key=lambda x:x[1])
cnt=0
min=-10**9
for r,l in list:
if min<r:
cnt+=1
min=l
print(cnt) | n=int(input())
list=[]
for i in range(n):
x,l=map(int,input().split())
list.append([x-l,x+l])
list=sorted(list,key=lambda x:x[1])
cnt=0
min=-10**18
for r,l in list:
if min<=r:
cnt+=1
min=l
print(cnt) | [
"expression.operation.binary.remove",
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 601,941 | 601,939 | u094191970 | python |
p02796 | n=int(input())
li=[None]*n
for i in range(0,n):
flag=True
x,l=map(int, input().split())
li[i]=(x+l, x)
li=sorted(li)
count=1
x,y=li[0]
for i in range(1,n):
x2,y2=li[i]
if y2 < x:
continue
count=count+1
x=x2
print(count) | n=int(input())
li=[None]*n
for i in range(0,n):
flag=True
x,l=map(int, input().split())
li[i]=(x+l, x-l)
li=sorted(li)
count=1
x,y=li[0]
for i in range(1,n):
x2,y2=li[i]
if y2 < x:
continue
count=count+1
x=x2
print(count) | [
"assignment.change"
] | 601,952 | 601,953 | u698849142 | python |
p02796 | n = int(input())
robots = []
for _ in range(n):
xi, li = map(int, input().split())
robots.append((xi - li, xi + li))
robots.sort(key=lambda x: x[1])
ans = 0
pre_r = -float('inf')
for l, r in robots:
if pre_r <= l:
ans += 1
pre_right = r
print(ans)
| n = int(input())
robots = []
for _ in range(n):
xi, li = map(int, input().split())
robots.append((xi - li, xi + li))
robots.sort(key=lambda x: x[1])
ans = 0
pre_r = -float('inf')
for l, r in robots:
if pre_r <= l:
ans += 1
pre_r = r
print(ans)
| [
"assignment.variable.change",
"identifier.change"
] | 601,956 | 601,957 | u305366205 | python |
p02796 | n = int(input())
robots = []
for _ in range(n):
xi, li = map(int, input().split())
robots.append((xi - li, xi + li))
robots.sort(key=lambda x: x[1])
ans = n
pre_r = -float('inf')
for l, r in robots:
if pre_r <= l:
ans += 1
pre_right = r
print(ans) | n = int(input())
robots = []
for _ in range(n):
xi, li = map(int, input().split())
robots.append((xi - li, xi + li))
robots.sort(key=lambda x: x[1])
ans = 0
pre_r = -float('inf')
for l, r in robots:
if pre_r <= l:
ans += 1
pre_r = r
print(ans)
| [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"assignment.variable.change",
"identifier.change"
] | 601,958 | 601,957 | u305366205 | python |
p02796 | import sys
from operator import itemgetter
n = int(input())
robots = []
for line in sys.stdin:
X, L = map(int, line.split())
l, r = X - L, X + L
robots.append((l, r))
robots.sort(key=itemgetter(1))
curr = -1
ans = 0
for l, r in robots:
if curr > l:
continue
ans += 1
curr = r
print(ans)... | import sys
from operator import itemgetter
n = int(input())
robots = []
for line in sys.stdin:
X, L = map(int, line.split())
l, r = X - L, X + L
robots.append((l, r))
robots.sort(key=itemgetter(1))
curr = -(10 ** 10)
ans = 0
for l, r in robots:
if curr > l:
continue
ans += 1
curr = r
p... | [
"assignment.value.change"
] | 601,966 | 601,967 | u340781749 | python |
p02796 | N=int(input())
ES = []
for i in range(N):
x,l = list(map(int,input().split()))
ES.append((x+l,x-l))
ES = sorted(ES)
sel = []
cur = None
ans = 0
for E,S in ES:
if cur is None or cur <= S:
sel.append((S,E))
cur = E
print(ans)
| N=int(input())
ES = []
for i in range(N):
x,l = list(map(int,input().split()))
ES.append((x+l,x-l))
ES = sorted(ES)
sel = []
cur = None
ans = 0
for E,S in ES:
if cur is None or cur <= S:
sel.append((S,E))
cur = E
ans += 1
print(ans)
| [] | 601,971 | 601,972 | u335830383 | python |
p02796 | import sys
input = sys.stdin.readline
def main():
N = int(input())
robo = []
for i in range(N):
x, l = [int(x) for x in input().split()]
robo.append((x-l, x+l))
robo.sort()
robo.sort(key=lambda x: x[1])
ans = N
l, r = robo[0]
for i in range(1, N):
if robo[i][0]... | import sys
input = sys.stdin.readline
def main():
N = int(input())
robo = []
for i in range(N):
x, l = [int(x) for x in input().split()]
robo.append((x-l, x+l))
robo.sort()
robo.sort(key=lambda x: x[1])
ans = N
l, r = robo[0]
for i in range(1, N):
if robo[i][0]... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 601,980 | 601,981 | u076917070 | python |
p02796 | import sys
input = sys.stdin.readline
def main():
N = int(input())
robo = []
for i in range(N):
x, l = [int(x) for x in input().split()]
robo.append((x-l, x+l))
robo.sort(key=lambda x: x[1])
ans = N
l, r = robo[0]
for i in range(1, N):
if robo[i][0] < r:
... | import sys
input = sys.stdin.readline
def main():
N = int(input())
robo = []
for i in range(N):
x, l = [int(x) for x in input().split()]
robo.append((x-l, x+l))
robo.sort()
robo.sort(key=lambda x: x[1])
ans = N
l, r = robo[0]
for i in range(1, N):
if robo[i][0]... | [
"call.add",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 601,982 | 601,981 | u076917070 | python |
p02796 | from operator import itemgetter
N = int(input())
X=[]
ans=0
for i in range(N):
H = list(map(int, input().split()))
O=[]
O.append(H[0]-H[1])
O.append(H[0]+H[1])
X.append(O)
#print(X)
X=sorted(X, key=itemgetter(1))
S=X[0][1]
ans+=1
for i in range(len(X)):
if(X[i][0]>S):
ans+=1
S=X... | from operator import itemgetter
N = int(input())
X=[]
ans=0
for i in range(N):
H = list(map(int, input().split()))
O=[]
O.append(H[0]-H[1])
O.append(H[0]+H[1])
X.append(O)
#print(X)
X=sorted(X, key=itemgetter(1))
S=X[0][1]
ans+=1
for i in range(len(X)):
if(X[i][0]>=S):
ans+=1
S=... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,000 | 602,001 | u492074881 | python |
p02796 | n = int(input())
r = []
for i in range(n):
x, l = map(int, input().split())
r.append((x - l + 1, x + l - 1))
r.sort(key=lambda _x: _x[1])
cnt = 1
limit = r[0][1]
for ri in r[1:]:
if ri[0] > limit:
cnt += 1
limit = ri[1]
print(cnt)
| n = int(input())
r = []
for i in range(n):
x, l = map(int, input().split())
r.append((x - l, x + l))
r.sort(key=lambda _x: _x[1])
cnt = 1
limit = r[0][1]
for ri in r[1:]:
if ri[0] >= limit:
cnt += 1
limit = ri[1]
print(cnt) | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,004 | 602,005 | u219197917 | python |
p02796 | N = int(input())
xl = [list(map(int, input().split())) for _ in range(N)]
rl = []
for i in range(N):
rl.append((xl[i][0] - xl[i][1], xl[i][0] + xl[i][1]))
rl.sort(key=lambda x: x[1])
cnt = 0
tmp = -10 ** 18
print(rl)
for i, j in rl:
if tmp <= i:
cnt += 1
tmp = j
print(cnt) | N = int(input())
xl = [list(map(int, input().split())) for _ in range(N)]
rl = []
for i in range(N):
rl.append((xl[i][0] - xl[i][1], xl[i][0] + xl[i][1]))
rl.sort(key=lambda x: x[1])
cnt = 0
tmp = -10 ** 18
for i, j in rl:
if tmp <= i:
cnt += 1
tmp = j
print(cnt) | [
"call.remove"
] | 602,006 | 602,007 | u311379832 | python |
p02796 | n = int(input())
d = []
left = []
right = []
for i in range(n):
x,l = map(int, input().split())
# num , left , right
d.append([x-l,x+l])
d.sort()
p = d[0][1]
ans = n
for i in range(1,n):
if d[i][0] <= p:
ans -= 1
p = min(p,d[i][1])
else:
p = d[i][1]
print(ans)
| n = int(input())
d = []
left = []
right = []
for i in range(n):
x,l = map(int, input().split())
# num , left , right
d.append([x-l,x+l])
d.sort()
p = d[0][1]
ans = n
for i in range(1,n):
if d[i][0] < p:
ans -= 1
p = min(p,d[i][1])
else:
p = d[i][1]
print(ans)
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,009 | 602,010 | u934099192 | python |
p02796 | n = int(input())
R = []
for _ in range(n):
x, l = map(int, input().split())
R.append((x+l-1, x-l+1))
R.sort()
ans = 0
last = -1e10
for r, l in R:
if last <= l:
ans += 1
last = r
print(ans) | n = int(input())
R = []
for _ in range(n):
x, l = map(int, input().split())
R.append((x+l, x-l))
R.sort()
ans = 0
last = -1e10
for r, l in R:
if last <= l:
ans += 1
last = r
print(ans) | [
"expression.operation.binary.remove"
] | 602,015 | 602,016 | u382423941 | python |
p02796 | n = int(input())
R = []
for _ in range(n):
x, l = map(int, input().split())
R.append((x+l-1, x-l+1))
R.sort()
ans = 0
last = -1e10
for r, l in R:
if last < l:
ans += 1
last = r
print(ans) | n = int(input())
R = []
for _ in range(n):
x, l = map(int, input().split())
R.append((x+l, x-l))
R.sort()
ans = 0
last = -1e10
for r, l in R:
if last <= l:
ans += 1
last = r
print(ans) | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,017 | 602,016 | u382423941 | python |
p02796 | N = int(input())
S = [tuple(map(int, input().split())) for i in range(N)]
T = list(map(lambda j:(j[0]-j[1]+1, j[0]+j[1]-1), S))
T.sort(key=lambda x: x[1])
for i, t in enumerate(T):
if i>0:
if end < t[0]:
res += 1
start = t[0]
end = t[1]
else:
start = t[0]
end = t[1]
res = 1
prin... | N = int(input())
S = [tuple(map(int, input().split())) for i in range(N)]
T = list(map(lambda j:(j[0]-j[1], j[0]+j[1]), S))
T.sort(key=lambda x: x[1])
for i, t in enumerate(T):
if i>0:
if end <= t[0]:
res += 1
start = t[0]
end = t[1]
else:
start = t[0]
end = t[1]
res = 1
print(r... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,018 | 602,019 | u259265086 | python |
p02796 | # -*- coding: utf-8 -*-
import sys
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for... | # -*- coding: utf-8 -*-
import sys
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,026 | 602,027 | u588341295 | python |
p02796 | # -*- coding: utf-8 -*-
import sys
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for... | # -*- coding: utf-8 -*-
import sys
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 602,026 | 602,028 | u588341295 | python |
p02796 | # -*- coding: utf-8 -*-
import sys
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for... | # -*- coding: utf-8 -*-
import sys
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for... | [
"expression.operation.binary.remove"
] | 602,026 | 602,029 | u588341295 | python |
p02796 | n=int(input())
x=[]
l=[]
for i in range(n):
a,b=map(int,input().split())
x.append(a)
l.append(b)
ans = [[0 for i in range(2)] for j in range(n)]
for i in range(n):
ans[i][1]=(x[i]+l[i])
ans[i][0]=max(0,x[i]-l[i])
ans.sort()
print(ans)
count=1
j=0
for i in range(n-1):
if ans[j][1]<=ans[i+1]... | n=int(input())
x=[]
l=[]
for i in range(n):
a,b=map(int,input().split())
x.append(a)
l.append(b)
ans = [[0 for i in range(2)] for j in range(n)]
for i in range(n):
ans[i][1]=(x[i]+l[i])
ans[i][0]=max(0,x[i]-l[i])
ans.sort()
count=1
j=0
for i in range(n-1):
if ans[j][1]<=ans[i+1][0] :
... | [
"call.remove"
] | 602,048 | 602,049 | u375695365 | python |
p02796 | n=int(input())
X=[]
for i in range(n):
x,l=[int(_) for _ in input().split()]
X+=[tuple(x-l,x+l)]
X.sort(key=lambda x:x[0])
ans=n
tmp=X[0][1]
for i in range(1,n):
if tmp>X[i][0]:
ans-=1
tmp=min(tmp,X[i][1])
else:
tmp=X[i][1]
print(ans) | n=int(input())
X=[]
for i in range(n):
x,l=[int(_) for _ in input().split()]
X+=[(x-l,x+l)]
X.sort(key=lambda x:x[0])
ans=n
tmp=X[0][1]
for i in range(1,n):
if tmp>X[i][0]:
ans-=1
tmp=min(tmp,X[i][1])
else:
tmp=X[i][1]
print(ans) | [] | 602,058 | 602,059 | u619197965 | python |
p02796 | N = int(input())
x = []
l = []
for i in range(N):
x1,l1=[int(i) for i in input().split()]
x.append(x1)
l.append(l1)
Range = []
for i in range(N):
max_i = x[i] + l[i]
min_i = x[i] - l[i]
Range.append((min_i,max_i,x[i]))
Range = sorted(Range, key = lambda x:x[2])
#print(Range)
a = 1
for i in range(... | N = int(input())
x = []
l = []
for i in range(N):
x1,l1=[int(i) for i in input().split()]
x.append(x1)
l.append(l1)
Range = []
for i in range(N):
max_i = x[i] + l[i]
min_i = x[i] - l[i]
Range.append((min_i,max_i))
Range = sorted(Range, key = lambda x:x[1])
a = 1
for i in range(N-1):
if Range[a][... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 602,067 | 602,068 | u477915050 | python |
p02796 | N = int(input())
x = []
l = []
for i in range(N):
x1,l1=[int(i) for i in input().split()]
x.append(x1)
l.append(l1)
Range = []
for i in range(N):
max_i = x[i] + l[i]
min_i = x[i] - l[i]
Range.append((min_i,max_i,x[i]))
Range = sorted(Range, key = lambda x:x[2])
#print(Range)
a = 1
for i in range(... | N = int(input())
x = []
l = []
for i in range(N):
x1,l1=[int(i) for i in input().split()]
x.append(x1)
l.append(l1)
Range = []
for i in range(N):
max_i = x[i] + l[i]
min_i = x[i] - l[i]
Range.append((min_i,max_i,x[i], l[i]))
Range = sorted(Range, key = lambda x:x[1])
#print(Range)
a = 1
for i in ... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 602,067 | 602,069 | u477915050 | python |
p02796 | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permut... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permut... | [
"expression.operation.binary.remove"
] | 602,076 | 602,077 | u334712262 | python |
p02796 | import sys
input = sys.stdin.readline
N = int(input())
a = []
x = -float("inf")
res = 0
for _ in range(N):
x, l = map(int, input().split())
a.append((x - l + 1, x + l - 1))
a.sort(key = lambda x: x[1])
x = -float("inf")
#print(a)
for i in range(N):
if x < a[i][0]:
x = a[i][1]
res += 1
print(res) | import sys
input = sys.stdin.readline
N = int(input())
a = []
x = -float("inf")
res = 0
for _ in range(N):
x, l = map(int, input().split())
a.append((x - l, x + l))
a.sort(key = lambda x: x[1])
x = -float("inf")
#print(a)
for i in range(N):
if x <= a[i][0]:
x = a[i][1]
res += 1
print(res) | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,078 | 602,079 | u141610915 | python |
p02796 | import sys
input = sys.stdin.readline
N = int(input())
a = []
x = -float("inf")
res = 0
for _ in range(N):
x, l = map(int, input().split())
a.append((x - l, x + l - 1))
a.sort(key = lambda x: x[1])
x = -float("inf")
#print(a)
for i in range(N):
if x <= a[i][0]:
x = a[i][1]
res += 1
print(res) | import sys
input = sys.stdin.readline
N = int(input())
a = []
x = -float("inf")
res = 0
for _ in range(N):
x, l = map(int, input().split())
a.append((x - l, x + l))
a.sort(key = lambda x: x[1])
x = -float("inf")
#print(a)
for i in range(N):
if x <= a[i][0]:
x = a[i][1]
res += 1
print(res) | [
"expression.operation.binary.remove"
] | 602,080 | 602,079 | u141610915 | python |
p02796 | N = int(input())
D = []
for i in range(N):
x, l = map(int, input().split())
D.append([x-l, x+l])
from operator import itemgetter
D = sorted(D, key = itemgetter(0))
u = -10**10 #最小値:x = 0, l = 10**10の時
cnt = 0
for a, b in D:
if u < a:
cnt += 1
u = b #つぎのロボットの範囲の下限に置きかえる
print(cnt)
| N = int(input())
D = []
for i in range(N):
x, l = map(int, input().split())
D.append([x-l, x+l])
from operator import itemgetter
D = sorted(D, key = itemgetter(1))
u = -10**10 #最小値:x = 0, l = 10**10の時
cnt = 0
for a, b in D:
if u <= a:
cnt += 1
u = b #つぎのロボットの範囲の下限に置きかえる
print(cnt)
| [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,083 | 602,082 | u906481659 | python |
p02796 | n = int(input())
xl = [list(map(int, input().split())) for i in range(n)]
xl = sorted([[x-l+1,x+l-1] for x,l in xl], key = lambda x: x[1])
now = - 10 ** 10
ans = 0
for s,e in xl:
if s > now:
ans += 1
now = e
print(ans) | n = int(input())
xl = [list(map(int, input().split())) for i in range(n)]
xl = sorted([[x-l,x+l] for x,l in xl], key = lambda x: x[1])
now = - 10 ** 10
ans = 0
for s,e in xl:
if s >= now:
ans += 1
now = e
print(ans) | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,084 | 602,085 | u102960641 | python |
p02796 | import sys
inputs = sys.stdin.readlines()
n = int(inputs[1])
Y = []
for s in inputs[1:]:
x, l = map(int, s.split())
Y.append((x-l, x+l))
Y.sort(key=lambda x: x[0])
cnt = 1
_, r0 = Y[0]
for i in range(1, n):
l, r = Y[i]
if r0 <= l:
cnt += 1
r0 = r
print(cnt) | import sys
inputs = sys.stdin.readlines()
n = int(inputs[0])
Y = []
for s in inputs[1:]:
x, l = map(int, s.split())
Y.append((x-l, x+l))
Y.sort(key=lambda x: x[1])
cnt = 1
_, r0 = Y[0]
for i in range(1, n):
l, r = Y[i]
if r0 <= l:
cnt += 1
r0 = r
print(cnt) | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 602,093 | 602,094 | u417365712 | python |
p02796 | import sys
inputs = sys.stdin.readlines()
n = int(inputs[0])
Y = []
for s in inputs[1:]:
x, l = map(int, s.split())
Y.append((x-l, x+l))
Y.sort(key=lambda x: x[0])
cnt = 1
_, r0 = Y[0]
for i in range(1, n):
l, r = Y[i]
if r0 <= l:
cnt += 1
r0 = r
print(cnt) | import sys
inputs = sys.stdin.readlines()
n = int(inputs[0])
Y = []
for s in inputs[1:]:
x, l = map(int, s.split())
Y.append((x-l, x+l))
Y.sort(key=lambda x: x[1])
cnt = 1
_, r0 = Y[0]
for i in range(1, n):
l, r = Y[i]
if r0 <= l:
cnt += 1
r0 = r
print(cnt) | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 602,095 | 602,094 | u417365712 | python |
p02796 | import sys
inputs = sys.stdin.readlines()
n = int(inputs[0])
Y = []
for s in inputs[1:]:
x, l = map(int, s.split())
Y.append((x-l+1, x+l-1))
Y.sort(key=lambda x: x[0])
cnt = 1
_, r0 = Y[0]
for i in range(1, n):
l, r = Y[i]
if r0 < l:
cnt += 1
r0 = r
print(cnt) | import sys
inputs = sys.stdin.readlines()
n = int(inputs[0])
Y = []
for s in inputs[1:]:
x, l = map(int, s.split())
Y.append((x-l, x+l))
Y.sort(key=lambda x: x[1])
cnt = 1
_, r0 = Y[0]
for i in range(1, n):
l, r = Y[i]
if r0 <= l:
cnt += 1
r0 = r
print(cnt) | [
"expression.operation.binary.remove",
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,096 | 602,094 | u417365712 | python |
p02796 | N = int(input())
xl = []
for i in range(N):
xl.append(list(map(int,input().split())))
itv = []
for i in range(N):
right = xl[i][0] + xl[i][1] ##right
left = xl[i][0] - xl[i][1] ##left
itv.append([right,left])
itv.sort()
ass = 0
tt = -1e10
for i in range(N):
if tt < itv[i][1]:
ass +... | N = int(input())
xl = []
for i in range(N):
xl.append(list(map(int,input().split())))
itv = []
for i in range(N):
right = xl[i][0] + xl[i][1] ##right
left = xl[i][0] - xl[i][1] ##left
itv.append([right,left])
itv.sort()
ass = 0
tt = -1e10
for i in range(N):
if tt <= itv[i][1]:
ass ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,099 | 602,100 | u497952650 | python |
p02796 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,175 | 602,176 | u285891772 | python |
p02796 | n = int(input())
robot = [0]*n
for i in range(n):
x,l = map(int,input().split())
robot[i] = (x-l, x+l)
robot.sort()
ans = 1
right = robot[0][1]
for i in range(1,n):
if right <= robot[i][0]:
right = robot[i][1]
ans += 1
print(ans) | n = int(input())
robot = [0]*n
for i in range(n):
x,l = map(int,input().split())
robot[i] = (x+l, x-l)
robot.sort()
#print(robot)
ans = 1
right = robot[0][0]
for i in range(1,n):
if right <= robot[i][1]:
right = robot[i][0]
ans += 1
print(ans) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 602,182 | 602,183 | u855831834 | python |
p02796 | N, *XL = map(int, open(0).read().split())
XL = sorted((x - l, x + l) for x, l in zip(*[iter(XL)] * 2))
curr = -float("inf")
ans = 0
for a, b in XL:
if a >= curr:
curr = b
ans += 1
print(ans) | N, *XL = map(int, open(0).read().split())
XL = sorted((x + l, x - l) for x, l in zip(*[iter(XL)] * 2))
curr = -float("inf")
ans = 0
for right, left in XL:
if left >= curr:
curr = right
ans += 1
print(ans)
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 602,205 | 602,206 | u888092736 | python |
p02796 | (N,), *XL = [list(map(int, s.split())) for s in open(0)]
XL.sort(key=lambda x: x[0] + x[1])
print(XL)
curr = -float("inf")
ans = 0
for x, l in XL:
if x - l >= curr:
curr = x + l
ans += 1
print(ans)
| (N,), *XL = [list(map(int, s.split())) for s in open(0)]
XL.sort(key=lambda x: x[0] + x[1])
curr = -float("inf")
ans = 0
for x, l in XL:
if x - l >= curr:
curr = x + l
ans += 1
print(ans)
| [
"call.remove"
] | 602,207 | 602,208 | u888092736 | python |
p02796 | n=int(input())
lr=[]
for i in range(n):
x,l=map(int,input().split())
lr.append((x-l,x+1))
lr.sort(key=lambda x: x[1])
ans=0
l=-10**18
r=0
for i in range(n):
if i==0:
tl,tr=lr[i]
l=tl
r=tr
ans+=1
continue
tl,tr=lr[i]
if tl>=r:
ans+=1
r=tr
l=tl
print(ans)
| n=int(input())
lr=[]
for i in range(n):
x,l=map(int,input().split())
lr.append((x-l,x+l))
lr.sort(key=lambda x: x[1])
ans=0
l=-10**18
r=0
for i in range(n):
if i==0:
tl,tr=lr[i]
l=tl
r=tr
ans+=1
continue
tl,tr=lr[i]
if tl>=r:
ans+=1
r=tr
l=tl
print(ans)
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 602,209 | 602,210 | u970197315 | python |
p02796 | n=int(input())
import bisect
L=[]
for i in range(n):
x,l=map(int,input().split())
a=x-l+1
b=x+l-1
L.append((b,a))
L=sorted(L)
rob=1
bottom=L[0][0]
for i in range(1,n):
if L[i][1]>bottom:
rob += 1
bottom=L[i][0]
print(rob) | n=int(input())
import bisect
L=[]
for i in range(n):
x,l=map(int,input().split())
a=x-l+0.1
b=x+l-0.1
L.append((b,a))
L=sorted(L)
rob=1
bottom=L[0][0]
for i in range(1,n):
if L[i][1]>bottom:
rob += 1
bottom=L[i][0]
print(rob) | [
"assignment.value.change",
"expression.operation.binary.change"
] | 602,211 | 602,212 | u216752093 | python |
p02796 | N = int(input())
LR = [[0,0] for _ in range(N)]
for i in range(N):
a,b = map(int, input().split())
LR.append([a-b,a+b])
LR.sort(key=lambda x: x[0])
prev_right = - 10**9 #一つ前の右端
cnt = 0
for i in range(N):
if LR[i][0]>=prev_right: #次の左端が前の右端以上なら
cnt += 1
prev_right = LR[i][1]
else:
if LR[i][1]<prev_... | N = int(input())
LR = [[0,0] for _ in range(N)]
for i in range(N):
a,b = map(int, input().split())
LR[i] = [a-b,a+b]
LR.sort(key=lambda x: x[0])
# print(LR)
prev_right = - 10**9 #一つ前の右端
cnt = 0
for i in range(N):
if LR[i][0]>=prev_right: #次の左端が前の右端以上なら
cnt += 1
prev_right = LR[i][1]
else:
if LR[i][... | [
"call.arguments.change"
] | 602,213 | 602,214 | u678167152 | python |
p02796 | def main():
N, *XL = map(int, open(0).read().split())
# print(N, XL)
robots = [0]*N
for i in range(N):
X, L = XL[2 * i + 0], XL[2 * i + 1]
robots[i] = (X - L, X + L)
robots.sort(key=lambda x: x[1])
# print(robots)
ans = 0
last = robots[0][0] - 1
for robot in robots:
... | def main():
N, *XL = map(int, open(0).read().split())
# print(N, XL)
robots = [0]*N
for i in range(N):
X, L = XL[2 * i + 0], XL[2 * i + 1]
robots[i] = (X - L, X + L)
robots.sort(key=lambda x: x[1])
# print(robots)
ans = 0
last = robots[0][0] - 1
for robot in robots:
... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 602,221 | 602,222 | u838644735 | python |
p02796 | import sys
N = int(sys.stdin.readline().rstrip())
sec = []
for _ in range(N):
x, l = map(int, sys.stdin.readline().rstrip().split())
sec.append((x - l + 1, x + l - 1))
sec = sorted(sec, key=lambda x: x[1])
r = -10**10
ans = 0
for s, t in sec:
if r <= s:
ans += 1
r = t
print(ans) | import sys
N = int(sys.stdin.readline().rstrip())
sec = []
for _ in range(N):
x, l = map(int, sys.stdin.readline().rstrip().split())
sec.append((x - l + 1, x + l - 1))
sec = sorted(sec, key=lambda x: x[1])
r = -10**10
ans = 0
for s, t in sec:
if r + 1 < s:
ans += 1
r = t
print(ans) | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 602,223 | 602,224 | u025501820 | python |
p02796 | import sys
N = int(sys.stdin.readline().rstrip())
sec = []
for _ in range(N):
x, l = map(int, sys.stdin.readline().rstrip().split())
sec.append((x - l + 1, x + l - 1))
sec = sorted(sec, key=lambda x: x[1])
r = -10**10
ans = 0
for s, t in sec:
if r < s:
ans += 1
r = t
print(ans) | import sys
N = int(sys.stdin.readline().rstrip())
sec = []
for _ in range(N):
x, l = map(int, sys.stdin.readline().rstrip().split())
sec.append((x - l + 1, x + l - 1))
sec = sorted(sec, key=lambda x: x[1])
r = -10**10
ans = 0
for s, t in sec:
if r + 1 < s:
ans += 1
r = t
print(ans) | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 602,225 | 602,224 | u025501820 | python |
p02796 | import sys
N = int(sys.stdin.readline().rstrip())
sec = []
for _ in range(N):
x, l = map(int, sys.stdin.readline().rstrip().split())
sec.append((x - l + 1, x + l - 1))
sec = sorted(sec, key=lambda x: x[1])
r = -10**10
ans = 0
for s, t in sec:
if r <= s:
ans += 1
r = t
print(ans) | import sys
N = int(sys.stdin.readline().rstrip())
sec = []
for _ in range(N):
x, l = map(int, sys.stdin.readline().rstrip().split())
sec.append((x - l, x + l))
sec = sorted(sec, key=lambda x: x[1])
r = -10**10
ans = 0
for s, t in sec:
if r <= s:
ans += 1
r = t
print(ans) | [
"expression.operation.binary.remove"
] | 602,223 | 602,226 | u025501820 | python |
p02796 | import sys
N = int(sys.stdin.readline().rstrip())
sec = []
for _ in range(N):
x, l = map(int, sys.stdin.readline().rstrip().split())
sec.append((x - l + 1, x + l - 1))
sec = sorted(sec, key=lambda x: x[1])
r = -10**10
ans = 0
for s, t in sec:
if r < s:
ans += 1
r = t
print(ans) | import sys
N = int(sys.stdin.readline().rstrip())
sec = []
for _ in range(N):
x, l = map(int, sys.stdin.readline().rstrip().split())
sec.append((x - l, x + l))
sec = sorted(sec, key=lambda x: x[1])
r = -10**10
ans = 0
for s, t in sec:
if r <= s:
ans += 1
r = t
print(ans) | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,225 | 602,226 | u025501820 | python |
p02796 | from operator import itemgetter
N = int(input())
arms = []
finishtime = float('-inf')
for i in range(N):
x,l = map(int,input().split())
arms.append((x-l,x+l))
arms.sort(key=itemgetter(1))
cnt=0
for L,R in arms:
if R >= finishtime:
cnt+=1
finishtime = R
print(cnt) | from operator import itemgetter
N = int(input())
arms = []
finishtime = float('-inf')
for i in range(N):
x,l = map(int,input().split())
arms.append((x-l,x+l))
arms.sort(key=itemgetter(1))
cnt=0
for L,R in arms:
if finishtime<=L:
cnt+=1
finishtime = R
print(cnt) | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 602,234 | 602,235 | u820180033 | python |
p02796 | N = int(input())
l = []
for i in range(N):
a, b = map(int, input().split())
l.append((a-b,a+b))
l = sorted(l,key=lambda x:x[1])
start = l[0][1]
ans = 1
for i in range(1,N):
if start <= l[i][0]:
start = l[i][0]
ans += 1
print(ans) | N = int(input())
l = []
for i in range(N):
a, b = map(int, input().split())
l.append((a-b,a+b))
l = sorted(l,key=lambda x:x[1])
start = l[0][1]
ans = 1
for i in range(1,N):
if start <= l[i][0]:
start = l[i][1]
ans += 1
print(ans) | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 602,246 | 602,247 | u854061980 | python |
p02796 | N = int(input())
l = []
for i in range(N):
a, b = map(int, input().split())
l.append((a+b,a-b))
l = sorted(l,key=lambda x:x[1])
start = l[0][1]
ans = 1
for i in range(1,N):
if start <= l[i][0]:
start = l[i][0]
ans += 1
print(ans) | N = int(input())
l = []
for i in range(N):
a, b = map(int, input().split())
l.append((a-b,a+b))
l = sorted(l,key=lambda x:x[1])
start = l[0][1]
ans = 1
for i in range(1,N):
if start <= l[i][0]:
start = l[i][1]
ans += 1
print(ans) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 602,248 | 602,247 | u854061980 | python |
p02796 | n = int(input())
lst = []
for i in range(n):
x, l = map(int, input().split())
lst.append((x + l, x - l))
sorted_lst = sorted(lst)
num = 0
ans = n
while True:
tmp = sorted_lst[num][0]
for i in range(num + 1, n):
if tmp > sorted_lst[i][1]:
ans -= 1
print(num, i)
el... | n = int(input())
lst = []
for i in range(n):
x, l = map(int, input().split())
lst.append((x + l, x - l))
sorted_lst = sorted(lst)
num = 0
ans = n
while True:
tmp = sorted_lst[num][0]
for i in range(num + 1, n):
if tmp > sorted_lst[i][1]:
ans -= 1
else:
num = i
... | [
"call.remove"
] | 602,252 | 602,253 | u183422236 | python |
p02796 | n = int(input())
Robo = []
for i in range(n):
x, l = map(int, input().split())
Robo.append([x-l, x+l])
Robo.sort(key=lambda x: x[0])
#print(Robo)
biggest_right = 2 * -10**9 - 1
counter = 0
for left, right in Robo:
if biggest_right <= left:
counter += 1
biggest_right = max(right, biggest_ri... | n = int(input())
Robo = []
for i in range(n):
x, l = map(int, input().split())
Robo.append([x-l, x+l])
Robo.sort(key=lambda x: x[1])
#print(Robo)
biggest_right = 2 * -10**9 - 1
counter = 0
for left, right in Robo:
if biggest_right <= left:
counter += 1
biggest_right = max(right, biggest_ri... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 602,256 | 602,257 | u332657092 | python |
p02796 | import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
from copy import copy, deepcopy
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#deque(l), pop(), append(x), pople... | import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
from copy import copy, deepcopy
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#deque(l), pop(), append(x), pople... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,262 | 602,263 | u424768586 | python |
p02796 | import sys
input = sys.stdin.buffer.readline
from operator import itemgetter
def main():
N = int(input())
lr = []
for _ in range(N):
p,l = map(int,input().split())
lr.append((p-l,p+l))
lr.sort(key = itemgetter(0,1))
now = -10**10
count = 0
for i in range(N):
... | import sys
input = sys.stdin.buffer.readline
from operator import itemgetter
def main():
N = int(input())
lr = []
for _ in range(N):
p,l = map(int,input().split())
lr.append((p-l,p+l))
lr.sort(key = itemgetter(1,0))
now = -10**10
count = 0
for i in range(N):
... | [
"call.arguments.change",
"call.arguments.add"
] | 602,275 | 602,276 | u648212584 | python |
p02796 | from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(n)]
R=[list(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
if r[i+1][0]>=s:
s=r[i+1][1]
ans+... | from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(n)]
R=[(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
if r[i+1][0]>=s:
s=r[i+1][1]
ans+=1
p... | [] | 602,277 | 602,278 | u768890894 | python |
p02796 | from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(N)]
R=[list(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
if r[i+1][0]>=s:
s=r[i+1][1]
ans+... | from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(n)]
R=[(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
if r[i+1][0]>=s:
s=r[i+1][1]
ans+=1
p... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 602,279 | 602,278 | u768890894 | python |
p02796 | from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(N)]
R=[list(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
if r[i+1][0]>s:
s=r[i+1][1]
ans+=... | from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(n)]
R=[(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
if r[i+1][0]>=s:
s=r[i+1][1]
ans+=1
p... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,280 | 602,278 | u768890894 | python |
p02796 |
n = int(input())
X = []
for _ in range(n):
x, l = map(int, input().split())
X.append((x, x + l))
count = 0
current = -1 * float('inf')
for x in sorted(X, key=lambda x: x[1]):
if x[0] >= current:
count += 1
current = x[1]
print(count) | n = int(input())
X = []
for _ in range(n):
x, l = map(int, input().split())
X.append((x - l, x + l))
count = 0
current = -1 * float('inf')
for x in sorted(X, key=lambda x: x[1]):
if x[0] >= current:
count += 1
current = x[1]
print(count) | [
"expression.operation.binary.add"
] | 602,285 | 602,286 | u319065189 | python |
p02796 | N = int(input())
ST = []
for i in range(N):
x, l = list(map(int, input().split()))
ST.append([x-l, x+l])
ST.sort(key = lambda x :x[1])
startT = ST[0][1]
ans = 1
if N != 1:
for i in range(1,N):
if startT >= ST[i][0]:
continue
else:
startT = ST[i][1]
ans += ... | N = int(input())
ST = []
for i in range(N):
x, l = list(map(int, input().split()))
ST.append([x-l, x+l])
ST.sort(key = lambda x :x[1])
startT = ST[0][1]
ans = 1
if N != 1:
for i in range(1,N):
if startT <= ST[i][0]:
startT = ST[i][1]
ans += 1
print(ans) | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,287 | 602,288 | u944643608 | python |
p02796 | import sys
input = sys.stdin.readline
n = int(input())
xl = [list(map(int, input().split())) for _ in range(n)]
xl2 = sorted([[x + l, x - l] for x, l in xl])
ans = 0
mr = xl2[0][0] - 1
for r, l in xl2:
if l > mr:
ans += 1
mr = r
print(ans)
| import sys
input = sys.stdin.readline
n = int(input())
xl = [list(map(int, input().split())) for _ in range(n)]
xl2 = sorted([[x + l, x - l] for x, l in xl])
ans = 0
mr = xl2[0][1]
for r, l in xl2:
if l >= mr:
ans += 1
mr = r
print(ans)
| [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,289 | 602,290 | u222668979 | python |
p02796 | #!/usr/bin/env python3
import sys
import collections
sys.setrecursionlimit(10 ** 7)
# 1 ✕ 1 (int)
N = int(input().rstrip())
# N ✕ M
A = list(tuple(map(int, input().rstrip().split())) for _ in range(N))
array = []
for s, t in A:
array.append((s + t, s))
array.sort()
# print(array)
ans = 0
t = 0
for e, s in arr... | #!/usr/bin/env python3
import sys
import collections
sys.setrecursionlimit(10 ** 7)
# 1 ✕ 1 (int)
N = int(input().rstrip())
# N ✕ M
A = list(tuple(map(int, input().rstrip().split())) for _ in range(N))
array = []
for s, t in A:
array.append((s + t, s - t))
array.sort()
# print(array)
ans = 0
t = -1e9
for e, s... | [
"assignment.value.change",
"expression.operation.unary.add"
] | 602,291 | 602,292 | u017723605 | python |
p02796 | n = int(input())
XL = []
for i in range(n):
x, l = map(int, input().split())
XL.append([x, l])
XL.sort(key=lambda x: x[0]+x[1])
seen = -10**10
ans = 0
for i in range(n):
rob = XL[i]
if seen <= rob[0]+rob[1]:
seen = rob[0]+rob[1]
ans += 1
print(ans) | n = int(input())
XL = []
for i in range(n):
x, l = map(int, input().split())
XL.append([x, l])
XL.sort(key=lambda x: x[0]+x[1])
seen = -10**10
ans = 0
for i in range(n):
rob = XL[i]
if seen <= rob[0]-rob[1]:
seen = rob[0]+rob[1]
ans += 1
print(ans) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 602,299 | 602,300 | u181195295 | python |
p02796 | n = int(input())
XL = []
for i in range(n):
x, l = map(int, input().split())
XL.append([x, l])
XL.sort(key=lambda x: x[0]-x[1])
seen = -10**10
ans = 0
for i in range(n):
rob = XL[i]
if seen <= rob[0]+rob[1]:
seen = rob[0]+rob[1]
ans += 1
print(ans) | n = int(input())
XL = []
for i in range(n):
x, l = map(int, input().split())
XL.append([x, l])
XL.sort(key=lambda x: x[0]+x[1])
seen = -10**10
ans = 0
for i in range(n):
rob = XL[i]
if seen <= rob[0]-rob[1]:
seen = rob[0]+rob[1]
ans += 1
print(ans) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 602,301 | 602,300 | u181195295 | python |
p02796 | N = int(input())
robot = []
ans = 0
for i in range(N):
x,l = map(int,input().split())
robot.append([x-l,x+l])
robot.sort()
cur = -float('inf')
for i in range(N):
if cur <= robot[i][1]:
ans += 1
cur = robot[i][0]
print(ans) | N = int(input())
robot = []
ans = 0
for i in range(N):
x,l = map(int,input().split())
robot.append([x+l,x-l])
robot.sort()
cur = -float('inf')
for i in range(N):
if cur <= robot[i][1]:
ans += 1
cur = robot[i][0]
print(ans) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 602,302 | 602,303 | u960080897 | python |
p02796 | n = int(input())
X = []
for i in range(n):
x, y = map(int, input().split())
X.append((x - y + 1, x + y))
X.sort(key=lambda x: x[1])
ter = -10**10
cnt = 0
for left, right in X:
if ter <= left:
ter = right
cnt += 1
print(cnt)
| n = int(input())
X = []
for i in range(n):
x, y = map(int, input().split())
X.append((x - y, x + y))
X.sort(key=lambda x: x[1])
ter = -10**10
cnt = 0
for left, right in X:
if ter <= left:
ter = right
cnt += 1
print(cnt)
| [
"expression.operation.binary.remove"
] | 602,310 | 602,311 | u997641430 | python |
p02796 | n = int(input())
lst = []
for i in range(n):
x, l = map(int, input().split())
left = x - l + 1
right = x + l - 1
lst.append([left, right])
lst = sorted(lst, key=lambda x: x[1])
ans = 1
limit = lst[0][1]
for i in range(n):
if lst[i][0] > limit:
ans += 1
limit = lst[i][1]
print(ans) | n = int(input())
lst = []
for i in range(n):
x, l = map(int, input().split())
left = x - l
right = x + l
lst.append([left, right])
lst = sorted(lst, key=lambda x: x[1])
ans = 1
limit = lst[0][1]
for i in range(n):
if lst[i][0] >= limit:
ans += 1
limit = lst[i][1]
print(ans) | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,314 | 602,315 | u289547799 | python |
p02796 | N = int(input())
ts = []
for _ in range(N):
x, l = map(int,input().split())
t = min(x+l,10**9)
s = max(x-l,0)
ts.appned([t,s])
ts.sort()
tmp = 0
count = 0
for n in ts:
if tmp<=n[1]:
count += 1
tmp = n[0]
print(count)
| N = int(input())
ts = []
for _ in range(N):
x, l = map(int,input().split())
t = min(x+l,10**9)
s = max(x-l,0)
ts.append([t,s])
ts.sort()
tmp = 0
count = 0
for n in ts:
if tmp<=n[1]:
count += 1
tmp = n[0]
print(count) | [
"identifier.change"
] | 602,316 | 602,317 | u935558307 | python |
p02796 | from operator import itemgetter
n = int(input())
a = [list(map(int, input().split())) for i in range(n)]
s = [i[0]-i[1]+1 for i in a]
t = [i[0]+i[1]-1 for i in a]
st = sorted([(s[i], t[i]) for i in range(n)], key=itemgetter(1))
ans = 0
last = -10**9
for i in range(n):
if last < st[i][0]:
ans += 1
... | from operator import itemgetter
n = int(input())
a = [list(map(int, input().split())) for i in range(n)]
s = [i[0]-i[1] for i in a]
t = [i[0]+i[1] for i in a]
st = sorted([(s[i], t[i]) for i in range(n)], key=itemgetter(1))
ans = 0
last = -10**10
for i in range(n):
if last <= st[i][0]:
ans += 1
l... | [
"expression.operation.binary.remove",
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,322 | 602,323 | u414458988 | python |
p02793 | N = int(input())
A = list(map(int, input().split()))
# 参考：https://qiita.com/aki-takano/items/a43fac70b702d4f22d7e
def lcm(a):
from math import gcd
x = a[0]
for i in range(1, len(a)):
x = (x * a[i]) // gcd(x, a[i])
return x
L = lcm(A)
B = []
for a in A:
B.append(a // L)
print(sum(B) % 1000... | N = int(input())
A = list(map(int, input().split()))
# 参考：https://qiita.com/aki-takano/items/a43fac70b702d4f22d7e
def lcm(a):
from math import gcd
x = a[0]
for i in range(1, len(a)):
x = (x * a[i]) // gcd(x, a[i])
return x
L = lcm(A)
B = []
for a in A:
B.append(L // a)
print(sum(B) % 1000... | [
"expression.operation.binary.remove"
] | 603,070 | 603,071 | u022138926 | python |
p02793 | n = int(input())
a = list(map(int,input().split()))
mod = 10**9 + 7
from math import gcd
from functools import reduce
def lcm_base(x, y):
return (x * y) // gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
x = lcm_list(a)
# pri... | n = int(input())
a = list(map(int,input().split()))
mod = 10**9 + 7
from math import gcd
from functools import reduce
def lcm_base(x, y):
return (x * y) // gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
x = lcm_list(a)
# pri... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 603,072 | 603,073 | u255673886 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.