RGB Boxes

AtCoder

IDdiverta2019_b

Time2000ms

Memory256MB

Difficulty—

Snuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes: * Red boxes, each containing $R$ red balls * Green boxes, each containing $G$ green balls * Blue boxes, each containing $B$ blue balls Snuke wants to get a total of exactly $N$ balls by buying $r$ red boxes, $g$ green boxes and $b$ blue boxes. How many triples of non-negative integers $(r,g,b)$ achieve this? ## Constraints * All values in input are integers. * $1 \leq R,G,B,N \leq 3000$ ## Input Input is given from Standard Input in the following format: $R$ $G$ $B$ $N$ [samples]

Samples

Input #1

1 2 3 4

Output #1

4

Four triples achieve the objective, as follows:

*   $(4,0,0)$
*   $(2,1,0)$
*   $(1,0,1)$
*   $(0,2,0)$

Input #2

13 1 4 3000

Output #2

API Response (JSON)

{
  "problem": {
    "name": "RGB Boxes",
    "description": {
      "content": "Snuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes: *   Red boxes, each containing $R$ red balls *   Green boxes, each containing $G$ gree",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "diverta2019_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Snuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes:\n\n*   Red boxes, each containing $R$ red balls\n*   Green boxes, each containing $G$ gree...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments