백준 18429

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

18429번: 근손실

#모든 경우의수 해보고 아닌거 거르기
import itertools
N, K = map(int,input().split())
A = list(map(int,input().split()))
count=0
for weight in itertools.permutations(A,N):
    W = 500
    
    for w in weight:
        W+=w-K
        if W <500:
            break

    else:
        count+=1

print(count)

배운것

1. itertools permutations => 순열