codeforces-894C

最新推荐文章于 2019-09-07 20:11:24 发布

Pei_1997

最新推荐文章于 2019-09-07 20:11:24 发布

阅读量466

点赞数

分类专栏：思维

本文链接：https://blog.csdn.net/Pei_1997/article/details/78579872

版权

思维专栏收录该内容

6 篇文章 0 订阅

订阅专栏

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.

分析：这题我做得时候是从1为切入点得，当给出得序列中有1得时候，那我只需要在给出序列的两两数据中插入1就可以了，这样得到的新序列

是肯定满足题意得。这样想思路是正确得，但我没有从1扩开去想，其实对于任意数A，只要它在给出序列得第一位（序列有序），那么这

个给出序列要想有解，那么其整体GCD(m个数求GCD）是肯定要等于A的，因为这个GCD是肯定<=A得，不等于A就是比A小，那么这个

GCD 肯定要包含在所求序列中，这就与题意矛盾了。

这道题暴露了我自己想问题不够透彻，能够想到解，但从特殊->一般做得不好，以后想问题还是要往深处想。

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MO=1000000007;
int gcd(int x,int y)
{
    if(x%y==0) return y;
    else return (gcd(y,x%y));
}
int ax[1050];
int main()
{
   int m,flag=0;
   cin>>m;
   for(int i=0;i<m;i++)
      cin>>ax[i];
   int temp=ax[0];
   for(int i=1;i<m;i++)
   {
       temp=gcd(temp,ax[i]);
   }
   if(temp==ax[0])
   {
       int index=0;
       printf("%d\n",2*m);
       for(int i=0;i<2*m;i++)
       {
           if(i)
            printf(" ");
           if(i%2==0)
            printf("%d",ax[index]),index++;
            else
                printf("%d",temp);
       }
   }
   else
   {
       printf("-1");
   }
  return 0;
}