{"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$ green balls\n*   Blue boxes, each containing $B$ blue balls\n\nSnuke 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?\n\n## Constraints\n\n*   All values in input are integers.\n*   $1 \\leq R,G,B,N \\leq 3000$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$R$ $G$ $B$ $N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"diverta2019_b","tags":[],"sample_group":[["1 2 3 4","4\n\nFour triples achieve the objective, as follows:\n\n*   $(4,0,0)$\n*   $(2,1,0)$\n*   $(1,0,1)$\n*   $(0,2,0)$"],["13 1 4 3000","87058"]],"created_at":"2026-03-03 11:01:14"}}