You are viewing a single comment's thread. Return to all comments →
I did the same logic in java :)
for(int i=0; i<n; i++){ for(int j=1;j<n;j++){ if (i < j){ a = ar[i] + ar[j]; if (a % k == 0){ 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 →
I did the same logic in java :)