CF453B.Little Pony and Harmony Chest
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Princess Twilight went to Celestia and Luna's old castle to research the chest from the Elements of Harmony.
A sequence of positive integers bi 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 bi which minimizes the following expression:
You are given sequence ai , 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 a1,a2,...,an ( 1<=ai<=30 ).
输出格式
Output the key — sequence bi 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