We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Divisible Sum Pairs
  5. Discussions

Divisible Sum Pairs

  • LukeRocheDev
     + 5 comments

    works but is hard to read... i would do 

    for(int i=0; i<n-1; i++){
        for(int j=i+1;j<n;j++){
            a = ar[i] + ar[j];
            if (a % k == 0)
                count++;
            
        }
    }