组合数板子

//求单个
ll cks(ll n, ll m) {
	if (n == m || m == 0) return 1;
	ll ans = 1;
	m = min(m, n - m);
	for (ll i = 1; i <= m; i++) ans *= (n - i + 1) / i;
	return ans;
}

//多次求
ll res[1010][1010];//使用时取出
ll c(ll n, ll m) {
	if (n < m) return 0;
	if (n == m || m == 0) return 1;
	if (res[n][m] != 0) return res[n][m];
	else {
		return res[n][m] = c(n-1,m)+c(n-1,m-1);//可以取模
	}
}