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 |
|---|---|---|---|---|---|---|---|
p02699 | S,W=[int(i) for i in input().split(" ")]
if W>=S:
print("unsage")
else:
print("safe") | S,W=[int(i) for i in input().split(" ")]
if W>=S:
print("unsafe")
else:
print("safe")
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 449,112 | 449,113 | u922952729 | python |
p02699 | S, W = map(int, input().split())
print('unsafe' if S / 2 <= W else 'safe')
| S, W = map(int, input().split())
print('unsafe' if S <= W else 'safe')
| [
"expression.operation.binary.remove"
] | 449,130 | 449,131 | u329709276 | python |
p02699 | from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)
a,b = map(int,stdin.readline().rstrip().split())
if b <= a:
print("unsafe")
else:
print("safe")
| from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)
a,b = map(int,stdin.readline().rstrip().split())
if b >= a:
print("unsafe")
else:
print("safe") | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 449,136 | 449,137 | u987164499 | python |
p02698 | from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a,b):
if(a%b==0):return(b)
return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()
N=int(input())
A=list(map(int,inp... | from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a,b):
if(a%b==0):return(b)
return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()
N=int(input())
A=list(map(int,inp... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 449,226 | 449,227 | u779455925 | python |
p02698 | from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a,b):
if(a%b==0):return(b)
return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()
N=int(input())
A=list(map(int,inp... | from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a,b):
if(a%b==0):return(b)
return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()
N=int(input())
A=list(map(int,inp... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 449,229 | 449,227 | u779455925 | python |
p02698 | import sys
input = sys.stdin.readline
from collections import deque
import bisect
n = int(input())
a = list(map(int,input().split()))
links = [[] for _ in range(n+1)]
for _ in range(n-1):
v,w = map(int, input().split())
links[v].append(w)
links[w].append(v)
inf = 10**10
lis = [inf] * n
inf_ind = 0
parent... | import sys
input = sys.stdin.readline
from collections import deque
import bisect
n = int(input())
a = list(map(int,input().split()))
links = [[] for _ in range(n+1)]
for _ in range(n-1):
v,w = map(int, input().split())
links[v].append(w)
links[w].append(v)
inf = 10**10
lis = [inf] * n
inf_ind = 0
parent... | [
"call.remove"
] | 449,280 | 449,281 | u490642448 | python |
p02698 | import sys
import bisect
sys.setrecursionlimit(10**9)
INF = 2**30
N = int(input())
A = list(map(int, input().split()))
E = []
for i in range(N):
E.append([])
for i in range(N-1):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
E[u].append(v)
E[v].append(u)
ans = [0] * N
dp = [INF] * N
def... | import sys
import bisect
sys.setrecursionlimit(10**9)
INF = 2**30
N = int(input())
A = list(map(int, input().split()))
E = []
for i in range(N):
E.append([])
for i in range(N-1):
u, v = list(map(int, input().split()))
u -= 1
v -= 1
E[u].append(v)
E[v].append(u)
ans = [0] * N
dp = [INF] * N
def... | [
"assignment.value.change",
"identifier.change"
] | 449,290 | 449,291 | u749321340 | python |
p02699 | A, B = map(int, input().split())
if A <= W:
print("unsafe")
else:
print("safe") | A, B = map(int, input().split())
if A <= B:
print("unsafe")
else:
print("safe") | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 449,340 | 449,341 | u982591663 | python |
p02698 | #!/usr/bin/env python3
#F
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collect... | #!/usr/bin/env python3
#F
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collect... | [
"control_flow.return.remove",
"control_flow.continue.add",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 449,387 | 449,388 | u191874006 | python |
p02698 | #!/usr/bin/env python3
#F
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collect... | #!/usr/bin/env python3
#F
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collect... | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 449,389 | 449,390 | u191874006 | python |
p02698 | import bisect
import sys
sys.setrecursionlimit(3*10**5)
INF = 10**10
N = int(input())
a = list(map(int,input().split()))
T = [set() for x in range(N)]
for i in range(N-1):
u,v = map(int,input().split())
u -= 1
v -= 1
T[u].add(v)
T[v].add(u)
search = [0]*N
A = [INF]
ans = [-1]*N
def dfs(V):
... | import bisect
import sys
sys.setrecursionlimit(3*10**5)
INF = 10**10
N = int(input())
a = list(map(int,input().split()))
T = [set() for x in range(N)]
for i in range(N-1):
u,v = map(int,input().split())
u -= 1
v -= 1
T[u].add(v)
T[v].add(u)
search = [0]*N
A = [INF]
ans = [-1]*N
def dfs(V):
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 449,442 | 449,443 | u278886389 | python |
p02698 | import sys
from bisect import bisect_left
sys.setrecursionlimit(1000000)
INF = pow(10, 10)
changed = []
input = sys.stdin.readline
N = int(input())
A = [int(a) for a in input().split()]
Edge = [[] for _ in range(N)]
for _ in range(N-1):
u, v = map(int, input().split())
Edge[u-1].append(v-1)
Edge[v-1].appen... | import sys
from bisect import bisect_left
sys.setrecursionlimit(1000000)
INF = pow(10, 10)
changed = []
input = sys.stdin.readline
N = int(input())
A = [int(a) for a in input().split()]
Edge = [[] for _ in range(N)]
for _ in range(N-1):
u, v = map(int, input().split())
Edge[u-1].append(v-1)
Edge[v-1].appen... | [
"expression.operation.binary.remove"
] | 449,446 | 449,447 | u608088992 | python |
p02698 | import sys
sys.setrecursionlimit(10**8)
N = int(input())
A = list(map(int,input().split()))
UV = [tuple(map(int,input().split())) for i in range(N-1)]
es = [[] for _ in range(N)]
for u,v in UV:
u,v = u-1,v-1
es[u].append(v)
es[v].append(u)
from bisect import bisect
lis = [A[0]]
stack = []
ans = [1] * N
def... | import sys
sys.setrecursionlimit(10**8)
N = int(input())
A = list(map(int,input().split()))
UV = [tuple(map(int,input().split())) for i in range(N-1)]
es = [[] for _ in range(N)]
for u,v in UV:
u,v = u-1,v-1
es[u].append(v)
es[v].append(u)
from bisect import bisect_left
lis = [A[0]]
stack = []
ans = [1] * ... | [
"identifier.change",
"assignment.value.change",
"call.function.change"
] | 449,488 | 449,489 | u761320129 | python |
p02698 | from collections import deque
from bisect import bisect_right,bisect_left
import sys
sys.setrecursionlimit(10**7)
n=int(input())
a=list(map(int,input().split()))
edge=[[] for _ in range(n)]
for _ in range(n-1):
u,v=map(int,input().split())
u-=1
v-=1
edge[u].append(v)
edge[v].append(u)
stack=deque([]... | from collections import deque
from bisect import bisect_left
import sys
sys.setrecursionlimit(10**7)
n=int(input())
a=list(map(int,input().split()))
edge=[[] for _ in range(n)]
for _ in range(n-1):
u,v=map(int,input().split())
u-=1
v-=1
edge[u].append(v)
edge[v].append(u)
stack=deque([])
inf=10**18
... | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 449,505 | 449,506 | u169138653 | python |
p02700 |
A, B, C, D = map(int, input().split())
m = C // B #青木君の耐えうるターン
if C % B == 0:
m = m+1
n = A // D #高橋君の耐えうるターン
if A % D == 0:
n = n+1
if n < m :
print('Yes')
else:
print('No')
|
A, B, C, D = map(int, input().split())
m = C // B # 青木君の耐えうるターン
if C % B != 0:
m = m + 1
n = A // D # 高橋君の耐えうるターン
if A % D != 0:
n = n + 1
if n >= m:
print('Yes')
else:
print('No')
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 449,559 | 449,560 | u925353288 | python |
p02700 |
A, B, C, D = map(int, input().split())
m = C // B #青木君の耐えうるターン
if C % B == 0:
m = m+1
n = A // D #高橋君の耐えうるターン
if A % D == 0:
n = n+1
if n <= m :
print('Yes')
else:
print('No')
|
A, B, C, D = map(int, input().split())
m = C // B # 青木君の耐えうるターン
if C % B != 0:
m = m + 1
n = A // D # 高橋君の耐えうるターン
if A % D != 0:
n = n + 1
if n >= m:
print('Yes')
else:
print('No')
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 449,561 | 449,560 | u925353288 | python |
p02700 | A, B, C, D = map(int, input().split())
while A > 0 and C > 0:
A -= D
C -= B
if C != 0:
print('No')
else:
print('Yes') | A, B, C, D = map(int, input().split())
while A > 0 and C > 0:
A -= D
C -= B
if C <= 0:
print('Yes')
else:
print('No') | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.remove",
"call.add"
] | 449,562 | 449,563 | u559313689 | python |
p02700 | A, B, C, D = map(int, input().split())
while A > 0 or C > 0:
A -= D
C -= B
if C != 0:
print('No')
else:
print('Yes') | A, B, C, D = map(int, input().split())
while A > 0 and C > 0:
A -= D
C -= B
if C <= 0:
print('Yes')
else:
print('No') | [
"control_flow.loop.condition.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.remove",
"call.add"
] | 449,564 | 449,563 | u559313689 | python |
p02700 | # 164
# 高橋君モンスター体力A/攻撃力B
# 青木君ﾓﾝｽﾀｰ体力C/攻撃力D
# 高橋→青木→高橋→青木の順番
# 相手のﾓﾝｽﾀｰの体力を自分のﾓﾝｽﾀｰの攻撃分減らせる。C＝C-B/A=A-D
# どちらかの体力が０以下になるまで戦い続ける。 A<0 B<0
# 先に自分のﾓﾝｽﾀｰの体力が０になった方が負け。
# 高橋君が勝つなら”YES”負けるなら”NO”を出力
A,B,C,D = map(int,input().split())
while A>0 and C>0:
C = C-B
A = A-D
if C <= 0:
print("YES")
else:
print("NO... | # 164
# 高橋君モンスター体力A/攻撃力B
# 青木君ﾓﾝｽﾀｰ体力C/攻撃力D
# 高橋→青木→高橋→青木の順番
# 相手のﾓﾝｽﾀｰの体力を自分のﾓﾝｽﾀｰの攻撃分減らせる。C＝C-B/A=A-D
# どちらかの体力が０以下になるまで戦い続ける。 A<0 B<0
# 先に自分のﾓﾝｽﾀｰの体力が０になった方が負け。
# 高橋君が勝つなら”Yes”負けるなら”No”を出力
A,B,C,D = map(int,input().split())
while A>0 and C>0:
C = C-B
A = A-D
if C <= 0:
print("Yes")
else:
print("No... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 449,570 | 449,571 | u588557741 | python |
p02700 | A,B,C,D = map(int,input().split())
while True:
C -= B
A -= D
if C <= 0:
result = "YES"
break
if A <= 0:
result = "NO"
break
print(result)
| A,B,C,D = map(int,input().split())
while True:
C -= B
A -= D
if C <= 0:
result = "Yes"
break
if A <= 0:
result = "No"
break
print(result) | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 449,572 | 449,573 | u779508975 | python |
p02700 | A,B,C,D = map(int,input().split())
while True:
C -= B
A -= D
if C <=0:
result = "YES"
break
if A<=0:
result = "NO"
break
print(result) | A,B,C,D = map(int,input().split())
while True:
C -= B
A -= D
if C <= 0:
result = "Yes"
break
if A <= 0:
result = "No"
break
print(result) | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 449,574 | 449,573 | u779508975 | python |
p02700 | A,B,C,D= map(int, input().split())
while True:
C-=B
A-=D
if C<=0:
result="YES"
break
if A<=0:
result="NO"
break
print(result) | A,B,C,D = map(int,input().split())
while True:
C -= B
A -= D
if C <= 0:
result = "Yes"
break
if A <= 0:
result = "No"
break
print(result) | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 449,575 | 449,573 | u779508975 | python |
p02700 | A, B, C, D = map(int, input().split())
while True:
C-=B
A-=D
if C<=0:
result="YES"
break
if A<=0:
result="NO"
break
print(result) | A,B,C,D = map(int,input().split())
while True:
C -= B
A -= D
if C <= 0:
result = "Yes"
break
if A <= 0:
result = "No"
break
print(result) | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 449,576 | 449,573 | u779508975 | python |
p02700 | A,B,C,D = map(int,input().split())
while True:
C -= B
A -= D
if C <= 0:
result = "YES"
break
if A <= 0:
result = "NO"
break
print(result)
| A,B,C,D = map(int,input().split())
while True:
C-=B
A-=D
if C<=0:
result="Yes"
break
if A<=0:
result="No"
break
print(result)
| [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 449,572 | 449,577 | u779508975 | python |
p02700 | A,B,C,D = map(int,input().split())
while True:
C -= B
A -= D
if C <=0:
result = "YES"
break
if A<=0:
result = "NO"
break
print(result) | A,B,C,D = map(int,input().split())
while True:
C-=B
A-=D
if C<=0:
result="Yes"
break
if A<=0:
result="No"
break
print(result)
| [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 449,574 | 449,577 | u779508975 | python |
p02700 | A,B,C,D= map(int, input().split())
while True:
C-=B
A-=D
if C<=0:
result="YES"
break
if A<=0:
result="NO"
break
print(result) | A,B,C,D = map(int,input().split())
while True:
C-=B
A-=D
if C<=0:
result="Yes"
break
if A<=0:
result="No"
break
print(result)
| [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 449,575 | 449,577 | u779508975 | python |
p02700 | a, b, c, d = map(int, input().split())
while c or a >= 0:
c -= b
a -= b
if c <= 0:
print("Yes")
break
if a <= 0:
print("No") | a, b, c, d = map(int, input().split())
while c or a >= 0:
c -= b
a -= d
if c <= 0:
print("Yes")
break
if a <= 0:
print("No")
break | [
"identifier.change",
"control_flow.break.add"
] | 449,584 | 449,585 | u434630332 | python |
p02700 | # abc164B
# https://atcoder.jp/contests/abc164/tasks/abc164_b
# 高橋君モンスターの体力はA、攻撃力はB
# 青木君モンスターの体力はC、攻撃力はD
# 高橋君が勝ったら"Yes"、負けたら"No"
# 入力
a, b, c, d = map(int, input().split())
# 処理
# 必殺技を受けた残りの体力
while a > 0 and c > 0:
a -= d
c -= b
if a <= 0:
print("No")
else:
print("Yes")
| # abc164B
# https://atcoder.jp/contests/abc164/tasks/abc164_b
# 高橋君モンスターの体力はA、攻撃力はB
# 青木君モンスターの体力はC、攻撃力はD
# 高橋君が勝ったら"Yes"、負けたら"No"
# 入力
a, b, c, d = map(int, input().split())
# 処理
# 必殺技を受けた残りの体力
while a > 0 and c > 0:
a -= d
c -= b
if c <= 0:
print("Yes")
else:
print("No")
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.remove",
"call.add"
] | 449,587 | 449,588 | u546132222 | python |
p02700 | # abc164B
# https://atcoder.jp/contests/abc164/tasks/abc164_b
# 高橋君モンスターの体力はA、攻撃力はB
# 青木君モンスターの体力はC、攻撃力はD
# 高橋君が勝ったら"Yes"、負けたら"No"
# 入力
a, b, c, d = map(int, input().split())
# 処理
# 必殺技を受けた残りの体力
while a > 0 and c > 0:
a -= d
c -= c
if a <= 0:
print("No")
else:
print("Yes")
| # abc164B
# https://atcoder.jp/contests/abc164/tasks/abc164_b
# 高橋君モンスターの体力はA、攻撃力はB
# 青木君モンスターの体力はC、攻撃力はD
# 高橋君が勝ったら"Yes"、負けたら"No"
# 入力
a, b, c, d = map(int, input().split())
# 処理
# 必殺技を受けた残りの体力
while a > 0 and c > 0:
a -= d
c -= b
if c <= 0:
print("Yes")
else:
print("No")
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.remove",
"call.add"
] | 449,589 | 449,588 | u546132222 | python |
p02700 | a,b,c,d = map(int,input().split())
while a>0 and b>0:
a-=d
c-=b
print(a,c)
if a <= 0 and c<=0:
print('Yes')
elif c <= 0:
print('Yes')
else:
print('No') | a,b,c,d = map(int,input().split())
while a>0 and b>0:
a-=d
c-=b
if a <= 0 and c<=0:
print('Yes')
elif c <= 0:
print('Yes')
else:
print('No') | [
"call.remove"
] | 449,593 | 449,594 | u658600714 | python |
p02700 | a,b,c,d = map(int,input().split())
while a>=0 and b>=0:
a-=d
b-=c
if a <= 0 and c<=0:
print('Yes')
elif c <= 0:
print('Yes')
else:
print('No') | a,b,c,d = map(int,input().split())
while a>0 and b>0:
a-=d
c-=b
if a <= 0 and c<=0:
print('Yes')
elif c <= 0:
print('Yes')
else:
print('No') | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 449,595 | 449,594 | u658600714 | python |
p02700 | a, b, c, d = map(int, input().split())
i = 0
i1 = 0
while a > 0:
a -= b
i += 1
while c > 0:
c -= d
i1 += 1
if i <= i1:
print('Yes')
else:
print('No')
| a, b, c, d = map(int, input().split())
i = 0
i1 = 0
while a > 0:
a -= d
i += 1
while c > 0:
c -= b
i1 += 1
if i >= i1:
print('Yes')
else:
print('No')
| [
"identifier.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 449,596 | 449,597 | u556477263 | python |
p02700 | import math
A,B,C,D=map(int,input().split())
print("Yes" if math.ceil(A/D) >= math.ceil(B/C) else "No") | import math
A,B,C,D=map(int,input().split())
print("Yes" if math.ceil(A/D) >= math.ceil(C/B) else "No") | [
"expression.operation.binary.remove"
] | 449,600 | 449,601 | u889405092 | python |
p02700 | A, B, C, D = map(int, input().split())
T_HP = A
T_AT = B
A_HP = C
A_AT = D
T_count = 0
A_count = 0
while T_HP > 0:
T_HP -= A_AT
T_count += 1
while A_HP > 0:
A_HP -= T_AT
A_count += 1
if T_count > A_count:
print('Yes')
if T_count == A_count:
print('Yes')
else:
print('No') | A, B, C, D = map(int, input().split())
T_HP = A
T_AT = B
A_HP = C
A_AT = D
T_count = 0
A_count = 0
while T_HP > 0:
T_HP -= A_AT
T_count += 1
while A_HP > 0:
A_HP -= T_AT
A_count += 1
if T_count > A_count:
print('Yes')
elif T_count == A_count:
print('Yes')
else:
print('No') | [
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 449,602 | 449,603 | u297399512 | python |
p02700 | a, b, c, d = map(int,input().split())
while True:
c = c - b
a = a - d
if c <= 0:
print('No')
break
elif a <= 0:
print('Yes')
break
else:
pass | a, b, c, d = map(int,input().split())
while True:
c = c - b
a = a - d
if c <= 0:
print('Yes')
break
elif a <= 0:
print('No')
break
else:
pass | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 449,606 | 449,607 | u258807490 | python |
p02700 | A, B, C, D=map(int,input().split())
while C or A >= 0:
C -= B
A -= D
if C <= 0:
print("Yes")
if A <= 0:
print("No")
break | A, B, C, D=map(int,input().split())
while C or A >= 0:
C -= B
A -= D
if C <= 0:
print("Yes")
break
if A <= 0:
print("No")
break | [
"control_flow.break.add"
] | 449,609 | 449,610 | u530169312 | python |
p02700 | a,b,c,d = map(int,input().split())
print('Yes' if (c+b-1)/b <= (a+d-1)/d else 'No') | a,b,c,d = map(int,input().split())
print('Yes' if (c+b-1)//b <= (a+d-1)//d else 'No') | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 449,611 | 449,612 | u045953894 | python |
p02700 | def resolve():
a,b,c,d = map(int,input().split())
A = math.ceil(c/b)
B = math.ceil(a/d)
print('Yes' if A <= B else 'No')
resolve() | import math
def resolve():
a,b,c,d = map(int,input().split())
A = math.ceil(c/b)
B = math.ceil(a/d)
print('Yes' if A <= B else 'No')
resolve() | [] | 449,613 | 449,614 | u405733072 | python |
p02700 | A, B, C, D = map(int, input().split())
print('Yes' if -A // D > -C // B else 'No') | A, B, C, D = map(int, input().split())
print('No' if -A // D > -C // B else 'Yes') | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 449,615 | 449,616 | u596536048 | python |
p02700 | a,b,c,d = map(int,input().split())
if -(-a//c) >= -(-d//b):
print("Yes")
else:
print("No") | a,b,c,d = map(int,input().split())
if -(-a//d) >= -(-c//b):
print("Yes")
else:
print("No") | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 449,617 | 449,618 | u107915058 | python |
p02700 | import math
a,b,c,d=map(int,input().split())
print("Yes") if math.ceil(c/a)<=math.ceil(a/d) else print("No") | import math
a,b,c,d=map(int,input().split())
print("Yes") if math.ceil(c/b)<=math.ceil(a/d) else print("No") | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 449,645 | 449,646 | u388297793 | python |
p02700 | import math
a,b,c,d=map(int,input().split())
print("Yes") if math.ceil(c/a)>=math.ceil(a/d) else print("No") | import math
a,b,c,d=map(int,input().split())
print("Yes") if math.ceil(c/b)<=math.ceil(a/d) else print("No") | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change"
] | 449,647 | 449,646 | u388297793 | python |
p02700 | import sys
a,b,c,d=map(int,input().split())
while a>0 or c>0:
c-=b
if c<1:
print("Yes")
sys.exit()
a-=d
print("No") | import sys
a,b,c,d=map(int,input().split())
while a>0:
c-=b
if c<1:
print("Yes")
sys.exit()
a-=d
print("No") | [] | 449,650 | 449,651 | u000037600 | python |
p02700 | import sys
a,b,c,d=map(int,input().split())
while a>0 or c>0:
c-=b
if c<1:
print("Yes")
sys.exit()
a-=d
print("NO") | import sys
a,b,c,d=map(int,input().split())
while a>0:
c-=b
if c<1:
print("Yes")
sys.exit()
a-=d
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 449,652 | 449,651 | u000037600 | python |
p02700 | a, b, c, d = map(int, input().split())
while a > 0:
c -= b
a -= d
if c <= 0:
print('Yes')
break
if a <= 0:
print('No') | a, b, c, d = map(int, input().split())
while a > 0:
c -= b
a -= d
if c <= 0:
print('Yes')
break
if c > 0:
print('No')
| [] | 449,661 | 449,662 | u581403769 | python |
p02700 | import math
A,B,C,D = map(int,input().split())
if (math.ceil(C/B) < math.ceil(A/D)):
print('Yes')
else:
print('No') | import math
A,B,C,D = map(int,input().split())
if (math.ceil(C/B) <= math.ceil(A/D)):
print('Yes')
else:
print('No') | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 449,675 | 449,674 | u772371451 | python |
p02700 | A,B,C,D = map(int,input().split())
while True:
C = C - B
if C <= 0:
break
A = A - D
if A <= 0:
break
print('Yes' if A > 0 else 'no') | A,B,C,D = map(int,input().split())
while True:
C = C - B
if C <= 0:
break
A = A - D
if A <= 0:
break
print('Yes' if A > 0 else 'No') | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 449,676 | 449,677 | u129749062 | python |
p02700 | A, B, C, D = map(int, input().split())
print("Yes" if (A+D)//D >= (C+B)//B else "No") | A, B, C, D = map(int, input().split())
print("Yes" if (A+D-1)//D >= (C+B-1)//B else "No") | [
"expression.operation.binary.add"
] | 449,700 | 449,701 | u612635771 | python |
p02700 | a,b,c,d = map(int,input().split())
for i in range(200):
if i % 2 == 0:
c -= b
else:
a -= d
if a<=0:
print("No")
break
elif b <= 0:
print("Yes")
break | a,b,c,d = map(int,input().split())
for i in range(200):
if i % 2 == 0:
c -= b
else:
a -= d
if a<=0:
print("No")
break
elif c <= 0:
print("Yes")
break
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 449,704 | 449,705 | u283751459 | python |
p02700 | a,b,c,d = map(int,input().split())
while a >= 0:
c -= b
if c <= 0:
print("Yes")
break
a -= d
if a <= 0:print("No") | a,b,c,d = map(int,input().split())
while True:
c -= b
if c <= 0:
print("Yes")
break
a -= d
if a <= 0:
print("No")
break | [
"control_flow.loop.condition.change",
"control_flow.break.add"
] | 449,712 | 449,713 | u338988175 | python |
p02700 | a, b, c, d = map(int,input().split())
while a >= 0:
c -= b
a -= d
if c <= 0:
print('Yes')
else:
print('No') | a, b, c, d = map(int,input().split())
while a > 0:
c -= b
a -= d
if c <= 0:
print('Yes')
else:
print('No') | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 449,730 | 449,731 | u569776981 | python |
p02700 | a, b, c, d = map(int,input().split())
while a >= 0 or c >= 0:
c -= b
a -= d
if c <= 0:
print('Yes')
else:
print('No') | a, b, c, d = map(int,input().split())
while a > 0:
c -= b
a -= d
if c <= 0:
print('Yes')
else:
print('No') | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 449,732 | 449,731 | u569776981 | python |
p02700 | A,B,C,D = map(int, input().split())
while True:
C = C - B
if C <= 0:
print("YES")
exit()
A = A - D
if A <= 0:
print("NO")
exit() | A,B,C,D = map(int, input().split())
while True:
C = C - B
if C <= 0:
print("Yes")
exit()
A = A - D
if A <= 0:
print("No")
exit() | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 449,755 | 449,756 | u918373199 | python |
p02700 | a, b, c, d = map(int, input().split())
while a > 0 and b > 0: c -= b; a -= d
print('Yes' if c == 0 else 'No') | a, b, c, d = map(int, input().split())
while a > 0 and b > 0: c -= b; a -= d
print('Yes' if c <= 0 else 'No') | [
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 449,757 | 449,758 | u317187086 | python |
p02700 | import sys
A, B, C, D = list(map(int, input().split()))
while True:
C -= B
if C <= 0:
print("Yes")
sys.exit()
A -= D
if D <= 0:
print("No")
sys.exit() | import sys
A, B, C, D = list(map(int, input().split()))
while True:
C -= B
if C <= 0:
print("Yes")
sys.exit()
A -= D
if A <= 0:
print("No")
sys.exit() | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 449,759 | 449,760 | u434609232 | python |
p02700 | a,b,c,d = map(int,input().split())
while True:
c=c-b
if c<=0:
print('Yes')
break
a=a-d
if a<=0:
print('No')
print(a)
break | a,b,c,d = map(int,input().split())
while True:
c=c-b
if c<=0:
print('Yes')
break
a=a-d
if a<=0:
print('No')
break | [
"call.remove"
] | 449,761 | 449,762 | u409254176 | python |
p02700 | a, b, c, d = map(int, input().split())
i = 0
while a > 0 or c > 0:
if i % 2 == 0:
c -= b
else:
a -= d
i += 1
print("Yes" if a > 0 else "No") | a, b, c, d = map(int, input().split())
i = 0
while a > 0 and c > 0:
if i % 2 == 0:
c -= b
else:
a -= d
i += 1
print("Yes" if a > 0 else "No") | [
"control_flow.loop.condition.change"
] | 449,775 | 449,776 | u468972478 | python |
p02700 | a,b,c,d = map(int, input().split())
i = 0
while True:
if i % 2 == 0:
c -= b
else:
a -= d
i += 1
if a <= 0:
print("Yes")
break
elif c <= 0:
print("No")
break
| a,b,c,d = map(int, input().split())
i = 0
while True:
if i % 2 == 0:
c -= b
else:
a -= d
i += 1
if a <= 0:
print("No")
break
elif c <= 0:
print("Yes")
break
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 449,784 | 449,785 | u416758623 | python |
p02700 | import math
A, B, C, D = map(int, input().split())
t = math.ceil(C / B)
a = math.ceil(A / D)
print(t, a)
print('Yes' if t <= a else 'No')
| import math
A, B, C, D = map(int, input().split())
t = math.ceil(C / B)
a = math.ceil(A / D)
print('Yes' if t <= a else 'No')
| [
"call.remove"
] | 449,788 | 449,789 | u331105860 | python |
p02700 | import math
A, B, C, D = map(int, input().split())
t = math.ceil(C // B)
a = math.ceil(A // D)
print('Yes' if t <= a else 'No')
| import math
A, B, C, D = map(int, input().split())
t = math.ceil(C / B)
a = math.ceil(A / D)
print('Yes' if t <= a else 'No')
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 449,790 | 449,789 | u331105860 | python |
p02700 | A, B, C, D = map(int, input().split())
# X=ceil(A/D)とY=ceil(C/B)を比較し、X<=Yなら勝ち、X>Yなら負け
X = (A+D-1) // D
Y = (C+B-1) // B
if X <= Y: print('Yes')
else: print('No')
| A, B, C, D = map(int, input().split())
# X=ceil(A/D)とY=ceil(C/B)を比較し、X>=Yなら勝ち、X<Yなら負け
X = (A+D-1) // D
Y = (C+B-1) // B
if X >= Y: print('Yes')
else: print('No') | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 449,799 | 449,800 | u309120194 | python |
p02700 | a = input()
a = a.split()
b = int(a[1])
c = int(a[2])
d = int(a[3])
a = int(a[0])
e = a / d
f = c / b
if int(e) < e:
e = e + 1
if int(f) < f:
f = f + 1
if e >= f:
print("Yes")
else:
print("No") | a = input()
a = a.split()
b = int(a[1])
c = int(a[2])
d = int(a[3])
a = int(a[0])
e = a / d
f = c / b
if int(e) < e:
e = int(e + 1)
if int(f) < f:
f = int(f + 1)
if e >= f:
print("Yes")
else:
print("No") | [
"call.add",
"call.arguments.change"
] | 449,801 | 449,802 | u116939152 | python |
p02700 | A,B,C,D=map(int,input().split())
for i in range(1,1000):
if i%2!=0:
C-=B
if C<=0:
print('Yes')
else:
A-=D
if A<=0:
print('No') | A,B,C,D=map(int,input().split())
for i in range(1,1000):
if i%2!=0:
C-=B
if C<=0:
print('Yes')
exit()
else:
A-=D
if A<=0:
print('No')
exit() | [
"call.add"
] | 449,808 | 449,809 | u827261928 | python |
p02700 | A,B,C,D = map(int,input().split())
taka = 0
aoki = 0
while True:
if A < 0:break
A -= B
taka += 1
while True:
if C < 0:break
C -= D
aoki += 1
if taka > aoki:
print("Yes")
else:
print("No") | A,B,C,D = map(int,input().split())
taka = 0
aoki = 0
while True:
if A <= 0:break
A -= D
taka += 1
while True:
if C <= 0:break
C -= B
aoki += 1
if taka >= aoki:
print("Yes")
else:
print("No") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 449,822 | 449,823 | u848535504 | python |
p02700 | a,b,c,d = map(int, input().split())
if a%d ==0:
ao = a/d
else:
ao = a/d +1
if c%b ==0:
taka = c/b
else:
taka = c/b +1
if taka> ao:
print('No')
else:
print('Yes') | a,b,c,d = map(int, input().split())
if a%d ==0:
ao = a/d
else:
ao = int(a/d +1)
if c%b ==0:
taka = c/b
else:
taka = int(c/b +1)
if taka> ao:
print('No')
else:
print('Yes') | [
"call.add",
"call.arguments.change"
] | 449,824 | 449,825 | u464823755 | python |
p02700 | import math
a, b, c, d = map(int, input().split())
if math.ceil(c / b) < math.ceil(a / d):
print("Yes")
else:
print("No")
| import math
a, b, c, d = map(int, input().split())
if math.ceil(c / b) <= math.ceil(a / d):
print("Yes")
else:
print("No")
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 449,842 | 449,841 | u392361133 | python |
p02700 | import math
a, b, c, d = map(int, input().split())
if math(c / b) < math(a / d):
print("Yes")
else:
print("No") | import math
a, b, c, d = map(int, input().split())
if math.ceil(c / b) <= math.ceil(a / d):
print("Yes")
else:
print("No")
| [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 449,843 | 449,841 | u392361133 | python |
p02700 | a, b, c, d = map(int, input().split())
if ((a + d - 1) // d) >= ((c + b - 1) / b):
print("Yes")
else:
print("No")
| a, b, c, d = map(int, input().split())
if ((a + d - 1) // d) >= ((c + b - 1) // b):
print("Yes")
else:
print("No") | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 449,846 | 449,847 | u516621632 | python |
p02700 | a,b,c,d=map(int,input().split())
if a%d>0:
a=a//d+1
elif a%d==0:
a=a//d
if c%b>0:
c=c//b+1
elif c%b==0:
c=c//b
if a>=c:
print("YES")
else:
print("NO") | a,b,c,d=map(int,input().split())
if a%d>0:
a=a//d+1
elif a%d==0:
a=a//d
if c%b>0:
c=c//b+1
elif c%b==0:
c=c//b
if a>=c:
print("Yes")
else:
print("No")
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 449,852 | 449,853 | u010777300 | python |
p02700 | a,b,c,d = map(int,input().split())
import math
print("yes" if math.ceil(a/d) >= math.ceil(c/b) else "no") | a,b,c,d = map(int,input().split())
import math
print("Yes" if math.ceil(a/d) >= math.ceil(c/b) else "No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 449,860 | 449,861 | u921632705 | python |
p02700 | A,B,C,D = map(int,input().split())
while A > 0 and C > 0:
C -= B
if C <= 0:
break
A -= D
print(A,C)
if A <= 0:
print('No')
else:
print('Yes') | A,B,C,D = map(int,input().split())
while A > 0 and C > 0:
C -= B
if C <= 0:
break
A -= D
if A <= 0:
print('No')
else:
print('Yes') | [
"call.remove"
] | 449,862 | 449,863 | u970198631 | python |
p02700 | A,B,C,D = map(int,input().split())
while A > 0 and C >0:
C -= B
if C <= 0:
break
A -= C
if A <= 0:
print('No')
else:
print('Yes') | A,B,C,D = map(int,input().split())
while A > 0 and C > 0:
C -= B
if C <= 0:
break
A -= D
if A <= 0:
print('No')
else:
print('Yes') | [
"identifier.change"
] | 449,864 | 449,863 | u970198631 | python |
p02700 | A, B, C, D = list(map(int, input().split()))
import math
if math.ceil(A / C) >= math.ceil(D / B):
print('Yes')
else:
print('No')
| A, B, C, D = list(map(int, input().split()))
import math
if math.ceil(A / D) >= math.ceil(C / B):
print('Yes')
else:
print('No') | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 449,875 | 449,876 | u364774090 | python |
p02700 | import math
a,b,c,d=map(int,input().split())
x=math.ceil(c/b)
y=math.ceil(a/d)
print("Yes" if x>=y else "No") | import math
a,b,c,d=map(int,input().split())
x=math.ceil(c/b)
y=math.ceil(a/d)
print("Yes" if y>=x else "No")
| [] | 449,881 | 449,882 | u054825571 | python |
p02700 | A, B, C, D = map(int, input().split())
takahasi = C // B
aoki = A // D
if C % B != 0:
takahasi += 1
if A % D != 0:
aoki += 1
if takahasi > aoki:
print("Yes")
else:
print("No") | A, B, C, D = map(int, input().split())
takahasi = C // B
aoki = A // D
if C % B != 0:
takahasi += 1
if A % D != 0:
aoki += 1
if takahasi > aoki:
print("No")
else:
print("Yes") | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 449,886 | 449,887 | u833963136 | python |
p02700 | import math
A, B, C, D = map(int, input().split())
E = math.ceil(A//D)
F = math.ceil(C//B)
if E >= F:
print('Yes')
else:
print('No') | import math
A, B, C, D = map(int, input().split())
E = math.ceil(A/D)
F = math.ceil(C/B)
if E >= F:
print('Yes')
else:
print('No')
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 449,894 | 449,895 | u607155447 | python |
p02700 | import math
A, B, C, D = list(map(lambda x: int(x), input().split(" ")))
print("Yes") if math.ceil(A/D) > math.ceil(C/B) else print("No") | import math
A, B, C, D = list(map(lambda x: int(x), input().split(" ")))
print("Yes") if math.ceil(A/D) >= math.ceil(C/B) else print("No") | [
"expression.operator.compare.change"
] | 449,896 | 449,897 | u739843002 | python |
p02700 | a,b,c,d=map(int,input().split())
while True:
c-=b
if c<=0:
print("Yes")
break
a-=d
if d<=0:
print("No")
break
| a,b,c,d=map(int,input().split())
while True:
c-=b
if c<=0:
print("Yes")
break
a-=d
if a<=0:
print("No")
break
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 449,910 | 449,911 | u367147039 | python |
p02700 | A,B,C,D=map(int,input().split())
X = 0
Y = o
while A > 0:
A = A-D
X+=1
while C > 0:
C = C-B
Y+=1
if X>=Y:
print("Yes")
else:
print("No")
| A,B,C,D=map(int,input().split())
X = 0
Y = 0
while A > 0:
A = A-D
X+=1
while C > 0:
C = C-B
Y+=1
if X>=Y:
print("Yes")
else:
print("No")
| [
"misc.typo",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 449,918 | 449,919 | u185806788 | python |
p02700 | a , b , c , d = map(int, input().split())
# a,c = health b, d = attack
x = (a+d-1)/d
y = (c+b-1)/b
if x>= y:
print("Yes")
else:
print("No") | a , b , c , d = map(int, input().split())
# a,c = health b, d = attack
x = (a+d-1)//d
y = (c+b-1)//b
if x>= y:
print("Yes")
else:
print("No") | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 449,933 | 449,934 | u020798319 | python |
p02700 | import numpy as np
def cumsum(x):
return list(np.cumsum(x))
def cumsum_number(N,K,x):
ans=[0]*(N-K+1)
number_cumsum = cumsum(x)
number_cumsum.insert(0,0)
for i in range(N-K+1):
ans[i]=number_cumsum[i+K]-number_cumsum[i]
return ans
"""
int #整数
float #小数
#for
for name in fruits: #fruitの頭... | import numpy as np
def cumsum(x):
return list(np.cumsum(x))
def cumsum_number(N,K,x):
ans=[0]*(N-K+1)
number_cumsum = cumsum(x)
number_cumsum.insert(0,0)
for i in range(N-K+1):
ans[i]=number_cumsum[i+K]-number_cumsum[i]
return ans
"""
int #整数
float #小数
#for
for name in fruits: #fruitの頭... | [
"assignment.value.change",
"identifier.change"
] | 449,948 | 449,949 | u695474809 | python |
p02700 | a,b,c,d = map(int, input().split())
x = (c+b-1)//b
y = (a+d-1)//d
if x >= y:
print('Yes')
else:
print('No') | a,b,c,d = map(int, input().split())
x = (c+b-1)//b
y = (a+d-1)//d
if y >= x:
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change"
] | 449,960 | 449,961 | u493520238 | python |
p02700 | from sys import stdin, stdout
a, b, c ,d = map(int, stdin.readline().strip().split())
from math import ceil
x = ceil(a/d)
y = ceil(b/c)
if x>=y:
print('Yes')
else:
print('No')
| from sys import stdin, stdout
a, b, c ,d = map(int, stdin.readline().strip().split())
from math import ceil
x = ceil(a/d)
y = ceil(c/b)
if x>=y:
print('Yes')
else:
print('No')
| [
"expression.operation.binary.remove"
] | 449,966 | 449,967 | u659159398 | python |
p02700 | from sys import stdin, stdout
a, b, c ,d = map(int, stdin.readline().strip().split())
from math import ceil
x = ceil(a/b)
y = ceil(b/c)
if x>=y:
print('Yes')
else:
print('No') | from sys import stdin, stdout
a, b, c ,d = map(int, stdin.readline().strip().split())
from math import ceil
x = ceil(a/d)
y = ceil(c/b)
if x>=y:
print('Yes')
else:
print('No')
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 449,968 | 449,967 | u659159398 | python |
p02700 | A, B, C, D = map(int, input().split())
while true:
if C - B <= 0:
print('Yes')
break
else:
C = C - B
if A - D <= 0:
print('No')
break
else:
A = A - D | A, B, C, D = map(int, input().split())
while True:
if C - B <= 0:
print('Yes')
break
else:
C = C - B
if A - D <= 0:
print('No')
break
else:
A = A - D | [
"misc.typo",
"control_flow.loop.condition.change"
] | 449,984 | 449,985 | u377834804 | python |
p02700 | A, B, C, D = map(int, input().split())
while true:
if C - B <= 0:
print('Yes')
else:
C = C - B
if A - D <= 0:
print('No')
else:
A = A - D | A, B, C, D = map(int, input().split())
while True:
if C - B <= 0:
print('Yes')
break
else:
C = C - B
if A - D <= 0:
print('No')
break
else:
A = A - D | [
"misc.typo",
"control_flow.loop.condition.change",
"control_flow.break.add"
] | 449,987 | 449,985 | u377834804 | python |
p02700 | a,b,c,d= map(int,input().split())
z = c//b
w = a//d
if c%b!=0:z+=1
if a%d!=0:w+=1
if z>w:print("NO")
else:print("YES") | a,b,c,d= map(int,input().split())
z = c//b
w = a//d
if c%b!=0:z+=1
if a%d!=0:w+=1
if z>w:print("No")
else:print("Yes") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 449,988 | 449,989 | u386197387 | python |
p02700 | a,b,c,d= map(int,input().split())
z = c//b
w = a//d
if c%b!=0:z+=1
if a%d!=0:w+=1
if z>w:print("NO")
else:print("YES")
| a,b,c,d= map(int,input().split())
z = c//b
w = a//d
if c%b!=0:z+=1
if a%d!=0:w+=1
if z>w:print("No")
else:print("Yes") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 449,990 | 449,989 | u386197387 | python |
p02700 | a, b, c, d = list(map(int, input().split()))
while True:
c -= b
if c <= 0:
print('Yes')
break
a -= d
if a <= 0:
pinrt('No')
break
| a, b, c, d = list(map(int, input().split()))
while True:
c -= b
if c <= 0:
print('Yes')
break
a -= d
if a <= 0:
print('No')
break
| [
"identifier.change",
"call.function.change"
] | 450,009 | 450,010 | u159335277 | python |
p02700 | # B - Battle
A,B,C,D = map(int,input().split())
ans = ['No', 'Yes']
takahashi = (C-1)//B + 1
aoki = (A-1)//D + 1
print(ans[takahashi>=aoki]) | # B - Battle
A,B,C,D = map(int,input().split())
ans = ['No', 'Yes']
takahashi = (C-1)//B + 1
aoki = (A-1)//D + 1
print(ans[takahashi<=aoki]) | [
"misc.opposites",
"expression.operator.compare.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 450,011 | 450,012 | u980205854 | python |
p02700 | import math
A,B,C,D = map(int,input().split())
print("Yes" if math.ceil(C/B) >= math.ceil(A/D) else "No") | import math
A,B,C,D = map(int,input().split())
print("Yes" if math.ceil(C/B) <= math.ceil(A/D) else "No") | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 450,013 | 450,014 | u565761178 | python |
p02700 | a, b, c, d = map(int, input().split())
tpow = a / d + (0 if a % d == 0 else 1)
apow = c / b + (0 if c % b == 0 else 1)
if tpow >= apow:
print("Yes")
else:
print("No") | a, b, c, d = map(int, input().split())
tpow = a // d + (0 if a % d == 0 else 1)
apow = c // b + (0 if c % b == 0 else 1)
if tpow >= apow:
print("Yes")
else:
print("No") | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 450,015 | 450,016 | u274758786 | python |
p02700 | a, b, c, d = map(int, input().split())
tpow = a / d + 1 + (0 if a % d == 0 else 1)
apow = c / b + 1 + (0 if c % b == 0 else 1)
if tpow >= apow:
print("Yes")
else:
print("No") | a, b, c, d = map(int, input().split())
tpow = a // d + (0 if a % d == 0 else 1)
apow = c // b + (0 if c % b == 0 else 1)
if tpow >= apow:
print("Yes")
else:
print("No") | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 450,017 | 450,016 | u274758786 | python |
p02700 | A,B,C,D = list(map(int,input().split()))
a=0
c=0
while A > 0:
A -= D
a += 1
while C > 0:
C -=B
c += 1
if a > c:
print('No')
elif a <= c:
print('Yes')
| A,B,C,D = list(map(int,input().split()))
a=0
c=0
while A > 0:
A -= D
a += 1#何回でやられたか
while C > 0:
C -= B
c += 1#何回で倒したか
if a < c:
print('No')
elif a >= c:
print('Yes')
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 450,020 | 450,021 | u051613269 | python |
p02700 | a,b,c,d=map(int,input().split())
while a>0:
c-=b
if c<=0:
print("Yes")
exit()
a-=d
print("No")
| a,b,c,d=map(int,input().split())
while a>0:
c-=b
if c<=0:
print("Yes")
exit()
a-=d
if a<=0:
print("No")
| [
"control_flow.branch.if.add"
] | 450,022 | 450,023 | u712239107 | python |
p02700 | a,b,c,d=map(int,input().split())
while a>0:
c-=b
if c<=0:
print("Yes")
exit()
a-=d
print("No")
| a,b,c,d=map(int,input().split())
while a>0:
c-=b
if c<=0:
print("Yes")
exit()
a-=d
if a<=0:
print("No")
| [
"control_flow.branch.if.add"
] | 450,024 | 450,023 | u712239107 | python |
p02700 | a,b,c,d=map(int,input().split())
ta=(c+a-1)//a
ao=(b+d-1)//d
if ta<=ao:
print("Yes")
else:
print("No") | a,b,c,d=map(int,input().split())
ta=(c-1)//b
ao=(a-1)//d
if ta<=ao:
print("Yes")
else:
print("No") | [
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 450,025 | 450,026 | u998262711 | python |
p02700 | A,B,C,D=map(int,input().split())
HP_T=A
HP_A=C
for i in range(1,102):
if i%2==1:
HP_A -= B
else:
HP_T -= D
if HP_A<=0:
print('No')
exit()
elif HP_T<=0:
print('Yes')
exit()
else:
pass | A,B,C,D=map(int,input().split())
HP_T=A
HP_A=C
for i in range(1,1000):
if i%2==1:
HP_A -= B
else:
HP_T -= D
if HP_A<=0:
print('Yes')
exit()
elif HP_T<=0:
print('No')
exit()
else:
pass | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"literal.string.change",
"io.output.change"
] | 450,029 | 450,028 | u674588203 | python |
p02700 | import math
a, b, c, d = map(int, input().split())
t = math.ceil(a/d)
k = math.ceil(c/b)
if (t <= k):
print("Yes")
else:
print("No") | import math
a, b, c, d = map(int, input().split())
k = math.ceil(a/d)
t = math.ceil(c/b)
if (t <= k):
print("Yes")
else:
print("No") | [
"assignment.variable.change",
"identifier.change"
] | 450,030 | 450,031 | u037156014 | python |
p02700 | def solve():
A, B, C, D = map(int, input().split())
print('NYoe s'[-(-C//B) > -(-A//D)::2])
if __name__ == '__main__':
solve()
| def solve():
A, B, C, D = map(int, input().split())
print('YNeos'[-(-C//B) > -(-A//D)::2])
if __name__ == '__main__':
solve()
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 450,032 | 450,033 | u739360929 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.