摘要：
转自acwing 1.询问次数大 // c[a][b] 表示从a个苹果中选b个的方案数 for (int i = 0; i < N; i ++ ) for (int j = 0; j <= i; j ++ ) if (!j) c[i][j] = 1; else c[i][j] = (c[i - 1] 阅读全文
摘要：
https://blog.csdn.net/xiaoming_p/article/details/79644386 阅读全文