C# solution, easy to understand
Complexity\n- Time complexity:\nO(n*m)\n\n- Space complexity:\nO(m)\n\n# Code\ncsharp []\npublic class Solution \n{\n    public int MaxDivScore(int[] nums, int[
# Complexity\n- Time complexity:\nO(n*m)\n\n- Space complexity:\nO(m)\n\n# Code\n```csharp []\npublic class Solution \n{\n    public int MaxDivScore(int[] nums, int[] divisors) \n    {\n        int[] count = new int[divisors.Length];\n        for (int i = 0; i < divisors.Length; i++)\n        {\n            int d = divisors[i];\n            for (int j = 0; j < nums.Length; j++)\n            {\n                if (nums[j] % d == 0) { count[i]++; }\n            }\n        }\n\n        int resultIndex = 0;\n        for (int i = 0; i < divisors.Length; i++)\n        {\n            int d = divisors[i];\n            int c = count[i];\n            int rd = divisors[resultIndex];\n            int rc = count[resultIndex];\n\n            if (c > rc) { resultIndex = i; }\n            else if (c == rc && d < rd)\n            {\n                resultIndex = i;\n            }\n        }\n\n        return divisors[resultIndex];\n    }\n}\n```
['C#']