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

  • pravd
     + 1 comment

    public class Solution {

    public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    int n = in.nextInt();
    int k = in.nextInt();
    int a[] = new int[n];
    int count = 0;
    for (int i = 0; i < n; i++) {
        a[i] = in.nextInt();
    }
    for (int i = 0; i < a.length - 1; i++) {
        for (int j = i; j < a.length - 1; j++) {
            if ((a[i] + a[j + 1]) % k == 0) {
                count++;
            }
        }
    }
    System.out.println(count);
}

    }