easy solution
Intuitionuse a hashmap and follow instructionsApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->
use a hashmap and follow instructions

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def maxDivScore(self, nums: List[int], divisors: List[int]) -> int:
        myd = dict()
        for d in divisors:
            cur = 0
            for n in nums:
                if n % d == 0:
                    cur += 1
            print(cur)
            myd[d] = cur
        print(myd)
        print(max(myd.values()))
        smallest = float('inf')
        for k in myd:
            if myd[k] == max(myd.values()):
                smallest = min(smallest, k)
        return smallest

```
['Python3']