Binomial Coeffcients

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define N 1010
#define mod 10000003
int cmp[N][N];
int main()
{
    int t,i,j;
    cmp[0][0]=cmp[1][0]=cmp[1][1]=1;
    for (i=2;i<N;i++)
    {
        cmp[i][i]=cmp[i][0]=1;
        for (j=0;j<i;j++)
            cmp[i][j]=(cmp[i-1][j-1]+cmp[i-1][j])%mod;  //这里用到了打表来计算组合数
    }
    scanf("%d",&t);
    int a,b;
    while (t--)
    {
        scanf("%d%d",&a,&b);
        printf("%d\n",cmp[a][b]);
    }
    return 0;
}