CF1633A.Div. 7

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

You are given an integer $n$ . You have to change the minimum number of digits in it in such a way that the resulting number does not have any leading zeroes and is divisible by $7$ .

If there are multiple ways to do it, print any of them. If the given number is already divisible by $7$ , leave it unchanged.

输入格式

The first line contains one integer $t$ ( $1 \le t \le 990$ ) — the number of test cases.

Then the test cases follow, each test case consists of one line containing one integer $n$ ( $10 \le n \le 999$ ).

输出格式

For each test case, print one integer without any leading zeroes — the result of your changes (i. e. the integer that is divisible by $7$ and can be obtained by changing the minimum possible number of digits in $n$ ).

If there are multiple ways to apply changes, print any resulting number. If the given number is already divisible by $7$ , just print it.

输入输出样例

输入#1
```
3
42
23
377
```
输出#1
```
42
28
777
```

说明/提示

In the first test case of the example, $42$ is already divisible by $7$ , so there's no need to change it.

In the second test case of the example, there are multiple answers — $28$ , $21$ or $63$ .

In the third test case of the example, other possible answers are $357$ , $371$ and $378$ . Note that you cannot print $077$ or $77$ .

首页