-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathHackerrankPsAlgorithms0037.java
More file actions
46 lines (37 loc) · 1.27 KB
/
HackerrankPsAlgorithms0037.java
File metadata and controls
46 lines (37 loc) · 1.27 KB
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.stream.IntStream;
public class HackerrankPsAlgorithms0037 {
// Find Digits
// https://www.hackerrank.com/challenges/find-digits/problem?isFullScreen=true
// --- You need to fill this method ---
public static int findDigits(int n) {
int totalDivisorCount = 0;
for (char item : String.valueOf(n).toCharArray()) {
if (item != '0' && n % Integer.valueOf(String.valueOf(item)) == 0) {
totalDivisorCount++;
}
}
return totalDivisorCount;
}
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int t = Integer.parseInt(bufferedReader.readLine().trim());
IntStream.range(0, t).forEach(tItr -> {
try {
int n = Integer.parseInt(bufferedReader.readLine().trim());
int result = findDigits(n);
bufferedWriter.write(String.valueOf(result));
bufferedWriter.newLine();
} catch (IOException ex) {
throw new RuntimeException(ex);
}
});
bufferedReader.close();
bufferedWriter.close();
}
}