题解 | #走方格的方案数#
走方格的方案数
http://www.nowcoder.com/practice/e2a22f0305eb4f2f9846e7d644dba09b
from itertools import combinations
while 1:
try:
n, m = map(int, input().split())
l = combinations(range(m+n), n)
print(len(list(l)))
except:
break
