Easy  c++ solution Brute force +map
Intuition\nBrute force approach and  to reduce repeated calculation  map is used.\n\n# Approach\nBrute force +map\n\n# Complexity\n- Time complexity:\nO(n*m)\n\
# Intuition\nBrute force approach and  to reduce repeated calculation  map is used.\n\n# Approach\nBrute force +map\n\n# Complexity\n- Time complexity:\nO(n*m)\n\n- Space complexity:\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        map<int,int>mp;\n        int maxi=INT_MIN;\n        int ans=0;\n        for(auto it:divisors){\n     //avoiding repeated divisors\n            if(mp[it]==0){\n                for(int i=0;i<nums.size();i++){\n                if(nums[i]%it==0){\n                    mp[it]+=1;\n                }\n            }\n            }\n        }\n        for(auto it:mp){\n            if(it.second>maxi){\n                maxi=it.second;\n                ans=it.first;\n            }\n        }\n        return ans;\n    }\n};\n```
['Ordered Map', 'C++']