CF1788B.Sum of Two Numbers

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

The sum of digits of a non-negative integer aa is the result of summing up its digits together when written in the decimal system. For example, the sum of digits of 123123 is 66 and the sum of digits of 1010 is 11 . In a formal way, the sum of digits of a=i=0ai10i\displaystyle a=\sum_{i=0}^{\infty} a_i \cdot 10^i , where 0ai90 \leq a_i \leq 9 , is defined as i=0ai\displaystyle\sum_{i=0}^{\infty}{a_i} .

Given an integer nn , find two non-negative integers xx and yy which satisfy the following conditions.

  • x+y=nx+y=n , and
  • the sum of digits of xx and the sum of digits of yy differ by at most 11 .

It can be shown that such xx and yy always exist.

输入格式

Each test contains multiple test cases. The first line contains the number of test cases tt ( 1t100001 \le t \le 10\,000 ).

Each test case consists of a single integer nn ( 1n1091 \leq n \leq 10^9 )

输出格式

For each test case, print two integers xx and yy .

If there are multiple answers, print any.

输入输出样例

  • 输入#1

    5
    1
    161
    67
    1206
    19

    输出#1

    1 0
    67 94
    60 7
    1138 68
    14 5

说明/提示

In the second test case, the sum of digits of 6767 and the sum of digits of 9494 are both 1313 .

In the third test case, the sum of digits of 6060 is 66 , and the sum of digits of 77 is 77 .

首页