2644. Find the Maximum Divisibility Score
\n# Code\n\nint maxDivScore(int* nums, int numsSize, int* divisors, int divisorsSize){\n    int max=0,count,out=0;\n    for(int i=0;i<divisorsSize;i++){\n      
\n# Code\n```\nint maxDivScore(int* nums, int numsSize, int* divisors, int divisorsSize){\n    int max=0,count,out=0;\n    for(int i=0;i<divisorsSize;i++){\n        count=0;\n        for(int j=0;j<numsSize;j++){\n            if(nums[j]%divisors[i]==0)\n                count++;\n        }\n        if(count>max) {\n            max=count;\n            out=i;\n        }\n        else if(count==max){\n           if(divisors[out]>divisors[i])\n            out=i; \n        }\n    }\n    return divisors[out];\n}\n```
['C']