O(NxQ) Approch
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
```java []
class Solution {
    public int maxDivScore(int[] nums, int[] divisors) {
        int maxscore=0;
        int ans=divisors[0];
        for(int i=0;i<divisors.length;i++){
            int score=0;
            for(int j=0;j<nums.length;j++){
                if(nums[j]%divisors[i]==0){
                    score++;
                }
            }
            if(score>=maxscore){
                if(score==maxscore){
                    ans=Math.min(ans,divisors[i]);
                }
                else{
                    ans=divisors[i];
                }
                maxscore=score;
            }
        }
        return ans;
    }
}
```
['Java']