对于题解第一篇的95pts优化

#include <bits/stdc++.h>
#define pb push_back
#define pf(a) push_front(a)
#define pof pop_front
#define pob pop_back
#define fr() front()
#define ba() back()
#define ls(x) x << 1
#define rs(x) (x << 1) | 1
#define re register
#define in(a) insert(a)
#define fi first
#define se second
#define gcd(a, b) __gcd(a, b)
#define l2(a) log(a) / log(2)
#define ui128 unsigned __int128
#define ll long long
#define pll pair<ll, ll>
#define ull unsigned long long
#define pii pair<int, int>
#define pq1 priority_queue<int>
#define pq2 priority_queue<int, vector<int>, greater<int>>
#define ui unsigned int
#define db long double
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
using namespace std;
const int N = 2005;
ull a[N][N];
int n,m,t;
ull c[N][N];
ull k;
int s[N][N];
int sum[N][N];
void init(){
    c[1][1] = 1;
    c[1][0] = c[0][0] = 1;
    for(int i = 2;i <= N - 5;++i){
        c[i][0] = 1;
        for(int j = 1;j <= i;++j){
            c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % k;
            if(c[i][j] % k == 0)s[i][j] = 1;
        }
    }
}
signed main() {
    // freopen("work.in", "r", stdin);
    // freopen("work.out", "w", stdout);
    IOS;
    cin>>t>>k;
    init();
    for(int i = 1;i <= N - 5;++i){
        for(int j = 1;j <= i;++j){
            sum[i][j] = sum[i][j - 1] + s[i][j];
        }
    }
    while(t--){
        cin>>n>>m;
        ll ans = 0;
        for(int i = 0;i <= n;++i){
            ans += sum[i][min(i,m)];
        }
        cout<<ans<<'\n';
    }
}