#AT1870. B - How many?
B - How many?
B - How many?
Score : $200$ points
Problem Statement
How many triples of non-negative integers $(a, b, c)$ satisfy $a+b+c \leq S$ and $a \times b \times c \leq T$?
Constraints
- $0 \leq S \leq 100$
- $0 \leq T \leq 10000$
- $S$ and $T$ are integers.
Input
Input is given from Standard Input in the following format:
Output
Print the number of triples of non-negative integers $(a,b,c)$ satisfying the conditions.
1 0
4
The triples $(a,b,c)$ satisfying the conditions are $(0,0,0)$, $(0,0,1)$, $(0,1,0)$, and $(1,0,0)$ ― there are four of them.
2 5
10
10 10
213
30 100
2471