C++ || Brute Force ✔
Complexity\n- Time complexity: O(nm)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(nm)\n Add your space complexity here, e.g. O(n) \n\n# 
# Complexity\n- Time complexity: $$O(n*m)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(n*m)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int maxDivScore(vector<int>& nums, vector<int>& divisors) {\n        int ans=0, ans2=0;\n        for (int i=0; i<divisors.size(); i++){\n            int curr=0;\n            for (int j=0; j<nums.size(); j++){\n                if (nums[j]%divisors[i]==0)curr++;\n            }\n            if (curr>ans){\n                ans= curr;\n                ans2= i;\n            }\n            else if (curr==ans && divisors[i]<divisors[ans2]){\n                ans2=i;\n                ans= curr;\n            }\n        }\n        return divisors[ans2];\n    }\n};\n```
['Array', 'Math', 'Matrix', 'Counting', 'C++']