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. Algorithms
  3. Implementation
  4. Between Two Sets
  5. Discussions

Between Two Sets

  • zsts0
     + 1 comment

    Probably, its better to use generators or maps under the all() instead of actual list comprehensions:

    def getTotalX(a, b):
    """naive, O(c(min(b) / max(a)) * (n+m)) """
    res = 0
    for i in range(max(a), min(b) + 1, max(a)):
        # print(i)
        if all(map(lambda x: i % x == 0, a)) and all(map(lambda x: x % i == 0, b)):
            res += 1

    return res

    Also, as you can see, i use max(a) as a range step, to skip "wrong" steps. p.s. I thing python will optimise max calculations when a and b are not changing.