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 |
|---|---|---|---|---|---|---|---|
p02681 | S=input()
T=input()
S = S[0:-1]
if S == T:
print("Yes")
else:
print("No") | S=input()
T=input()
T = T[0:-1]
if S == T:
print("Yes")
else:
print("No")
| [
"assignment.variable.change",
"identifier.change",
"assignment.value.change"
] | 404,285 | 404,286 | u069273180 | python |
p02681 | print(True if(input()==input()[:-1]) else False) | print("Yes" if(input()==input()[:-1]) else "No") | [
"call.arguments.change",
"io.output.change"
] | 404,289 | 404,290 | u669696235 | python |
p02681 | s = input()
t = input()
if len(t) == len(s)+1 and t[0:len(s)-1] == s:
print("Yes")
else:
print("No") | s = input()
t = input()
if len(t) == len(s)+1 and t[0:len(s)] == s:
print("Yes")
else:
print("No") | [
"expression.operation.binary.remove"
] | 404,326 | 404,327 | u233841219 | python |
p02681 | s = input()
t = input()
if len(t)+1 == len(s) and t[0:len(s)-1] == s:
print("Yes")
else:
print("No") | s = input()
t = input()
if len(t) == len(s)+1 and t[0:len(s)] == s:
print("Yes")
else:
print("No") | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 404,328 | 404,327 | u233841219 | python |
p02681 | S = list(input())
T = list(input())
for i in range(len(s)):
if T[i] != S[i]:
print('No')
exit(0)
print('Yes') | S = list(input())
T = list(input())
for i in range(len(S)):
if T[i] != S[i]:
print('No')
exit(0)
print('Yes') | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 404,338 | 404,339 | u876536031 | python |
p02681 | #python 3.7.1
a=str(input())
b=str(input())
if a==b[:-1]:
print("YES")
else:
print("NO")
| #python 3.7.1
a=str(input())
b=str(input())
if a==b[:-1]:
print("Yes")
else:
print("No")
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 404,340 | 404,341 | u859072377 | python |
p02681 | S = input()
T = input()
print("YES" if T[:-1] == S else "NO") | S = input()
T = input()
print("Yes" if T[:-1] == S else "No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 404,352 | 404,353 | u670397449 | python |
p02681 | s=input()
t=input()
if s==t.remove(t[len(t)-1]):
print('Yes')
else:
print('No')
| s=input()
t=input()
if s==t[:len(t)-1]:
print('Yes')
else:
print('No')
| [
"call.remove",
"control_flow.branch.if.condition.change"
] | 404,380 | 404,381 | u414050834 | python |
p02681 | s=input()
t=input()
if s==t-t[len(t)-1]:
print('Yes')
else:
print('No')
| s=input()
t=input()
if s==t[:len(t)-1]:
print('Yes')
else:
print('No')
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 404,382 | 404,381 | u414050834 | python |
p02681 | s=input()
t=input()
if s==t-s[len(s)]:
print('Yes')
else:
print('No') | s=input()
t=input()
if s==t[:len(t)-1]:
print('Yes')
else:
print('No')
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 404,383 | 404,381 | u414050834 | python |
p02681 | s = input()
t = input()
def main():
if len(s) < 1 and len(s) > 10:
print('No')
return
if (s.isalpha() == False or s.islower() == False):
print('No')
return
if (t[-1].isalpha() == False or t[-1].islower() == False):
print('No')
return
if len(t) == len(s... | s = input()
t = input()
def main():
if len(s) < 1 and len(s) > 10:
print('No')
return
if (s.isalpha() == False or s.islower() == False):
print('No')
return
if (t[-1].isalpha() == False or t[-1].islower() == False):
print('No')
return
if len(t) == len(s... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 404,394 | 404,395 | u084865106 | python |
p02681 | S = input()
T = input()
if len(S) + 1 == len(T) and S == T[:-1] and 1 <= len(S) <= 10 and T.islower() == True and S.islower() == True:
print("Yes")
else:
print("NO") | S = input()
T = input()
if len(S) + 1 == len(T) and S == T[:-1] and 1 <= len(S) <= 10 and T.islower() == True and S.islower() == True:
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 404,398 | 404,399 | u231518782 | python |
p02681 | import sys
S = input()
T = input()
if S == T[:-1]:
print("Yes")
else:
print("NO") | import sys
S = input()
T = input()
if S == T[:-1]:
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 404,400 | 404,401 | u231518782 | python |
p02681 | S=input()
T=input()
if S==T[:len(T)]:
print("Yes")
else:
print('No') | S=input()
T=input()
if S==T[:-1]:
print("Yes")
else:
print('No') | [
"call.arguments.change"
] | 404,406 | 404,407 | u201986772 | 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"
] | 404,408 | 404,407 | u201986772 | 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") | [
"control_flow.branch.if.condition.change"
] | 404,414 | 404,415 | u984081384 | python |
p02681 | s = input()
t = input()
if len(s) + 1 != t:
print("No")
exit
elif s != t[:len(s)]:
print("No")
exit
else:
print("Yes") | s = input()
t = input()
if len(s) + 1 != len(t):
print("No")
elif s != t[:len(s)]:
print("No")
else:
print("Yes") | [
"control_flow.branch.if.condition.change",
"call.add"
] | 404,422 | 404,423 | u994400382 | python |
p02681 | a = raw_input()
b = raw_input()
a = str(a)
b = str(b)
length = len(a)
if a == b[0:length]:
print("Yes")
else:
print("No")
| a = input()
b = input()
a = str(a)
b = str(b)
length = len(a)
if a == b[0:length]:
print("Yes")
else:
print("No")
| [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 404,446 | 404,445 | u984592063 | python |
p02681 | S = input()
T = input()
if T[0:len(S)] == S and len(S) + 1 == len(T):
print('Yes')
print('No') | S = input()
T = input()
if T[0:len(S)] == S and len(S) + 1 == len(T):
print('Yes')
else:
print('No') | [] | 404,447 | 404,448 | u334533374 | python |
p02681 | s = input()
t = input()
print('YES' if t.startswith(s) and len(t) - len(s) == 1 else 'NO') | s = input()
t = input()
print('Yes' if t.startswith(s) and len(t) - len(s) == 1 else 'No') | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 404,449 | 404,450 | u239889104 | python |
p02681 | import io, sys, atexit, os
import math as ma
from sys import exit
from decimal import Decimal as dec
from itertools import permutations
from itertools import combinations
def li():
return list(map(int, sys.stdin.readline().split()))
def num():
return map(int, sys.stdin.readline().split())
def nu():
re... | import io, sys, atexit, os
import math as ma
from sys import exit
from decimal import Decimal as dec
from itertools import permutations
from itertools import combinations
def li():
return list(map(int, sys.stdin.readline().split()))
def num():
return map(int, sys.stdin.readline().split())
def nu():
re... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 404,478 | 404,479 | u883574098 | python |
p02681 | a,b=open(0);print("YNeos"[a[:-2]!=b[:-2]::2]) | a,b=open(0);print("YNeos"[a[:-1]!=b[:-2]::2]) | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 404,523 | 404,524 | u789199225 | python |
p02681 | s = input()
t = input()
if s.startswith(t):
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"
] | 404,531 | 404,532 | u022345222 | python |
p02681 | s=input()
t=input()
n=len(s)
index=0
for i in range(n):
if(s[i] != t[i]):
print("no")
index=1
break
if(index==0):
print("yes")
| s=input()
t=input()
n=len(s)
index=0
for i in range(n):
if(s[i] != t[i]):
print("No")
index=1
break
if(index==0):
print("Yes")
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 404,535 | 404,536 | u602128502 | python |
p02681 | a=input()
b=input()
if a==b[:1]:
print("Yes")
else:
print("No")
| a=input()
b=input()
if a==b[:len(a)]:
print("Yes")
else:
print("No")
| [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"call.arguments.add"
] | 404,540 | 404,541 | u379136995 | python |
p02681 | s = list(input())
t = list(input())
n = int(len(t))
m = int(len(s))
if s == t[0:n-2] and n-1 == m:
print('Yes')
else:
print('No')
| s = list(input())
t = list(input())
n = int(len(t))
m = int(len(s))
if s == t[0:n-1] and n-1 == m:
print('Yes')
else:
print('No')
| [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 404,544 | 404,545 | u813405587 | python |
p02681 | S = input()
T = input()
ns = len(S)
U = T[:ns]
if T == U:
print("Yes")
else:
print("No")
| S = input()
T = input()
ns = len(S)
U = T[:ns]
if S == U:
print("Yes")
else:
print("No")
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 404,562 | 404,563 | u817692975 | python |
p02681 | S = input()
T = input()
ns = len(S)
U = str[:ns]
if T == U:
print("Yes")
else:
print("No")
| S = input()
T = input()
ns = len(S)
U = T[:ns]
if S == U:
print("Yes")
else:
print("No")
| [
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 404,564 | 404,563 | u817692975 | python |
p02681 | S = input()
T = input()
ns = len(S)
U = str[:S]
if T == U:
print("Yes")
else:
print("No") | S = input()
T = input()
ns = len(S)
U = T[:ns]
if S == U:
print("Yes")
else:
print("No")
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 404,565 | 404,563 | u817692975 | python |
p02679 | import math
def modpow(val, n, mod):
ret = 1
while n:
if n & 1:
ret = (ret * val) % mod
val = (val * val) % mod
n = n >> 1
return ret
n = int(input())
ab = []
for i in range(n):
a, b = map(int, input().split())
ab.append((a, b))
my_dict = dict()
ab_mod = []
... | import math
def modpow(val, n, mod):
ret = 1
while n:
if n & 1:
ret = (ret * val) % mod
val = (val * val) % mod
n = n >> 1
return ret
n = int(input())
ab = []
for i in range(n):
a, b = map(int, input().split())
ab.append((a, b))
my_dict = dict()
ab_mod = []
... | [
"call.arguments.change"
] | 404,590 | 404,591 | u550294762 | python |
p02679 | n = int(input())
abl = [map(int, input().split()) for _ in range(n)]
from collections import defaultdict
dic = defaultdict(int)
# a,bの最大公約数
def gcd(a, b):
while b:
a, b = b, a % b
return a
ab0 = 0
a0 = 0
b0 = 0
for a,b in abl:
if a == 0 and b == 0:
ab0 += 1
continue
elif a == 0:... | n = int(input())
abl = [map(int, input().split()) for _ in range(n)]
from collections import defaultdict
dic = defaultdict(int)
# a,bの最大公約数
def gcd(a, b):
while b:
a, b = b, a % b
return a
ab0 = 0
a0 = 0
b0 = 0
for a,b in abl:
if a == 0 and b == 0:
ab0 += 1
continue
elif a == 0:... | [
"call.add",
"call.arguments.add"
] | 404,606 | 404,607 | u683134447 | python |
p02679 | import sys
input = sys.stdin.readline
from collections import defaultdict
n = int(input())
a = [list(map(int,input().split())) for i in range(n)]
mod = 10**9+7
def p2(x):
return pow(2,x,mod)
dc = defaultdict(int)
st = set()
from math import gcd
n00 = 0
n0x = 0
nx0 = 0
nxy = 0
ls = []
for i in range(n):
if a[i][0] =... | import sys
input = sys.stdin.readline
from collections import defaultdict
n = int(input())
a = [list(map(int,input().split())) for i in range(n)]
mod = 10**9+7
def p2(x):
return pow(2,x,mod)
dc = defaultdict(int)
st = set()
from math import gcd
n00 = 0
n0x = 0
nx0 = 0
nxy = 0
ls = []
for i in range(n):
if a[i][0] =... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 404,626 | 404,627 | u905582793 | python |
p02679 | import sys
input=sys.stdin.readline
n=int(input())
INF=10**9+7
D={}
z=0
import math
for i in range(n):
a,b=map(int,input().split())
if a==0:
if b==0:
z+=1
else:
if (0,1) in D:
D[(0,1)]+=1
else:
D[(0,1)]=1
elif b==0:
... | import sys
input=sys.stdin.readline
n=int(input())
INF=10**9+7
D={}
z=0
import math
for i in range(n):
a,b=map(int,input().split())
if a==0:
if b==0:
z+=1
else:
if (0,1) in D:
D[(0,1)]+=1
else:
D[(0,1)]=1
elif b==0:
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 404,628 | 404,629 | u877470159 | python |
p02679 | #!/usr/bin/env python3
import sys
input = sys.stdin.readline
import math
MOD = 10**9 + 7
n = int(input())
fish = dict()
azero = 0
bzero = 0
abzero = 0
for _ in range(n):
a, b = map(int, input().split())
if a == 0 and b == 0:
abzero += 1
continue
if a == 0:
azero += 1
contin... | #!/usr/bin/env python3
import sys
input = sys.stdin.readline
import math
MOD = 10**9 + 7
n = int(input())
fish = dict()
azero = 0
bzero = 0
abzero = 0
for _ in range(n):
a, b = map(int, input().split())
if a == 0 and b == 0:
abzero += 1
continue
if a == 0:
azero += 1
contin... | [] | 404,630 | 404,631 | u052499405 | python |
p02679 | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(ro... | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(ro... | [
"identifier.replace.add",
"literal.replace.remove"
] | 404,651 | 404,652 | u353797797 | python |
p02680 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, acos, asin, at... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, acos, asin, at... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 404,721 | 404,722 | u499381410 | python |
p02680 | #写経
#https://atcoder.jp/contests/abc168/submissions/14421546
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
from bisect import bisect_left, bisect_right
INF = 10 **18
def resolve():
n,m = map(int,input().split())
a = [list(map(int,input().split())) for i in range(n)]
b = [list(map(int,i... | #写経
#https://atcoder.jp/contests/abc168/submissions/14421546
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
from bisect import bisect_left, bisect_right
INF = 10 **18
def resolve():
n, m = map(int, input().split())
a = [list(map(int, input().split())) for i in range(n)]
b = [list(map(in... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 404,723 | 404,724 | u994935583 | python |
p02680 | #写経
#https://atcoder.jp/contests/abc168/submissions/14421546
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
from bisect import bisect_left, bisect_right
INF = 10 **18
def resolve():
n,m = map(int,input().split())
a = [list(map(int,input().split())) for i in range(n)]
b = [list(map(int,... | #写経
#https://atcoder.jp/contests/abc168/submissions/14421546
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
from bisect import bisect_left, bisect_right
INF = 10 **18
def resolve():
n, m = map(int, input().split())
a = [list(map(int, input().split())) for i in range(n)]
b = [list(map(in... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 404,725 | 404,724 | u994935583 | python |
p02681 | s,t=input().split()
if(t[0:-1]==s):
print("Yes")
else:
print("No") | s=input()
t=input()
if(t[0:-1]==s):
print("Yes")
else:
print("No") | [
"call.add",
"call.remove"
] | 404,748 | 404,749 | u670580484 | python |
p02681 | def resolve():
S = input()
T = input()
if re.match(r'[a-z]{1,10}', S) and re.match(S + '.', T):
print('Yes')
return
print('No')
resolve() | import re
def resolve():
S = input()
T = input()
if re.match(r'[a-z]{1,10}', S) and re.match(S + '.', T):
print('Yes')
return
print('No')
resolve() | [] | 404,754 | 404,755 | u586662847 | python |
p02681 | s=input()
t=input()
pr=t[:len(t)-1]
if pr==s:
print("YES")
else:
print("NO") | s=input()
t=input()
pr=t[:len(t)-1]
if pr==s:
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 404,756 | 404,757 | u858929490 | python |
p02681 | s = input()
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") | [
"control_flow.branch.if.condition.change",
"call.arguments.add"
] | 404,776 | 404,777 | u068142202 | python |
p02681 | s=input()
t=input()
l=len(s)
if len(s)+1 == len(t):
si=s+t[l]
else:
si=""
if si == t and len(si) == len(t):
print("yes")
else:
print("no") | s=input()
t=input()
l=len(s)
if len(s)+1 == len(t):
si=s+t[l]
else:
si=""
if si == t and len(si) == len(t):
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 404,805 | 404,806 | u772969943 | python |
p02681 | S=input()
T=input()
if(S[:-1]==T):
print("Yes")
else:
print("No") | S=input()
T=input()
if(S==T[:-1]):
print("Yes")
else:
print("No") | [
"control_flow.branch.if.condition.change"
] | 404,821 | 404,822 | u455133066 | python |
p02681 | #!/usr/bin/env python3
import sys
YES = "Yes" # type: str
NO = "No" # type: str
def solve(S: str, T: str):
if (S == T[:-1]):
print("YES")
return 0
print("NO")
return 1
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can ... | #!/usr/bin/env python3
import sys
YES = "Yes" # type: str
NO = "No" # type: str
def solve(S: str, T: str):
if (S == T[:-1]):
print(YES)
return 0
print(NO)
return 1
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remo... | [
"call.arguments.change"
] | 404,823 | 404,824 | u792671636 | python |
p02681 | S = input()
T = input()
if len(T) == 2 and S[0] == T[1]:
print("Yes")
else:
if S[0] == T[0]:
T = T.replace(S,"")
if len(T)==1:
print("Yes")
else:
print("No")
else:
print("No") | S = input()
T = input()
if len(T) == 2 and S[0] == T[0]:
print("Yes")
else:
if S[0] == T[0]:
T = T.replace(S,"")
if len(T)==1:
print("Yes")
else:
print("No")
else:
print("No") | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 404,830 | 404,831 | u265213765 | python |
p02681 | import re
x = input()
y = input()
if x in y:
if len(re.findall(x+'(.*)', y)) == 1:
print('Yes')
else:
print('No')
else:
print('No')
| import re
x = input()
y = input()
if x in y:
if len(re.findall(x+'(.*)', y)[0]) == 1:
print('Yes')
else:
print('No')
else:
print('No')
| [
"control_flow.branch.if.condition.change"
] | 404,841 | 404,842 | u715396242 | python |
p02681 | S=input()
T=input()
L=len(S)
if(S[:L-1] == T[:L-1]):
print("Yes")
else:
print("No") | S=input()
T=input()
L=len(S)
if(S[:L] == T[:L]):
print("Yes")
else:
print("No")
| [
"expression.operation.binary.remove"
] | 404,843 | 404,844 | u309039873 | python |
p02681 | s=input()
t=input()
if s==t[:-1]:
print("YES")
else:
print("NO")
| s = input()
t = input()
if s == t[:-1]:
print("Yes")
else:
print("No")
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 404,858 | 404,859 | u409254176 | python |
p02681 | S = input()
T = input()
flag = False
for i in "abcdefghijklmnopqrstuvwxyz":
if T==S+i:
print("YES")
flag = True
break
if flag == False:
print("NO") | S = input()
T = input()
flag = False
for i in "abcdefghijklmnopqrstuvwxyz":
if T==S+i:
print("Yes")
flag = True
break
if flag == False:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 404,888 | 404,889 | u249372595 | python |
p02681 | s = input()
t = input()
len_s = len(s)
if len_s > 0 and s.find(t) == 0 and (len_s +1) == len(t):
print('Yes')
else:
print('No') | s = input()
t = input()
len_s = len(s)
if len_s > 0 and t.find(s) == 0 and (len_s +1) == len(t):
print('Yes')
else:
print('No') | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 404,892 | 404,893 | u789854092 | python |
p02681 | a = input()
b = input()
if (a==b[:len(a)-1]):
print("Yes")
else:
print("No") | a = input()
b = input()
if (a==b[:len(a)]):
print("Yes")
else:
print("No")
#print(b[:len(a)-1]) | [
"expression.operation.binary.remove"
] | 404,906 | 404,907 | u186051700 | python |
p02681 | a = input()
b = inout()
if (a==b[:len(a)-1]):
print("Yes")
else:
print("No") | a = input()
b = input()
if (a==b[:len(a)]):
print("Yes")
else:
print("No")
#print(b[:len(a)-1]) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.remove"
] | 404,908 | 404,907 | u186051700 | python |
p02681 | s=input()
t=input()
if s[:-1]==t:
print('Yes')
else:
print('No') | s=input()
t=input()
if s==t[:-1]:
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change"
] | 404,910 | 404,911 | u568576853 | python |
p02681 | s = input()
t = input()
if t.starttswith(s) and len(s) + 1 == len(t):
print("Yes")
else:
print("No") | s = input()
t = input()
if t.startswith(s) and len(s) + 1 == len(t):
print("Yes")
else:
print("No") | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 404,912 | 404,913 | u611033537 | python |
p02681 | a = [input() for i in range(3)]
# print(a)
# print(T[:-1])
# s_len = len(a[0])
# a[0] = a[0].rstrip('\n')
if a[0] == a[1][:-1]:
print("Yes")
else:
print("No") | a = [input() for i in range(2)]
# print(a)
# print(T[:-1])
# s_len = len(a[0])
# a[0] = a[0].rstrip('\n')
if a[0] == a[1][:-1]:
print("Yes")
else:
print("No") | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 404,918 | 404,919 | u459215900 | python |
p02681 | S=input()
T=input()
if S==T:
print('No')
else:
if T.isalpha()==0:
print('No')
else:
if T.find(S)==-1:
print('No')
else:
print('Yes') | S=input()
T=input()
if S==T:
print('No')
else:
if T.startswith(S)==0:
print('No')
else:
if T.find(S)==-1:
print('No')
else:
print('Yes') | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 404,930 | 404,931 | u726154863 | python |
p02681 | s = input()
t = input()
if s == t[:-1]:
print('YES')
else:
print('NO') | s = input()
t = input()
if s == t[:-1]:
print('Yes')
else:
print('No') | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 404,934 | 404,935 | u851082576 | 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"
] | 404,942 | 404,943 | u857605629 | python |
p02681 | def main():
S = input()
T = input()
if S == T[0:-1]:
print("OK")
else:
print("NG")
if __name__=="__main__":
main()
| def main():
S = input()
T = input()
if S == T[0:-1]:
print("Yes")
else:
print("No")
if __name__=="__main__":
main()
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 404,948 | 404,949 | u173644182 | python |
p02681 | s = input()
t = input()
if t[0:len(s)-1] == s:
print('Yes')
else:
print('No') | s = input()
t = input()
if t[0:len(s)] == s:
print('Yes')
else:
print('No')
| [
"expression.operation.binary.remove"
] | 404,954 | 404,955 | u949831615 | python |
p02681 | s=input()
t=input()
if s==t[0:-1]:
print("YES")
else:
print("NO")
| s=input()
t=input()
if s==t[0:-1]:
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 404,964 | 404,965 | u052833850 | python |
p02681 | s = input()
t = input()
if s+"z" ==t:
print("Yes")
else:
print("No") | s = input()
t = input()
if s + t[-1] == t :
print("Yes")
else:
print("No") | [
"control_flow.branch.if.condition.change"
] | 404,978 | 404,979 | u252828980 | python |
p02681 | S = input()
T = input()
n = T[:-1]
if S == n:
print('YES')
else:
print('NO')
| S = input()
T = input()
x = T[0:-1]
if S == x:
print('Yes')
else:
print('No')
| [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 405,009 | 405,008 | u187621751 | python |
p02681 | def main():
S=input()
T=input()
if(S[0:-1]==T[0:len(T)-1]):
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() | def main():
S=input()
T=input()
if(S[0:]==T[0:len(T)-1]):
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() | [] | 405,012 | 405,013 | u051218477 | python |
p02681 | s = input()
t = input()
if t[0:len(s)+1] == s and len(t) == len(s) + 1 and 1 <= len(s) <= 10:
print('Yes')
else:
print('No') | s = input()
t = input()
if t[0:len(s)] == s and len(t) == len(s) + 1 and 1 <= len(s) <= 10:
print('Yes')
else:
print('No') | [
"expression.operation.binary.remove"
] | 405,014 | 405,015 | u629560745 | python |
p02681 | S = input()
T = input()
S = str(S)
T = str(T)
def register(S, T):
if (1 <= len(S) <= 10 and len(T) == len(S) + 1) and (S[0: len(S) - 1] == T[0: len(S) - 1]):
print("Yes")
else:
print("No")
register(S, T) | S = input()
T = input()
S = str(S)
T = str(T)
def register(S, T):
if (1 <= len(S) <= 10 and len(T) == len(S) + 1) and (S[0: len(S)] == T[0: len(S)]):
print("Yes")
else:
print("No")
register(S, T)
| [
"expression.operation.binary.remove"
] | 405,032 | 405,033 | u296984343 | python |
p02681 | s=list(input())
t=list(input())
if s==t[:-1]:
print("YES")
else:
print("NO") | s=list(input())
t=list(input())
if s==t[:-1]:
print("Yes")
else:
print("No")
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 405,045 | 405,046 | u941794834 | python |
p02681 | S = input()
T = input()
print('Yes ' if T[-1] not in S else 'No ') | S = input()
T = input()
print('Yes' if T[:-1] == S else 'No') | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 405,048 | 405,049 | u594862874 | python |
p02681 | S = input()
T = input()
print('Yes' if T[-1] not in S else 'No') | S = input()
T = input()
print('Yes' if T[:-1] == S else 'No') | [
"call.arguments.change",
"io.output.change"
] | 405,050 | 405,049 | u594862874 | python |
p02681 | s= str(input())
t = str(input())
s = list(s)
t = list(t)
a=0
for i in range(len(s)-1):
if s[i]==t[i]:
a = a+1
if a == len(s)-1:
if len(t)-len(s)==1:
print("Yes")
else:
print("No")
else:
print("No") | s= str(input())
t = str(input())
s = list(s)
t = list(t)
a=0
for i in range(len(s)):
if s[i]==t[i]:
a = a+1
if a == len(s):
if len(t)-len(s)==1:
print("Yes")
else:
print("No")
else:
print("No") | [
"expression.operation.binary.remove"
] | 405,056 | 405,057 | u266143155 | python |
p02681 | s= str(input())
t= str(input())
if len(t) == len(s) + 1 and len(s) >=1 and len(s) <= 10:
if t.islower() and s.islower():
if s==t[:-1]:
print("Yes")
else:
print("No")
| s= str(input())
t= str(input())
if len(t) == len(s) + 1 and len(s) >=1 and len(s) <= 10 and t.islower() and s.islower() and s==t[:-1]:
print("Yes")
else:
print("No")
| [] | 405,076 | 405,077 | u693723949 | python |
p02681 | s= str(input())
t= str(input())
if len(t) == len(s) + 1 and len(s) >=1 and len(s) <= 10:
if t.islower() and s.islower():
if s==t[:-2]:
print("Yes")
else:
print("No")
| s= str(input())
t= str(input())
if len(t) == len(s) + 1 and len(s) >=1 and len(s) <= 10 and t.islower() and s.islower() and s==t[:-1]:
print("Yes")
else:
print("No")
| [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 405,078 | 405,077 | u693723949 | python |
p02681 | s=str(input())
t=str(input())
if t[-1:]==s:
print("Yes")
else:
print("No") | s=str(input())
t=str(input())
if t[:-1]==s:
print("Yes")
else:
print("No") | [
"control_flow.branch.if.condition.change"
] | 405,091 | 405,092 | u549603397 | python |
p02681 | S = input()
T = input()
if (T == S[:-1]):
print("Yes")
else:
print("No") | S = input()
T = input()
if (T[:-1] == S):
print("Yes")
else:
print("No") | [
"control_flow.branch.if.condition.change"
] | 405,093 | 405,094 | u060012100 | python |
p02681 | S = input()
T = input()
N = len(S) - 1
if S[0:N] == T[0:N]:
print("Yes")
else:
print("No")
| S = input()
T = input()
N = len(S)
if S[0:N] == T[0:N]:
print("Yes")
else:
print("No")
| [
"expression.operation.binary.remove"
] | 405,097 | 405,098 | u260248309 | python |
p02681 | S=input(str)
T=input()
last= T[-1]
if(T==S+last):
print('Yes')
else:
print('No') | S=input()
T=input()
last= T[-1]
if(T==S+last):
print('Yes')
else:
print('No') | [
"call.arguments.change"
] | 405,123 | 405,124 | u632757234 | python |
p02681 | s = input()
t = input()
flag = 0
for i in range(len(s)):
if s[i] != t[i]:
print("No")
flag = 1
if flag != 1:
print("Yes") | s = input()
t = input()
flag = 0
for i in range(len(s)):
if s[i] != t[i]:
print("No")
flag = 1
break
if flag != 1:
print("Yes") | [
"control_flow.break.add"
] | 405,137 | 405,138 | u811709035 | python |
p02681 | S = input()
T = input()
j = 0
for i in T[0:len(S)-1]:
if(i != S[j]):
print('No')
exit(0)
j+=1
print('Yes')
| S = input()
T = input()
j = 0
for i in T[0:len(T)-1]:
if(i != S[j]):
print('No')
exit(0)
j+=1
print('Yes')
| [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 405,145 | 405,146 | u153302617 | python |
p02681 | list = [input() for i in range (2)]
if list[1] == list[2][:-1]:
print("Yes")
else:
print("No") | list = [input() for i in range (2)]
if list[0] == list[1][:-1]:
print("Yes")
else:
print("No") | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 405,151 | 405,152 | u523910497 | python |
p02681 | import re
s=input()
st=input()
if re.search(s,st):
print("Yes")
else:
print("No")
| import re
s=input()
st=input()
if re.match(s,st):
print("Yes")
else:
print("No")
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 405,159 | 405,160 | u208947104 | python |
p02681 | s = input()
t = input()
ttt = t[-1]
tt = t.rstrip(ttt)
ss = int(len(s))
tttt = t[:ss]
print(tttt)
if len(ttt) == 1 and tttt == s:
print("Yes")
else:
print("No")
| s = input()
t = input()
ttt = t[-1]
tt = t.rstrip(ttt)
ss = int(len(s))
tttt = t[:ss]
if len(ttt) == 1 and tttt == s:
print("Yes")
else:
print("No")
| [
"call.remove"
] | 405,183 | 405,184 | u940332739 | python |
p02681 | s = input()
t = input()
ttt = t[-1]
tt = t.rstrip(ttt)
ss = int(len(s))
tttt = t[ss]
if len(ttt) == 1 and tttt == s:
print("Yes")
else:
print("No")
| s = input()
t = input()
ttt = t[-1]
tt = t.rstrip(ttt)
ss = int(len(s))
tttt = t[:ss]
if len(ttt) == 1 and tttt == s:
print("Yes")
else:
print("No")
| [] | 405,185 | 405,184 | u940332739 | python |
p02681 | s=input()
t=input()
a="Yes"
for i in range(len(s)-1):
if s[i]!=t[i]:
a="No"
if len(s)+1!=len(t):
a="No"
if len(s)>10 or len(s)<1:
a="No"
print(a)
| s=input()
t=input()
a="Yes"
for i in range(len(s)):
if s[i]!=t[i]:
a="No"
if len(s)+1!=len(t):
a="No"
if len(s)>10 or len(s)<1:
a="No"
print(a)
| [
"expression.operation.binary.remove"
] | 405,188 | 405,189 | u310381103 | python |
p02681 | n =str(input())
r =str(input())
s = len(n)
t = len(r)
if n== r[0:t] :
print('Yes')
else :
print('No')
| n =str(input())
r =str(input())
s = len(n)
t = len(r)
if n== r[0:t-1] :
print('Yes')
else :
print('No') | [
"control_flow.branch.if.condition.change"
] | 405,194 | 405,195 | u744695362 | python |
p02681 | n = input()
m = input()
if 1 <= len(n):
if len(n)<= 10 :
a = m[-1]
n = n + a
if n == m:
print("YES")
else :
print("NO") | n = input()
m = input()
if 1 <= len(n):
if len(n)<= 10 :
a = m[-1]
n = n + a
if n == m:
print("Yes")
else :
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 405,196 | 405,197 | u157184457 | python |
p02681 | import sys
S = input()
T = input()
if S in T :
text = T.replace(S,"",1)
if text == T[len(T)-1]:
if len(T) == 1:
print("Yes")
sys.exit()
else:
print("No")
sys.exit()
print("No") | import sys
S = input()
T = input()
#print(T[len(T)-1])
if S in T :
text = T.replace(S,"",1)
if text == T[len(T)-1]:
if len(text) == 1:
print("Yes")
sys.exit()
else:
print("No")
sys.exit()
print("No") | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 405,208 | 405,209 | u400982556 | python |
p02681 | from sys import stdin
S = list(stdin.readline().rstrip())
T = list(stdin.readline().rstrip())
if S[:len(S)-1] == T[:len(S)-1]:
print('Yes')
else:
print('No') | from sys import stdin
S = list(stdin.readline().rstrip())
T = list(stdin.readline().rstrip())
if S[:len(S)] == T[:len(S)]:
print('Yes')
else:
print('No') | [
"expression.operation.binary.remove"
] | 405,217 | 405,218 | u948050032 | python |
p02681 | a, b = input(), input()
if a==b[:len(a)]:
print("Yes")
else:
print("NO")
| a, b = input(), input()
if a==b[:-1]:
print("Yes")
else:
print("No")
| [
"call.arguments.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 405,221 | 405,222 | u193582576 | python |
p02681 | # -*- coding: utf-8 -*-
# 文字列の入力
S = input()
T = input()
judge = "NO"
if (len(S) + 1 == len(T)):
if (T.startswith(S)):
judge = "YES"
print("{}".format(judge)) | # -*- coding: utf-8 -*-
# 文字列の入力
S = input()
T = input()
judge = "No"
if (len(S) + 1 == len(T)):
if (T.startswith(S)):
judge = "Yes"
print("{}".format(judge)) | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 405,223 | 405,224 | u099300899 | python |
p02681 | a = input()
b = input()
if((b.find(a, 0, len(a)) != -1) and (len(a)+1 == len(b)) and (1 <= len(a) <= 10) and a.islower() and b.islower()):
print('yes')
else:
print('no')
| a = input()
b = input()
if((b.find(a, 0, len(a)) != -1) and (len(a)+1 == len(b)) and (1 <= len(a) <= 10) and a.islower() and b.islower()):
print('Yes')
else:
print('No')
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 405,235 | 405,236 | u840773955 | python |
p02681 | s = str(input())
t = str(input())
length = len(s)
count = 0
for i in range(length):
if not s[i] == t[i]:
print('No')
count = 1
if count == 0:
print('Yes')
| s = str(input())
t = str(input())
length = len(s)
count = 0
for i in range(length):
if not s[i] == t[i]:
print('No')
count = 1
break
if count == 0:
print('Yes')
| [
"control_flow.break.add"
] | 405,249 | 405,250 | u374815848 | python |
p02681 | s = str(input())
t = str(input())
l = len(s)
count = 0
for i in range(l):
if not s[i] == t[i]:
print('No')
count = 1
if count == 0:
print('Yes')
| s = str(input())
t = str(input())
length = len(s)
count = 0
for i in range(length):
if not s[i] == t[i]:
print('No')
count = 1
break
if count == 0:
print('Yes')
| [
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.break.add"
] | 405,251 | 405,250 | u374815848 | python |
p02681 | s = input()
t = input()
if t[:-1] == s:
print("YES")
else:
print("NO") | s = input()
t = input()
if t[:-1] == s:
print("Yes")
else:
print("No")
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 405,252 | 405,253 | u664015993 | python |
p02681 | str1=input()
str2=input()
n=len(str2)
str3=str2[:n-1]
if(str1==str3):
print("yes")
else:
print("no") | str1=input()
str2=input()
n=len(str2)
str3=str2[:n-1]
if(str1==str3):
print("Yes")
else:
print("No") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 405,254 | 405,255 | u687635165 | python |
p02681 | s = input()
t = input()
a = t[:-1]
if s == a:
print('YES')
else:
print('NO') | s = input()
t = input()
a = t[:-1]
if s == a:
print('Yes')
else:
print('No')
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 405,259 | 405,260 | u316390754 | python |
p02681 | s = input()
t = input()
ss = t[:len(t)-1]
print('Yes' if ss == s else 'No')
print(ss) | s = input()
t = input()
ss = t[:len(t)-1]
print('Yes' if ss == s else 'No') | [
"call.remove"
] | 405,263 | 405,264 | u771167374 | python |
p02681 | a,b = input().split()
if a == b[0:-1]:
print('Yes')
else:
print('No') | a = input()
b = input()
if a == b[0:-1]:
print('Yes')
else:
print('No') | [
"call.add",
"call.remove"
] | 405,265 | 405,266 | u578441226 | python |
p02681 | s=input()
t=input()
lens=len(s)
if s==t[:3:]:
print("Yes")
else:
print("No")
| s=input()
t=input()
lens=len(s)
if s==t[:lens:]:
print("Yes")
else:
print("No")
| [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 405,277 | 405,278 | u258410210 | python |
p02681 | n=input()
k=input()
y=len(k)
s=k[:y]
if len(n)==y-1 and s==n:
print("Yes")
else:
print("No") | n=input()
k=input()
y=len(n)
s=k[:y]
if len(k)==y+1 and s==n:
print("Yes")
else:
print("No") | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 405,287 | 405,288 | u005517181 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.