You are viewing a single comment's thread. Return to all comments →
C Solution
int divisibleSumPairs(int n, int k, int ar_count, int* ar) { int count = 0; for(int i=0;i<ar_count-1;i++){ for(int j = i+1 ;j<ar_count;j++){ if((ar[i]+ar[j]) %k == 0) count++; } } return count; }
Seems like cookies are disabled on this browser, please enable them to open this website
Divisible Sum Pairs
You are viewing a single comment's thread. Return to all comments →
C Solution