Pairs of Integers
Time Limit: 2 Seconds
Memory Limit: 65536 KB
You are to find all pairs of integers such that their sum is equal to the 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 digit.
The input file consists of a single integer N (10 <= N <= 10^9).
On the first line of the output file write the total number of different pairs
of integers that satisfy the problem statement. On the following lines write
all those pairs. Write one pair on a line in ascending order of the first integer
in the pair. Each pair must be written in the following format:
X + Y = N
Here X, Y, and N, must be replaced with the corresponding integer numbers. There
should be exactly one space on both sides of '+' and '=' characters.
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed
by N input blocks. Each input block is in the format indicated in the problem
description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between
251 + 51 = 302
275 + 27 = 302
276 + 26 = 302
281 + 21 = 302
301 + 01 = 302
Source: Northeastern Europe 2001