A9469 | Little Pony and Harmony Chest
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Princess Twilight went to Celestia and Luna's old castle to research the chest from the Elements of Harmony.
A sequence of positive integers $b_{i}$ is harmony if and only if for every two elements of the sequence their greatest common divisor equals 1. According to an ancient book, the key of the chest is a harmony sequence $b_{i}$ which minimizes the following expression:
You are given sequence $a_{i}$ , help Princess Twilight to find the key.
A sequence of positive integers $b_{i}$ is harmony if and only if for every two elements of the sequence their greatest common divisor equals 1. According to an ancient book, the key of the chest is a harmony sequence $b_{i}$ which minimizes the following expression:
You are given sequence $a_{i}$ , help Princess Twilight to find the key.
输入格式
The first line contains an integer $n$ ( $1<=n<=100$ ) — the number of elements of the sequences $a$ and $b$ . The next line contains $n$ integers $a_{1},a_{2},...,a_{n}$ ( $1<=a_{i}<=30$ ).
输出格式
Output the key — sequence $b_{i}$ that minimizes the sum described above. If there are multiple optimal sequences, you can output any of them.
输入输出样例
输入 #1
5 1 1 1 1 1
输出 #1
1 1 1 1 1
输入 #2
5 1 6 4 2 8
输出 #2
1 5 3 1 8
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted