forked from sknsht/HackerRank
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
41 lines (30 loc) · 1.12 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
32
33
34
35
36
37
38
39
40
41
import java.io.*;
import java.util.*;
public class Solution {
static long repeatedString(String s, long n) {
long numOccurrences = s.replaceAll("[^a]", "").length();
if (numOccurrences == 0)
return numOccurrences;
long remainder = n % s.length();
long numRepetitions = n / s.length();
numOccurrences = numRepetitions * numOccurrences;
for (int i = 0; i < remainder; i++) {
if (s.charAt(i) == 'a') {
numOccurrences++;
}
}
return numOccurrences;
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
String s = scanner.nextLine();
long n = scanner.nextLong();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
long result = repeatedString(s, n);
bufferedWriter.write(String.valueOf(result));
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}