Statement
This question is based on bonus of this problem.
Given $$$0 \leq S, T \leq 10^{18}$$$
We need to count such triple $$$(a, b, c)$$$ that satisfy $$$(0 \leq a + b + c \leq S)$$$ and $$$(0 \leq a \times b \times c \leq T)$$$
Notice that $$$(0, 0, 1) \neq (0, 1, 0) \neq (1, 0, 0)$$$
Example
Example 0
Example 1
Example 2
Example 3
Example 4
Example 5
Example 6
- Just to make it simpler to do the problem, you can use this brute-forces to generate small test cases
O(S^2) code to generate tests