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 |
|---|---|---|---|---|---|---|---|
p02679 | import sys
from collections import Counter
from math import gcd
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j i... | import sys
from collections import Counter
from math import gcd
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j i... | [
"literal.number.integer.change",
"variable_access.subscript.index.change"
] | 402,928 | 402,929 | u588341295 | python |
p02679 | import sys
import math
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
MOD = 10**9+7
N = int(input())
dic = defaultdict(int)
zero = 0
for i in range(N):
a, b = map(int, input().split())
if b < 0:
a = -a
b = -b
if a == 0 and b == 0:
zero +=... | import sys
import math
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
MOD = 10**9+7
N = int(input())
dic = defaultdict(int)
zero = 0
for i in range(N):
a, b = map(int, input().split())
if b < 0:
a = -a
b = -b
if a == 0 and b == 0:
zero +=... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 402,936 | 402,937 | u924691798 | python |
p02679 | import sys
from collections import defaultdict
from math import gcd
sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline
MOD = 10 ** 9 + 7
def solve():
N = int(rl())
AB = tuple(tuple(map(int, rl().split())) for _ in range(N))
zero_pare = 0
zero_a, zero_b = 0, 0
counter = defaultdict(int)
... | import sys
from collections import defaultdict
from math import gcd
sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline
MOD = 10 ** 9 + 7
def solve():
N = int(rl())
AB = tuple(tuple(map(int, rl().split())) for _ in range(N))
zero_pare = 0
zero_a, zero_b = 0, 0
counter = defaultdict(int)
... | [
"identifier.change"
] | 402,965 | 402,966 | u935984175 | python |
p02679 | import math
import collections
from collections import defaultdict
n=int(input())
l=[list(map(int,input().split())) for i in range(n)]
mod=10**9+7
L=[]
ct0=0
for i in range(n):
if l[i][0]==0 and l[i][1]==0:
ct0+=1
elif l[i][0]==0:
L.append((0,1))
elif l[i][1]==0:
L.append((1,0))
elif l[i][0]<0:
... | import math
import collections
from collections import defaultdict
n=int(input())
l=[list(map(int,input().split())) for i in range(n)]
mod=10**9+7
L=[]
ct0=0
for i in range(n):
if l[i][0]==0 and l[i][1]==0:
ct0+=1
elif l[i][0]==0:
L.append((0,1))
elif l[i][1]==0:
L.append((1,0))
elif l[i][0]<0:
... | [
"expression.operation.binary.add"
] | 402,971 | 402,972 | u017810624 | python |
p02679 | #!python3
def LI():
return list(map(int, input().split()))
# input
N = int(input())
AB = [LI() for _ in range(N)]
MOD = 10 ** 9 + 7
def gcd(a, b):
while b:
a, b = b, a % b
return a
def create_pairs():
z = 0
d = {}
for a, b in AB:
# irre
if a == 0 and b == 0:
... | #!python3
def LI():
return list(map(int, input().split()))
# input
N = int(input())
AB = [LI() for _ in range(N)]
MOD = 10 ** 9 + 7
def gcd(a, b):
while b:
a, b = b, a % b
return a
def create_pairs():
z = 0
d = {}
for a, b in AB:
# irre
if a == 0 and b == 0:
... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"assignment.value.change"
] | 402,983 | 402,984 | u671861352 | python |
p02679 | #!python3
def LI():
return list(map(int, input().split()))
# input
N = int(input())
AB = [LI() for _ in range(N)]
MOD = 10 ** 9 + 7
def gcd(a, b):
while b:
a, b = b, a % b
return a
def create_pairs():
z = 0
d = {}
for a, b in AB:
# irre
if a == 0 and b == 0:
... | #!python3
def LI():
return list(map(int, input().split()))
# input
N = int(input())
AB = [LI() for _ in range(N)]
MOD = 10 ** 9 + 7
def gcd(a, b):
while b:
a, b = b, a % b
return a
def create_pairs():
z = 0
d = {}
for a, b in AB:
# irre
if a == 0 and b == 0:
... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"assignment.value.change"
] | 402,985 | 402,984 | u671861352 | python |
p02679 | from math import gcd
MOD = 10**9+7
N = int(input())
d = {}
zero = 0
for i in range(N):
a, b = map(int, input().split())
if a == 0 and b == 0:
zero += 1
continue
flip = 0
while not (a >= 0 and b >= 0):
a, b = -b, a
flip ^= 1
g = gcd(a, b)
a //= g
b //= g
... | from math import gcd
MOD = 10**9+7
N = int(input())
d = {}
zero = 0
for i in range(N):
a, b = map(int, input().split())
if a == 0 and b == 0:
zero += 1
continue
# cosで単位円を考える
# 第一象限に来るまでの90度回転回数
flip = 0
while not (a >= 0 and b > 0):
a, b = -b, a
flip ^= 1
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 402,988 | 402,989 | u342869120 | python |
p02679 | from math import gcd
MOD = 10**9+7
N = int(input())
d = {}
zero = 0
for i in range(N):
a, b = map(int, input().split())
if a == 0 and b == 0:
zero += 1
continue
flip = 0
while not (a >= 0 and b >= 0):
a, b = -b, a
flip ^= 1
g = gcd(a, b)
a //= g
b //= g
... | from math import gcd
MOD = 10**9+7
N = int(input())
d = {}
zero = 0
for i in range(N):
a, b = map(int, input().split())
if a == 0 and b == 0:
zero += 1
continue
# a/bでbが0にならないように、かつ両方正の整数となるまで(a,b)->(-b,a)に変換
flip = 0
while not (a >= 0 and b > 0):
a, b = -b, a
flip ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 402,988 | 402,991 | u342869120 | python |
p02679 | from math import gcd
MOD = 10**9+7
N = int(input())
d = {}
zero = 0
for i in range(N):
a, b = map(int, input().split())
if a == 0 and b == 0:
zero += 1
continue
flip = 0
while not (a >= 0 and b >= 0):
a, b = -b, a
flip ^= 1
g = gcd(a, b)
a //= g
b //= g
... | from math import gcd
MOD = 10**9+7
N = int(input())
d = {}
zero = 0
for i in range(N):
a, b = map(int, input().split())
if a == 0 and b == 0:
zero += 1
continue
flip = 0
while not (a >= 0 and b > 0):
a, b = -b, a
flip ^= 1
g = gcd(a, b)
a //= g
b //= g
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 402,988 | 402,992 | u342869120 | python |
p02679 | from math import gcd
from collections import Counter
slope=Counter()
slope_zero=0
slope_inf=0
both_zero=0
n=int(input())
for _ in range(n):
a,b=map(int,input().split())
if a==0 and b==0:
both_zero=1
else:
if a==0:
slope_zero+=1
elif b==0:
slope_inf+=1
... | from math import gcd
from collections import Counter
slope=Counter()
slope_zero=0
slope_inf=0
both_zero=0
n=int(input())
for _ in range(n):
a,b=map(int,input().split())
if a==0 and b==0:
both_zero+=1
else:
if a==0:
slope_zero+=1
elif b==0:
slope_inf+=1
... | [
"assignment.value.change"
] | 403,002 | 403,003 | u964299793 | python |
p02679 | from collections import defaultdict
def gcd(x, y):
if y == 0:
return x
else:
return gcd(y, x % y)
def main():
MOD = 1000000007
N = int(input())
# Ai * Aj + Bi * Bj = 0
# -> Ai * Aj = -Bi * Bj
# -> (Ai/Bi) = -(Aj/Bj)
# のとき、そのイワシ同士は入れられない
# そこで、 Ci = Ai/Bi を約分したもの（かつ... | from collections import defaultdict
def gcd(x, y):
if y == 0:
return x
else:
return gcd(y, x % y)
def main():
MOD = 1000000007
N = int(input())
# Ai * Aj + Bi * Bj = 0
# -> Ai * Aj = -Bi * Bj
# -> (Ai/Bi) = -(Aj/Bj)
# のとき、そのイワシ同士は入れられない
# そこで、 Ci = Ai/Bi を約分したもの（かつ... | [
"expression.operation.unary.add"
] | 403,013 | 403,014 | u066413086 | python |
p02679 | import sys
sys.setrecursionlimit(700000)
def s_in():
return input()
def n_in():
return int(input())
def l_in():
return list(map(int, input().split()))
MOD = 1000000007
def mod_add(a, b):
return (a+b)%MOD
def mod_sub(a, b):
return (a+MOD-b)%MOD
def mod_mul(a, b):
return a*b%MOD
#互いに素なa,bについて、a*... | import sys
sys.setrecursionlimit(700000)
def s_in():
return input()
def n_in():
return int(input())
def l_in():
return list(map(int, input().split()))
MOD = 1000000007
def mod_add(a, b):
return (a+b)%MOD
def mod_sub(a, b):
return (a+MOD-b)%MOD
def mod_mul(a, b):
return a*b%MOD
#互いに素なa,bについて、a*... | [] | 403,021 | 403,022 | u291278680 | python |
p02679 | import sys
sys.setrecursionlimit(700000)
def s_in():
return input()
def n_in():
return int(input())
def l_in():
return list(map(int, input().split()))
MOD = 1000000007
def mod_add(a, b):
return (a+b)%MOD
def mod_sub(a, b):
return (a+MOD-b)%MOD
def mod_mul(a, b):
return a*b%MOD
#互いに素なa,bについて、a*... | import sys
sys.setrecursionlimit(700000)
def s_in():
return input()
def n_in():
return int(input())
def l_in():
return list(map(int, input().split()))
MOD = 1000000007
def mod_add(a, b):
return (a+b)%MOD
def mod_sub(a, b):
return (a+MOD-b)%MOD
def mod_mul(a, b):
return a*b%MOD
#互いに素なa,bについて、a*... | [
"call.remove",
"call.arguments.change"
] | 403,023 | 403,022 | u291278680 | python |
p02679 | from collections import defaultdict
from math import gcd
import sys
input = sys.stdin.readline
N=int(input())
mod=10**9+7
dic=defaultdict(lambda: [0,0])
c=0
d=0
e=0
for i in [0]*N:
A,B = map(int,input().split())
if A==0 and B==0:
e+=1
elif A==0:
c+=1
elif B==0:
d+=1
else:
g=gcd(A,B)
A//=g
B//g
if A*B... | from collections import defaultdict
from math import gcd
import sys
input = sys.stdin.readline
N=int(input())
mod=10**9+7
dic=defaultdict(lambda: [0,0])
c=0
d=0
e=0
for i in [0]*N:
A,B = map(int,input().split())
if A==0 and B==0:
e+=1
elif A==0:
c+=1
elif B==0:
d+=1
else:
g=gcd(A,B)
A//=g
B//=g
if A*... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 403,026 | 403,027 | u387774811 | python |
p02679 | from collections import defaultdict
from math import atan2, gcd
N = int(input())
MOD = 1000000007
d = defaultdict(lambda: [0, 0])
zero = 0
pos = []
neg = []
for _ in range(N):
a, b = map(int, input().split())
if a == 0 and b == 0:
zero += 1
continue
if a < 0:
a = -a
b = -b... | from collections import defaultdict
from math import atan2, gcd
N = int(input())
MOD = 1000000007
d = defaultdict(lambda: [0, 0])
zero = 0
pos = []
neg = []
for _ in range(N):
a, b = map(int, input().split())
if a == 0 and b == 0:
zero += 1
continue
if a < 0:
a = -a
b = -b... | [
"expression.operation.binary.remove",
"expression.operator.change"
] | 403,030 | 403,031 | u839188633 | python |
p02679 | import collections
import math
n = int(input())
m = 0
mod = 10 ** 9 + 7
c = []
d = []
frac = []
for _ in range(n):
a, b = map(int, input().split())
if a == 0 and b == 0:
n -= 1
m += 1
continue
if a == 0:
frac.append('0/1')
elif b == 0:
frac.append(('1/0'))
e... | import collections
import math
n = int(input())
m = 0
mod = 10 ** 9 + 7
c = []
d = []
frac = []
for _ in range(n):
a, b = map(int, input().split())
if a == 0 and b == 0:
n -= 1
m += 1
continue
if a == 0:
frac.append('0/1')
elif b == 0:
frac.append(('1/0'))
e... | [
"call.remove"
] | 403,050 | 403,051 | u157020659 | python |
p02679 | import sys
from collections import defaultdict
dic1 = defaultdict(int)
dic2 = defaultdict(int)
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
mod = 10**9+7
def pow(n,p,mod=10**9+7): #繰り返し二乗法(nのp乗)
res = 1
while p > 0:
if p % 2 == 0:
n = n ** 2 % mod
p... | import sys
from collections import defaultdict
dic1 = defaultdict(int)
dic2 = defaultdict(int)
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
mod = 10**9+7
def pow(n,p,mod=10**9+7): #繰り返し二乗法(nのp乗)
res = 1
while p > 0:
if p % 2 == 0:
n = n ** 2 % mod
p... | [
"assignment.variable.change",
"identifier.change"
] | 403,090 | 403,091 | u372144784 | python |
p02679 | import math
mod = 10**9 + 7
n = int(input())
d = {}
d0 = 0
for _ in range(n):
a, b = map(int, input().split())
g = math.gcd(a, b)
if g == 0:
d0 += 1
else:
a //= g
b //= g
if a < 0:
a = -a
b = -b
elif a == 0 and b < 0:
b = -b
... | import math
mod = 10**9 + 7
n = int(input())
d = {}
d0 = 0
for _ in range(n):
a, b = map(int, input().split())
g = math.gcd(a, b)
if g == 0:
d0 += 1
else:
a //= g
b //= g
if a < 0:
a = -a
b = -b
elif a == 0 and b < 0:
b = -b
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 403,110 | 403,111 | u425177436 | python |
p02679 | import math
mod = 10**9 + 7
n = int(input())
d = {}
d0 = 0
for _ in range(n):
a, b = map(int, input().split())
g = math.gcd(a, b)
if g == 0:
d0 += 1
else:
a //= g
b //= g
if a < 0:
a = -a
b = -b
elif a == 0 and b < 0:
b = -b
... | import math
mod = 10**9 + 7
n = int(input())
d = {}
d0 = 0
for _ in range(n):
a, b = map(int, input().split())
g = math.gcd(a, b)
if g == 0:
d0 += 1
else:
a //= g
b //= g
if a < 0:
a = -a
b = -b
elif a == 0 and b < 0:
b = -b
... | [
"call.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 403,112 | 403,111 | u425177436 | python |
p02679 | import math
mod = 10**9 + 7
n = int(input())
d = {}
d0 = 0
for _ in range(n):
a, b = map(int, input().split())
g = math.gcd(a, b)
if g == 0:
d0 += 1
else:
a //= g
b //= g
if a < 0:
a = -a
b = -b
elif a == 0 and b < 0:
b = -b
... | import math
mod = 10**9 + 7
n = int(input())
d = {}
d0 = 0
for _ in range(n):
a, b = map(int, input().split())
g = math.gcd(a, b)
if g == 0:
d0 += 1
else:
a //= g
b //= g
if a < 0:
a = -a
b = -b
elif a == 0 and b < 0:
b = -b
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"call.arguments.add"
] | 403,113 | 403,111 | u425177436 | python |
p02679 | import sys
sys.setrecursionlimit(100000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from math import gcd
def main():
N = int(input())
minus_iwashi = {}
iwashi = {}
a0 = 0
b0 = 0
a0b0 = 0
for _ in range(N):
a,b = map(int,input().split())
if a < 0... | import sys
sys.setrecursionlimit(100000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from math import gcd
def main():
N = int(input())
minus_iwashi = {}
iwashi = {}
a0 = 0
b0 = 0
a0b0 = 0
for _ in range(N):
a,b = map(int,input().split())
if a < 0... | [] | 403,147 | 403,148 | u561231954 | python |
p02679 | from collections import Counter
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
def solve():
MOD = 10**9 + 7
N = int(input())
ABs = [tuple(map(int, input().split())) for _ in range(N)]
def gcd(a, b):
while b:
a, b = b, a%b
return a
cntPos = Counter(... | from collections import Counter
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
def solve():
MOD = 10**9 + 7
N = int(input())
ABs = [tuple(map(int, input().split())) for _ in range(N)]
def gcd(a, b):
while b:
a, b = b, a%b
return a
cntPos = Counter(... | [
"expression.operation.binary.add"
] | 403,149 | 403,150 | u297574184 | python |
p02679 | def main():
from math import gcd
n = int(input())
ab = [list(map(int, input().split())) for _ in [0]*n]
adb = dict()
ans = 0
mod = 10**9+7
for a, b in ab:
if a == b == 0:
ans += 1
continue
if b != 0:
g = gcd(a, b)
a = a//g
... | def main():
from math import gcd
n = int(input())
ab = [list(map(int, input().split())) for _ in [0]*n]
adb = dict()
ans = 0
mod = 10**9+7
for a, b in ab:
if a == b == 0:
ans += 1
continue
if b != 0:
g = gcd(a, b)
a = a//g
... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 403,156 | 403,157 | u532966492 | python |
p02679 | from collections import Counter
import sys
input = sys.stdin.readline
N = int(input())
AB = [[int(i) for i in input().split()] for _ in range(N)]
mod = 10 ** 9 + 7
def gcd(a, b) :
if b > a :
a, b = b, a
while b != 0 :
a, b = b, a % b
return a
p = []
both = 0
zeroa = 0
zerob = 0
for a, b in AB :
... | from collections import Counter
import sys
input = sys.stdin.readline
N = int(input())
AB = [[int(i) for i in input().split()] for _ in range(N)]
mod = 10 ** 9 + 7
def gcd(a, b) :
if b > a :
a, b = b, a
while b != 0 :
a, b = b, a % b
return a
p = []
both = 0
zeroa = 0
zerob = 0
for a, b in AB :
... | [] | 403,189 | 403,190 | u511965386 | python |
p02679 | from collections import Counter
import sys
input = sys.stdin.readline
N = int(input())
AB = [[int(i) for i in input().split()] for _ in range(N)]
mod = 10 ** 9 + 7
def gcd(a, b) :
if b > a :
a, b = b, a
while b != 0 :
a, b = b, a % b
return a
p = []
both = 0
zeroa = 0
zerob = 0
for a, b in AB :
... | from collections import Counter
import sys
input = sys.stdin.readline
N = int(input())
AB = [[int(i) for i in input().split()] for _ in range(N)]
mod = 10 ** 9 + 7
def gcd(a, b) :
if b > a :
a, b = b, a
while b != 0 :
a, b = b, a % b
return a
p = []
both = 0
zeroa = 0
zerob = 0
for a, b in AB :
... | [
"expression.operator.change",
"expression.operation.binary.remove"
] | 403,191 | 403,190 | u511965386 | python |
p02681 | n = input()
s = input()
if n == s[-1] and len(n) == len(s)-1:
print('Yes')
else :
print('No') | n = input()
s = input()
if n == s[:-1] and len(n) == len(s)-1:
print('Yes')
else :
print('No') | [
"control_flow.branch.if.condition.change"
] | 403,237 | 403,238 | u945065638 | python |
p02681 | A = input()
B = input()
B= B.rstrip(B[-1])
if A == B:
print('Yes')
else:
print('No') | A = input()
B = input()
B = B[0:len(B)-1]
if A == B:
print('Yes')
else:
print('No') | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 403,245 | 403,246 | u048826171 | python |
p02681 | S = input()
T = input()
result = False
if all([s >= 'a' and s <= 'z' for s in S]):
if all([t >= 'a' and t <= 'z' for t in T]):
if len(S) >= 1 and len(S) <= 10:
if len(T) == len(S) + 1:
result = S.startswith(T)
if result:
print('Yes')
else:
print('No') | S = input()
T = input()
result = False
if all([s >= 'a' and s <= 'z' for s in S]):
if all([t >= 'a' and t <= 'z' for t in T]):
if len(S) >= 1 and len(S) <= 10:
if len(T) == len(S) + 1:
result = T.startswith(S)
if result:
print('Yes')
else:
print('No') | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 403,247 | 403,248 | u921156673 | python |
p02681 | S = input()
T = input()
result = False
if all([s >= 'a' and s <= 'z' for s in S]):
if all([t >= 'a' and t <= 'z' for t in T]):
if len(S) >= 1 and len(S) <= 10:
if len(T) == len(S) + 1:
result = True
if result:
print('Yes')
else:
print('No') | S = input()
T = input()
result = False
if all([s >= 'a' and s <= 'z' for s in S]):
if all([t >= 'a' and t <= 'z' for t in T]):
if len(S) >= 1 and len(S) <= 10:
if len(T) == len(S) + 1:
result = T.startswith(S)
if result:
print('Yes')
else:
print('No') | [
"assignment.value.change",
"call.add"
] | 403,249 | 403,248 | u921156673 | python |
p02681 | S=str(input())
B=str(input())
if S[:-1:]==B:
print('Yes')
else:
print('No') | S=str(input())
B=str(input())
if B[:-1:]==S:
print('Yes')
else:
print('No') | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 403,256 | 403,257 | u519922200 | python |
p02681 | S = input()
T = input()
if T.startwith('S'):
print("Yes")
else:
print("No")
| S = input()
T = input()
if T.startswith(S):
print("Yes")
else:
print("No")
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 403,267 | 403,268 | u740157634 | python |
p02681 | s = input()
t = input()
for i in range(len(s)):
if s[i] != t[i]:
print("No")
print("Yes") | s = input()
t = input()
for i in range(len(s)):
if s[i] != t[i]:
print("No")
exit()
print("Yes") | [
"call.add"
] | 403,277 | 403,278 | u053856575 | python |
p02681 | bef = str(input())
aft = str(input())
print(("No","Yes")[len(aft[0:len(bef)].strip(bef) + aft[len(bef):]) == 1]) | bef = str(input())
aft = str(input())
print(("No","Yes")[len(aft[0:len(bef)].replace(bef,"") + aft[len(bef):]) == 1]) | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"call.arguments.add"
] | 403,279 | 403,280 | u773686010 | python |
p02681 | S = input()
T = input()
if S == T[:-2]:
print("Yes")
else:
print("No")
| S = input()
T = input()
if S == T[:-1]:
print("Yes")
else:
print("No")
| [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 403,284 | 403,285 | u244466744 | python |
p02681 | s,t = input().split()
o = t[:-1]
if ( o == s ):
print('Yes')
else:
print('No') | s = input()
t = input()
o = t[:-1]
if ( o == s ):
print('Yes')
else:
print('No') | [
"call.add",
"call.remove"
] | 403,291 | 403,292 | u768219634 | python |
p02681 | a=input()
b=input()
c=0
if (len(a)+1)!=len(b):
print("No")
else:
for i in range(len(b)):
if a[i]==b[i]:
c=c+1
if c==len(a):
print("Yes")
else:
print("No") | a=input()
b=input()
c=0
if (len(a)+1)!=len(b):
print("No")
else:
for i in range(len(a)):
if a[i]==b[i]:
c=c+1
if c==len(a):
print("Yes")
else:
print("No") | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 403,299 | 403,300 | u244836567 | python |
p02681 | s = input()
t = input()
ans = "Yes"
for i in range(len(s) - 1):
if s[i] == t[i]:
continue
else:
ans = "No"
if ans == "Yes" and (len(s)+1) == len(t):
ans = "Yes"
else:
ans = "No"
print(ans) | s = input()
t = input()
ans = "Yes"
for i in range(len(s)):
if s[i] == t[i]:
continue
else:
ans = "No"
if ans == "Yes" and (len(s)+1) == len(t):
ans = "Yes"
else:
ans = "No"
print(ans) | [
"expression.operation.binary.remove"
] | 403,305 | 403,306 | u808572836 | python |
p02681 | S=input()
T=input()
S=list(S)
T=list(T)
b=0
for i in range(0,len(S)):
if S[i]==T[i]:
b+=1
if len(T)==len(S)+1 and b!=0:
print("Yes")
else:
print("No") | S=input()
T=input()
S=list(S)
T=list(T)
b=0
for i in range(0,len(S)):
if not S[i]==T[i]:
b+=1
if len(T)==len(S)+1 and b==0:
print("Yes")
else:
print("No") | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 403,311 | 403,312 | u582803594 | python |
p02681 | s = input()
t = input()
flag = True
for i in range(s):
if s[i] is not t[i]:
flag = False
if flag is True:
print("Yes")
else:
print("No")
| s = input()
t = input()
flag = True
for i in range(len(s)):
if s[i] is not t[i]:
flag = False
if flag is True:
print("Yes")
else:
print("No") | [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 403,313 | 403,314 | u298976461 | python |
p02681 | s = input()
t = input()
if t.startswich(s):
print('Yes')
else:
print('No')
| s = input()
t = input()
if t.startswith(s):
print('Yes')
else:
print('No') | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 403,317 | 403,318 | u249987458 | python |
p02681 | a = input()
b = input()
b.pop()
if a == b[:-1]:
print('Yes')
else:
print('No')
| a = input()
b = input()
if a == b[:-1]:
print('Yes')
else:
print('No') | [
"call.remove"
] | 403,331 | 403,332 | u726823037 | python |
p02681 | s = input()
t = input()
if s == t[:-2]:
print('Yes')
else:
print('No')
| s = input()
t = input()
if s == t[:-1]:
print('Yes')
else:
print('No')
| [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 403,333 | 403,334 | u571190119 | python |
p02681 |
def main():
s = input()
t = input()
t_ = s[:len(t)]
if s == t_:
print('Yes')
else:
print('No')
if __name__ == "__main__":
main()
|
def main():
s = input()
t = input()
t_ = t[:len(t)-1]
if s == t_:
print('Yes')
else:
print('No')
if __name__ == "__main__":
main()
| [
"assignment.value.change",
"identifier.change"
] | 403,335 | 403,336 | u274615057 | python |
p02681 | s = str(input())
T = str(input())
t_before = ''
for i in range(len(s)):
t_before += t[i]
if s == t_before:
print('Yes')
else:
print('No') | s = str(input())
t = str(input())
t_before = ''
for i in range(len(s)):
t_before += t[i]
if s == t_before:
print('Yes')
else:
print('No') | [
"assignment.variable.change",
"identifier.change"
] | 403,337 | 403,338 | u672316981 | python |
p02681 | S=list(input())
T=list(input())
T.pop(len(T)-1)
print(S,T)
if S == T:
print("Yes")
else:
print("No") | S=list(input())
T=list(input())
T.pop(len(T)-1)
if S == T:
print("Yes")
else:
print("No") | [
"call.remove"
] | 403,345 | 403,346 | u906769651 | python |
p02681 | S=list(input())
T=list(input())
T=T.pop(len(T)-1)
if S == T:
print("Yes")
else:
print("No") | S=list(input())
T=list(input())
T.pop(len(T)-1)
if S == T:
print("Yes")
else:
print("No") | [
"assignment.remove"
] | 403,347 | 403,346 | u906769651 | python |
p02681 | S = input()
T = input()
if T[0:len(T)] == S:
print("Yes")
else:
print("No") | S = input()
T = input()
judge = T[0:len(S)]
if judge == S:
print("Yes")
else:
print("No") | [
"assignment.variable.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 403,350 | 403,351 | u556589653 | python |
p02681 | S = input()
T = input()
if T[0:len(T)] == S:
print("Yes")
else:
print("No") | S = input()
T = input()
if T[0:len(S)] == S:
print("Yes")
else:
print("No") | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 403,350 | 403,352 | u556589653 | python |
p02681 | s=input()
t=input()
t=t[:-2]
if s == t:
print('Yes')
else:
print('No') | s=input()
t=input()
t=t[:-1]
if s == t:
print('Yes')
else:
print('No') | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 403,360 | 403,361 | u087118202 | python |
p02681 | s=input()
print("Yes"if input()[:-1]else"No") | s=input()
print("Yes"if s==input()[:-1]else"No") | [] | 403,362 | 403,363 | u619819312 | python |
p02681 | s=input()
print("Yes"if input()[::-1]else"No") | s=input()
print("Yes"if s==input()[:-1]else"No") | [
"call.arguments.change"
] | 403,364 | 403,363 | u619819312 | python |
p02681 | a=input()
b=input()
if a==b[:-1]:
print("yes")
else:
print("No") | a=input()
b=input()
if a==b[:-1]:
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 403,369 | 403,370 | u384744829 | python |
p02681 | a = [input() for i in range(2)]
s = a[0]
t = s[1]
if s == t[:-1]:
print('Yes')
else:
print('No') | a = [input() for i in range(2)]
s = a[0]
t = a[1]
if s == t[:-1]:
print('Yes')
else:
print('No') | [
"assignment.value.change",
"identifier.change"
] | 403,380 | 403,381 | u863371419 | python |
p02681 | S=input()
T=input()
num=0
for i in range(len(S)):
if S[i]==T[i]:
num+=1
else:
print("No")
if num==len(S):
print("Yes")
| S=input()
T=input()
num=0
for i in range(len(S)):
if S[i]==T[i]:
num+=1
else:
print("No")
exit()
if num==len(S):
print("Yes")
| [
"call.add"
] | 403,401 | 403,402 | u438189153 | python |
p02681 | s=input()
t=input()
u=t[0:len(s)]
if s==u:
print("OK")
else:
print("NO")
| s=input()
t=input()
u=t[0:len(s)]
if s==u:
print("Yes")
else:
print("No")
| [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"literal.string.case.change"
] | 403,426 | 403,427 | u803684095 | python |
p02681 | def main():
s = input()
t = input()
if s == t[0:len(t) - 1]:
print('Yes')
else:
print('No')
main | def main():
s = input()
t = input()
if s == t[0:len(t) - 1]:
print('Yes')
else:
print('No')
main() | [
"call.add"
] | 403,428 | 403,429 | u962609087 | python |
p02681 | S=input()
T=input()
if T.find(S)==0:
print("yes")
else:
print("no")
| S=input()
T=input()
if T.find(S)==0:
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 403,432 | 403,433 | u882514852 | python |
p02681 | S=input()
T=input()
ls = []
flg = False
for i in range(26):
#print(S+chr(ord("a")+i))
#print(type(T),type(S+chr(ord("a")+i)))
if T == S+chr(ord("a")+i):
flg = True
print("Yes")
break
else:
continue
if flg == True:
print("Yes")
else:
print("No")
| S=input()
T=input()
ls = []
flg = False
for i in range(26):
#print(S+chr(ord("a")+i))
#print(type(T),type(S+chr(ord("a")+i)))
if T == S+chr(ord("a")+i):
flg = True
#print("Yes")
break
else:
continue
if flg == True:
print("Yes")
else:
print("No")
| [
"call.remove"
] | 403,439 | 403,440 | u455354923 | python |
p02681 | S,T=[input() for i in range(2)]
U=list(S)
W=list(T)
if S in T and len(S)+1==len(T) and U[1]==W[1]:
print("Yes")
else:
print("No") | S,T=[input() for i in range(2)]
U=list(S)
W=list(T)
if S in T and len(S)+1==len(T) and U[0]==W[0]:
print("Yes")
else:
print("No") | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 403,441 | 403,442 | u502594696 | python |
p02681 | S = input()
T = input()
ans = 'Yes'
if len(S) + 1 == len(T):
for i in range(len(S)):
if S[i] != T[i]:
ans = 'No'
else:
ans = 'No' | S = input()
T = input()
ans = 'Yes'
if len(S) + 1 == len(T):
for i in range(len(S)):
if S[i] != T[i]:
ans = 'No'
else:
ans = 'No'
print(ans) | [
"call.add"
] | 403,447 | 403,448 | u967484343 | python |
p02681 | S = input()
T = input()
if S == T[:len(S)+1]:
print("Yes")
else:
print("No") | S = input()
T = input()
if S == T[:len(S)]:
print("Yes")
else:
print("No")
| [
"expression.operation.binary.remove"
] | 403,453 | 403,454 | u047931063 | python |
p02681 | S = input()
T = input()
if S == T[:len(S)-1]:
print("Yes")
else:
print("No") | S = input()
T = input()
if S == T[:len(S)]:
print("Yes")
else:
print("No")
| [
"expression.operation.binary.remove"
] | 403,455 | 403,454 | u047931063 | python |
p02681 | s,t = input().split()
if s == t[:-1]:
print('Yes')
else:
print('No') | s = input()
t = input()
if s == t[:-1]:
print('Yes')
else:
print('No')
| [
"call.add",
"call.remove"
] | 403,458 | 403,459 | u642528832 | python |
p02681 | s = input()
t = input()
t_2 = []
for i in range(len(t) - 1):
t_2.append(t[i])
line = "".join(t_2)
if line == s:
print("Yes")
else:
print("No")
print (line) | s = input()
t = input()
t_2 = []
for i in range(len(t) - 1):
t_2.append(t[i])
line = "".join(t_2)
if line == s:
print("Yes")
else:
print("No") | [
"call.remove"
] | 403,468 | 403,469 | u790476785 | python |
p02681 | def c167(x):
if x[1][:-1] == x[0]: return "yes"
else: return "no"
if __name__=="__main__":
input1 = input()
input2 = input()
input3 = [input1,input2]
print(c167(input3)) | def c167(x):
if x[1][:-1] == x[0]: return "Yes"
else: return "No"
if __name__=="__main__":
input1 = input()
input2 = input()
input3 = [input1,input2]
print(c167(input3))
| [
"literal.string.change",
"literal.string.case.change",
"function.return_value.change"
] | 403,470 | 403,471 | u204358360 | python |
p02681 | S = input()
T = input()
if(S==T[0:len(S)]):
print(Yes)
else:
print(No)
| S = input()
T = input()
if(S==T[0:len(S)]):
print('Yes')
else:
print('No')
| [
"call.arguments.change"
] | 403,472 | 403,473 | u962765087 | python |
p02681 | S = ipnut()
T = input()
if(S==T[:len(S)-1]):
print("Yes")
else:
print("No") | S = input()
T = input()
if(S==T[:len(S)]):
print("Yes")
else:
print("No") | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.remove"
] | 403,475 | 403,476 | u432356156 | python |
p02681 | S = ipnut()
T = input()
if(S==T[:len(S)]):
print("Yes")
else:
print("No") | S = input()
T = input()
if(S==T[:len(S)]):
print("Yes")
else:
print("No") | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 403,477 | 403,476 | u432356156 | python |
p02681 | S = ipnut()
T = input()
if(S==T[:-1]):
print("Yes")
else:
print("No") | S = input()
T = input()
if(S==T[:len(S)]):
print("Yes")
else:
print("No") | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"call.arguments.add"
] | 403,478 | 403,476 | u432356156 | python |
p02681 | S, T = input().split()
if S == T[:len(S)]:
print("Yes")
else:
print("No") | S = input()
T = input()
if S == T[:len(S)]:
print("Yes")
else:
print("No") | [
"call.add",
"call.remove"
] | 403,494 | 403,495 | u699008198 | python |
p02681 | s=str(input())
t=str(input())
num=0
if s == t[:-1]:
print("yes")
else:
print("no") | s=str(input())
t=str(input())
if s == t[:-1]:
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 403,504 | 403,505 | u026643077 | python |
p02681 | print('YNeos'[input()>input()[:-1]::2]) | print('YNeos'[input()!=input()[:-1]::2]) | [
"expression.operator.compare.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 403,514 | 403,515 | u729133443 | python |
p02681 | id_s = input()
id_t = input()
if(id_s == id_t[:-1]):
print("yes")
else:
print("no")
| id_s = input()
id_t = input()
if(id_s == id_t[:-1]):
print("Yes")
else:
print("No")
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 403,519 | 403,520 | u559048291 | python |
p02681 | # -*- coding: utf-8 -*-
s = str(input())
t = str(input())
if s == t[0:-2]:
print('Yes')
else:
print('No') | # -*- coding: utf-8 -*-
s = str(input())
t = str(input())
if s == t[0:-1]:
print('Yes')
else:
print('No') | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 403,521 | 403,522 | u618369407 | python |
p02681 | n = str(input())
t = str(input())
N = list(n)
T = list(t)
del N[-1]
if N == T:
print("Yes")
else:
print("No") | n = str(input())
t = str(input())
N = list(n)
T = list(t)
del T[-1]
if N == T:
print("Yes")
else:
print("No") | [
"identifier.change"
] | 403,541 | 403,542 | u133240057 | python |
p02681 | s=input()
t=input()
n=len(s)
for i in range(n-1):
if s[i]==t[i]:
continue
else:
print('No')
exit()
print('Yes')
| s=input()
t=input()
n=len(s)
for i in range(n):
if s[i]==t[i]:
continue
else:
print('No')
exit()
print('Yes')
| [
"expression.operation.binary.remove"
] | 403,549 | 403,550 | u523385176 | python |
p02681 | s,t = input()
if t[:-1]==s:
print("Yes")
else:
print("No")
| s= input()
t = input()
if t[:-1]==s:
print("Yes")
else:
print("No")
| [
"call.add"
] | 403,560 | 403,561 | u040642458 | python |
p02681 | S = input()
T = input()
if S == T[0:len(S)] and len(T) == len(S) + 1:
print("yes")
else:
print("No") | S = input()
T = input()
if S == T[0:len(S)] and len(T) == len(S) + 1:
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 403,563 | 403,564 | u514960601 | python |
p02681 | s = input()
t = input()
for i in range(len(s)):
if s[i] != t[i]:
print("No")
exit()
print("yes") | s = input()
t = input()
for i in range(len(s)):
if s[i] != t[i]:
print("No")
exit()
print("Yes")
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 403,570 | 403,571 | u363599046 | python |
p02681 | S = str(input())
T = str(input())
if S == T[:len(T)-2]:
print('Yes')
else:
print('No') | S = str(input())
T = str(input())
if S == T[:len(T)-1]:
print('Yes')
else:
print('No') | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 403,579 | 403,580 | u720124072 | python |
p02681 | S = list(input())
T = list(input())
t = []
s = len(S)
for i in range(s):
t += T[i]
if t == S:
print("yes")
else:
print("No") | S = list(input())
T = list(input())
t = []
s = len(S)
for i in range(s):
t += T[i]
if t == S:
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 403,585 | 403,586 | u509029769 | python |
p02681 | S = input()
T = input()
if len(S)>=1 and len(S)<=10:
if T == S[:-1] and len(T) == len(S)+1:
print('Yes')
exit()
print('No') | S = input()
T = input()
if len(S)>=1 and len(S)<=10:
if T[:-1] == S and len(T) == len(S)+1:
print('Yes')
exit()
print('No') | [
"control_flow.branch.if.condition.change"
] | 403,587 | 403,588 | u439063038 | python |
p02681 | S=input()
T=input()
newT=T[len(T)-1]
S=S+newT
if S==T:
print('yes')
else:
print('no')
| S=input()
T=input()
newT=T[len(T)-1]
S=S+newT
if S==T:
print('Yes')
else:
print('No')
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 403,596 | 403,597 | u815763296 | python |
p02681 | x = input()
y = input()
if x == y[:-1]:
print("yes")
else:
print("no") | x = input()
y = input()
if x == y[:-1]:
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 403,600 | 403,601 | u898634672 | python |
p02681 | x = input()
y = input()
if x == y[:-1]:
print("yes")
else:
print("no") | x = input()
y = input()
if x == y[:-1]:
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 403,602 | 403,601 | u898634672 | python |
p02681 | a = input()
e = input()
b = len(a)
f = 0
for i in range(b) :
c = a[i]
d = e[i]
if not c == d :
if not f == 0 :
print("No")
f = 1
if f == 0 :
print("Yes") | a = input()
e = input()
b = len(a)
f = 0
for i in range(b) :
c = a[i]
d = e[i]
if not c == d :
if f == 0 :
print("No")
f = 1
if f == 0 :
print("Yes") | [
"control_flow.branch.if.condition.change"
] | 403,611 | 403,612 | u426205961 | python |
p02681 | a = input()
e = input()
b = len(a)
f = 0
for i in range(b) :
c = a[i]
d = e[i]
if not c == d :
print("No")
f = 1
if f == 0 :
print("Yes") | a = input()
e = input()
b = len(a)
f = 0
for i in range(b) :
c = a[i]
d = e[i]
if not c == d :
if f == 0 :
print("No")
f = 1
if f == 0 :
print("Yes") | [
"control_flow.branch.if.add"
] | 403,613 | 403,612 | u426205961 | python |
p02681 | #
from collections import Counter
k = input()
p = input()
p = p[0:len(p)-1]
print(p)
if k==p:
print('Yes')
else:
print('No') | #
from collections import Counter
k = input()
p = input()
p = p[0:len(p)-1]
if k==p:
print('Yes')
else:
print('No') | [
"call.remove"
] | 403,614 | 403,615 | u232733545 | python |
p02681 | S = input()
T = input()
T1 = T[:-1]
if S == T:
print("Yes")
else:
print("No") | S = input()
T = input()
T1 = T[:-1]
if S == T1:
print("Yes")
else:
print("No") | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 403,616 | 403,617 | u364541509 | python |
p02681 | #!/usr/bin/env python
"""AtCoder Beginner Contest 167: A -
https://atcoder.jp/contests/abc167/tasks/abc167_a
"""
__author__ = 'bugttle <bugttle@gmail.com>'
def main():
S = input()
T = input()
if S == T[0:-1]:
print('YES')
else:
print('NO')
if __name__ == '__main__':
main()
| #!/usr/bin/env python
"""AtCoder Beginner Contest 167: A -
https://atcoder.jp/contests/abc167/tasks/abc167_a
"""
__author__ = 'bugttle <bugttle@gmail.com>'
def main():
S = input()
T = input()
if S == T[0:-1]:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 403,629 | 403,630 | u587518324 | python |
p02681 | s = input()
t = input()
x = len(s)
if s[x - 1] == t:
print('Yes')
else:
print('No') | s = input()
t = input()
x = len(s)
if t[0:x] == s:
print('Yes')
else:
print('No') | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 403,631 | 403,632 | u200228637 | python |
p02681 | S = input()
T = input()
if T[:len(S)-1] == S:
print("Yes")
else:
print("No") | S = input()
T = input()
if T[:len(S)] == S:
print("Yes")
else:
print("No") | [
"expression.operation.binary.remove"
] | 403,639 | 403,640 | u580920947 | python |
p02681 | S = input()
T = input()
if S == T[:-1] and len(S)==len(T)+1:
print('Yes')
else:
print('No')
| S = input()
T = input()
if S == T[:-1] and (len(S)+1)==len(T):
print('Yes')
else:
print('No')
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 403,645 | 403,646 | u377834804 | python |
p02681 | S=input()
T=input()
if T.startswith(S):
if len(T)==len(S)+1:
print('YES')
else:
print('NO') | S=input()
T=input()
if T.startswith(S):
if len(T)==len(S)+1:
print('Yes')
else:
print('No') | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 403,656 | 403,657 | u052838115 | python |
p02681 | S, T = input().split()
if S == T[0:-1]:
print('Yes')
else:
print('No') | S = input()
T = input()
if S == T[0:-1]:
print('Yes')
else:
print('No') | [
"call.add",
"call.remove"
] | 403,662 | 403,663 | u106095117 | python |
p02681 | S = input()
T = input()
if S == T[:len(T)-1]:
print("YES")
else:
print("NO") | S = input()
T = input()
if S == T[:len(T)-1]:
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 403,664 | 403,665 | u010566167 | python |
p02681 | S = list(input())
T = list(input())
if S == T[0:-1]:
print('Yes')
else:
print('no') | S = list(input())
T = list(input())
if S == T[0:-1]:
print('Yes')
else:
print('No') | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 403,674 | 403,675 | u399973890 | python |
p02681 | s,t = input().split()
t = t[:-1]
if s == t:
print('Yes')
else:
print('No1')
| s = input()
t = input()
t = t[:-1]
if s == t:
print('Yes')
else:
print('No')
| [
"call.add",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 403,676 | 403,677 | u751485759 | python |
p02681 | S=input()
T=input()
print("Yes" if S+T[-1]==T else "NG")
| S=input()
T=input()
print("Yes" if S+T[-1]==T else "No")
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 403,682 | 403,683 | u199356004 | python |
p02681 | s = input()
t = input()
if s in t and len(t) == len(s) + 1 and s[0] != t[0]:
print('Yes')
else:
print('No')
| s = input()
t = input()
if s in t and len(t) == len(s) + 1 and s[0] == t[0]:
print('Yes')
else:
print('No')
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 403,690 | 403,691 | u166560497 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.