[알고리즘] 45. Repeated String

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.

Function Description

Complete the repeatedString function in the editor below. It should return an integer representing the number of occurrences of a in the prefix of length  in the infinitely repeating string.

repeatedString has the following parameter(s):

• s: a string to repeat
• n: the number of characters to consider

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.

답 :

#!/bin/python3

import math

import os

import random

import re

import sys

from math import floor

# Complete the repeatedString function below.

if __name__ == '__main__':

s = input()

n = int(input())

print(s.count('a')* (n // len(s)) + s[:n%len(s)].count('a'))

몫과 나머지로 풀이!

먼저 몫만큼은 배열을 다 포함하기에 (몫 * 배열내 'a'의 수)

그리고 배열[:나머지] 만큼이 뒤에 붙기에 그 배열까지의 'a' 갯수를 세서 더한다.