【技能点】类欧几里得

类欧几里得可以在$O(logn)$的复杂度下求解类似以下的式子；
$$f(n,a,b,c)=\sum _{i=0}^n\lfloor \frac{ai+b}{c}\rfloor$$
$$g(n,a,b,c)=\sum _{i=0}^{n}i\lfloor \frac{ai+b}{c}\rfloor$$
$$h(n,a,b,c)=\sum _{i=0}^n{\lfloor \frac{ai+b}{c}\rfloor }^2$$

$f(n,a,b,c)$函数的计算：

1. 当$a=0$时，原式$=(n+1)\lfloor \frac{b}{c}\rfloor$
2. 当$a\ge c||b\ge c$时，
   $$\begin{array}{rl}原式& =\sum _{i=0}^n\lfloor \frac{(\lfloor \frac{a}{c}\rfloor c+a\%c)i+(\lfloor \frac{b}{c}\rfloor c+b\%c)}{c}\rfloor \\ & =\sum _{i=0}^n\lfloor \frac{a}{c}\rfloor i+\lfloor \frac{b}{c}\rfloor +\lfloor \frac{(a\%c)i+b\%c}{c}\rfloor \\ & =\lfloor \frac{a}{c}\rfloor \frac{n(n+1)}{2}+(n+1)\lfloor \frac{b}{c}\rfloor +\sum _{i=0}^n\lfloor \frac{(a\%c)i+b\%c}{c}\rfloor \\ & =\lfloor \frac{a}{c}\rfloor \frac{n(n+1)}{2}+(n+1)\lfloor \frac{b}{c}\rfloor +f(n,a\%c,b\%c,c)\end{array}$$
3. 当$a<c\&\&b<c$
   $$\begin{array}{rl}原式& =\sum _{i=0}^n\sum _{j=0}^{\lfloor \frac{ai+b}{c}\rfloor -1}1\\ & =\sum _{j=0}^{\lfloor \frac{an+b}{c}\rfloor -1}\sum _{i=0}^n\left[j<\lfloor \frac{ai+b}{c}\rfloor \right]\end{array}$$
   然后对于$j<\lfloor \frac{ai+b}{c}\rfloor$进行一些变换
   $$\begin{array}{rl}j<\lfloor \frac{ai+b}{c}\rfloor & \iff j+1\le \lfloor \frac{ai+b}{c}\rfloor \iff j+1\le \frac{ai+b}{c}\\ & \iff jc+c\le ai+b\iff jc+c-b-1<ai\\ & \iff \frac{jc+c-b-1}{a}<i\\ & \iff \lfloor \frac{jc+c-b-1}{a}\rfloor <i\end{array}$$
   此时令$m=\lfloor \frac{an+b}{c}\rfloor ,t=\lfloor \frac{jc+c-b-1}{a}\rfloor$
   所以可以得到
   $$\begin{array}{rl}原式& =\sum _{j=0}^{\lfloor \frac{an+b}{c}\rfloor -1}\sum _{i=0}^n\left[j<\lfloor \frac{ai+b}{c}\rfloor \right]\\ & =\sum _{j=0}^{m-1}\sum _{i=0}^n[i>t]\\ & =\sum _{j=0}^{m-1}n-t=nm-\sum _{j=0}^{m-1}t\\ & =nm-\sum _{j=0}^{m-1}\lfloor \frac{jc+c-b-1}{a}\rfloor \\ & =nm-f(m-1,c,c-b-1,a)\end{array}$$

总结$f(n,a,b,c)$的函数值，令$m=\lfloor \frac{an+b}{c}\rfloor$
当$a=0$时，$f(n,a,b,c)=(n+1)\lfloor \frac{b}{c}\rfloor$
当$a\ge c||b\ge c$时，$f(n,a,b,c)=\lfloor \frac{a}{c}\rfloor \frac{n(n+1)}{2}+(n+1)\lfloor \frac{b}{c}\rfloor +f(n,a\%c,b\%c,c)$
当$a<c\&\&b<c$，$f(n,a,b,c)=nm-f(m-1,c,c-b-1,a)$
\\
\\
\\
$g(n,a,b,c)$函数的计算：
此处主要推导当$a<c\&\&b<c$的情况：
还是令$m=\lfloor \frac{an+b}{c}\rfloor ,t=\lfloor \frac{jc+c-b-1}{a}\rfloor$
$$\begin{array}{rl}原式& =\sum _{i=0}^{n}i\lfloor \frac{ai+b}{c}\rfloor =\sum _{i=0}^n\sum _{j=0}^{\lfloor \frac{ai+b}{c}\rfloor -1}i\\ & =\sum _{j=0}^{\lfloor \frac{an+b}{c}\rfloor -1}\sum _{i=0}^{n}i\left[j<\lfloor \frac{ai+b}{c}\rfloor \right]\\ & =\sum _{j=0}^{m-1}\sum _{i=0}^{n}i[i>t]\\ & =\sum _{j=0}^{m-1}\frac{(n-m)(m+1+n)}{2}\\ & =\frac{1}{2}[nm(n+1)-h(m-1,c,c-b-1,a)-f(m-1,c,c-b-1,a)]\end{array}$$

总结$g(n,a,b,c)$的函数值，令$m=\lfloor \frac{an+b}{c}\rfloor$
当$a=0$时，$g(n,a,b,c)=\frac{n(n+1)}{2}\lfloor \frac{b}{c}\rfloor$
当$a\ge c||b\ge c$时，$g(n,a,b,c)=\lfloor \frac{a}{c}\rfloor \frac{n(n+1)(2n+1)}{6}+\lfloor \frac{b}{c}\rfloor \frac{n(n+1)}{2}+g(n,a\%c,b\%c,c)$
当$a<c\&\&b<c$，$g(n,a,b,c)=\frac{1}{2}[nm(n+1)-h(m-1,c,c-b-1,a)-f(m-1,c,c-b-1,a)]$

\\
\\
\\
$h(n,a,b,c)$函数的计算：
此处主要推导当$a<c\&\&b<c$的情况：
首先进行一步代换：$$n^2=2\frac{n(n+1)}{2}-n=\left(2\sum _{i=0}^{n}i\right)-n$$
$$\begin{array}{rl}原式& =\sum _{i=0}^n{\lfloor \frac{ai+b}{c}\rfloor }^2\\ & =\sum _{i=0}^n\left[\left(2\sum _{j=1}^{\lfloor \frac{ai+b}{c}\rfloor }j\right)-\lfloor \frac{ai+b}{c}\rfloor \right]\\ & =\left(2\sum _{i=0}^n\sum _{j=1}^{\lfloor \frac{ai+b}{c}\rfloor }j\right)-f(n,a,b,c)\end{array}$$
对于左边一部分：
$$\begin{array}{rl}\sum _{i=0}^n\sum _{j=1}^{\lfloor \frac{ai+b}{c}\rfloor }j& =\sum _{i=0}^n\sum _{j=0}^{\lfloor \frac{ai+b}{c}\rfloor -1}(j+1)\\ & =\sum _{j=0}^{m-1}(j+1)\sum _{i=0}^n\left[j<\lfloor \frac{ai+b}{c}\rfloor \right]\\ & =\sum _{j=0}^{m-1}(j+1)\sum _{i=0}^n[i>t]\\ & =\sum _{j=0}^{m-1}(j+1)(n-t)\\ & =\frac{1}{2}nm(n+1)-g(m-1,c,c-b-1,a)-f(m-1,c,c-b-1,a)\end{array}$$

综上$h(n,a,b,c)=nm(n+1)-2g(m-1,c,c-b-1,a)-2f(m-1,c,c-b-1,a)-f(n,a,b,c)$

总结$h(n,a,b,c)$的函数值，令$m=\lfloor \frac{an+b}{c}\rfloor$
当$a=0$时，$h(n,a,b,c)=(n+1)\lfloor \frac{b}{c}{\rfloor }^2$
当$a\ge c||b\ge c$时，$h(n,a,b,c)=\frac{n(n+1)(2n+1)}{6}\lfloor \frac{a}{c}{\rfloor }^2+(n+1)\lfloor \frac{b}{c}{\rfloor }^2+\lfloor \frac{a}{c}\rfloor \lfloor \frac{b}{c}\rfloor n(n+1)+h(n,a\%c,b\%c,c)+2\lfloor \frac{b}{c}\rfloor f(n,a\%c,b\%c,c)+2\lfloor \frac{a}{c}\rfloor g(n,a\%c,b\%c,c)$
当$a<c\&\&b<c$，$h(n,a,b,c)=\frac{1}{2}[nm(n+1)-h(m-1,c,c-b-1,a)-f(m-1,c,c-b-1,a)]$

const LL p=998244353;
LL i2=499122177,i6=166374059;//2^(-1),6^(-1)
struct data
{
	data(){f=g=h=0;}
	LL f,g,h;
};
data calc(LL n,LL a,LL b,LL c)
{
	LL ac=a/c,bc=b/c,m=(a*n+b)/c,n1=n+1,n21=n*2+1;
	data d;
	if(!a)
	{
		d.f=bc*n1%p;
		d.g=bc*n%p*n1%p*i2%p;
		d.h=bc*bc%p*n1%p;
		return d;
	}
	if(a>=c||b>=c)
	{
		d.f=n*n1%p*i2%p*ac%p+n1*bc%p;
		d.g=ac*n%p*n1%p*n21%p*i6%p+bc*n%p*n1%p*i2%p;
		d.h=ac*ac%p*n%p*n1%p*n21%p*i6%p+bc*bc%p*n1%p+ac*bc%p*n%p*n1%p;
		d.f%=p,d.g%=p,d.h%=p;
		data e=calc(n,a%c,b%c,c);
		d.h+=e.h+2*bc%p*e.f%p+2*ac%p*e.g%p;
		d.g+=e.g,d.f+=e.f;
		d.f%=p,d.g%=p,d.h%=p;
		return d;
	}
	data e=calc(m-1,c,c-b-1,a);
	d.f=n*m%p-e.f,d.f=(d.f%p+p)%p;
	d.g=m*n%p*n1%p-e.h-e.f,d.g=(d.g*i2%p+p)%p;
	d.h=n*m%p*(m+1)%p-2*e.g-2*e.f-d.f,d.h=(d.h%p+p)%p;
	return d;
}