摘要: 2017 2018 ACM ICPC Asia East Continent League Final (ECL Final 2017) A 求$C(n,k)\%P$, 用$C(n,k 1)$递推$C(n,k)$即可。复杂度$O(Tk)$ B 目标是最小化$D = E(X^2) E(X)^2$,因为 阅读全文
posted @ 2018-10-18 12:58 RUSH_D_CAT 阅读(308) 评论(0) 推荐(0) 编辑