组合数dp求法

void getC()
{
    c[0][0]=1;
    for(int i=1;i<=1000;++i)
    {
        c[i][0]=c[i][i]=1;
        for(int j=1;j<=i/2;++j)
        {
            c[i][j]=(c[i-1][j]+c[i-1][j-1])%mod;
            c[i][i-j]=c[i][j];
        }
    }
}

标签：组合,int,void,getC,求法,dp
来源： https://blog.csdn.net/wangqianqianya/article/details/90446167