A15687 | Not Dividing
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given an array of $n$ positive integers $a_1, a_2, \ldots, a_n$ . In one operation, you can choose any number of the array and add $1$ to it.
Make at most $2n$ operations so that the array satisfies the following property: $a_{i+1}$ is not divisible by $a_i$ , for each $i = 1, 2, \ldots, n-1$ .
You do not need to minimize the number of operations.
Make at most $2n$ operations so that the array satisfies the following property: $a_{i+1}$ is not divisible by $a_i$ , for each $i = 1, 2, \ldots, n-1$ .
You do not need to minimize the number of operations.
输入格式
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 first line of each test case contains an integer $n$ ( $1\le n\le 10^4$ ) — the length of the given array.
The second line of each test case contains $n$ integers $a_1,a_2,\ldots,a_n$ ( $1\le a_i\leq 10^9$ ) — the given array.
It is guaranteed that the sum of $n$ over all test cases does not exceed $5\cdot 10^4$ .
The first line of each test case contains an integer $n$ ( $1\le n\le 10^4$ ) — the length of the given array.
The second line of each test case contains $n$ integers $a_1,a_2,\ldots,a_n$ ( $1\le a_i\leq 10^9$ ) — the given array.
It is guaranteed that the sum of $n$ over all test cases does not exceed $5\cdot 10^4$ .
输出格式
For each test case, print the answer on a separate line.
In the only line, print $n$ integers — the resulting array $a$ after applying at most $2n$ operations.
We can show that an answer always exists under the given constraints. If there are multiple answers, print any of them.
In the only line, print $n$ integers — the resulting array $a$ after applying at most $2n$ operations.
We can show that an answer always exists under the given constraints. If there are multiple answers, print any of them.
输入输出样例
输入 #1
3 4 2 4 3 6 3 1 2 3 2 4 2
输出 #1
4 5 6 7 3 2 3 4 2
In the first test case, the array $[4, 5, 6, 7]$ can be achieved by applying $2$ operations to the first element, $1$ operation to the second element, $3$ operations to the third element, and $1$ operation to the last element. The total number of operations performed is $7$ , which is less than the allowed $8$ operations in this case.
In the second test case, the array $[3, 2, 3]$ can be achieved by applying two operations to the first element. Another possible resulting array could be $[2, 3, 5]$ , because the total number of operations does not need to be minimum.
In the third test case, not applying any operations results in an array that satisfies the statement's property. Observe that it is not mandatory to make operations.
In the second test case, the array $[3, 2, 3]$ can be achieved by applying two operations to the first element. Another possible resulting array could be $[2, 3, 5]$ , because the total number of operations does not need to be minimum.
In the third test case, not applying any operations results in an array that satisfies the statement's property. Observe that it is not mandatory to make operations.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted