CF660A.Co-prime Array

普及/提高-

通过率:0%

AC君温馨提醒

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

题目描述

You are given an array of nn elements, you must make it a co-prime array in as few moves as possible.

In each move you can insert any positive integral number you want not greater than 10910^{9} in any place in the array.

An array is co-prime if any two adjacent numbers of it are co-prime.

In the number theory, two integers aa and bb are said to be co-prime if the only positive integer that divides both of them is 11 .

输入格式

The first line contains integer nn ( 1<=n<=10001<=n<=1000 ) — the number of elements in the given array.

The second line contains nn integers aia_{i} ( 1<=ai<=1091<=a_{i}<=10^{9} ) — the elements of the array aa .

输出格式

Print integer kk on the first line — the least number of elements needed to add to the array aa to make it co-prime.

The second line should contain n+kn+k integers aja_{j} — the elements of the array aa after adding kk elements to it. Note that the new array should be co-prime, so any two adjacent values should be co-prime. Also the new array should be got from the original array aa by adding kk elements to it.

If there are multiple answers you can print any one of them.

输入输出样例

  • 输入#1

    3
    2 7 28
    

    输出#1

    1
    2 7 9 28
    
首页