Problems
Someone just won the Code Jam lottery, and we owe them N jamcoins!
However, when we tried to print out an oversized check, we encountered a
problem. The value of N, which is an integer, includes at least one
digit that is a 4... and the 4 key on the keyboard
of our oversized check printer is broken.
Fortunately, we have a workaround: we will send our winner two checks for
positive integer amounts A and B, such that neither A nor B contains any
digit that is a 4, and A + B = N. Please help us find any
pair of values A and B that satisfy these conditions.
Input
The first line of the input gives the number of test cases, T. T test cases follow; each consists of one line with an integer N.
Output
For each test case, output one line containing Case #x: A B,
where x is the test case number (starting from 1), and
A and B are positive integers as described above.
It is guaranteed that at least one solution exists. If there are multiple solutions, you may output any one of them. (See "What if a test case has multiple correct solutions?" in the Competing section of the FAQ. This information about multiple solutions will not be explicitly stated in the remainder of the 2019 contest.)
Example
3
4
940
4444
Case #1: 2 2
Case #2: 852 88
Case #3: 667 3777
You must sign in to write code.