AtCoder Beginner Contest 087
翻译中…
Problem Statement
翻译中…
You have $A$ $500$-yen coins, $B$ $100$-yen coins and $C$ $50$-yen coins (yen is the currency of Japan). In how many ways can we select some of these coins so that they are $X$ yen in total?
翻译中…
Coins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.
翻译中…
Constraints
翻译中…
$0 \leq A, B, C \leq 50$$A + B + C \geq 1$$50 \leq X \leq 20$$000$$A$,$B$and$C$are integers.$X$is a multiple of$50$.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
A
B
C
X
翻译中…
Output
翻译中…
Print the number of ways to select coins.
翻译中…
样例
Input #1
2
2
2
100
Output #1
2
There are two ways to satisfy the condition:
- Select zero $500$-yen coins, one $100$-yen coin and zero $50$-yen coins.
- Select zero $500$-yen coins, zero $100$-yen coins and two $50$-yen coins.
Input #2
5
1
0
150
Output #2
0
Note that the total must be exactly $X$ yen.
Input #3
30
40
50
6000
Output #3
213
题目信息
题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。