How many?

AtCoder

IDabc214_b

Time2000ms

Memory256MB

Difficulty—

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: $S$ $T$ [samples]

Samples

Input #1

1 0

Output #1

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.

Input #2

2 5

Output #2

Input #3

10 10

Output #3

Input #4

30 100

Output #4

API Response (JSON)

{
  "problem": {
    "name": "How many?",
    "description": {
      "content": "How many triples of non-negative integers $(a, b, c)$ satisfy $a+b+c \\leq S$ and $a \\times b \\times c \\leq T$?",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc214_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "How many triples of non-negative integers $(a, b, c)$ satisfy $a+b+c \\leq S$ and $a \\times b \\times c \\leq T$?\n\n## Constraints\n\n*   $0 \\leq S \\leq 100$\n*   $0 \\leq T \\leq 10000$\n*   $S$ and $T$ are in...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments