Square Investment

Problem Statement

Problem Description Bob and John both have N dollars each and want to invest some money in Jack. They will invest amounts i, j (1 <= i, j <= N). Jack has promised them a return of i * j. Bob and John will be happy if the return is a perfect square. Task: Calculate the number of pairs of investment (i, j) such that the return i * j is a perfect square. For example, if N = 4, the possible pairs (i, j) such that 1 <= i, j <= 4 and i * j is a perfect square are: (1, 1) because 1 * 1 = 1 (which is 1^2) (1, 4) because 1 * 4 = 4 (which is 2^2) (2, 2) because 2 * 2 = 4 (which is 2^2) (3, 3) because 3 * 3 = 9 (which is 3^2) (4, 1) because 4 * 1 = 4 (which is 2^2) (4, 4) because 4 * 4 = 16 (which is 4^2) In this case, there are 6 such pairs. Function description: Complete the function solution(). The function takes the following parameter and returns the solution: N: Represents the total amount. Input format for custom testing: Note: Use this input format if you are testing against c