You are viewing a single comment's thread. Return to all comments →
work to me
count=0; for(i=0;i<(ar.length)-1;i++) for(j=i+1;j<(ar.length);j++) if((ar[i]+ar[j])%k==0) count++; return count;
Divisible Sum Pairs
You are viewing a single comment's thread. Return to all comments →
work to me