类欧几里得的基本操作

刚刚偷师学来了一波类欧，现在手推一下。

有几何推法——哦对不起空间想象能力超差的，这里直接用公式推导：

定义一堆东东

• $f(a,b,c,n)=\sum_{i=0}^n \lfloor \frac{ai+b}c\rfloor$
• $g(a,b,c,n)=\sum_{i=0}^n i\lfloor \frac{ai+b}c\rfloor$
• $h(a,b,c,n)=\sum_{i=0}^n \lfloor \frac{ai+b}c\rfloor^2$

推导

对于a,b,c,n设$m=\lfloor\frac{an+b}c\rfloor\ \ ,a'=a\mod c \ \ ,b'=b\mod c$

推f

$$\begin{align} f(a,b,c,n) & = \sum_{i=0}^n\lfloor \frac{ai+b}c\rfloor\\ & = \sum_{i=0}^n\lfloor \frac{a'i+b'}c\rfloor+i\lfloor \frac ac\rfloor+\lfloor\frac bc\rfloor\\ & = f(a',b',c,n)+\frac 12(n+1)n\lfloor\frac ac\rfloor+(n+1)\lfloor\frac bc\rfloor\\ \end{align}$$

对于$a<c,b<c$

$$\begin{align} f(a,b,c,n) & = \sum_{i=0}^n\sum_{j=1}^m[j\leq\lfloor\frac{ai+b}c\rfloor]\\ & = \sum_{j=0}^{m-1}\sum_{i=0}^n[\lfloor\frac{ai+b}c\rfloor\geq j+1]\\ & = \sum_{j=0}^{m-1}\sum_{i=0}^n[ai\geq jc+c-b]\\ & = \sum_{j=0}^{m-1}\sum_{i=0}^n[ai\gt jc+c-b-1]\\ & = \sum_{j=0}^{m-1}n-\lfloor\frac{jc+c-b-1}a\rfloor\\ & = mn-f(c,c-b-1,a,m-1) \end{align}$$

推g和h是类似的：

推g

$$\begin{align} g(a,b,c,n) & =\sum_{i=0}^n i\lfloor \frac{ai+b}c\rfloor\\ & = \sum_{i=0}^n i\lfloor \frac{a'i+b'}c\rfloor+i^2\lfloor\frac ac\rfloor+i\lfloor\frac bc\rfloor\\ & = g(a',b',c,n)+\frac 16n(n+1)(2n+1)\lfloor\frac ac\rfloor+\frac 12(n+1)n\lfloor\frac bc\rfloor\\ \end{align}$$

当$a<c,b<c$时

$$\begin{align} g(a,b,c,n) & = \sum_{i=0}^n i\lfloor \frac{ai+b}c\rfloor\\ & = \sum_{i=0}^n i\sum_{j=1}^m[j\leq\lfloor \frac{ai+b}c\rfloor]\\ & = \sum_{j=0}^{m-1}\sum_{i=0}^n i[i>\lfloor\frac{jc+c-b-1}a\rfloor]\\ & = \sum_{j=0}^{m-1}\frac 12n(n+1)-\frac 12\lfloor\frac{jc+c-b-1}a\rfloor(\lfloor\frac{jc+c-b-1}a\rfloor+1)\\ & (利用等差数列)\\ & =\frac 12(mn(n+1)-h(c,c-b-1,a,m-1)-f(c,c-b-1,a,m-1))\\ \end{align}$$

推h

$$\begin{align} h(a,b,c,n) & =\sum_{i=0}^n \lfloor \frac{ai+b}c\rfloor^2\\ & = \sum_{i=0}^n(\lfloor \frac{a'i+b'}c\rfloor+i\lfloor\frac ac\rfloor+\lfloor\frac bc\rfloor)^2\\ & = \sum_{i=0}^n \lfloor\frac{a'i+b'}c\rfloor^2+i^2\lfloor\frac ac\rfloor^2+\lfloor\frac bc\rfloor^2+2i\lfloor\frac{a'i+b'}c\rfloor\lfloor\frac ac\rfloor+2\lfloor\frac{a'i+b'}c\rfloor\lfloor\frac bc\rfloor+2i\lfloor\frac ac\rfloor\lfloor\frac bc\rfloor\\ & = h(a',b',c,n)+\frac 16n(n+1)(2n+1)\lfloor\frac ac\rfloor^2+(n+1)\lfloor\frac bc\rfloor^2+2\lfloor\frac ac\rfloor g(a',b',c,n)\\ & + 2\lfloor\frac bc\rfloor f(a',b',c,n)+n(n+1)\lfloor\frac ac\rfloor\lfloor \frac bc\rfloor\\ \end{align}$$

当$a<c,b<c$时

首先介绍个很有用的东西：

$$a^2=(a+1)a-a=2(\sum_{i=1}^a i)-a$$

那么

$$\begin{align} h(a,b,c,n) & =\sum_{i=0}^n \lfloor \frac{ai+b}c\rfloor^2\\ & = \sum_{i=0}^n 2(\sum_{j=1}^{\lfloor\frac{ai+b}c\rfloor}j)-\lfloor\frac{ai+b}c\rfloor\\ & = 2(\sum_{j=0}^{m-1}(j+1)\sum_{i=0}^n [\lfloor\frac{ai+b}c\rfloor>=j+1])-f(a,b,c,n)\\ & = 2(\sum_{j=0}^{m-1}j\sum_{i=0}^n[i<\lfloor\frac{jc+c-b-1}a\rfloor])+2(\sum_{j=0}^{m-1}\sum_{i=0}^n[i<\lfloor\frac{jc+c-b-1}a\rfloor])-f(a,b,c,n)\\ & = 2g(c,c-b-1,a,m-1)+2f(c,c-b-1,a,m-1)-f(a,b,c,n)\\ \end{align}$$

递归求出a,b,c,n的f,g,h即可

时间复杂度

观察式子，发现a先模c，然后与c交换，在模，与gcd操作基本相同，时间复杂度也相同，为$O(\log a)$