Find the Maximum Divisibility Score Solution in C++
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\nO(n^2)\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(1)\n# Code\n```\nclass Solution {\npublic:\n    int maxDivScore(vector<int>& nums, vector<int>& divisors) {\n        int i, j, score, max=0, ans=divisors[0];\n        for(i=0 ; i<divisors.size() ; i++)\n        {\n            score = 0;\n            for(j=0 ; j<nums.size() ; j++)\n            {\n                if(nums[j]%divisors[i]==0)\n                {\n                    score++;\n                }\n            }\n            if(score>max)\n            {\n                max = score;\n                ans = divisors[i];\n            }\n            else if(score==max && divisors[i]<ans)\n            {\n                ans = divisors[i];\n            }\n        }\n        return ans;\n    }\n};\n```\n![upvote new.jpg](https://assets.leetcode.com/users/images/e7d4450c-db89-4385-9fe3-6c42fad1000c_1683948810.613229.jpeg)\n
['C++']