@@ -0,0 +1,782 @@
+import java.util.*;%0Aimport static java.lang.Math.*;%0Aimport java.util.stream.*;%0A%0A/*%0AProblem name: 10036 Divisibility%0AProblem url: https://uva.onlinejudge.org/external/100/10036.pdf%0AAuthor: Andrey Yemelyanov%0A*/%0Apublic class _10036_Divisibility %7B%0A  public static void main(String%5B%5D args)%7B%0A    Scanner s = new Scanner(System.in);%0A    int M = s.nextInt();%0A    while(M-- %3E 0)%7B%0A      int N = s.nextInt(); int K = s.nextInt();%0A      int%5B%5D sequence = new int%5BN%5D;%0A      for(int i = 0; i %3C N; i++)%7B%0A        sequence%5Bi%5D = s.nextInt();%0A      %7D%0A      if(divisible(sequence, K)) System.out.println(%22Divisible%22);%0A      else System.out.println(%22Not divisible%22);%0A    %7D%0A  %7D%0A%0A  static boolean divisible(int%5B%5D sequence, int K)%7B%0A    System.out.println(Arrays.toString(sequence));%0A    return false;%0A  %7D%0A%7D%0A

work in progress...