【codeforces 660 A Co-prime Array】
2016-08-22 20:14
393 查看
Co-prime Array
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 adding k elements to it.
If there are multiple answers you can print any one of them.
Sample Input
Input
3
2 7 28
Output
1
2 7 9 28
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 adding k elements to it.
If there are multiple answers you can print any one of them.
Sample Input
Input
3
2 7 28
Output
1
2 7 9 28
#include<cstdio> const int INF=0x3f3f3f3f; int pa[1011]; int st[2022]; int LCM(int x,int y) { int pl; while(x%y) { pl=x; x=y; y=pl%y; } //printf("---%d---\n",y); return y; } int main() { int i,N,ml,j,ans,pl; scanf("%d",&N); for(i=1;i<=N;i++) scanf("%d",&pa[i]); ml=1;ans=0; st[1]=pa[1]; for(i=2;i<=N;i++) { if(LCM(pa[i],pa[i-1])==1) { st[++ml]=pa[i]; //printf("---%d---\n",st[ml]); } else { ans++; st[++ml]=1; st[++ml]=pa[i]; } } printf("%d\n",ans); for(i=1;i<ml;i++) printf("%d ",st[i]); printf("%d\n",st[ml]); return 0; }
相关文章推荐
- CodeForces 660 A. Co-prime Array【互质+思维】
- CodeForces 660A Co-prime Array
- CodeForces 660ACo-prime Array
- CodeForces-660A-Co-prime Array
- Codeforces 660A Co-prime Array 【水题】
- codeforces-660【思维】
- CodeForces 660A Co-prime Array(GCD)
- CodeForces 632B Co-prime Array 【GCD(互质)】
- codeforces 660A A. Co-prime Array(水题)
- 暑假第一周 D CodeForces 660 B.
- CodeForces 660A Co-prime Array
- codeforces 660B B. Seating On Bus(模拟)
- CodeForces 660 B. Seating On Bus【模拟】
- 暑假第一周 C . CodeForces 660A Co-prime Array
- 【codeforces】-660Co-prime Array
- Codeforces--660A--Co-prime Array(数学水题)
- codeforces 660A Co-prime Array
- codeforces 660D D. Number of Parallelograms(计算几何)
- Codeforces 660 C. Hard Process (尺取)
- 【CodeForces】660A - Co-prime Array(水)