hackerrank infinitum10 Fun with 1010

题目大意

给定$N,M$,求出

$$\sum_{i=1}^M \left[\sum_{j=1}^i \binom{N}{j}\right]^3 \bmod{2000003}$$

数据范围

$1 \leq N \leq M \leq 10^{12}$

题解

首先，对于$i > N$的情况，显然他们的和就等于$(M-N)(2^N-1)^3$，那么接下来就考虑怎么求

$$\begin{aligned} &\sum_{i=0}^N \left[\sum_{j=1}^i \binom{N}{j}\right]^3 \\ &= \sum_{i=0}^N \left[\sum_{j=0}^i \binom{N}{j} - 1\right]^3 \\ &= \sum_{i=0}^N \left[\sum_{j=0}^i \binom{N}{j}\right]^3 - 3\left[\sum_{j=0}^i \binom{N}{j}\right]^2+3\left[\sum_{j=0}^i \binom{N}{j}\right]-1 \end{aligned}$$

记
$A_i = \sum_{j=0}^i \binom{N}{j}$
$S_1=\sum_{i=0}^N A_i$
$S_2=\sum_{i=0}^N A_i^2$
$S_3=\sum_{i=0}^N A_i^3$

只需要把这三个东西求出来就好了。

另外设$P_1 = A_0A_{N-1}+A_1A_{N-2}+\cdots+A_{N-1}A_0$，先考虑怎么把$P_1$求出来。

$$\begin{aligned} P_1 &=A_0A_{n-1}+\cdots+A_{n-1}A_0 \\ &=\left[\binom{n}{0}\right]\times \left[\binom{n}{1}+\cdots+\binom{n}{n}\right]+\left[\binom{n}{0}+\binom{n}{1}\right] \times \left[\binom{n}{2}+\cdots+\binom{n}{n}\right] \\ &~~~~+ \cdots + \left[\binom{n}{1}+\cdots+\binom{n}{n-1}\right] \times \left[\binom{n}{n}\right] \\ &= \sum_{j<k} \binom{n}{j}\binom{n}{k}(k-j) \\ &= \sum_{r=1}^n r\sum_{k-j=r} \binom{n}{j}\binom{n}{k} \{相当于求[x^r]((1+\frac{1}{x})^n(1+x)^n)\}\\ &= \sum_{r=1}^n r \binom{2n}{n+r}\\ &= \sum_{r=1}^n r \binom{2n}{n-r}\\ &= n\sum_{r=1}^n \binom{2n}{n-r}-\sum_{r=1}^n (n-r)\binom{2n}{n-r}\\ &= \frac{n\times\left[2^{2n}-\binom{2n}{n}\right]}{2}-\frac{2n \times \left[2^{2n-1}-2\binom{2n-1}{n-1}\right]}{2} \\ &= \frac{n\binom{2n}{n}}{2} \end{aligned}$$

求出$P_1$后问题就简单很多了，我们逐个来求$S_1,S_2,S_3$。

$$\begin{aligned} S_1 &= \sum_{i=0}^n A_i \\ &= \frac{(A_0+A_{n-1})+(A_2+A_{n-2})+\cdots+(A_{n-1}+A_0)}{2}+A_n \\ &=n2^{n-1}+2^n\\ &=(n+2)2^{n-1} \\ \\ \\ S_2 &= \sum_{i=0}^n A_i^2 \\ &=A_0(2^n-A_{n-1})+\cdots+A_{n-1}(2^n-A_0)+A_n^2 \\ &=2^n(A_0+\cdots+A_n)-(A_0A_{n-1}+\cdots+A_{n-1}A_0) \\ &=2^nS_1-P_1\\ \\ \\ S_3 &= \sum_{i=0}^n A_i^3 \\ &= \frac{A_0^3+A_{n-1}^3+A_1^3+A_{n-2}^3+\cdots+A_{n-1}^3+A_0^3}{2}+A_n^3 \\ &= \frac{(A_0+A_{n-1})(A_0^2-A_0A_{n-1}+A_{n-1}^2)+\cdots}{2}+A_{n}^3\\ &= 2^n(A_0^2+A_1^2+\cdots+A_n^2)-2^{n-1}P_1\\ &=2^nS_2-P_1 \end{aligned}$$

然后这题求完这些东西后就做完啦。求组合数时用lucas即可。