@@ -0,0 +1,623 @@
+import java.io.*;%0Aimport java.util.*;%0Aimport java.text.*;%0Aimport java.math.*;%0Aimport java.util.regex.*;%0A%0Aclass Solution %7B%0A%0A    public static void main(String%5B%5D args) %7B%0A        Scanner in = new Scanner(System.in);%0A        int n = in.nextInt();%0A        int k = in.nextInt();%0A        int a%5B%5D = new int%5Bn%5D;%0A        for(int a_i=0; a_i %3C n; a_i++)%7B%0A            a%5Ba_i%5D = in.nextInt();%0A        %7D%0A        int count =0;%0A        Arrays.sort(a);%0A        for(int i=0;i%3Ca.length;i++)%7B%0A        %09for(int j=i+1;j%3Ca.length;j++)%7B%0A        %09%09if((a%5Bi%5D+a%5Bj%5D)%25k==0) count++;%0A        %09%7D%0A        %7D%0A        System.out.println(count);%0A        %0A    %7D%0A%7D

add DivisibleSumPairs.java