No hashmap!!!
IntuitionApproachComplexity
Time complexity: O(n^2)

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

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

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

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

# Code
```cpp []
class Solution {
public:
    int maxDivScore(vector<int>& nums, vector<int>& divisors) {
        int m = INT_MIN, l = 0;
        for (int i = 0; i < divisors.size(); i++) {
            int c = 0;
            for (int j = 0; j < nums.size(); j++)
                if (nums[j] % divisors[i] == 0) c++;
            if (m < c) {
                m = c;
                l = i;
            } else if (m == c) {
                l = (divisors[l] > divisors[i]) ? i : l;
            }
        }
        return divisors[l];
    }
};
```
['C++']