P23778 [AtCoder] Bichrome Cells
入门
题目描述

Problem Statement

We have an $N \times N$ square grid.
We will paint each square in the grid either black or white.
If we paint exactly A squares white, how many squares will be painted black?

Inputs

Input is given from Standard Input in the following format:
N
A

Outputs

Print the number of squares that will be painted black.

Constraints

  • $1 \leq N \leq 100$
  • $0 \leq A \leq N^2$

Sample Input 1

3
4

Sample Output 1

5

There are nine squares in $a 3 \times 3$ square grid.
Four of them will be painted white, so the remaining five squares will be painted black.

Sample Input 2

19
100

Sample Output 2

261

Sample Input 3

10
0

Sample Output 3

100

As zero squares will be painted white, all the squares will be painted black.

输入格式

见题面 Input 部分

输出格式

见题面 Output 部分

样例输入
3 4
样例输出
5