A square triple $(a, b, c)$ is a triple of positive integers satisfying $a^2 + b^2 = c^2$.

Given an integer n, return the total number of square triples such that $1 \le a, b, c \le n$.

Constraints:

• $1 \le n \le 250$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.