problem1.py 505 B

1234567891011121314151617181920212223242526
  1. def has_one_mistake(name, word):
  2. if len(name) != len(word):
  3. return False
  4. mistakes = 0
  5. for i in range(len(name)):
  6. if name[i] != word[i]:
  7. mistakes += 1
  8. return mistakes == 1
  9. n = int(input())
  10. gods = []
  11. for i in range(n):
  12. gods.append(input())
  13. m = int(input())
  14. words = []
  15. for i in range(m):
  16. words.append(input())
  17. for god in gods:
  18. count = 0
  19. for word in words:
  20. if has_one_mistake(god, word):
  21. count += 1
  22. print(count, end=" ")