Codeforces Round #447 (Div. 2) C. Marco and GCD Sequence-CSDN博客

本文链接：https://blog.csdn.net/qq_37785469/article/details/78613618

In a dream Marco met an elderly man with a pair of black glasses. The man told him the key to immortality and then disappeared with the wind of time.

When he woke up, he only remembered that the key was a sequence of positive integers of some length n, but forgot the exact sequence. Let the elements of the sequence be a1, a2, ..., an. He remembered that he calculated gcd(ai, ai + 1, ..., aj) for every 1 ≤ i ≤ j ≤ n and put it into a set S. gcd here means the greatest common divisor.

Note that even if a number is put into the set S twice or more, it only appears once in the set.

Now Marco gives you the set S and asks you to help him figure out the initial sequence. If there are many solutions, print any of them. It is also possible that there are no sequences that produce the set S, in this case print -1.

Input

The first line contains a single integer m (1 ≤ m ≤ 1000) — the size of the set S.

The second line contains m integers s1, s2, ..., sm (1 ≤ si ≤ 106) — the elements of the set S. It's guaranteed that the elements of the set are given in strictly increasing order, that means s1 < s2 < ... < sm.

Output

If there is no solution, print a single line containing -1.

Otherwise, in the first line print a single integer n denoting the length of the sequence, n should not exceed 4000.

In the second line print n integers a1, a2, ..., an (1 ≤ ai ≤ 106) — the sequence.

We can show that if a solution exists, then there is a solution with n not exceeding 4000 and ai not exceeding 106.

If there are multiple solutions, print any of them.

Note

In the first example 2 = gcd(4, 6), the other elements from the set appear in the sequence, and we can show that there are no values different from 2, 4, 6 and 12 among gcd(ai, ai + 1, ..., aj) for every 1 ≤ i ≤ j ≤ n.

题目链接：点击打开链接

题意：能否找到一个a集合使得 gcd(ai, ai + 1, ..., aj) for every 1 ≤ i ≤ j ≤ n 成为 s集合。

题解：判断他们所有的数的gcd是否小于a[1],若小于则说明无解，否则将他们的所有的数的gcd插入到每个数的中间。

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
#define mod 1000000007
#define N 2000
#define LL long long
LL ex_pow(LL n,LL k) {
    LL ans=1,base=n;
    while(k) {
        if(k&1) {
            ans=ans*base%mod;
        }
        base=base*base%mod;
        k>>=1;
    }
    return ans;
}

int a[N];
int vis[N * 1000];
int main()
{
    int n, m;
    scanf("%d", &n);
    int sum = n;
    int flag = 0;
    for(int i = 1; i <= n; i++)
        scanf("%d", &a[i]);

    for(int i = n; i >= 1; i--) {
        if(i == n)
            m  = a[i];
        else {
            m = __gcd(a[i], m);
            if(m < a[1]) {
                flag = 1;
                break;
            }
        }
    }
    if(flag)
        printf("-1\n");
    else {
        printf("%d\n", 2 * n + 1);

        for(int i = 1; i <= n; i++) {
                printf("%d %d ", a[1], a[i]);
        }
        printf("%d\n", a[1]);
    }
    return 0;
}