codeforces 660A

本文介绍了一种算法,用于将给定数组转换为相邻元素互质的共质数数组。通过插入不超过10^9的正整数,实现数组的最小改动。文章详细解释了输入输出格式及示例。
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

#include<iostream>
#include<algorithm>
#include<cstring>
using  namespace std;
int  gcd(int a,int b)
{
    if(a%b==0)
    {
        if(b==1)return 1;
        else return 0;
    }
    else gcd(b,a%b);
}
int main()
{
    int n;
    while(cin>>n)
    {
        int  num[2010]={0};

        int flag=0;
        for(int i=0;i<n;++i)
            cin>>num[2*i];
        for(int i=0;i<2*n-2;i+=2)
        {
            if(num[i]==1||num[i+2]==1)
                continue;
            int a=max(num[i],num[i+2]);
            int b=min(num[i],num[i+2]);
            if(gcd(a,b)==0)
            {
                flag++;
                num[i+1]=1;
            }
        }
        cout<<flag<<endl;
        for(int i=0;i<=2*n-2;i++)
            if(num[i])cout<<num[i]<<" ";

        cout<<endl;

    }
    return 0;
}




评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值