One Mathematic Problem

Description

Gives a line $ax-cy+b(a,b\in \mathbb{N},c\in {\mathbb{N}}^{\ast })$ and an integer $n$, count the points $(x_0,y_0)(x_0,y_0\in \mathbb{N})$ following the two conditions below:

1. Under the specified line (including the ones on the line);
2. $x_0\le n$

Input Format

Test includes $t$ groups of data.
For one group of data, inputs a line including 4 integers $a$, $b$, $c$ and $n$.

Output Format

A line of one integer for each group of data, i.e. the count result.

Data Scale

As for 100% inputs, $1\le t\le 10^5$,
$a,b,c,n\le 10^7$

Solution

The count of points is in fact finding the summation expression:
$$\sum _{i=0}^n\lfloor \frac{ai+b}{c}\rfloor$$$$=\sum _{i=0}^n(\lfloor \frac{ai\mathrm{m}\mathrm{o}\mathrm{d}c+b\mathrm{m}\mathrm{o}\mathrm{d}c}{c}\rfloor +\lfloor \frac{a}{c}\rfloor i+\lfloor \frac{b}{c}\rfloor )$$
Construct a function $f(a,b,c,n)={\sum }_{i=0}^n\lfloor \frac{ai+b}{c}\rfloor$, therefore:
$$f(a,b,c,n)=f(ai\mathrm{m}\mathrm{o}\mathrm{d}c+b\mathrm{m}\mathrm{o}\mathrm{d}c,c,n)+\sum _{i=0}^n\lfloor \frac{a}{c}\rfloor i+\sum _{i=0}^n\lfloor \frac{b}{c}\rfloor$$So that, the answer can be found by recursions. Here is given the recursive expression of function $f(a,b,c,n)$ below:
$$f(a,b,c,n)=\sum _{i=0}^n\lfloor \frac{ai+b}{c}\rfloor$$$$=\sum _{i=0}^n\sum _{j=0}^{\lfloor \frac{ai+b}{c}\rfloor -1}1$$ Obviously, the inner summation cycles $\lfloor \frac{ai+b}{c}\rfloor -1$ times, which depends on the outer summation loop. So the inner condition is extracted into the expression:
$$=\sum _{i=0}^n\sum _{j=0}^{\lfloor \frac{an+b}{c}\rfloor -1}[j<\lfloor \frac{ai+b}{c}\rfloor -1]$$
Thereinto, the bracket expressions $[\dots ]$ means checking a condition. It has value $1$ if the condition is true, or $0$ otherwise.
Besides, the summation expressions can exchange the range when they are all independent:
$$=\sum _{j=0}^{\lfloor \frac{an+b}{c}\rfloor -1}\sum _{i=0}^n[j<\lfloor \frac{ai+b}{c}\rfloor -1]$$
Please pay attention to the condition expression inside. The inner summation cycles with variable $i$, but the condition judges variable $j$. So we do something to make it work on $j$:
$$j<\lfloor \frac{ai+b}{c}\rfloor -1$$$$\therefore j+1<\lfloor \frac{ai+b}{c}\rfloor \le \frac{ai+b}{c}$$ And then solve the equation of $i$, considering variable $j$ as a parameter:
$$i>\frac{cj+c-b}{a}$$ For $i$ is an integer, in the summation loop it has a starting value:
$$i>\frac{cj+c-b}{a}\ge \lfloor \frac{cj+c-b}{a}\rfloor +1$$ So the original expression of $f(a,b,c,n)$ turns out to be:
$$=\sum _{j=0}^{\lfloor \frac{an+b}{c}\rfloor -1}\sum _{i=\lfloor \frac{cj+c-b}{a}\rfloor +1}^{n}1$$$$=\sum _{j=0}^{\lfloor \frac{an+b}{c}\rfloor -1}(n-\lfloor \frac{cj+c-b}{a}\rfloor )$$$$=\sum _{j=0}^{\lfloor \frac{an+b}{c}\rfloor -1}n-\sum _{j=0}^{\lfloor \frac{an+b}{c}\rfloor -1}\lfloor \frac{cj+c-b}{a}\rfloor$$$$=n\lfloor \frac{an+b}{c}\rfloor -f(c,c-b-1,a,\lfloor \frac{an+b}{c}\rfloor -1)$$ In the function variables $a$ and $c$ is defined as divident and divisor, whose positions in parameter list are exchanged, taking after Euclid’s algorithm. In fact it can be proved that, this algorithm has the time complexity in $O({\log }_{2}n)$. So that this algorithm can be designed as recursive calls. The input data scale doesn’t beyond $10^9$ (below $2^{30}$), and the program would process data scale $O(t{\log }_{2}n)<3E^6$, using no more than 0.1s.