Comments by Patricia Bianca Duka (Top 3 by date)

I need to write a program to find all pairs of integers such that their sum must be equal to a given integer number N and the second number results from the first one by striking out one of its digits. The first integer always has at least two digits and starts with a non-zero digit. The second integer always has one digit less than the first integer and may start with a zero.
Input
The first line of the input is an integer N, from 1 to 20, giving the number of test cases. This is then followed by N lines, containing one integer each, giving the desired sums (maximum of 5 digits each).
then the output shall commence only after the last test case (desired sum) had been inputted. For each test case, state how many pairs were found and list the pairs in equation form, one on each following line, as shown in the sample runs.
the list should be arranged in ascending order of the first addend.
and show leading 0’s to emphasize the number of digits of the second addend.