fork download
  1.  
  2. import re
  3.  
  4. quest = input()
  5.  
  6. left = []
  7. right = []
  8.  
  9. inp = input()
  10.  
  11. for i in re.finditer('[a-z]|<delete>|<bspace>|<left>|<right>', inp):
  12. case = i.group()
  13. if case == '<delete>':
  14. if right:
  15. right.pop()
  16. elif case == '<bspace>':
  17. if left:
  18. left.pop()
  19. elif case == '<left>':
  20. if left:
  21. right.append(left.pop())
  22. elif case == '<right>':
  23. if right:
  24. left.append(right.pop())
  25. else:
  26. left.append(case)
  27.  
  28. if quest == ''.join(left + right[::-1]):
  29. print('Yes')
  30. else:
  31. print('No')
  32.  
  33.  
Success #stdin #stdout 0.03s 9660KB
stdin
hellochild
helto<left><bspace>l<delete>ochilds<bspace>
stdout
Yes