[백준 파이썬 1010번]다리놓기★Sorted★

import sys

def fact(n):
    if n==1 or n==0:
        return 1
    else:
        res=1
        for i in range(n, 0, -1):
            res*=i
        return res
n = int(sys.stdin.readline())
result = []
for i in range(n):
    A = list(map(int , sys.stdin.readline().rstrip().split()))
    A = sorted(A , reverse=True)
    res = fact(A[0])//(fact(A[0]-A[1])*(fact(A[1])))
    result.append(res)
for k in result:
    print(k)

sorted(A, reverse=True) ==> 내림차순으로의 정리 

 

29C13 = 67863915