KMP연습할 겸 풀었다. 하나만 찾으면 되는 문제 import sys input = sys.stdin.readline def make_pattern(s): counter = 0 for idx in range(1, len(s)): while counter > 0 and s[counter] != s[idx]: counter = lose_funtion[counter-1] if s[counter] == s[idx]: counter += 1 lose_funtion[idx] = counter def KMP_pattern_matching(p, s): counter = 0 p_size = len(p) for idx in range(len(s)): while counter > 0 and p[counter] != s[id..