# 2644. Find the Maximum Divisibility Score
###### tags: `Leetcode` `Easy`
Link: https://leetcode.com/problems/find-the-maximum-divisibility-score/description/
Brute Force
## Code

class Solution:
    def maxDivScore(self, nums: List[int], divisors: List[int]) -> int:
        maxScore, ans = 0, divisors[0]
        for d in divisors:
            score = 0
            for num in nums:
                if num%d==0: score += 1
            if score>maxScore:
                maxScore = score
                ans = d
            elif score==maxScore:
                ans = min(d, ans)
        return ans