Problem:
Score : 100 points

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?

Constraints

1 \leq N \leq 100

0 \leq A \leq N^2

Inputs

Input is given from Standard Input in the following format:

N
A

Outputs

Print the number of squares that will be painted black.

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.

Solution in Ruby (2.3.3) (judge verdict: Runtime Error)

a, b, c, d, e, f = gets.split.map{|x| x.to_i}

s = []
w = []
50.times do |i|
	50.times do |j|
		k = c * i + d * j
		s << k if k < f
		k = (a * i + b * j) * 100
		w << k if k <= f && k > 0
	end
end

maxPr = 0
sumA = 0
sumS = 0

w.each do |i|
	s.each do |j|
		if i + j <= f
			pr = j.to_f / (i + j)
			if pr > maxPr && j * 100 <= e * i
				maxPr = pr
				sumA = i + j
				sumS = j
			end
		end
	end
end

sumA = a * 100 if sumA == 0
print sumA, ' ', sumS