@@ -0,0 +1,626 @@
+package net.anapsil.hackerrank.algorithms.implementation;%0A%0Aimport java.util.Scanner;%0A%0Apublic class FindDigits %7B%0A%0A%09public static void main(String%5B%5D args) %7B%0AScanner in = new Scanner(System.in);%0A%09%09%0A%09%09int quant = in.nextInt();%0A        String%5B%5D values = new String%5B30%5D;%0A%09%09int dividers;%0A%09%09%0A%09%09for (int i = 0;i%3C quant;i++) %7B%0A%09%09%09if (in.hasNext()) %7B%0A%09%09%09%09values%5Bi%5D = in.next();%0A%09%09%09%7D%0A%09%09%7D%0A%09%09%0A%09%09for (String v: values) %7B%0A%09%09%09dividers = 0;%0A%09%09%09for (int i = 0; i %3C v.length(); i++) %7B%0A%09%09%09%09int div = (int) v.charAt(i);%0A%09%09%09%09%0A%09%09%09%09if (div != 0 && Integer.parseInt(v)%25div == 0) %7B%0A%09%09%09%09%09dividers++;%0A%09%09%09%09%7D%0A%09%09%09%7D%0A%09%09%09System.out.println(dividers);%0A%09%09%7D%0A%09%7D%0A%0A%7D%0A

Find digits