这就是组合数问题，i了i了

$老组合数学$

标签 $组合数$ $\&$ $前缀和$

#include<bits/stdc++.h>
#define re register
#define f(i, a, b) for(re int i = a; i <= b; ++i)
using namespace std;

int t, k, n, m, c[2001][2001], f[2001][2001];

signed main(){
	scanf("%d%d", &t, &k);
	f(i, 0, 2000) c[i][0] = 1;//初始化
	f(i, 1, 2000)
		f(j, 1, i)
			c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % k;
	f(i, 1, 2000){
		f(j, 1, i){
			f[i][j] = f[i - 1][j] + f[i][j - 1] - f[i - 1][j - 1];//求和
			if(!c[i][j]) f[i][j]++;//0 | k = 0 (k ≠0)
		}
		f[i][i + 1] = f[i][i];//杨辉三角的弊端
	}
	while(t--){
		scanf("%d%d", &n, &m);
		(n < m) ? printf("%d\n", f[n][n]) : printf("%d\n", f[n][m]);//特殊情况 
	}
	return 0;
}