my solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# 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:
        count=0
        result=[]
        for i in divisors:
            for j in nums:
                if j%i==0:
                    count+=1
            result.append(count)
            count=0
        output=float('inf')
        for idx in range(len(result)):
            if result[idx]==max(result):
                output=min(output,divisors[idx])
        return output
        
```
['Python3']