Educational Codeforces Round 11A. Co-prime Array 数学

地址：http://codeforces.com/contest/660/problem/A

题目：

A. Co-prime Array

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an array of n 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 109 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 a and b are said to be co-prime if the only positive integer that divides both of them is 1.

Input

The first line contains integer n (1 ≤ n ≤ 1000) — the number of elements in the given array.

The second line contains n integers ai (1 ≤ ai ≤ 109) — the elements of the array a.

Output

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

The second line should contain n + k integers aj — the elements of the array a after adding k 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 a by adding kelements to it.

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

Example

input

3
2 7 28

output

1
2 7 9 28

思路：互质是两个数的最大公约数为1，即gcd（a，b）=1；

　　如果相邻两个数不是互质的话，插个1就好了（比赛时没想到1，插得是1—100内某一质数，（因为x<10^9，所以100内的质数绝对可以，因为乘积大于最大取值范围了）

　　代码：

 #include <iostream>
 #include <algorithm>
 #include <cstdio>
 #include <cmath>
 #include <cstring>
 #include <queue>
 #include <stack>
 #include <map>
 #include <vector>

 #define PI acos((double)-1)
 #define E exp(double(1))
 using namespace std;

 int a[];
 int b[];
 int prime[] = { ,,,,,,,,,,,,,,,, };

 int is_coprime(int a, int b)
 {
     int t = ;
     while (t)
     {
         if (b == )
             return ;
         t = a %b;
         a = b;
         b = t;
     }
     return ;
 }

 int main(void)
 {
     int n, k;
     while (scanf("%d", &n) == )
     {
         k = ;
         memset(b, , sizeof(b));
         for (int i = ; i <= n; i++)
             scanf("%d", &a[i]);
         for (int i = ; i<n; i++)
         {
             if (is_coprime(a[i], a[i + ]))
             {
                 b[k++] = a[i];
             }
             else
             {
                 b[k++] = a[i];
                 for (int j = ; j <= ; j++)
                     if (is_coprime(a[i], prime[j]) && is_coprime(a[i + ], prime[j]))
                     {
                         b[k++] = prime[j];
                         break;
                     }
             }
         }
         b[k] = a[n];
         cout << k - n << endl;
         for (int i = ; i<k; i++)
             printf("%d ", b[i]);
         printf("%d\n", b[k]);
     }
     return ;
 }