BZOJ2987：Earthquake(类欧几里德算法)

Sol

设 $n=\lfloor \frac{c}{a}\rfloor$
问题转化为求
$$\sum _{i=0}^n\lfloor \frac{c-ax}{b}\rfloor +1=\sum _{i=0}^n\lfloor \frac{-ax+b+c}{b}\rfloor$$
考虑一般性的问题
设
$$f(a,b,c,n)=\sum _{i=0}^n\lfloor \frac{ax+b}{c}\rfloor ，c̸=0$$

1. 若 $c\le 0$，那么 $f(a,b,c,n)=f(-a,-b,-c,n)$
2. 若 $a<0$ 或 $b<0$，那么
   $$f(a,b,c,n)=f(amodc+c,bmodc+c,c,n)+\frac{n(n+1)}{2}(\lfloor \frac{a}{c}\rfloor -1)+(n+1)(\lfloor \frac{b}{c}\rfloor -1)$$
3. 若 $a>=c$ 或 $b>=c$，那么
   $$f(a,b,c,n)=f(amodc,bmodc,c,n)+\frac{n(n+1)}{2}\lfloor \frac{a}{c}\rfloor +(n+1)\lfloor \frac{b}{c}\rfloor$$
4. 最后 $0\le a<c$ 且 $0\le b<c$
   设 $m=\lfloor \frac{an+b}{c}\rfloor$
   那么
   $$\sum _{i=0}^n\lfloor \frac{ai+b}{c}\rfloor =\sum _{i=0}^n\sum _{j=1}^m[\lfloor \frac{ai+b}{c}\rfloor \ge j]=\sum _{i=0}^n\sum _{j=0}^{m-1}[\lfloor \frac{ai+b}{c}\rfloor \ge j+1]$$
   $$=\sum _{i=0}^n\sum _{j=0}^{m-1}[ai\ge cj+c-b]=\sum _{i=0}^n\sum _{j=0}^{m-1}[ai>cj+c-b-1]$$
   $$=\sum _{i=0}^n\sum _{j=0}^{m-1}[i>\lfloor \frac{cj+c-b-1}{a}\rfloor ]=\sum _{i=0}^{m-1}(n-\lfloor \frac{ci+c-b-1}{a}\rfloor )$$
   $$=nm-\sum _{i=0}^{m-1}\lfloor \frac{ci+c-b-1}{a}\rfloor =nm-f(c,c-b-a,a,m-1)$$
   边界是 $a=0$ 或者 $n\le 1$

这个题直接代入就好了

# include <bits/stdc++.h>
using namespace std;
typedef long long ll;

inline ll Gcd(ll x, ll y) {
	if (!x || !y) return x + y;
	return !y ? x : Gcd(y, x % y);
}

inline ll Solve(ll a, ll b, ll c, ll n) {
	if (!a) return (n + 1) * (b / c);
	if (!n) return b / c;
	if (n == 1) return (a + b) / c + b / c;
	if (c < 0) return Solve(-a, -b, -c, n);
	register ll d = abs(Gcd(Gcd(a, b), c));
	a /= d, b /= d, c /= d;
	if (a >= c || b >= c) return Solve(a % c, b % c, c, n) + n * (n + 1) / 2 * (a / c) + (n + 1) * (b / c);
	if (a < 0 || b < 0) return Solve(a % c + c, b % c + c, c, n) + n * (n + 1) / 2 * (a / c - 1) + (n + 1) * (b / c - 1);
	register ll m = (a * n + b) / c;
	return n * m - Solve(c, c - b - 1, a, m - 1);
}

ll a, b, c, n;

int main() {
	scanf("%lld%lld%lld", &a, &b, &c), n = c / a;
	printf("%lld\n", Solve(-a, c + b, b, n));
    return 0;
}