We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Python
  3. Sets
  4. No Idea!
  5. Discussions

No Idea!

  • wernersjunk2
     + 2 comments

    Try to solve the Problem with intersection(), but it didnt work in some cases... Some ideas?

    n, m = map(int, input().split())
arr = list(map(int, input().split()))
a = set(map(int, input().split()))
b = set(map(int, input().split()))

happ = len(a.intersection(arr))
sad = len(b.intersection(arr))
print(happ-sad)