시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 (추가 시간 없음) | 1024 MB (추가 메모리 없음) | 225 | 123 | 112 | 63.636% |
The sum of digits of a non-negative integer $a$ is the result of summing up its digits together when written in the decimal system. For example, the sum of digits of $123$ is $6$ and the sum of digits of $10$ is $1$.
In a formal way, the sum of digits of $\displaystyle a=\sum_{i=0}^{\infty} a_i \cdot 10^i$, where $0 \leq a_i \leq 9$, is defined as $\displaystyle\sum_{i=0}^{\infty}{a_i}$.
Given an integer $n$, find two non-negative integers $x$ and $y$ which satisfy the following conditions.
It can be shown that such $x$ and $y$ always exist.
Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 10\,000$).
Each test case consists of a single integer $n$ ($1 \leq n \leq 10^9$)
For each test case, print two integers $x$ and $y$.
If there are multiple answers, print any.
5 1 161 67 1206 19
1 0 67 94 60 7 1138 68 14 5
In the second test case, the sum of digits of $67$ and the sum of digits of $94$ are both $13$.
In the third test case, the sum of digits of $60$ is $6$, and the sum of digits of $7$ is $7$.
Contest > Codeforces > Codeforces Round 851 (Div. 2) B번