@@ -0,0 +1,733 @@
+import java.io.*;%0Aimport java.util.*;%0Aimport java.text.*;%0Aimport java.math.*;%0Aimport java.util.regex.*;%0A%0A/**%0A* Solution to https://www.hackerrank.com/challenges/find-digits%0A*/%0Apublic class Solution %7B%0A%0A    public static void main(String%5B%5D args) %7B%0A        Scanner in = new Scanner(System.in);%0A%0A        int tests = in.nextInt();%0A%0A        for (int i = 0; i %3C tests; i++) %7B%0A            int n = in.nextInt();%0A            int orig = n;%0A%0A            int divisors = 0;%0A%0A            while (n != 0) %7B%0A                int digit = n %25 10;%0A%0A                if (digit != 0 && orig %25 digit == 0) %7B%0A                    divisors++;%0A                %7D%0A%0A                n /= 10;%0A            %7D%0A%0A            System.out.println(divisors);%0A        %7D%0A    %7D%0A%7D%0A

Create find-digits.java