Lilah has a string, , of lowercase English letters that she repeated infinitely many times.
Given an integer, , find and print the number of letter a
's in the first letters of Lilah's infinite string.
For example, if the string and , the substring we consider is , the first characters of her infinite string. There are occurrences of a
in the substring.
Input Format
The first line contains a single string, .
The second line contains an integer, .
Constraints
- For of the test cases, .
Output Format
Print a single integer denoting the number of letter a
's in the first letters of the infinite string created by repeating infinitely many times.
Sample Input 0
aba
10
Sample Output 0
7
Explanation 0
The first letters of the infinite string are abaabaabaa
. Because there are a
's, we print on a new line.
Sample Input 1
a
1000000000000
Sample Output 1
1000000000000
Explanation 1
Because all of the first letters of the infinite string are a
, we print on a new line.
'HackerRank > Algorithms' 카테고리의 다른 글
Equalize the Array (0) | 2018.07.20 |
---|---|
Jumping on the Clouds (0) | 2018.07.19 |
Non-Divisible Subset (0) | 2018.07.19 |
Cut the sticks (0) | 2018.07.18 |
Library Fine (0) | 2018.07.18 |