Python 95%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def maxDivScore(self, nums: List[int], divisors: List[int]) -> int:\n        count = 0\n        maximal = 0\n        result = []\n        for divisor in divisors:\n            for n in nums:\n                if n % divisor == 0:\n                    count += 1\n            if count > maximal:\n                maximal = count\n                result = [divisor]\n            elif count == maximal:\n                result.append(divisor)\n            count = 0\n        return min(result)\n```
['Python3']