공돌이 공룡의 서재

def solution(answers): solver = [0, 0, 0] s1 = [1, 2, 3, 4, 5] s2 = [2, 1, 2, 3, 2, 4, 2, 5] s3 = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5] for i in range(len(answers)): if answers[i] == s1[i % len(s1)]: solver[0] += 1 if answers[i] == s2[i % len(s2)]: solver[1] += 1 if answers[i] == s3[i % len(s3)]: solver[2] += 1 answer = [] for i in range(len(solver)): if solver[i] == max(solver): answer.append(i + 1) r..