Classical A+B Problem

시간 제한4초메모리 제한1024 MB

요약

4000자리 이하의 큰 양의 정수 n이 주어질 때, n = a + b를 만족하는 두 양의 렙디지트 a와 b를 찾는다.

난이도: 보통10점 중 7점
유형: 수학, 구현, 완전 탐색, 문자열 매칭
정답자: 아직 제출이 없습니다

문제

An integer is called a repdigit if it is positive and its decimal representation consists of repeated instances of the same digit. For example, $1$ , $666$ , $4444$ , and $999999$ are repdigits, while $0$ , $44244$ , $50216$ , and $787788$ are not.

You are given a positive integer $n$ . It is known that $n$ can be represented as $n = a + b$ , where $a$ and $b$ are repdigits. Find any such representation.

입력

Each test contains multiple test cases. The first line contains the number of test cases $t$ ( $1 \le t \le 10^4$ ). The description of the test cases follows.

The only line of each test case contains a single integer $n$ without leading zeros ( $2 \le n < 10^{4000}$ ). It is guaranteed that $n$ can be represented as $n = a + b$ , where $a$ and $b$ are repdigits.

It is guaranteed that the total number of digits in $n$ over all test cases does not exceed $10^5$ .

출력

For each test case, print two integers $a$ and $b$ such that $n = a + b$ and both $a$ and $b$ are repdigits.

If there are multiple solutions, print any of them.

예제1

예제 1

입력

6
2
786
1332
89110
2333333
10000000000000000000000000001

예상 출력

1 1
777 9
333 999
88888 222
2222222 111111
9999999999999999999999999999 2