공부하자 동진아

def solution(answers):
    answer = []
    players = [0, 0, 0]
    pattern = [[1,2,3,4,5], [2,1,2,3,2,4,2,5], [3,3,1,1,2,2,4,4,5,5]]
    
    for idx1, x in enumerate(answers):
        for idx2, y in enumerate(pattern):
            if x == y[idx1 % len(y)]: # index를 다시 0으로 돌리기 위해 [idx1 % len(y)]
                players[idx2] += 1
    
    for idx, value in enumerate(players):
        if value == max(players):
            answer.append(idx+1)
            
    return answer

def solution(n):

    sieve = [True] * (n+1)
    m = int(n ** 0.5)
    
    for i in range(2, m + 1):
        if sieve[i] == True:           
            for j in range(i+i, n+1, i):
                sieve[j] = False

    return len([i for i in range(2, n+1) if sieve[i] == True])

def solution(d, budget):
    result = 0
    d = sorted(d)
    
    for i in range(len(d)):
        result += d[i]
        if result > budget:
            answer = len(d[:i])
            break
            
    if result <= budget:
        answer = len(d)
    return answer

def solution(d, budget):
    d.sort()
    for i in range(len(d)):
        if sum(d) > budget:
            d.pop()
    return len(d)

def solution(s):
    answer = 0
    if len(s) >= 1 and len(s) <= 5:
        answer = int(s)
    return answer