AtCoder Beginner Contest 051
翻译中…
Problem Statement
翻译中…
You are given two integers $K$ and $S$.
Three variable $X, Y$ and $Z$ takes integer values satisfying $0≤X,Y,Z≤K$.
How many different assignments of values to $X, Y$ and $Z$ are there such that $X + Y + Z = S$?
翻译中…
Constraints
翻译中…
$2≤K≤2500$$0≤S≤3K$$K$and$S$are integers.
翻译中…
Input
翻译中…
The input is given from Standard Input in the following format:
翻译中…
K S
翻译中…
Output
翻译中…
Print the number of the triples of $X, Y$ and $Z$ that satisfy the condition.
翻译中…
样例
Input #1
2 2
Output #1
6
There are six triples of $X, Y$ and $Z$ that satisfy the condition:
- $X = 0, Y = 0, Z = 2$
- $X = 0, Y = 2, Z = 0$
- $X = 2, Y = 0, Z = 0$
- $X = 0, Y = 1, Z = 1$
- $X = 1, Y = 0, Z = 1$
- $X = 1, Y = 1, Z = 0$
Input #2
5 15
Output #2
1
The maximum value of $X + Y + Z$ is $15$, achieved by one triple of $X, Y$ and $Z$.
题目信息
题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。