数学
DerekHJH
这个作者很懒,什么都没留下…
展开
-
Problem Solving OJ-2019.03.10
读入n,输出 样例输入:10样例输出: 36数据范围: 0<n<10^7Analysis: We only need to calculate the number of odd binomial coefficients.Points:1. C(n,k) is odd if and only if n&k==k(0<=k<=n);2...原创 2019-03-10 16:23:11 · 146 阅读 · 0 评论 -
Preprocess the binomial coefficient mod a prime number MOD with time cost of O(n)
First remember that, and all we have to do is to calculate all the n fatorials, namelyFactorial[i]=i!, 0<=i<=nand theircorresponding inverses Factorial_Inverse[i] in O(n) time. And when we w...原创 2019-04-07 19:34:02 · 111 阅读 · 0 评论 -
Vandermonde Identity
is calld Vandermonde Identity. According to Wikipedia and some other CSDN blogs, I breifly summarize the way of proving this identity as follows:The first version of proof is quite intuitive. We ex...原创 2019-04-07 20:42:37 · 492 阅读 · 0 评论