Consider an integer and positive number that has n digits. Separate the square of the number into two parts, the first one on the right has d digits and the second on the left has d or d-1 digits.
Add these two numbers and check if their sum is equal to the original number n.
- Examples 9 (92 = 81, 8 + 1 = 9), 45 (452 = 2025, 20 + 25 = 45).
Write a program in C language that will insert into a one-dimensional array all these numbers meet the above property and are less than 100. The algorithm will display the table at the end
as well as the number of its elements.