Given a positive integer n, return the punishment number of n.

The punishment number of n is defined as the sum of the squares of all integers i satisfying $1 \leq i \leq$ n, such that the decimal string representation of $i imes i$ can be partitioned into contiguous substrings whose integer values sum to $i$.

Constraints:

• $1 \leq$ n $\leq 1000$

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.