CodeForces 660A Co-prime Array
来源:互联网 发布:张伯伦生涯数据 编辑:程序博客网 时间:2024/04/29 20:12
Description
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 addingk elements to it.
If there are multiple answers you can print any one of them.
Sample Input
32 7 28
12 7 9 28
在不互质的整数间添加1。
#include<cstdio>int gcd(int a,int b){if(a%b == 0)return b;elsereturn gcd(b,a%b);}int main(){int n;while(scanf("%d",&n)!=EOF){int i,j;int a[1100],b[1100];for(i = 1 ; i <= n ; i++){scanf("%d",&a[i]);}int ans=1,ant=0,k=0;for(i = 1 ; i < n ; i++){if(gcd(a[i],a[i+1]) != 1){ant++;}}printf("%d\n",ant);for(i = 1 ; i < n ; i++){printf("%d ",a[i]);if(gcd(a[i],a[i+1])!= 1)printf("1 ");}printf("%d\n",a[n]);}}
- Codeforces 660A Co-prime Array 【水题】
- CodeForces 660A Co-prime Array
- CodeForces-660A-Co-prime Array
- CodeForces 660A Co-prime Array
- codeforces 660A Co-prime Array
- 【codeforces 660 A Co-prime Array】
- CodeForces 660A Co-prime Array
- CodeForces 660A Co-prime Array
- 【codeforces】-660Co-prime Array
- Codeforces--660A--Co-prime Array(数学水题)
- CodeForces - 660A Co-prime Array (模拟)
- CodeForces 660 A. Co-prime Array【互质+思维】
- 【CodeForces】660A - Co-prime Array(水)
- Codeforces 660A:Co-prime Array(水题+思维)
- CodeForces 660A Co-prime Array(GCD)
- CodeForces 660A Co-prime Array(互质数列)
- 【Codeforces】-660A-Co-prime Array(数学)
- CodeForces 660A Co-prime Array (互质队列)
- Android桌面悬浮窗效果实现,仿360手机卫士悬浮窗效果
- CodeForces 554BOhana Cleans Up
- 安卓获取状态栏(Status Bar)高度
- CentOS-创建yum本地源
- HDU 1317 一路wa到西天
- CodeForces 660A Co-prime Array
- Redis学习(二)
- poj1321 dfs
- centos下LNMP网站应用环境的部署
- Unity Shader种类
- 大数据IMF传奇行动绝密课程第37课:Task执行内幕与结果处理解密
- 数据结构实验之排序六:希尔排序
- Logistic Regression 模型简介
- c/c++第十九天