๐Ÿ—๏ธ Algorithm/๐ŸŸฉ ๋ฐฑ์ค€

๐ŸŸฉ [๋ฐฑ์ค€] [Python] [Class3] 5252๋ฒˆ_IOIOI

Dbswnstjd 2022. 11. 11. 19:17

๋ฌธ์ œ

https://www.acmicpc.net/problem/5525

 

5525๋ฒˆ: IOIOI

N+1๊ฐœ์˜ I์™€ N๊ฐœ์˜ O๋กœ ์ด๋ฃจ์–ด์ ธ ์žˆ์œผ๋ฉด, I์™€ O์ด ๊ต๋Œ€๋กœ ๋‚˜์˜ค๋Š” ๋ฌธ์ž์—ด์„ PN์ด๋ผ๊ณ  ํ•œ๋‹ค. P1 IOI P2 IOIOI P3 IOIOIOI PN IOIOI...OI (O๊ฐ€ N๊ฐœ) I์™€ O๋กœ๋งŒ ์ด๋ฃจ์–ด์ง„ ๋ฌธ์ž์—ด S์™€ ์ •์ˆ˜ N์ด ์ฃผ์–ด์กŒ์„ ๋•Œ, S์•ˆ์— PN์ด ๋ช‡

www.acmicpc.net

ํ’€์ด

# ๋ฐฑ์ค€ 5252๋ฒˆ ๋ฌธ์ œ - IOIOI
n = int(input())
m = int(input())
s = input()

cursor, count, result = 0, 0, 0

while cursor < (m-1):
    if s[cursor:cursor+3] == 'IOI':
        count += 1
        cursor += 2
        if count == n:
            result += 1
            count -= 1
    else:
        cursor += 1
        count = 0
print(result)