100% easy understandable solution ♐✅
\n\n# Complexity\n- Time complexity:O(nm)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity:\n Add your space complexity here, e.g. O(n) \n\n# C
\n\n# Complexity\n- Time complexity:O(nm)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int maxDivScore(int[] nums, int[] divisors) {\n        int count=0;\n        int ans=Integer.MAX_VALUE;\n        for( int i=0; i<divisors.length; i++)\n        {\n            int val=0;\n            for( int j=0; j<nums.length; j++)\n            {\n                if(nums[j]%divisors[i]==0)\n                {\n                    val++;\n                }\n            }\n            if(val>count)\n            {\n                count=val;\n                ans=divisors[i];\n            }\n           else if(count==val)\n            {\n                ans=Math.min(ans, divisors[i]);\n            }\n        }\n        return ans;\n    }\n}\n```
['Java']