-
Notifications
You must be signed in to change notification settings - Fork 693
/
Solution.java
31 lines (26 loc) · 1.02 KB
/
Solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
//Problem: https://www.hackerrank.com/challenges/find-digits
//Java 8
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
Scanner input = new Scanner(System.in);
int T = input.nextInt();
for(int i = 0; i < T; i++)
{
String numberString = String.valueOf(input.nextInt());
int numberInteger = Integer.parseInt(numberString);
int evenlyDivisibleDigits = 0;
for(int j = 0; j < numberString.length(); j++)
{
int digit = Character.getNumericValue(numberString.charAt(j));
if(digit != 0 && numberInteger % digit == 0)
{
evenlyDivisibleDigits++;
}
}
System.out.println(evenlyDivisibleDigits);
}
}
}