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 |
|---|---|---|---|---|---|---|---|
p02700 | A, B, C, D = map(int, input().split())
t_attack = -(-1*C // B)
a_attack = -(-1*A / D)
if t_attack <= a_attack:
print("Yes")
else:
print('No') | A, B, C, D = map(int, input().split())
t_attack = -(-1*C // B)
a_attack = -(-1*A // D)
if t_attack <= a_attack:
print("Yes")
else:
print('No') | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 452,531 | 452,532 | u888721916 | python |
p02700 | import math
A, B, C, D = map(int, input().split())
num_A = math.floor(C/B)
num_B = math.floor(A/D)
if num_A >= num_B:
print('Yes')
else:
print('No') | import math
A, B, C, D = map(int, input().split())
num_A = math.ceil(C/B)
num_B = math.ceil(A/D)
if num_A <= num_B:
print('Yes')
else:
print('No') | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 452,535 | 452,536 | u432098488 | python |
p02700 | a,b,c,d=map(int,input().split())
print("No"if c//b+int(c%b)>a//d+int(a%d) else"Yes") | a,b,c,d=map(int,input().split())
print("No"if c//b+int(c%b>0)>a//d+int(a%d>0) else"Yes") | [] | 452,539 | 452,540 | u695644361 | python |
p02700 | a, b, c, d = list(map(int, input().split()))
if (a-1)//d < (c-1)//b:
print("Yes")
else:
print("No") | a, b, c, d = list(map(int, input().split()))
if (a-1)//d < (c-1)//b:
print("No")
else:
print("Yes") | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 452,543 | 452,544 | u123872895 | python |
p02700 | t, a, ta, aa = list(map(int, input().split()))
while(True):
a -= ta
if a <= 0:
print("Yes")
break
t -= aa
if t <= 0:
print("No")
break | t, ta, a, aa = list(map(int, input().split()))
while(True):
a -= ta
if a <= 0:
print("Yes")
break
t -= aa
if t <= 0:
print("No")
break | [] | 452,545 | 452,546 | u505825680 | python |
p02700 | a=list(map(int,input().split(" ")))
A=a[2]
B=a[0]
while True:
A-=a[1]
if A<0:
print("No")
break
B-=a[3]
if B<0:
print("Yes")
break
| a=list(map(int,input().split(" ")))
A=a[2]
B=a[0]
while True:
A-=a[1]
if A<=0:
print("Yes")
break
B-=a[3]
if B<=0:
print("No")
break
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 452,549 | 452,550 | u788452182 | python |
p02700 | a,b,c,d=[int(x) for x in input().split()]
if (c-1)//b < (a-1)//d:
print("No")
else:
print("Yes") | a,b,c,d=[int(x) for x in input().split()]
if (c-1)//b > (a-1)//d:
print("No")
else:
print("Yes") | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 452,558 | 452,559 | u163903855 | python |
p02700 | a,b,c,d=(int(x) for x in input().split())
if (c+1)//b < (a+1)//d:
print("No")
else:
print("Yes") | a,b,c,d=[int(x) for x in input().split()]
if (c-1)//b > (a-1)//d:
print("No")
else:
print("Yes") | [
"assignment.value.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 452,560 | 452,559 | u163903855 | python |
p02700 | import sys
sys.setrecursionlimit(10**6)
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 | import sys
sys.setrecursionlimit(10**6)
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 | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 452,561 | 452,562 | u947047288 | python |
p02700 | a, b, c, d = [int(i) for i in input().split()]
e = a//d + (0 if a%d == 0 else 1)
f = c//b + (0 if b%c == 0 else 1)
print("Yes" if e>=f else "No") | a, b, c, d = [int(i) for i in input().split()]
e = a//d + (0 if a%d == 0 else 1)
f = c//b + (0 if c%b == 0 else 1)
print("Yes" if e>=f else "No") | [
"expression.operation.binary.remove"
] | 452,565 | 452,566 | u274841648 | python |
p02700 | a,b,c,d=map(int,input().split())
while True:
c=c-b
if c<0:
print("No")
break
a=a-d
if a<0:
print("Yes")
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
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 452,571 | 452,572 | u985735467 | python |
p02700 | a,b,c,d=map(int,input().split())
ta=(c-1)//b+1
ao=(d-1)//a+1
print('Yes') if ta<=ao else print('No') | a,b,c,d=map(int,input().split())
ta=(c-1)//b+1
ao=(a-1)//d+1
print('Yes') if ta<=ao else print('No') | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 452,589 | 452,590 | u798675549 | python |
p02700 |
import heapq
from collections import defaultdict, deque
from math import ceil, factorial, gcd
from itertools import accumulate
import sys
import bisect
sys.setrecursionlimit(10 ** 7)
INF = float("inf")
MOD = 10 ** 9 + 7
si = lambda: input().strip()
ii = lambda: int(input())
mii = lambda: map(int, input().split())
lm... |
import heapq
from collections import defaultdict, deque
from math import ceil, factorial, gcd
from itertools import accumulate
import sys
import bisect
sys.setrecursionlimit(10 ** 7)
INF = float("inf")
MOD = 10 ** 9 + 7
si = lambda: input().strip()
ii = lambda: int(input())
mii = lambda: map(int, input().split())
lm... | [
"control_flow.branch.if.condition.change"
] | 452,608 | 452,609 | u970308980 | python |
p02700 | a,b,c,d=map(int,input().split())
while True:
c-=b
if a<0:
print("Yes")
break
a-=d
if c<0:
print("No")
break | a,b,c,d=map(int,input().split())
while True:
c-=b
if c<=0:
print("Yes")
break
else:a-=d
if a<=0:
print("No")
break | [] | 452,622 | 452,623 | u344065503 | python |
p02700 | a,b,c,d=map(int,input().spplit())
index=0
for i in range(1000):
if index==0:
c=c-b
if c<=0:
print("Yes")
break
else:
index=1
else:
a=a-d
if a<=0:
print("No")
break
else:
index=0
| a,b,c,d=map(int,input().split())
index=0
for i in range(1000):
if index==0:
c=c-b
if c<=0:
print("Yes")
break
else:
index=1
else:
a=a-d
if a<=0:
print("No")
break
else:
index=0
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 452,628 | 452,629 | u224993839 | python |
p02700 | from sys import stdin
def main():
inp=stdin.readline
a,b,c,d=map(int, inp().split())
f=True
while a>0 or c>0:
if f:
a-=d
else:
c-=b
f=not(f)
if a>0:
print("Yes")
else:
print("No")
main() | from sys import stdin
def main():
inp=stdin.readline
a,b,c,d=map(int, inp().split())
f=False
while a>0 and c>0:
if f:
a-=d
else:
c-=b
f=not(f)
if a>0:
print("Yes")
else:
print("No")
main() | [
"misc.opposites",
"assignment.value.change",
"control_flow.loop.condition.change"
] | 452,658 | 452,659 | u434019166 | python |
p02700 | a, b, c, d = map(int, input().split())
print('YNeos'[-(-a//d) < --(c//b)::2])
| a, b, c, d = map(int, input().split())
print('YNeos'[-(-a//d) < -(-c//b)::2])
| [
"expression.operation.unary.arithmetic.remove",
"call.arguments.change",
"expression.operation.unary.add"
] | 452,663 | 452,664 | u021019433 | python |
p02700 | a, b,c,d = map(int, input().split())
wintaka = -(-c//b)
winao = -(-a//d)
if wintaka>=winao:
print('Yes')
else:
print('No') | a, b,c,d = map(int, input().split())
wintaka = -(-c//b)
winao = -(-a//d)
if wintaka<=winao:
print('Yes')
else:
print('No') | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 452,796 | 452,797 | u843318346 | python |
p02700 | import sys
input = sys.stdin.readline
ma = lambda : map(int,input().split())
ni = lambda : int(input())
a,b,c,d = ma()
import math
ceil =math.ceil
if ceil(c/b) <=ceil(a/d)+1:print("Yes")
else:print("No")
| import sys
input = sys.stdin.readline
ma = lambda : map(int,input().split())
ni = lambda : int(input())
a,b,c,d = ma()
import math
ceil =math.ceil
if ceil(c/b) <=ceil(a/d):print("Yes")
else:print("No")
| [
"expression.operation.binary.remove"
] | 452,804 | 452,805 | u401487574 | python |
p02700 | TH,TS,AH,AS = map(int,input().split())
while Ture:
AH -= TS
if AH <= 0:
print('Yes')
break
else:
TH -= AS
if TH <= 0:
print('No')
break | TH,TS,AH,AS = map(int,input().split())
while True:
AH -= TS
if AH <= 0:
print('Yes')
break
else:
TH -= AS
if TH <= 0:
print('No')
break | [
"control_flow.loop.condition.change"
] | 452,812 | 452,813 | u404401732 | python |
p02700 | from math import ceil
A, B, C, D = map(int, input().split())
Takahashi = ceil(A/D)
Aoki = ceil(C/D)
if Takahashi >= Aoki:
print("Yes")
else:
print("No") | from math import ceil
A, B, C, D = map(int, input().split())
Takahashi = ceil(A/D)
Aoki = ceil(C/B)
if Takahashi >= Aoki:
print("Yes")
else:
print("No") | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 452,822 | 452,823 | u873776333 | python |
p02700 | from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp():
'''
一つの整数
'''
return int(input())
def inpl():
'''
一行に複数の整数
'''
return l... | from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp():
'''
一つの整数
'''
return int(input())
def inpl():
'''
一行に複数の整数
'''
return l... | [
"expression.operation.binary.remove"
] | 452,826 | 452,827 | u802977614 | python |
p02700 | A, B, C, D = map(int, input().split())
ans = 'Yes'
while True:
# 高橋くんのターン
D -= A
if D <= 0:
break
# 青木くんのターン
B -= C
if B <= 0:
ans = 'No'
break
print(ans)
| A, B, C, D = map(int, input().split())
ans = 'Yes'
while True:
# 高橋くんのターン
C -= B
if C <= 0:
break
# 青木くんのターン
A -= D
if A <= 0:
ans = 'No'
break
print(ans)
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 452,828 | 452,829 | u701318346 | python |
p02700 | a,b,c,d=map(int,input().split())
while 0<a or 0<c:
c-=b
if c<=0:
break
a-=d
if a<=c:
print("No")
else:
print("Yes") | a,b,c,d=map(int,input().split())
while 0<a or 0<c:
c-=b
if c<=0:
break
a-=d
if a<=0:
print("No")
else:
print("Yes") | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 452,671 | 452,672 | u798093965 | python |
p02700 | a,b,c,d=map(int,input().split())
while 0<a or 0<c:
c-=b
if c==0:
break
a-=d
if a<=c:
print("No")
else:
print("Yes") | a,b,c,d=map(int,input().split())
while 0<a or 0<c:
c-=b
if c<=0:
break
a-=d
if a<=0:
print("No")
else:
print("Yes") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add"
] | 452,673 | 452,672 | u798093965 | python |
p02700 | A, B, C, D = [int(s) for s in input().split()]
takahashi_attacks = A // D if A % D == 0 else A // D + 1
aoki_attacks = C // B if C % B == 0 else C // B + 1
print('Yes') if takahashi_attacks <= aoki_attacks else print('No')
| A, B, C, D = [int(s) for s in input().split()]
aoki_attacks = A // D if A % D == 0 else A // D + 1
takahashi_attacks = C // B if C % B == 0 else C // B + 1
print('Yes') if takahashi_attacks <= aoki_attacks else print('No') | [
"assignment.variable.change",
"identifier.change"
] | 452,679 | 452,680 | u692054751 | python |
p02700 | a, b, c, d = list(map(int, input().split()))
i = 1
while a>0 and c>0:
if i % 2 == 0:
a -= d
else:
c -= b
else:
if a > c:
print("Yes")
else:
print("No")
| a, b, c, d = list(map(int, input().split()))
i = 1
while a>0 and c>0:
if i % 2 == 0:
a -= d
else:
c -= b
i += 1
else:
if a > c:
print("Yes")
else:
print("No")
| [] | 452,683 | 452,684 | u037601040 | python |
p02700 | a, b, c, d = list(map(int, input().split()))
i = 1
while a>=0 and c>=0:
if i % 2 == 0:
a -= d
else:
c -= b
else:
if a > c:
print("Yes")
else:
print("No")
| a, b, c, d = list(map(int, input().split()))
i = 1
while a>0 and c>0:
if i % 2 == 0:
a -= d
else:
c -= b
i += 1
else:
if a > c:
print("Yes")
else:
print("No")
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 452,685 | 452,684 | u037601040 | python |
p02700 | A, B, C, D = map(int, input().split())
while True:
C = C - B
if C < 0:
print('No')
break
A = A - D
if A < 0:
print('Yes')
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
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 452,692 | 452,693 | u715396242 | python |
p02700 | a,b,c,d= map(int, input().split())
e=a//d
f=c//b
if a%d!=0:
e+=1
if c%b!=0:
f+=1
if e<=f:
print("Yes")
else:
print("No")
| a,b,c,d= map(int, input().split())
e=a//d
f=c//b
if a%d!=0:
e+=1
if c%b!=0:
f+=1
if f<=e:
print("Yes")
else:
print("No") | [
"control_flow.branch.if.condition.change"
] | 452,716 | 452,717 | u771538568 | python |
p02700 | a,b,c,d=map(int, input().split())
aoki = int(c/b)
if c % b != 0:
aoki += 1
taka = int(a/d)
if a % d != 0:
taka += 1
if aoki <= taka+1:
print("Yes")
else:
print("No")
| a,b,c,d=map(int, input().split())
aoki = int(c/b)
if c % b != 0:
aoki += 1
taka = int(a/d)
if a % d != 0:
taka += 1
if aoki <= taka:
print("Yes")
else:
print("No")
| [
"expression.operation.binary.remove"
] | 452,722 | 452,723 | u695261159 | python |
p02700 | num=list(map(int,input().split()))
while 1:
num[2]=num[2]-num[1]
if num[2]<=0:
print("Yes")
break
num[0]=num[0]-num[3]
if num[3]<=0:
print("No")
break | num=list(map(int,input().split()))
while 1:
num[2]=num[2]-num[1]
if num[2]<=0:
print("Yes")
break
num[0]=num[0]-num[3]
if num[0]<=0:
print("No")
break | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 452,726 | 452,727 | u736564905 | python |
p02700 | a, b, c, d = map(int, input().split())
if c % b == 0:
takahashi = c / b
else:
takahashi = c / b + 1
if a % d == 0:
aoki = a / d
else:
aoki = a / d + 1
if takahashi <= aoki:
print("Yes")
else:
print("No") | a, b, c, d = map(int, input().split())
if c % b == 0:
takahashi = c // b
else:
takahashi = c // b + 1
if a % d == 0:
aoki = a // d
else:
aoki = a // d + 1
# print(takahashi)
# print(aoki)
if takahashi <= aoki:
print("Yes")
else:
print("No") | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 452,738 | 452,739 | u373703188 | python |
p02700 | HP_t, ATK_t, HP_a, ATK_a = [int(x) for x in input().split()]
while True:
HP_t = HP_t - ATK_a
if HP_t <= 0:
print('No')
break
HP_a = HP_a - ATK_t
if HP_a <= 0:
print('Yes')
break | HP_t, ATK_t, HP_a, ATK_a = [int(x) for x in input().split()]
while True:
HP_a = HP_a - ATK_t
if HP_t <= 0:
print('No')
break
HP_t = HP_t - ATK_a
if HP_a <= 0:
print('Yes')
break | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 452,740 | 452,741 | u414682674 | python |
p02700 | A, B, C, D = map(int, input().split())
while A > 0 and C > 0:
C = C - B
if C <= 0:
break
else:
A = A - D
if A == 0:
ans = 'No'
else:
ans = 'Yes'
print(ans)
| A, B, C, D = map(int, input().split())
while A > 0 and C > 0:
C = C - B
if C <= 0:
break
else:
A = A - D
if A <= 0:
ans = 'No'
else:
ans = 'Yes'
print(ans)
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 452,746 | 452,747 | u101350975 | python |
p02700 | a,b,c,d = map(int,input().split())
cnt = 0
while (a >= 0 and c >= 0):
if cnt % 2 == 0:
c = c - b
else:
a = a - d
cnt += 1
if c <= 0:
print("Yes")
else:
print("No") | a,b,c,d = map(int,input().split())
cnt = 0
while (a > 0 and c > 0):
if cnt % 2 == 0:
c = c - b
else:
a = a - d
cnt += 1
if c <= 0:
print("Yes")
else:
print("No") | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 452,771 | 452,772 | u791070772 | python |
p02700 | a,b,c,d = map(int,input().split())
cnt = 0
while (a >= 0 and c >= 0):
if c % 2 == 0:
c = c - b
else:
a = a - d
cnt += 1
if c <= 0:
print("Yes")
else:
print("No") | a,b,c,d = map(int,input().split())
cnt = 0
while (a > 0 and c > 0):
if cnt % 2 == 0:
c = c - b
else:
a = a - d
cnt += 1
if c <= 0:
print("Yes")
else:
print("No") | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 452,773 | 452,772 | u791070772 | python |
p02700 | def io():
return map(int,input().split())
def op():
return list(map(int,input().split()))
a,b,c,d=io()
while 1:
c=c-b
if c<=0:
print('yes')
break
a-=d
if a<=0:
print('no')
break | def io():
return map(int,input().split())
def op():
return list(map(int,input().split()))
a,b,c,d=io()
while 1:
c=c-b
if c<=0:
print('Yes')
break
a-=d
if a<=0:
print('No')
break | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 452,790 | 452,791 | u471217476 | python |
p02700 | import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:(input())
"""========main code==============="""
a,b,c,d=ml()
i=0
while(a>0 and c>0):
if(i%2==0):
c-=b
else:
a-=d
i+=1
if(a==0):
... | import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:(input())
"""========main code==============="""
a,b,c,d=ml()
i=0
while(a>0 and c>0):
if(i%2==0):
c-=b
else:
a-=d
i+=1
if(a<=0):
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 452,848 | 452,849 | u706984643 | python |
p02700 | a,b,c,d=map(int,input().split())
import math
if math.ceil(c/b)>=math.ceil(a/d):
print('Yes')
else:
print('No') | a,b,c,d=map(int,input().split())
import math
if math.ceil(c/b)<=math.ceil(a/d):
print('Yes')
else:
print('No') | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 452,863 | 452,864 | u106778233 | python |
p02700 | A, B, C, D = map(int, input().split())
tak = - (-C//B)
oak = -(-D//A)
if tak <= oak:
print('Yes')
else:
print('No') | A, B, C, D = map(int, input().split())
tak = - (-C//B)
oak = -(-A//D)
if tak <= oak:
print('Yes')
else:
print('No') | [
"expression.operation.binary.remove"
] | 452,868 | 452,869 | u470560351 | python |
p02700 | from math import ceil
a, b, c, d = map(int, input().split())
if ceil(a/d) >= ceil(c/d):
print("Yes")
else:
print("No") | from math import ceil
a, b, c, d = map(int, input().split())
if ceil(a/d) >= ceil(c/b):
print("Yes")
else:
print("No") | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 452,870 | 452,871 | u034128150 | python |
p02700 | #!/usr/bin/env python3
from pprint import pprint
from collections import deque, defaultdict
import sys
sys.setrecursionlimit(10 ** 6)
inf = float("inf")
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
if a > 0:
print('Yes')
else:
... | #!/usr/bin/env python3
from pprint import pprint
from collections import deque, defaultdict
import sys
sys.setrecursionlimit(10 ** 6)
inf = float("inf")
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
if a > 0:
print('Yes... | [] | 452,889 | 452,890 | u705857261 | python |
p02700 | import math
A, B, C, D = map(int, input().split())
taka = math.ceil(C / B)
aoki = math.ceil(A / D)
print('Yes' if taka == aoki else 'No') | import math
A, B, C, D = map(int, input().split())
taka = math.ceil(C / B)
aoki = math.ceil(A / D)
print('Yes' if taka <= aoki else 'No') | [
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 452,918 | 452,919 | u728566015 | python |
p02700 | from math import ceil
A, B, C, D = map(int,input().split())
t = ceil(C / A)
a = ceil(A / D)
if t <= a:
print('Yes')
else:
print('No') | from math import ceil
A, B, C, D = map(int,input().split())
t = ceil(C / B)
a = ceil(A / D)
if t <= a:
print('Yes')
else:
print('No') | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 452,924 | 452,925 | u189479417 | python |
p02700 | A,B,C,D = map(int,input().split())
for i in range(10000):
C -= B
if C <= 0:
print("Yes")
break
A -= D
if B <= 0:
print("No")
break | A,B,C,D = map(int,input().split())
for i in range(100000):
C -= B
if C <= 0:
print("Yes")
break
A -= D
if A <= 0:
print("No")
break | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 452,926 | 452,927 | u355371431 | python |
p02700 | a, b, c, d = map(int, input().split())
t = 0
while a > 0 and c > 0:
if t % 2 == 0:
c -= b
else:
a -= d
t += 1
if a == 0:
print("No")
else:
print("Yes") | a, b, c, d = map(int, input().split())
t = 0
while a > 0 and c > 0:
if t % 2 == 0:
c -= b
else:
a -= d
t += 1
if a <= 0:
print("No")
else:
print("Yes") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 452,903 | 452,904 | u830390742 | python |
p02700 | import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
if l... | import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
if l... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 452,905 | 452,906 | u807772568 | python |
p02700 | import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect... | import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect... | [] | 452,911 | 452,912 | u404290207 | python |
p02700 | import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect... | import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 452,913 | 452,912 | u404290207 | python |
p02700 | import sys
input = sys.stdin.readline
A, B, C, D = map(int, input().split())
t = 0
while A > 0 and (C > 0):
if t % 2: A -= D
else: C -= B
t += 1
if A: print("Yes")
else: print("No") | import sys
input = sys.stdin.readline
A, B, C, D = map(int, input().split())
t = 0
while A > 0 and (C > 0):
if t % 2: A -= D
else: C -= B
t += 1
if A > 0: print("Yes")
else: print("No") | [
"control_flow.branch.if.condition.change"
] | 452,916 | 452,917 | u141610915 | python |
p02700 | 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
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') | [] | 452,936 | 452,937 | u497046426 | python |
p02700 | #N = int(input())
l = [int(x) for x in input().split()]
while True:
l[2] = l[2] - l[1]
if l[2] <= 0:
print("Yes")
break
l[0] = l[0] ^ l[3]
if l[0] <= 0:
print("No")
break | #N = int(input())
l = [int(x) for x in input().split()]
while True:
l[2] = l[2] - l[1]
if l[2] <= 0:
print("Yes")
break
l[0] = l[0] - l[3]
if l[0] <= 0:
print("No")
break | [
"assignment.value.change",
"expression.operation.binary.change"
] | 452,948 | 452,949 | u708019102 | 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')
exit()
elif a<=0:
print('No')
exit() | a,b,c,d=map(int, input().split())
while a>0 or c>0:
c-=b
a-=d
if c<=0:
print('Yes')
exit()
elif a<=0:
print('No')
exit()
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 452,956 | 452,957 | u363836311 | python |
p02700 | A,B,C,D = [int(_n) for _n in input().split()]
taka = C / B + (0 if C % B == 0 else 1)
aoki = A / D + (0 if A % D == 0 else 1)
print("Yes" if taka <= aoki else "No") | A,B,C,D = [int(_n) for _n in input().split()]
taka = C // B + (0 if C % B == 0 else 1)
aoki = A // D + (0 if A % D == 0 else 1)
# print(taka)
# print(aoki)
print("Yes" if taka <= aoki else "No") | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 452,966 | 452,967 | u974620347 | python |
p02700 | import math
a,b,c,d = map(int,input().split())
t = math.ceil(c/b)
o = math.ceil(a/d)
print(t,o)
if t <= o:
print('Yes')
else:
print('No') | import math
a,b,c,d = map(int,input().split())
t = math.ceil(c/b)
o = math.ceil(a/d)
if t <= o:
print('Yes')
else:
print('No') | [
"call.remove"
] | 452,968 | 452,969 | u291028869 | python |
p02700 | A, B, C, D = map(int,input().split())
while True:
C -= B
if C <= 0:
ans = 'Yes'
break
A -= D
if C <= 0:
ans = 'No'
break
print(ans) | A, B, C, D = map(int,input().split())
while True:
C -= B
if C <= 0:
ans = 'Yes'
break
A -= D
if A <= 0:
ans = 'No'
break
print(ans)
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 452,978 | 452,979 | u045939752 | python |
p02701 | N = int(input())
gacha = set()
for _ in range(N):
gacha.append(input())
print(len(gacha)) | N = int(input())
gacha = set()
for _ in range(N):
gacha.add(input())
print(len(gacha)) | [
"identifier.change"
] | 453,000 | 453,001 | u974918235 | python |
p02701 | n=int(input())
l=[]
for i in range(n):
l.append(len(input()))
print(len(set(l))) | n=int(input())
l=[]
for i in range(n):
l.append(input())
print(len(set(l))) | [
"call.arguments.change"
] | 453,002 | 453,003 | u767438459 | python |
p02701 | n = int(input())
s = set()
for i in range(n):
s.insert(input())
print(len(s)) | n = int(input())
s = set()
for i in range(n):
s.add(input())
print(len(s))
| [
"identifier.change"
] | 453,006 | 453,007 | u236885379 | python |
p02700 | A, B, C, D = map(int, input().split())
while True:
C = C - A
if C <= 0:
print('Yes')
break
B = B - D
if B <= 0:
print('No')
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
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"assignment.variable.change",
"control_flow.branch.if.condition.change"
] | 453,021 | 453,022 | u965581346 | python |
p02700 | a, b, c, d = map(int, input().split())
import math
ao = math.ceil(a / d)
taka = math.ceil(c / b)
#print(taka, ao)
if taka == ao:
print('YES')
else:
if taka > ao:
print('NO')
else:
print('YES') | a, b, c, d = map(int, input().split())
import math
ao = math.ceil(a / d)
taka = math.ceil(c / b)
#print(taka, ao)
if taka == ao:
print('Yes')
else:
if taka > ao:
print('No')
else:
print('Yes') | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 453,033 | 453,034 | u038408819 | python |
p02700 | a,b,c,d = map(int,input().split())
for i in range(1,1000):
if(i%2!=0):
c -= b
else:
a -= d
if(a<=0):
print("No")
return
elif(c<=0):
print("Yes")
return | a,b,c,d = map(int,input().split())
for i in range(1,1000):
if(i%2!=0):
c -= b
else:
a -= d
if(a<=0):
print("No")
break
elif(c<=0):
print("Yes")
break | [
"control_flow.return.remove",
"control_flow.break.add"
] | 453,040 | 453,041 | u828261239 | python |
p02700 | from math import ceil
A, B, C, D = map(int,input().split())
if ceil(D / A) >= ceil(B / C): print("Yes")
else: print("No")
| from math import ceil
A, B, C, D = map(int,input().split())
if ceil(C / B) <= ceil(A / D): print("Yes")
else: print("No")
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 453,060 | 453,061 | u460185449 | python |
p02700 | from math import ceil
A, B, C, D = map(int,input().split())
if ceil(D / A) <= ceil(B / C): print("Yes")
else: print("No")
| from math import ceil
A, B, C, D = map(int,input().split())
if ceil(C / B) <= ceil(A / D): print("Yes")
else: print("No")
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 453,062 | 453,061 | u460185449 | python |
p02700 | import numpy as np
import sys
import math
a , b , c , d = map(int,input().split())
time = c / b
w = c % b
if w != 0:
time += 1
if a - ( (time-1)*d) > 0:
print("Yes")
else:
print("No")
| import numpy as np
import sys
import math
a , b , c , d = map(int,input().split())
time = int( c / b )
w = c % b
if w != 0:
time += 1
if a - ( (time-1)*d) > 0:
print("Yes")
else:
print("No")
| [
"call.add",
"call.arguments.change"
] | 453,069 | 453,070 | u192042624 | python |
p02700 | A, B, C, D = map(int, input().split())
if (D + B - 1) // B < (A + D - 1) // D:
print("Yes")
else:
print("No")
| A, B, C, D = map(int, input().split())
if (C + B - 1) // B <= (A + D - 1) // D:
print("Yes")
else:
print("No")
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 453,077 | 453,078 | u782098901 | python |
p02700 | A,B,C,D = map(int,input().split())
if C % B != 0:
ans_A = ((C // B) + 1)
else:
ans_A = C // B
if A % D != 0:
ans_C = A // D + 2
else:
ans_C = A // D
if ans_A <= ans_C:
print('Yes')
else:
print('No') | A,B,C,D = map(int,input().split())
if C % B != 0:
ans_A = ((C // B) + 1)
else:
ans_A = C // B
if A % D != 0:
ans_C = A // D + 1
else:
ans_C = A // D
if ans_A <= ans_C:
print('Yes')
else:
print('No') | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 453,079 | 453,080 | u861071267 | python |
p02701 | import sys
import itertools
print(set(itertools.islice(sys.stdin.buffer, 1, None))) | import sys, itertools
print(len(set(itertools.islice(sys.stdin.buffer, 1, None)))) | [
"call.arguments.add",
"call.arguments.change"
] | 453,091 | 453,092 | u317423698 | python |
p02701 | n=int(input())
d={}
for i in range(n):
s=str(input())
d.add(s)
print(len(d)) | n=int(input())
d=set()
for i in range(n):
s=str(input())
d.add(s)
print(len(d)) | [
"call.arguments.change"
] | 453,093 | 453,094 | u108509795 | python |
p02701 | import collections
N=int(input())
P=[input() for i in range(N)]
print(P)
c=collections.Counter(P)
print(len(c)) | import collections
N=int(input())
P=[input() for i in range(N)]
c=collections.Counter(P)
print(len(c)) | [
"call.remove"
] | 453,102 | 453,103 | u011202375 | python |
p02701 | N = int(input())
S = [input(i) for i in range(N)]
#print(S)
ans=set(S)
print(len(ans)) | N = int(input())
S = [input() for _ in range(N)]
#print(S)
ans=set(S)
print(len(ans)) | [
"call.arguments.change",
"assignment.value.change",
"identifier.change"
] | 453,114 | 453,115 | u316233444 | python |
p02701 | n = int(input())
x = [input() for i in range(3)]
print(len(list(set(x))))
| n = int(input())
x = [input() for i in range(n)]
print(len(list(set(x))))
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 453,116 | 453,117 | u116484168 | python |
p02701 | n = int(input())
s = [input() for i in range(n)]
print(list(set(s)).length)
| n = int(input())
x = [input() for i in range(n)]
print(len(list(set(x))))
| [
"assignment.variable.change",
"identifier.change",
"call.add",
"call.arguments.change",
"call.arguments.add"
] | 453,118 | 453,117 | u116484168 | python |
p02701 | N = int(input())
S = [input() for i in range(N)]
# N = 5
# S = ['aa', 'a', 'aa', 'aaaa', 'aa']
C = dict([s,1] for s in S)
L = len(C) | N = int(input())
S = [input() for i in range(N)]
# N = 5
# S = ['aa', 'a', 'aa', 'aaaa', 'aa']
C = dict([s,1] for s in S)
L = len(C)
print(L) | [
"call.add"
] | 453,119 | 453,120 | u529737989 | python |
p02701 | N = int(input())
ga = []
for _ in range(N):
ga.append(input())
print(len(ga)) | N = int(input())
ga = []
for _ in range(N):
ga.append(input())
ga = set(ga)
print(len(ga)) | [
"assignment.add"
] | 453,121 | 453,122 | u434609232 | python |
p02701 | import math
import collections
import fractions
import itertools
def solve():
n = int(input())
s = [input() for i in range(n)]
print(len(s))
return 0
if __name__ == '__main__':
solve() | import math
import collections
import fractions
import itertools
def solve():
n = int(input())
s = [input() for i in range(n)]
print(len(set(s)))
return 0
if __name__ == '__main__':
solve() | [
"call.add",
"call.arguments.change"
] | 453,126 | 453,127 | u075304271 | python |
p02701 | n = int(input())
ans = []
cnt = 0
for i in range(n):
s = input()
ans.append(s)
ans.sort()
for i in range(n-1):
if ans[i]!=ans[i+1]:
cnt+=1
print(cnt) | n = int(input())
ans = []
cnt = 1
for i in range(n):
s = input()
ans.append(s)
ans.sort()
for i in range(n-1):
if ans[i]!=ans[i+1]:
cnt+=1
print(cnt) | [
"literal.number.integer.change",
"assignment.value.change"
] | 453,128 | 453,129 | u035453792 | python |
p02701 | N=int(input())
X=[]
for i in range(N):
X.append(input())
print(set(X))
| N=int(input())
X=[]
for i in range(N):
X.append(input())
print(len(set(X)))
| [
"call.arguments.add",
"call.arguments.change"
] | 453,130 | 453,131 | u185806788 | python |
p02701 | n=int(input())
s=[]
for i in range(n):
s[i]=str(input())
s=list(set(s))
print(len(s)) | n=int(input())
s=[0]*n
for i in range(n):
s[i]=str(input())
s=list(set(s))
print(len(s)) | [
"assignment.change"
] | 453,138 | 453,139 | u629350026 | python |
p02701 | N = int(input())
S = []
for n in range(N):
Sn = str(input())
S.append(Sn)
print(S)
ans = len(list(dict.fromkeys(S)))
print(ans) | N = int(input())
S = []
for n in range(N):
Sn = str(input())
S.append(Sn)
ans = len(list(dict.fromkeys(S)))
print(ans) | [
"call.remove"
] | 453,146 | 453,147 | u188305619 | python |
p02701 | N=int(input())
A=set(input().split())
print(len(A))
| N=int(input())
A=set(input() for i in range(N))
print(len(A)) | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 453,155 | 453,156 | u490127109 | python |
p02701 | N = int(input())
S = []
for i in range(N):
S.append(input())
print(set(S)) | N = int(input())
S = []
for i in range(N):
S.append(input())
print(len(set(S))) | [
"call.arguments.add",
"call.arguments.change"
] | 453,163 | 453,164 | u696231671 | python |
p02701 | n= int(input())
l= {}
for _ in range(n):
s= input()
l.add(s)
print(len(l)) | n= int(input())
l= set()
for _ in range(n):
s= input()
l.add(s)
print(len(l)) | [
"call.arguments.change"
] | 453,168 | 453,169 | u101232733 | python |
p02701 | N=int(input())
S=[]
for i in range(N):
_=input()
S.append(i)
Set=set(S)
print(len(Set)) | N=int(input())
S=[]
for i in range(N):
_=input()
S.append(_)
Set=set(S)
print(len(Set)) | [
"identifier.change",
"call.arguments.change"
] | 453,176 | 453,177 | u674588203 | python |
p02701 | N=int(input())
S=[]
for i in range(N):
S.append(i)
Set=set(S)
print(len(Set)) | N=int(input())
S=[]
for i in range(N):
_=input()
S.append(_)
Set=set(S)
print(len(Set)) | [
"identifier.change",
"call.arguments.change"
] | 453,178 | 453,177 | u674588203 | python |
p02701 | N = int(input())
S = []
for i in range(N):
S.append(input())
set(S)
print(len(S)) | N = int(input())
S = []
for i in range(N):
S.append(input())
S= set(S)
print(len(S)) | [
"assignment.add"
] | 453,182 | 453,183 | u258325541 | python |
p02701 | N = int(input())
S = []
for j in range(N):
S[j]= input()
print(len(set(S))) | N = int(input())
S = []
for j in range(N):
S.append(input())
print(len(set(S))) | [
"call.arguments.change"
] | 453,194 | 453,195 | u635621124 | python |
p02701 | N = int(input())
prizes = set()
unique = 0
for _ in range(N):
curr = input()
if not prizes:
unique += 1
prizes.add(curr)
if curr not in prizes:
unique += 1
print(unique) | N = int(input())
prizes = set()
unique = 0
for _ in range(N):
curr = input()
if not prizes:
unique += 1
prizes.add(curr)
if curr not in prizes:
prizes.add(curr)
unique += 1
print(unique) | [
"call.add"
] | 453,196 | 453,197 | u626684023 | python |
p02701 | N = int(input())
S = [int(input()) for i in range(N)]
print(len(set(S))) | N = int(input())
S = [input() for i in range(N)]
print(len(set(S))) | [
"call.remove",
"call.arguments.change"
] | 453,210 | 453,211 | u848535504 | python |
p02701 | n = int(input())
s = [int(input()) for _ in range(n)]
ans = set()
for i in s:
ans.add(i)
print(len(ans))
| n = int(input())
s = [input() for _ in range(n)]
ans = set()
for i in s:
ans.add(i)
print(len(ans))
| [
"call.remove",
"call.arguments.change"
] | 453,212 | 453,213 | u643679148 | python |
p02701 | N = int(input())
d = {}
for i in range(N):
d[input()] = 0
print(len(dict)) | N = int(input())
d = {}
for i in range(N):
d[input()] = 0
print(len(d))
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 453,220 | 453,221 | u240630407 | python |
p02701 | Row = int(input())
List = []
for i in range (Row):
List.append(int(input()))
s_l = set(List)
print(len(s_l)) | Row = int(input())
List = []
for i in range (Row):
List.append(input())
s_l = set(List)
print(len(s_l)) | [
"call.arguments.change"
] | 453,238 | 453,239 | u113255362 | python |
p02701 | N = input()
list = [input() for i in range(N)]
print(len(set(list))) | N = int(input())
list = [input() for i in range(N)]
print(len(set(list))) | [
"call.add",
"call.arguments.change"
] | 453,246 | 453,247 | u600261652 | python |
p02701 | N = input()
list = list(input() for i in range(N))
print(len(set(list))) | N = int(input())
list = [input() for i in range(N)]
print(len(set(list))) | [
"call.add",
"call.arguments.change",
"assignment.value.change"
] | 453,249 | 453,247 | u600261652 | python |
p02701 | N = int(input())
st = set()
for _ in range(N):
S = input()
st.insert(S)
print(len(st)) | N = int(input())
st = set()
for _ in range(N):
S = input()
st.add(S)
print(len(st)) | [
"identifier.change"
] | 453,252 | 453,253 | u127285813 | python |
p02701 | n=int(input())
li=[]
for si in n:
si=input()
li.append(si)
print(len(set(li))) | n=int(input())
li=[]
for si in range(n):
si=input()
li.append(si)
print(len(set(li))) | [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 453,260 | 453,261 | u938718404 | python |
p02701 | n = int(input())
s = [input() for i in range(n)]
ss = sorted(s)
test = ss[0]
count = 1
for i in range(n):
if test != s[i]:
test = s[i]
count += 1
print(count) | n = int(input())
s = [input() for i in range(n)]
ss = sorted(s)
test = ss[0]
count = 1
for i in range(n):
if test != ss[i]:
test = ss[i]
count += 1
print(count) | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 453,264 | 453,265 | u425834921 | python |
p02701 | n=int(intput())
s=set(input() for _ in range(n))
print(len(s)) | n=int(input())
s=set([input() for _ in range(n)])
print(len(s)) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 453,266 | 453,267 | u344065503 | python |
p02701 | N = int(input())
S =[input() for i in range(N+1)]
s = set(S)
print(len(s)) | N = int(input())
S =[input() for i in range(N)]
s = set(S)
print(len(s)) | [
"expression.operation.binary.remove"
] | 453,271 | 453,272 | u857673087 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.