← Back to List

1359번: 복권 ↗

Solutions

Python 3
254 B | 254 chars
from itertools import combinations

n, m, k = map(int,input().split())

ans = 0
all = [*combinations([i for i in range(n)], m)]

for i in all:
  cnt = 0
  for j in range(m):
    if i[j] < m:
      cnt+=1
  if cnt >= k:
    ans += 1

print(ans / len(all))