완전탐색 - 모의고사

def solution(answers):
    s1 = [1,2,3,4,5] # 5개
    s2 = [2,1,2,3,2,4,2,5] # 7개
    s3 = [3,3,1,1,2,2,4,4,5,5] #10개 
    count1=0
    count2=0
    count3=0
    list_len = len(answers) # ex)17 
    s1 = s1*int(list_len/len(s1)) + s1[:int(list_len%len(s1))]
    s2 = s2*int(list_len/len(s2)) + s2[:int(list_len%len(s2))]
    s3 = s3*int(list_len/len(s3)) + s3[:int(list_len%len(s3))]
    for i in range(list_len):
        if s1[i] == answers[i]:
            count1 +=1
        if s2[i] == answers[i]:
            count2 +=1
        if s3[i] == answers[i]:
            count3 +=1        
    answer = [count1, count2, count3]
    m = max(answer)
    result = [idx+1 for idx, val in enumerate(answer) if m==val]
    result.sort()
    return result

슬라이싱이랑 enumerate()를 스스로 써본 경험.. 그렇지만 시간이 너무 오래걸렸다