241일차 - BOJ no.11050

Dzeko·2022년 3월 19일
0

Daily Algorithm

목록 보기
238/396
post-thumbnail

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

My Solution

import sys

N, K = list(map(int, sys.stdin.readline().rstrip().split()))

x = 1
for i in range(N, N-K, -1):
    x *= i

y = 1
for i in range(1, K+1):
    y *= i

print(x // y)python
profile
Hound on the Code

0개의 댓글