-
Notifications
You must be signed in to change notification settings - Fork 138
/
Copy pathSolution.java
60 lines (48 loc) · 1.33 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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class Solution {
// Complete the repeatedString function below.
static long repeatedString(String s, long n) {
long counter = 0;
if (s.length() > n) {
for (int i = 0; i< n; i++) {
if (s.charAt(i) == 'a') {
counter++;
}
}
return counter;
}
long as = 0;
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) == 'a') {
as++;
}
}
long maxSeq = n / s.length();
counter = maxSeq * as;
int remaining = (int)(n - maxSeq * s.length());
for (int i = 0; i < remaining; i++) {
if (s.charAt(i) == 'a') {
counter++;
}
}
return counter;
}
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();
}
}