codeforce_894C_给你原序列所有连续子序列的GCD从小到大,求原序列_构造

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.

Sample Input
Input
4
2 4 6 12
Output
3
4 6 12
Input
2
2 3
Output
-1

mean
给你原序列所有连续子序列的GCD从小到大,求原序列_构造

ans

因为GCD(a)=a所以这个序列中的数都在原序列出现过,所以这个序列最小GCD=第一个数
如果输入序列的某几个数的公约数不在输入序列里面，这个答案就不对了，
比如 1 6 8，6和8可以求出公约数2，怎么能避免相邻数又生出新的公约数呢？就要插入某个数打断这种可能，

#include<bits/stdc++.h>
#define ll long long
const ll mod=(ll)1000000007;
using namespace std;
int gcd(int a,int b)
{
    return b==0? a:gcd(b,a%b);
}

int main()
{
    int  m,n,i,j;
    while(cin>>n)
    {
        int a[1111],f=0;
        for(i=0;i<n;i++)
        {
            scanf("%d",a+i);
            if(!i)
                f=a[i];
            else
                f=gcd(a[i],f);
        }
        if(f!=a[0])
            puts("-1");
        else
        {
            cout<<2*n<<endl;
            for(i=0;i<n;i++)
            {
                printf("%d %d",a[0],a[i]);
                if(i!=n-1)
                    cout<<" ";
                else puts("");
            }
        }
    }
    return 0;
}