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 |
|---|---|---|---|---|---|---|---|
p02646 | a,v = map(int, input().split())
b,w = map(int, input().split())
t=int(input())
rev = v-w
if rev*t > (b-a):
print("YES")
else:
print("NO") | a,v = map(int, input().split())
b,w = map(int, input().split())
t=int(input())
rev = v-w
if rev*t >= abs(b-a):
print("YES")
else:
print("NO") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 367,803 | 367,801 | u323045245 | python |
p02646 | A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
v = V - W
sa = abs(A-B)
if v <= 0:
print("NO")
else:
if sa / v < T:
print("YES")
else:
print("NO")
| A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
v = V - W
sa = abs(A-B)
if v <= 0:
print("NO")
else:
if sa / v <= T:
print("YES")
else:
print("NO")
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 367,808 | 367,809 | u267300160 | python |
p02646 | a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
dist = b - a
time_dif = v - w
if dist > time_dif*t:
print('NO')
else:
print('YES') | a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
dist = abs(b - a)
time_dif = v - w
if dist > time_dif*t:
print('NO')
else:
print('YES') | [
"call.add",
"call.arguments.change"
] | 367,818 | 367,819 | u771007149 | python |
p02646 | a, v = list(map(int,input().strip().split()))
b, w = list(map(int,input().strip().split()))
t = int(input())
if w - v >= 0:
print("NO")
else:
time = abs(a-b)/(v-w)
if t <= time:
print("YES")
else:
print("NO") | a, v = list(map(int,input().strip().split()))
b, w = list(map(int,input().strip().split()))
t = int(input())
if w - v >= 0:
print("NO")
else:
time = abs(a-b)/(v-w)
if time <= t:
print("YES")
else:
print("NO") | [
"control_flow.branch.if.condition.change"
] | 367,840 | 367,841 | u573670713 | python |
p02646 | a, v = map(int,input().split())
b, w = map(int,input().split())
t = int(input())
if v > w and abs(a-b)//(v-w)<=t:
print("YES")
else:
print("NO") | a, v = map(int,input().split())
b, w = map(int,input().split())
t = int(input())
if v > w and abs(a-b)/(v-w)<=t:
print("YES")
else:
print("NO") | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 367,854 | 367,855 | u406767170 | python |
p02646 | A, V = [int(v) for v in input().strip().split(" ")]
B, W = [int(v) for v in input().strip().split(" ")]
T = int(input().strip())
if B - A <= (V - W) * T:
print("YES")
else:
print("NO") | A, V = [int(v) for v in input().strip().split(" ")]
B, W = [int(v) for v in input().strip().split(" ")]
T = int(input().strip())
if abs(B - A) <= (V - W) * T:
print("YES")
else:
print("NO") | [
"control_flow.branch.if.condition.change",
"call.add"
] | 367,864 | 367,865 | u551058317 | python |
p02646 | #東京海上日動 プログラミングコンテスト2020 b
a,v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())
dis = abs(a-b)
move = abs(w-v)
if dis <= move * t:
print('YES')
else:
print('NO') | #東京海上日動 プログラミングコンテスト2020 b
a,v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())
dis = abs(a-b)
move = v-w
if dis <= move * t:
print('YES')
else:
print('NO')
| [
"call.arguments.change"
] | 367,868 | 367,869 | u816265237 | python |
p02646 | A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
delta_v = V - W
if delta_v <= 0:
print('No')
elif (abs(A - B) + delta_v - 1) // delta_v > T:
print('No')
else:
print('Yes')
| A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
delta_v = V - W
if delta_v <= 0:
print('NO')
elif (abs(A - B) + delta_v - 1) // delta_v > T:
print('NO')
else:
print('YES')
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 367,870 | 367,871 | u888092736 | python |
p02646 | a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if v-w!=0 and (a-b)/(v-w)<=t:
print("YES")
else:
print("NO")
| a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if v-w>0 and abs(a-b)/(v-w)<=t:
print("YES")
else:
print("NO") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 367,887 | 367,888 | u103208639 | python |
p02646 | A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
if W-V == 0 or abs(A-B)/abs(W-V) > T:
print('NO')
else:
print('YES') | A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
if W>=V or abs(A-B)/abs(W-V) > T:
print('NO')
else:
print('YES') | [
"control_flow.branch.if.condition.change"
] | 367,895 | 367,896 | u834224054 | python |
p02646 | A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
if abs(A-B)/abs(W-V) > T:
print('NO')
else:
print('YES') | A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
if W>=V or abs(A-B)/abs(W-V) > T:
print('NO')
else:
print('YES') | [
"control_flow.branch.if.condition.change"
] | 367,897 | 367,896 | u834224054 | python |
p02646 | a,v = map(int, input().split())
b,w = map(int, input().split())
t =int(input())
dif = b-a
vel = v-w
if vel*t >= dif:
print('YES')
else:
print('NO') | a,v = map(int, input().split())
b,w = map(int, input().split())
t =int(input())
dif = abs(b-a)
vel = v-w
if vel*t >= dif:
print('YES')
else:
print('NO') | [
"call.add",
"call.arguments.change"
] | 367,917 | 367,918 | u493520238 | python |
p02646 | a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
ans = "NO"
if (v-w)*t >= (b-a):
ans = "YES"
print(ans) | a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
ans = "NO"
if (v-w)*t >= abs(b-a):
ans = "YES"
print(ans) | [
"call.add",
"control_flow.branch.if.condition.change"
] | 367,921 | 367,922 | u255172538 | python |
p02646 | A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
D = B - A
if (V - W)*T >= D:
print("YES")
else:
print("NO")
| A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
D = abs(B - A)
if (V - W)*T >= D:
print("YES")
else:
print("NO")
| [
"call.add",
"call.arguments.change"
] | 367,949 | 367,950 | u814986259 | python |
p02646 | A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
D = B - A
if (V - W)*T >= T:
print("YES")
else:
print("NO")
| A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
D = abs(B - A)
if (V - W)*T >= D:
print("YES")
else:
print("NO")
| [
"call.add",
"call.arguments.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 367,951 | 367,950 | u814986259 | python |
p02646 | a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
d = abs(a - b)
s = v - w
if (s > 0 and t * s > d):
print('YES')
else:
print('NO') | a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
d = abs(a - b)
s = v - w
if (s > 0 and t * s >= d):
print('YES')
else:
print('NO') | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 367,970 | 367,971 | u908763441 | python |
p02646 | a, v = [int(i) for i in input().split()]
b, w = [int(i) for i in input().split()]
t = int(input())
if v <= w:
print('No')
else:
if abs(a - b) <= t * (v - w):
print('Yes')
else:
print('No') | a, v = [int(i) for i in input().split()]
b, w = [int(i) for i in input().split()]
t = int(input())
if v <= w:
print('NO')
else:
if abs(a - b) <= t * (v - w):
print('YES')
else:
print('NO') | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 367,972 | 367,973 | u172877642 | python |
p02646 | A,V=map(int,input().split())
B,W=map(int,input().split())
t=input()
T=int(t)
if abs(B-A)+(V-W)*T <=0:
print('YES')
else:
print('NO')
| A,V=map(int,input().split())
B,W=map(int,input().split())
t=input()
T=int(t)
if abs(B-A)-(V-W)*T <=0:
print('YES')
else:
print('NO')
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 367,974 | 367,975 | u781027071 | python |
p02646 | ma = lambda :map(int,input().split())
ni = lambda:int(input())
import collections
import math
import itertools
gcd = math.gcd
a,v = ma()
b,w = ma()
t = ni()
if w>=v:
print("NO")
exit()
d = abs(a-b)
if d + w*t <v*t:
print("YES")
else:
print("NO")
| ma = lambda :map(int,input().split())
ni = lambda:int(input())
import collections
import math
import itertools
gcd = math.gcd
a,v = ma()
b,w = ma()
t = ni()
if w>=v:
print("NO")
exit()
d = abs(a-b)
if d + w*t <=v*t:
print("YES")
else:
print("NO")
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 367,977 | 367,978 | u401487574 | python |
p02646 | a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
d=b-a
s=v-w
if d<s*t:
print('YES')
else:
print('NO') | a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
d=abs(b-a)
s=v-w
if d<=s*t:
print('YES')
else:
print('NO') | [
"call.add",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 367,979 | 367,980 | u956547804 | python |
p02646 | a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
d=b-a
s=v-w
if d<=s*t:
print('YES')
else:
print('NO') | a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
d=abs(b-a)
s=v-w
if d<=s*t:
print('YES')
else:
print('NO') | [
"call.add",
"call.arguments.change"
] | 367,981 | 367,980 | u956547804 | python |
p02646 | A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
if A - B >= 0 :
C = A - B
else:
C = B - A
X = V - W
Z = T * X
if C - Z >= 0:
print("NO")
else:
print("YES") | A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
if A - B >= 0 :
C = A - B
else:
C = B - A
X = V - W
Z = T * X
if C - Z > 0:
print("NO")
else:
print("YES") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 367,998 | 367,999 | u362127784 | python |
p02646 | a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
s = v-w
d = b-a
if(s*t>=d):
print('YES')
else:
print('NO') | a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
s = v-w
d = b-a
d = abs(d)
if(s*t>=d):
print('YES')
else:
print('NO') | [
"assignment.add"
] | 368,004 | 368,005 | u627143908 | python |
p02646 | import io,sys
sys.setrecursionlimit(10**6)
def main():
a,v = map(int,sys.stdin.readline().rstrip().split())
b,w = map(int,sys.stdin.readline().rstrip().split())
t = int(input())
l = abs(a-b)
p = abs(v-w)
if p != 0 and l/p <= t:
print("YES")
else:
print("NO")
main() | import io,sys
sys.setrecursionlimit(10**6)
def main():
a,v = map(int,sys.stdin.readline().rstrip().split())
b,w = map(int,sys.stdin.readline().rstrip().split())
t = int(input())
l = abs(a-b)
p = v-w
if p > 0 and l/p <= t:
print("YES")
else:
print("NO")
main() | [
"call.remove",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 368,017 | 368,018 | u474561976 | python |
p02646 | import sys
import os
import itertools
from collections import deque
def main():
if os.getenv("ENV")=='LOCAL':
sys.stdin = open(os.path.dirname(__file__)+'/input.txt', 'r')
A,V=map(int, input().split())
B,W=map(int, input().split())
T=int(input())
if T*W+abs(A-W)<=T*V:
print('YES')... | import sys
import os
import itertools
from collections import deque
def main():
if os.getenv("ENV")=='LOCAL':
sys.stdin = open(os.path.dirname(__file__)+'/input.txt', 'r')
A,V=map(int, input().split())
B,W=map(int, input().split())
T=int(input())
if T*W+abs(A-B)<=T*V:
print('YES')... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 368,035 | 368,036 | u077003677 | python |
p02646 | # -*- coding: utf-8 -*-
def solve():
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if V-W >0 and abs(A-B)/V-W <= T:
return 'YES'
return 'NO'
if __name__ == '__main__':
print(solve())
| # -*- coding: utf-8 -*-
def solve():
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if V-W >0 and abs(A-B)/(V-W) <= T:
return 'YES'
return 'NO'
if __name__ == '__main__':
print(solve())
| [
"control_flow.branch.if.condition.change"
] | 368,037 | 368,038 | u667469290 | python |
p02646 | a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if v <= w:
print('No')
else:
if abs(a - b) <= abs(v - w) * t:
print('Yes')
else:
print('No')
| a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if v <= w:
print('NO')
else:
if abs(a - b) <= abs(v - w) * t:
print('YES')
else:
print('NO')
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 368,053 | 368,054 | u970523279 | python |
p02646 | a, v = map(int,input().split())
b, w = map(int,input().split())
t = int(input())
if a <= b:
if a+v*t >= b+w*t:
print("YES")
else:
print("NO")
else:
if a+v*t <= b+w*t:
print("YES")
else:
print("NO") | a, v = map(int,input().split())
b, w = map(int,input().split())
t = int(input())
if a <= b:
if a+v*t >= b+w*t:
print("YES")
else:
print("NO")
else:
if a-v*t <= b-w*t:
print("YES")
else:
print("NO") | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 368,055 | 368,056 | u948522631 | python |
p02646 | a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
x = t * (v - w)
if (b - a) <= x:
print('YES')
else:
print('NO') | a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
x = t * (v - w)
if abs(b - a) <= x:
print('YES')
else:
print('NO')
| [
"call.add",
"control_flow.branch.if.condition.change"
] | 368,064 | 368,065 | u581403769 | python |
p02646 | import sys
readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prn = lambda x: print(*x, sep='\n')
def solve():
a, v = nm()
b, w = nm()
t = ni... | import sys
readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prn = lambda x: print(*x, sep='\n')
def solve():
a, v = nm()
b, w = nm()
t = ni... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 368,074 | 368,075 | u543954314 | python |
p02646 | a,v = list(map(int, input().split()))
b,w = list(map(int, input().split()))
t = int(input())
diff = abs(a-b)
V = abs(v-w)
if V <= 0:
print('NO')
else:
if diff<=V*t:
print('YES')
else:
print('NO')
| a,v = list(map(int, input().split()))
b,w = list(map(int, input().split()))
t = int(input())
diff = abs(a-b)
V = v-w
if V <= 0:
print('NO')
else:
if diff<=V*t:
print('YES')
else:
print('NO') | [
"call.remove",
"call.arguments.change"
] | 368,076 | 368,077 | u687574784 | python |
p02646 | # -*- coding: utf-8 -*-
def input_one_number():
return int(input())
def input_multiple_number():
return map(int, input().split())
def input_multiple_number_as_list():
return list(map(int, input().split()))
A , V = input_multiple_number()
B, W = input_multiple_number()
T = input_one_number()
D = abs(B-... | # -*- coding: utf-8 -*-
def input_one_number():
return int(input())
def input_multiple_number():
return map(int, input().split())
def input_multiple_number_as_list():
return list(map(int, input().split()))
A , V = input_multiple_number()
B, W = input_multiple_number()
T = input_one_number()
D = abs(B-... | [
"expression.operation.binary.remove"
] | 368,093 | 368,094 | u985972698 | python |
p02646 | # -*- coding: utf-8 -*-
def input_one_number():
return int(input())
def input_multiple_number():
return map(int, input().split())
def input_multiple_number_as_list():
return list(map(int, input().split()))
A , V = input_multiple_number()
B, W = input_multiple_number()
T = input_one_number()
D = abs(B-... | # -*- coding: utf-8 -*-
def input_one_number():
return int(input())
def input_multiple_number():
return map(int, input().split())
def input_multiple_number_as_list():
return list(map(int, input().split()))
A , V = input_multiple_number()
B, W = input_multiple_number()
T = input_one_number()
D = abs(B-... | [
"call.remove",
"call.arguments.change"
] | 368,096 | 368,094 | u985972698 | python |
p02646 | # -*- coding: utf-8 -*-
def input_one_number():
return int(input())
def input_multiple_number():
return map(int, input().split())
def input_multiple_number_as_list():
return list(map(int, input().split()))
A , V = input_multiple_number()
B, W = input_multiple_number()
T = input_one_number()
D = abs(B-... | # -*- coding: utf-8 -*-
def input_one_number():
return int(input())
def input_multiple_number():
return map(int, input().split())
def input_multiple_number_as_list():
return list(map(int, input().split()))
A , V = input_multiple_number()
B, W = input_multiple_number()
T = input_one_number()
D = abs(B-... | [
"call.remove",
"call.arguments.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 368,097 | 368,094 | u985972698 | python |
p02646 | A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if abs(B-A) <= T*(V-W):
print("Yes")
else:
print("No")
| A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if abs(B-A) <= T*(V-W):
print("YES")
else:
print("NO")
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 368,100 | 368,101 | u722148122 | python |
p02646 | def main1():
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if (V-W)*T >= B-A:
print("YES")
else:
print("NO")
main1()
| def main1():
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if (V-W)*T >= abs(B-A):
print("YES")
else:
print("NO")
main1()
| [
"control_flow.branch.if.condition.change",
"call.add"
] | 368,110 | 368,111 | u825378567 | python |
p02646 |
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
d = V - W
if d > 0 and abs(A - B) // d <= T:
print("YES")
else:
print("NO")
|
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
d = V - W
if d > 0 and abs(A - B) / d <= T:
print("YES")
else:
print("NO")
| [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 368,116 | 368,117 | u057109575 | python |
p02646 | A,V=map(int, input().split())
B,W=map(int, input().split())
T=int(input())
AB=abs(A-B)
VW=V-W
if VW == 0:
print('NO')
elif AB < VW * T:
print('YES')
else:
print('NO') | A,V=map(int, input().split())
B,W=map(int, input().split())
T=int(input())
AB=abs(A-B)
VW=V-W
if VW == 0:
print('NO')
elif AB <= VW * T:
print('YES')
else:
print('NO') | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 368,128 | 368,129 | u841599623 | python |
p02646 | A, V = (int(i) for i in input().split())
B, W = (int(i) for i in input().split())
T = int(input())
if V <= W:
print("No")
else:
if abs(A - B) / (V - W) <= T:
print("YES")
else:
print("NO") | A, V = (int(i) for i in input().split())
B, W = (int(i) for i in input().split())
T = int(input())
if V <= W:
print("NO")
else:
if abs(A - B) / (V - W) <= T:
print("YES")
else:
print("NO") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 368,130 | 368,131 | u261374036 | python |
p02646 | A, V = (int(i) for i in input().split())
B, W = (int(i) for i in input().split())
T = int(input())
if V <= W:
print("No")
else:
if abs(A - B) / (V - W) <= T:
print("Yes")
else:
print("No") | A, V = (int(i) for i in input().split())
B, W = (int(i) for i in input().split())
T = int(input())
if V <= W:
print("NO")
else:
if abs(A - B) / (V - W) <= T:
print("YES")
else:
print("NO") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 368,132 | 368,131 | u261374036 | python |
p02646 | a = input().split()
b = input().split()
t = input()
d = abs(int(a[0]) - int(b[0]))
if (int(a[1]) <= int(b[1])):
print('No')
else:
sek = int(a[1]) - int(b[1])
if d <= int(t)*sek:
print('YES')
else :
print('NO') | a = input().split()
b = input().split()
t = input()
d = abs(int(a[0]) - int(b[0]))
if (int(a[1]) <= int(b[1])):
print('NO')
else:
sek = int(a[1]) - int(b[1])
if d <= int(t)*sek:
print('YES')
else :
print('NO') | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 368,133 | 368,134 | u966542724 | python |
p02646 | a = input().split()
b = input().split()
t = input()
d = abs(int(a[0]) - int(b[0]))
if (int(a[1]) <= int(b[1])):
print('No')
else:
sek = int(a[1]) - int(b[1])
if d <= int(t)*sek:
print('Yes')
else :
print('No') | a = input().split()
b = input().split()
t = input()
d = abs(int(a[0]) - int(b[0]))
if (int(a[1]) <= int(b[1])):
print('NO')
else:
sek = int(a[1]) - int(b[1])
if d <= int(t)*sek:
print('YES')
else :
print('NO') | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 368,135 | 368,134 | u966542724 | python |
p02646 | a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if a<=b and a+v*t>=b+w*t:
print("YES")
elif a>b and a+v*t<=b+w*t:
print("YES")
else:
print("NO") | a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if a<=b and a+v*t>=b+w*t:
print("YES")
elif a>b and a-v*t<=b-w*t:
print("YES")
else:
print("NO") | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 368,140 | 368,139 | u371409687 | python |
p02646 | A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if W>=V:
print('No')
else:
key=abs(A-B)
if key+W*T>V*T:
print('No')
else:
print('Yes') | A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if W>=V:
print('NO')
else:
key=abs(A-B)
if key+W*T>V*T:
print('NO')
else:
print('YES') | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 368,153 | 368,154 | u579015878 | python |
p02646 | A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
if (B-A) - (V - W)*T <= 0:
print('YES')
else:
print('NO')
| A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
if abs(B-A) - (V - W)*T <= 0:
print('YES')
else:
print('NO')
| [
"call.add",
"control_flow.branch.if.condition.change"
] | 368,159 | 368,160 | u973972117 | python |
p02646 | import sys
def _i(): return int(sys.stdin.readline().strip())
def _ia(): return map(int, sys.stdin.readline().strip().split())
def main():
a, v = _ia()
b, w = _ia()
t = _i()
if a > b:
ans = "Yes" if a - (v-w) * t <= b else "No"
else:
ans = "Yes" if a + (v-w) * t >= b else "No"
... | import sys
def _i(): return int(sys.stdin.readline().strip())
def _ia(): return map(int, sys.stdin.readline().strip().split())
def main():
a, v = _ia()
b, w = _ia()
t = _i()
if a > b:
ans = "YES" if a - (v-w) * t <= b else "NO"
else:
ans = "YES" if a + (v-w) * t >= b else "NO"
... | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 368,177 | 368,178 | u591589288 | python |
p02646 |
a,v=map(int,input().split())
b,w=map(int,input().split())
T=int(input())
if (v*T)-(w*T)>abs(a-b):
print("YES")
else:
print("NO")
| import math
a,v=map(int,input().split())
b,w=map(int,input().split())
T=int(input())
if (v*T)-(w*T)>=abs(a-b):
print("YES")
else:
print("NO")
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 368,201 | 368,202 | u376450099 | python |
p02646 | A,V=map(int,(input().split()))
B,W=map(int,(input().split()))
T=int(input())
dist=abs(A-B)
sp=abs(V-W)
if(sp*T>=dist):
print("YES")
else:
print("NO") | A,V=map(int,(input().split()))
B,W=map(int,(input().split()))
T=int(input())
dist=abs(A-B)
sp=V-W
if(sp*T>=dist):
print("YES")
else:
print("NO") | [
"call.remove",
"call.arguments.change"
] | 368,203 | 368,204 | u382407432 | python |
p02646 | a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if v <= w:
print("NO")
elif abs(a-b) // abs(v-w) <= t:
print("YES")
else:
print("NO") | a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if v <= w:
print("NO")
elif abs(a-b) / abs(v-w) <= t:
print("YES")
else:
print("NO") | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 368,364 | 368,365 | u102126195 | python |
p02647 | n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[0]*n
c=[0]*n
cnt=0
while cnt<101:
cnt+=1
for i in range(n):
b[max(0,i-a[i])]+=1
if i+a[i]<n-1:
b[i+a[i]+1]-=1
c[0]=b[0]
for j in range(n-1):
c[j+1]=c[j]+b[j+1]
a=c
b=[0]*n
c=[0]*n
print(*a) | n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[0]*n
c=[0]*n
cnt=0
while cnt<min(k,101):
cnt+=1
for i in range(n):
b[max(0,i-a[i])]+=1
if i+a[i]<n-1:
b[i+a[i]+1]-=1
c[0]=b[0]
for j in range(n-1):
c[j+1]=c[j]+b[j+1]
a=c
b=[0]*n
c=[0]*n
print(*a) | [
"control_flow.loop.condition.change",
"call.add"
] | 368,380 | 368,381 | u492910842 | python |
p02647 | N, K = map(int, input().split())
A = list(map(int, input().split()))
for _ in range(min(K, 50)):
lamp = [0 for i in range(N + 1)]
for i in range(N):
lamp[max(0, i - A[i])] += 1
lamp[min(N, i + A[i] + 1)] -= 1
print(lamp)
for i in range(1, N + 1):
lamp[i] += lamp[i - 1]
A = ... | N, K = map(int, input().split())
A = list(map(int, input().split()))
for _ in range(min(K, 50)):
lamp = [0 for i in range(N + 1)]
for i in range(N):
lamp[max(0, i - A[i])] += 1
lamp[min(N, i + A[i] + 1)] -= 1
for i in range(1, N + 1):
lamp[i] += lamp[i - 1]
A = lamp
[print(A[i... | [
"call.remove"
] | 368,395 | 368,396 | u651109406 | python |
p02647 | N, K = map(int, input().split())
A = list(map(int, input().split()))
for _ in range(min(K, 50)):
lamp = [0 for i in range(N + 1)]
for i in range(N):
lamp[max(0, i - A[i])] += 1
lamp[min(N, i + A[i] + 1)] -= 1
for i in range(N):
lamp[i] += lamp[i - 1]
A = lamp
[print(A[i], end=... | N, K = map(int, input().split())
A = list(map(int, input().split()))
for _ in range(min(K, 50)):
lamp = [0 for i in range(N + 1)]
for i in range(N):
lamp[max(0, i - A[i])] += 1
lamp[min(N, i + A[i] + 1)] -= 1
for i in range(1, N + 1):
lamp[i] += lamp[i - 1]
A = lamp
[print(A[i... | [
"call.arguments.add"
] | 368,398 | 368,396 | u651109406 | python |
p02647 | # 問題文の意味がわからんコンテスト
# 0の場合も自分自身を照らす、っての気づくところからやっと読解
# Kを5000兆回やったあとはすべての要素がNになっとる この収束はわりと早いらしい
n, k = map(int, input().split())
a = list(map(int, input().split()))
for _ in range(max(k, 100)):
b = [0] * (n + 1)
for i in range(n):
b[max(0, i - a[i])] += 1
b[min(n, i + a[i] + 1)] -= 1
for i... | # 問題文の意味がわからんコンテスト
# 0の場合も自分自身を照らす、っての気づくところからやっと読解
# Kを5000兆回やったあとはすべての要素がNになっとる この収束はわりと早いらしい
n, k = map(int, input().split())
a = list(map(int, input().split()))
for _ in range(min(k, 100)):
b = [0] * (n + 1)
for i in range(n):
b[max(0, i - a[i])] += 1
b[min(n, i + a[i] + 1)] -= 1
for i... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 368,423 | 368,424 | u445624660 | python |
p02647 | # 問題文の意味がわからんコンテスト
# 0の場合も自分自身を照らす、っての気づくところからやっと読解
# Kを5000兆回やったあとはすべての要素がNになっとる この収束はわりと早いらしい
n, k = map(int, input().split())
a = list(map(int, input().split()))
for _ in range(50):
b = [0] * (n + 1)
for i in range(n):
b[max(0, i - a[i])] += 1
b[min(n, i + a[i] + 1)] -= 1
for i in range... | # 問題文の意味がわからんコンテスト
# 0の場合も自分自身を照らす、っての気づくところからやっと読解
# Kを5000兆回やったあとはすべての要素がNになっとる この収束はわりと早いらしい
n, k = map(int, input().split())
a = list(map(int, input().split()))
for _ in range(min(k, 100)):
b = [0] * (n + 1)
for i in range(n):
b[max(0, i - a[i])] += 1
b[min(n, i + a[i] + 1)] -= 1
for i... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 368,425 | 368,424 | u445624660 | python |
p02647 | # 問題文の意味がわからんコンテスト
# 0の場合も自分自身を照らす、っての気づくところからやっと読解
# Kを5000兆回やったあとはすべての要素がNになっとる この収束はわりと早いらしい
n, k = map(int, input().split())
a = list(map(int, input().split()))
for _ in range(1000):
b = [0] * (n + 1)
for i in range(n):
b[max(0, i - a[i])] += 1
b[min(n, i + a[i] + 1)] -= 1
for i in ran... | # 問題文の意味がわからんコンテスト
# 0の場合も自分自身を照らす、っての気づくところからやっと読解
# Kを5000兆回やったあとはすべての要素がNになっとる この収束はわりと早いらしい
n, k = map(int, input().split())
a = list(map(int, input().split()))
for _ in range(min(k, 100)):
b = [0] * (n + 1)
for i in range(n):
b[max(0, i - a[i])] += 1
b[min(n, i + a[i] + 1)] -= 1
for i... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 368,427 | 368,424 | u445624660 | python |
p02647 |
N, K = map(int, input().split())
X = list(map(int, input().split()))
x = X[:] + [0]
for _ in range(K):
if all(v == N for v in x[:-1]):
break
new = [0] * (N + 1)
for i in range(N):
new[max(0, i - x[i])] += 1
new[min(N, i + x[i] + 1)] -= 1
for i in range(N):
new[i + 1] ... |
N, K = map(int, input().split())
X = list(map(int, input().split()))
x = X[:] + [0]
for _ in range(K):
if all(v == N for v in x[:-1]):
break
new = [0] * (N + 1)
for i in range(N):
new[max(0, i - x[i])] += 1
new[min(N, i + x[i] + 1)] -= 1
for i in range(N):
new[i + 1] ... | [] | 368,433 | 368,434 | u057109575 | python |
p02647 | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [-int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())... | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [-int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())... | [
"misc.opposites",
"assignment.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 368,440 | 368,441 | u703950586 | python |
p02647 | n, k = map(int, input().split())
a = list(map(int, input().split()))
for j in range(41):
b = [0]*n
for i in range(n):
l = max(0, i-a[i])
r = min(n, i+a[i]+1)
b[l] += 1
if r < n:
b[r] -= 1
for i in range(1, n):
b[i]+=b[i-1]
a = b
print(" ".join(list(map(str, a))))
| n, k = map(int, input().split())
a = list(map(int, input().split()))
for j in range(min(k, 41)):
b = [0]*n
for i in range(n):
l = max(0, i-a[i])
r = min(n, i+a[i]+1)
b[l] += 1
if r < n:
b[r] -= 1
for i in range(1, n):
b[i]+=b[i-1]
a = b
print(" ".join(list(map(str, a))))
| [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 368,445 | 368,446 | u626881915 | python |
p02647 | import math
from sys import stdin,stdout
#% 998244353
from heapq import heapify,heappop,heappush
import collections
n,k=list(map(int,stdin.readline().split()))
a=list(map(int,stdin.readline().split()))
for i in range(min(k,math.log(n))):
#nw=[0]*n
pr=[0]*n
for x,d in enumerate(a):
if d==0:
... | import math
from sys import stdin,stdout
#% 998244353
from heapq import heapify,heappop,heappush
import collections
n,k=list(map(int,stdin.readline().split()))
a=list(map(int,stdin.readline().split()))
for i in range(min(k,42)):
#nw=[0]*n
pr=[0]*n
for x,d in enumerate(a):
if d==0:
pr[... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.remove"
] | 368,454 | 368,455 | u117327911 | python |
p02647 | import math
from sys import stdin,stdout
#% 998244353
from heapq import heapify,heappop,heappush
import collections
n,k=list(map(int,stdin.readline().split()))
a=list(map(int,stdin.readline().split()))
for i in range(4):
#nw=[0]*n
pr=[0]*n
for x,d in enumerate(a):
if d==0:
pr[x]+=1
... | import math
from sys import stdin,stdout
#% 998244353
from heapq import heapify,heappop,heappush
import collections
n,k=list(map(int,stdin.readline().split()))
a=list(map(int,stdin.readline().split()))
for i in range(min(k,42)):
#nw=[0]*n
pr=[0]*n
for x,d in enumerate(a):
if d==0:
pr[... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 368,458 | 368,455 | u117327911 | python |
p02647 | import math
from sys import stdin,stdout
#% 998244353
from heapq import heapify,heappop,heappush
import collections
n,k=list(map(int,stdin.readline().split()))
a=list(map(int,stdin.readline().split()))
for i in range(2):
#nw=[0]*n
pr=[0]*n
for x,d in enumerate(a):
if d==0:
pr[x]+=1
... | import math
from sys import stdin,stdout
#% 998244353
from heapq import heapify,heappop,heappush
import collections
n,k=list(map(int,stdin.readline().split()))
a=list(map(int,stdin.readline().split()))
for i in range(min(k,42)):
#nw=[0]*n
pr=[0]*n
for x,d in enumerate(a):
if d==0:
pr[... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 368,459 | 368,455 | u117327911 | python |
p02647 | from itertools import accumulate
def mi():
return map(int, input().split())
def main():
N, K = mi()
A = list(mi())
for _ in range(K):
l = [0]*N
for i in range(N):
left = max(i-A[i], 0)
right = min(i+A[i]+1, N)
l[left] += 1
if right < N:
... | from itertools import accumulate
def mi():
return map(int, input().split())
def main():
N, K = mi()
A = list(mi())
for _ in range(K):
l = [0]*N
for i in range(N):
left = max(i-A[i], 0)
right = min(i+A[i]+1, N)
l[left] += 1
if right < N:
... | [
"call.add",
"call.arguments.change"
] | 368,529 | 368,530 | u495667483 | python |
p02647 | #import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
#import heapq
#from fractions import gcd
#input=sys.stdin.readline
import bisect
n,k=map(int,input().split())
a=list(map(int,input().split()))
c=0
while True:
b... | #import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
#import heapq
#from fractions import gcd
#input=sys.stdin.readline
import bisect
n,k=map(int,input().split())
a=list(map(int,input().split()))
c=0
while True:
b... | [
"call.arguments.change"
] | 368,581 | 368,582 | u064434060 | python |
p02647 | n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(k):
acc = [0 for j in range(n+1)]
for j in range(n):
acc[max(0, j - a[j])] += 1
acc[min(n-1, j + a[j]) + 1] -= 1
for j in range(n):
acc[j+1] += acc[j]
a = acc[:-1]
if sum(a) == n * n:
... | n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(k):
acc = [0 for j in range(n+1)]
for j in range(n):
acc[max(0, j - a[j])] += 1
acc[min(n-1, j + a[j]) + 1] -= 1
for j in range(n):
acc[j+1] += acc[j]
a = acc[:-1]
if sum(a) == n * n:
... | [
"call.remove"
] | 368,599 | 368,600 | u691896522 | python |
p02647 |
n, k = map(int, input().split())
a = list(map(int, input().split()))
#n = 2 * 10 ** 5
#a = [0] * n
cnt = 0
while cnt < k:
imos = [0] * (n + 1)
for i in range(n):
imos[max(i - a[i], 0)] += 1
imos[min(i + a[i] + 1, n)] -= 1
for i in range(n):
imos[i + 1] += imos[i]
a = imos[0:n... | n, k = map(int, input().split())
a = list(map(int, input().split()))
# imos法で区間和を計算する、をk回まで繰り返す
cnt = 0
while cnt < k:
imos = [0] * (n + 1)
for i in range(n):
imos[max(i - a[i], 0)] += 1
imos[min(i + a[i] + 1, n)] -= 1
for i in range(n):
imos[i + 1] += imos[i]
a = imos[0:n]
... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 368,669 | 368,670 | u794173881 | python |
p02647 |
n, k = map(int, input().split())
a = list(map(int, input().split()))
#n = 2 * 10 ** 5
#a = [0] * n
cnt = 0
while cnt < k:
imos = [0] * (n + 1)
for i in range(n):
imos[max(i - a[i], 0)] += 1
imos[min(i + a[i] + 1, n)] -= 1
for i in range(n):
imos[i + 1] += imos[i]
a = imos[0:n... |
n, k = map(int, input().split())
a = list(map(int, input().split()))
#n = 2 * 10 ** 5
#a = [0] * n
cnt = 0
while cnt < k:
imos = [0] * (n + 1)
for i in range(n):
imos[max(i - a[i], 0)] += 1
imos[min(i + a[i] + 1, n)] -= 1
for i in range(n):
imos[i + 1] += imos[i]
a = imos[0:n... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 368,669 | 368,671 | u794173881 | python |
p02647 | import sys
import math
import fractions
from collections import defaultdict
import numpy as np
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
N,K=nm()
A=nl(... | import sys
import math
import fractions
from collections import defaultdict
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
N,K=nm()
A=nl()
imos_l=[0]*(N+1)... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 368,677 | 368,675 | u525796732 | python |
p02647 | import sys
input = sys.stdin.readline
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range(K):
b = [0] * (N+1)
for j in range(N):
a = A[j]
b[max(j-a, 0)] += 1
b[min(j+a+1, N)] -= 1
for k in range(1,N+1):
... | import sys
input = sys.stdin.readline
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range(K):
b = [0] * (N+1)
for j in range(N):
a = A[j]
b[max(j-a, 0)] += 1
b[min(j+a+1, N)] -= 1
for k in range(1,N+1):
... | [
"call.remove"
] | 368,678 | 368,679 | u163501259 | python |
p02647 | n,k=map(int,input().split())
a=list(map(int,input().split()))
for j in range(41):
b=[0]*n
for i in range(0,n):
l=max(0,i-a[i])
r=min(n-1,i+a[i])
b[l]+=1
if(r+1<n):
b[r+1]-=1
for i in range(1,n,1):
b[i]+=b[i-1]
if a==b:
break
a=b
print(' ... | n,k=map(int,input().split())
a=list(map(int,input().split()))
for j in range(k):
b=[0]*n
for i in range(0,n):
l=max(0,i-a[i])
r=min(n-1,i+a[i])
b[l]+=1
if(r+1<n):
b[r+1]-=1
for i in range(1,n,1):
b[i]+=b[i-1]
if a==b:
break
a=b
print(' '... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 368,680 | 368,681 | u502126017 | python |
p02647 | from itertools import accumulate
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
for _ in range(K):
arr = [0]*(N+1)
for i, a in enumerate(A):
left = max(0, i-a)
right = min(N, i+a+1)
arr[left] += 1
arr[right] ... | from itertools import accumulate
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
for _ in range(K):
arr = [0]*(N+1)
for i, a in enumerate(A):
left = max(0, i-a)
right = min(N, i+a+1)
arr[left] += 1
arr[right] ... | [] | 368,769 | 368,770 | u707498674 | python |
p02647 | n,k=map(int,input().split())
A=list(map(int,input().split()))
def culc(L):
subL=[0]*(n+1)
for i in range(n):
temp=L[i]
bottom=max(i-temp,0)
top=min(i+temp,n-1)
subL[bottom]+=1
subL[top+1]-=1
resL=[0]*n
resL[0]=subL[0]
for i in range(1,n):
resL[... | n,k=map(int,input().split())
A=list(map(int,input().split()))
def culc(L):
subL=[0]*(n+1)
for i in range(n):
temp=L[i]
bottom=max(i-temp,0)
top=min(i+temp,n-1)
subL[bottom]+=1
subL[top+1]-=1
resL=[0]*n
resL[0]=subL[0]
for i in range(1,n):
resL[... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 368,783 | 368,781 | u523545435 | python |
p02647 | n,k=map(int,input().split())
A=list(map(int,input().split()))
def culc(L):
subL=[0]*(n+1)
for i in range(n):
temp=L[i]
bottom=max(i-temp,0)
top=min(i+temp,n-1)
subL[bottom]+=1
subL[top+1]-=1
resL=[0]*n
resL[0]=subL[0]
for i in range(1,n):
resL[... | n,k=map(int,input().split())
A=list(map(int,input().split()))
def culc(L):
subL=[0]*(n+1)
for i in range(n):
temp=L[i]
bottom=max(i-temp,0)
top=min(i+temp,n-1)
subL[bottom]+=1
subL[top+1]-=1
resL=[0]*n
resL[0]=subL[0]
for i in range(1,n):
resL[... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 368,784 | 368,781 | u523545435 | python |
p02647 | n,k=map(int,input().split())
A=list(map(int,input().split()))
def culc(L):
subL=[0]*(n+1)
for i in range(n):
temp=L[i]
bottom=max(i-temp,0)
top=min(i+temp,n-1)
subL[bottom]+=1
subL[top+1]-=1
resL=[0]*n
resL[0]=subL[0]
for i in range(1,n):
resL[... | n,k=map(int,input().split())
A=list(map(int,input().split()))
def culc(L):
subL=[0]*(n+1)
for i in range(n):
temp=L[i]
bottom=max(i-temp,0)
top=min(i+temp,n-1)
subL[bottom]+=1
subL[top+1]-=1
resL=[0]*n
resL[0]=subL[0]
for i in range(1,n):
resL[... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 368,783 | 368,785 | u523545435 | python |
p02647 | n,k=map(int,input().split())
A=list(map(int,input().split()))
def culc(L):
subL=[0]*(n+1)
for i in range(n):
temp=L[i]
bottom=max(i-temp,0)
top=min(i+temp,n-1)
subL[bottom]+=1
subL[top+1]-=1
resL=[0]*n
resL[0]=subL[0]
for i in range(1,n):
resL[... | n,k=map(int,input().split())
A=list(map(int,input().split()))
def culc(L):
subL=[0]*(n+1)
for i in range(n):
temp=L[i]
bottom=max(i-temp,0)
top=min(i+temp,n-1)
subL[bottom]+=1
subL[top+1]-=1
resL=[0]*n
resL[0]=subL[0]
for i in range(1,n):
resL[... | [
"call.arguments.change"
] | 368,784 | 368,785 | u523545435 | python |
p02647 | import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue
# import numpy as np
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
ni... | import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = lambda: int(sys.s... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 368,805 | 368,804 | u888337853 | python |
p02647 | import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue
import numpy as np
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
ni =... | import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = lambda: int(sys.s... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 368,806 | 368,804 | u888337853 | python |
p02647 | import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue
# import numpy as np
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
ni... | import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue
# import numpy as np
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
ni... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 368,805 | 368,809 | u888337853 | python |
p02647 | import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue
import numpy as np
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
ni =... | import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue
# import numpy as np
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
ni... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 368,806 | 368,809 | u888337853 | python |
p02647 | n, k = map(int, input().split())
a = list(map(int, input().split()))
for _ in range(min(50, k)):
l = [0]*(n+1)
for i in range(n):
l[max(i-a[i], 0)] += 1 #光の届く距離（後ろ）
l[min(i+a[i]+1, n)] -= 1 #光が届かなくなる距離(前)
print(l)
add = 0
for i in range(n):
add += l[i] #光の届いている電球の数を累積
... | n, k = map(int, input().split())
a = list(map(int, input().split()))
for _ in range(min(50, k)):
l = [0]*(n+1)
for i in range(n):
l[max(i-a[i], 0)] += 1 #光の届く距離（後ろ）
l[min(i+a[i]+1, n)] -= 1 #光が届かなくなる距離(前)
add = 0
for i in range(n):
add += l[i] #光の届いている電球の数を累積
a[i] = add
... | [
"call.remove"
] | 368,837 | 368,838 | u518386853 | python |
p02647 | n,k,*l=map(int,open(0).read().split())
for _ in range(min(k,99)):
s=[0]*(n+1)
for i in range(n):
s[max(i-l[i],0)]+=1
s[min(i+l[i]+1,n)]-=1
l[0]=min(s[0],n)
for i in range(1,n):
l[i]=min(l[i-1]+s[i],n)
print(l) | n,k,*l=map(int,open(0).read().split())
for _ in range(min(k,41)):
s=[0]*(n+1)
for i in range(n):
s[max(i-l[i],0)]+=1
s[min(i+l[i]+1,n)]-=1
l[0]=min(s[0],n)
for i in range(1,n):
l[i]=min(l[i-1]+s[i],n)
print(*l) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 368,885 | 368,883 | u133936772 | python |
p02647 | n,k,*l=map(int,open(0).read().split())
for _ in range(min(k,20)):
s=[0]*(n+1)
for i in range(n):
s[max(i-l[i],0)]+=1
s[min(i+l[i]+1,n)]-=1
l[0]=min(s[0],n)
for i in range(1,n):
l[i]=min(l[i-1]+s[i],n)
print(l) | n,k,*l=map(int,open(0).read().split())
for _ in range(min(k,41)):
s=[0]*(n+1)
for i in range(n):
s[max(i-l[i],0)]+=1
s[min(i+l[i]+1,n)]-=1
l[0]=min(s[0],n)
for i in range(1,n):
l[i]=min(l[i-1]+s[i],n)
print(*l) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 368,886 | 368,883 | u133936772 | python |
p02647 | n,k,*l=map(int,open(0).read().split())
for _ in range(min(k,99)):
s=[0]*(n+1)
for i in range(n):
s[max(i-l[i],0)]+=1
s[min(i+l[i]+1,n)]-=1
l[0]=min(s[0],n)
for i in range(1,n):
l[i]=min(l[i-1]+s[i],n)
print(l) | n,k,*l=map(int,open(0).read().split())
for _ in range(min(k,99)):
s=[0]*(n+1)
for i in range(n):
s[max(i-l[i],0)]+=1
s[min(i+l[i]+1,n)]-=1
l[0]=min(s[0],n)
for i in range(1,n):
l[i]=min(l[i-1]+s[i],n)
print(*l) | [
"call.arguments.change"
] | 368,885 | 368,887 | u133936772 | python |
p02647 | n,k,*l=map(int,open(0).read().split())
for _ in range(min(k,20)):
s=[0]*(n+1)
for i in range(n):
s[max(i-l[i],0)]+=1
s[min(i+l[i]+1,n)]-=1
l[0]=min(s[0],n)
for i in range(1,n):
l[i]=min(l[i-1]+s[i],n)
print(l) | n,k,*l=map(int,open(0).read().split())
for _ in range(min(k,99)):
s=[0]*(n+1)
for i in range(n):
s[max(i-l[i],0)]+=1
s[min(i+l[i]+1,n)]-=1
l[0]=min(s[0],n)
for i in range(1,n):
l[i]=min(l[i-1]+s[i],n)
print(*l) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 368,886 | 368,887 | u133936772 | python |
p02647 | N, K = map(int, input().split())
A = list(map(int, input().split()))
# imos法して，もう一回同じことを行う
# K回のシミューレション，途中で全てがKになったら打ち切る
for _ in range(K):
new = [0] * N
imos = [0] * N
for i, a in enumerate(A): # 0-indexにしても問題ない
imos[max(0, i-a)] += 1
if i+a+1 <= N-1: # 右端まで照らすなら，終端は管理しない
im... | N, K = map(int, input().split())
A = list(map(int, input().split()))
# imos法して，もう一回同じことを行う
# K回のシミューレション，途中で全てがKになったら打ち切る
for _ in range(K):
new = [0] * N
imos = [0] * N
for i, a in enumerate(A): # 0-indexにしても問題ない
imos[max(0, i-a)] += 1
if i+a+1 <= N-1: # 右端まで照らすなら，終端は管理しない
im... | [] | 368,913 | 368,914 | u708255304 | python |
p02647 | def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
for _ in range(k):
imos = [0]*(n+1)
finish = True
for i, brightness in enumerate(a):
if finish and brightness != n:
finish = False
begin = max(i - brightness, 0)
... | def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
for _ in range(k):
imos = [0]*(n+1)
finish = True
for i, brightness in enumerate(a):
if finish and brightness != n:
finish = False
begin = max(i - brightness, 0)
... | [
"call.arguments.change",
"io.output.change"
] | 368,919 | 368,920 | u479719434 | python |
p02647 | N,K = map(int,input().split())
A = list(map(int,input().split()))
def s(n,a):
b = [0]*n
for i in range(n):
l = max(0,i-a[i])
r = min(n-1,i+a[i])
b[l] += 1
if r < n - 1:
b[r+1] -= 1
for i in range(n):
b[i+1] = b[i]
return b
for i in range(min(41,K)):
A = s(N,A)
print(A)
| N,K = map(int,input().split())
A = list(map(int,input().split()))
def s(n,a):
b = [0]*n
for i in range(n):
l = max(0,i-a[i])
r = min(n-1,i+a[i])
b[l] += 1
if r < n - 1:
b[r+1] -= 1
for i in range(n-1):
b[i+1] += b[i]
return b
for i in range(min(41,K)):
A = s(N,A)
print(*A)
... | [
"assignment.value.change",
"call.arguments.change"
] | 368,968 | 368,969 | u425762225 | python |
p02647 | import itertools
N, K = map(int,input().split())
A = list(map(int,input().split()))
B = [0] * (N+1)
chk = [N] *N
for k in range(K):
if A == chk:
break
for i in range(N):
if A[i] == 0:
B[i] += 1
B[i+1] -= 1
continue
l = i - A[i]
r = i + A[i]
... | import itertools
N, K = map(int,input().split())
A = list(map(int,input().split()))
B = [0] * (N+1)
chk = [N] *N
for k in range(K):
if A == chk:
break
for i in range(N):
if A[i] == 0:
B[i] += 1
B[i+1] -= 1
continue
l = i - A[i]
r = i + A[i]
... | [
"call.arguments.change"
] | 369,051 | 369,052 | u489124637 | python |
p02647 | N, K = map(int, input().split())
A = list(map(int, input().split()))
b = [0 for i in range(N+2)]
if K > 70:
ans = [N for i in range(N)]
print(*ans)
else:
for _ in range(K):
for i in range(N+2):
b[i] = 0
for i in range(N):
b[max(0, i+1-a[i])] += 1
b[min(N+1... | N, K = map(int, input().split())
A = list(map(int, input().split()))
b = [0 for i in range(N+2)]
if K > 70:
ans = [N for i in range(N)]
print(*ans)
else:
for _ in range(K):
for i in range(N+2):
b[i] = 0
for i in range(N):
b[max(0, i+1-A[i])] += 1
b[min(N+1... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.variable.change",
"io.output.change"
] | 369,088 | 369,089 | u780962115 | python |
p02647 | from heapq import heappush, heappop
N, K = map(int, input().split())
A = [int(i) for i in input().split()]
while K and sum(A) < N * N :
l = [0] * N
h = []
for i in range(N) :
while h and h[0] < i :
heappop(h)
l[i] = len(h)
heappush(h, (i + A[i]))
r = [0] * N
h = []
for i in range(N ... | from heapq import heappush, heappop
N, K = map(int, input().split())
A = [int(i) for i in input().split()]
while K and sum(A) < N * N :
l = [0] * N
h = []
for i in range(N) :
while h and h[0] < i :
heappop(h)
l[i] = len(h)
heappush(h, (i + A[i]))
r = [0] * N
h = []
for i in range(N ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"expression.operation.unary.add",
"call.arguments.change"
] | 369,275 | 369,276 | u511965386 | python |
p02647 | import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
for j in range(min(K,2*(math.log2(N))+1)):
B = [0]*N
for i in range(N):
l = max(0,i-A[i])
r = min(N-1,i+A[i])
B[l] += 1
if r < N-1:
B[r+1] -= 1
for i in range(1,N):
B[i] += B[i-1]
A = B
print(' '.join(map(str,A)))
| import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
for j in range(min(K,int(2*(math.log2(N)))+10)):
B = [0]*N
for i in range(N):
l = max(0,i-A[i])
r = min(N-1,i+A[i])
B[l] += 1
if r < N-1:
B[r+1] -= 1
for i in range(1,N):
B[i] += B[i-1]
A = B
print(' '.join(map(str,A)))
| [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"literal.number.integer.change",
"expression.operation.binary.change"
] | 369,326 | 369,323 | u591812989 | python |
p02647 | import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
for j in range(min(K,int(math.log2(N)))):
B = [0]*N
for i in range(N):
l = max(0,i-A[i])
r = min(N-1,i+A[i])
B[l] += 1
if r < N-1:
B[r+1] -= 1
for i in range(1,N):
B[i] += B[i-1]
A = B
print(' '.join(map(str,A)))
| import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
for j in range(min(K,int(2*(math.log2(N)))+10)):
B = [0]*N
for i in range(N):
l = max(0,i-A[i])
r = min(N-1,i+A[i])
B[l] += 1
if r < N-1:
B[r+1] -= 1
for i in range(1,N):
B[i] += B[i-1]
A = B
print(' '.join(map(str,A)))
| [
"call.arguments.add"
] | 369,327 | 369,323 | u591812989 | python |
p02647 | def main():
N, K = map(int, input().split())
A = list(map(int, input().split())) # 整数のリスト
B = [0] * N
for j in range(K, 41):
for i in range(N):
l = max(0, i-A[i])
r = min(N-1, i+A[i])
B[l] += 1
if r+1 < N: B[r+1] -= 1
for i in range(1,N):... | def main():
N, K = map(int, input().split())
A = list(map(int, input().split())) # 整数のリスト
B = [0] * N
for j in range(min(K, 41)):
for i in range(N):
l = max(0, i-A[i])
r = min(N-1, i+A[i])
B[l] += 1
if r+1 < N: B[r+1] -= 1
for i in range(... | [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 369,329 | 369,330 | u337751290 | python |
p02647 | # coding: utf-8
# Your code here!
import time
t1=time.time()
def LI():return list(map(int,input().split()))
n,k=LI()
a=LI()
for _ in range(k):
tab=[0]*(n)
for i in range(n):
q=a[i]
if 0<=i-q:
tab[i-q]+=1
else:
tab[0]+=1
if i+q+1<=n-1:
tab[i+q+... | # coding: utf-8
# Your code here!
import time
t1=time.time()
def LI():return list(map(int,input().split()))
n,k=LI()
a=LI()
for _ in range(k):
tab=[0]*(n)
for i in range(n):
q=a[i]
if 0<=i-q:
tab[i-q]+=1
else:
tab[0]+=1
if i+q+1<=n-1:
tab[i+q+... | [
"control_flow.break.remove",
"control_flow.exit.add",
"call.add"
] | 369,398 | 369,399 | u130900604 | python |
p02647 | from math import log2
n,k = map(int,input().split())
a = list(map(int,input().split()))
b = [0]*n
if(k > log2(n)):
for i in range(n):
print(n,end=" ")
else:
for j in range(k):
b = [0]*n
for i in range(n):
l = max(0,i-a[i])
r = min(n-1,a[i]+i)
b[l] +=... | from math import log2
n,k = map(int,input().split())
a = list(map(int,input().split()))
b = [0]*n
if(k > 10*log2(n) + 1):
for i in range(n):
print(n,end=" ")
else:
for j in range(k):
b = [0]*n
for i in range(n):
l = max(0,i-a[i])
r = min(n-1,a[i]+i)
... | [
"control_flow.branch.if.condition.change"
] | 369,402 | 369,401 | u920204936 | python |
p02647 | #!/usr/bin python3
# -*- coding: utf-8 -*-
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range(min(K,100)):
dm = [0]*N
for x in range(N):
dm[max(x - A[x],0)]+=1
if x+A[i]+1<N:
dm[x+A[x]+1]+=-1
for j... | #!/usr/bin python3
# -*- coding: utf-8 -*-
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range(min(K,50)):
dm = [0]*N
for x in range(N):
dm[max(x - A[x],0)]+=1
if x+A[x]+1<N:
dm[x+A[x]+1]+=-1
for j ... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 369,422 | 369,420 | u113971909 | python |
p02647 | #!/usr/bin python3
# -*- coding: utf-8 -*-
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range(K):
dm = [0]*N
for x in range(N):
dm[max(x - A[x],0)]+=1
if x+A[i]+1<N:
dm[x+A[x]+1]+=-1
for j in range... | #!/usr/bin python3
# -*- coding: utf-8 -*-
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range(min(K,50)):
dm = [0]*N
for x in range(N):
dm[max(x - A[x],0)]+=1
if x+A[x]+1<N:
dm[x+A[x]+1]+=-1
for j ... | [
"call.add",
"call.arguments.add",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 369,423 | 369,420 | u113971909 | python |
p02647 | def main():
N, K = list(map(int, input().split(' ')))
A = list(map(int, input().split(' ')))
if 2 ** K >= N:
print(' '.join([str(N) for _ in range(N)]))
return
for _ in range(K):
cumsum = [0 for _ in range(N)]
for i, a in enumerate(A):
left = max(0, i - a)
... | def main():
N, K = list(map(int, input().split(' ')))
A = list(map(int, input().split(' ')))
if K >= 42:
print(' '.join([str(N) for _ in range(N)]))
return
for _ in range(K):
cumsum = [0 for _ in range(N)]
for i, a in enumerate(A):
left = max(0, i - a)
... | [
"expression.operation.binary.remove",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 369,433 | 369,434 | u892487306 | python |
p02647 | #!/usr/bin/env python3
import sys
def solve(N: int, K: int, A: "List[int]"):
for k in range(K):
B = [0] * N
for i in range(N):
l = max(0, i - A[i])
r = i + A[i]
B[l] += 1
if r + 1 < N:
B[r + 1] -= 1
for i in range(1, N):
... | #!/usr/bin/env python3
import sys
def solve(N: int, K: int, A: "List[int]"):
for k in range(K):
B = [0] * N
for i in range(N):
l = max(0, i - A[i])
r = i + A[i]
B[l] += 1
if r + 1 < N:
B[r + 1] -= 1
for i in range(1, N):
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 369,453 | 369,454 | u544587633 | python |
p02647 | n, k = map(int, input().split())
A = list(map(int, input().split()))
for i in range(k):
B = [0] * (n+1)
for j in range(n):
B[max(0, j-A[j])] += 1
B[min(n, j+A[j])] -= 1
A[0] = B[0]
for j in range(1, n):
A[j] = A[j-1]+B[j]
if A == [n]*n:
print(*A)
exit()
print(... | n, k = map(int, input().split())
A = list(map(int, input().split()))
for i in range(k):
B = [0] * (n+1)
for j in range(n):
B[max(0, j-A[j])] += 1
B[min(n, j+A[j]+1)] -= 1
A[0] = B[0]
for j in range(1, n):
A[j] = A[j-1]+B[j]
if A == [n]*n:
print(*A)
exit()
prin... | [
"expression.operation.binary.add"
] | 369,468 | 369,469 | u594803920 | python |
p02647 | n, k = map(int, input().split())
A = list(map(int, input().split()))
for i in range(k):
B = [0] * (n+1)
for j in range(n):
B[max(0, j-A[j])] += 1
B[min(n, j+A[j])] -= 1
A[0] = B[0]
for j in range(1, n):
A[j] = A[j-1]+B[j]
if A == [n]*n:
print(*A)
exit()
print(... | n, k = map(int, input().split())
A = list(map(int, input().split()))
for i in range(k):
B = [0] * (n+1)
for j in range(n):
B[max(0, j-A[j])] += 1
B[min(n, j+A[j]+1)] -= 1
A[0] = B[0]
for j in range(1, n):
A[j] = A[j-1]+B[j]
if A == [n]*n:
print(*A)
exit()
prin... | [
"expression.operation.binary.add"
] | 369,470 | 369,469 | u594803920 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.