threeint Batch , stdin/stdout

Registered Users Only

Please login to utilize this feature.

Do note that this website only supports submissions in C++.

threeint.html

Title

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.

Sample Input 1

2 2

Sample Output 1

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

Sample Input 2

5 15

Sample Output 2

The maximum value of X + Y + Z is 15, achieved by one triple of X, Y and Z.

Subtasks and Limits

Subtask	Score	#TC	Time	Memory	Scoring
1	100	10	1s	256MB	Minimum
2	0	2	1s	256MB	Minimum

Judge Compile Command

g++-8 ans.cpp -o threeint -Wall -Wshadow -static -O2 -lm -m64 -s -w -std=gnu++17 -fmax-errors=512