fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define ll long long int
  4. #define f(i,a,b) for(int i=a;i<b;i++)
  5. #define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);
  6. #define ld long long double
  7. #define T int t;cin>>t;while(t--)
  8. #define MOD 1000000007
  9. #define ex endl;
  10. #define F first
  11. #define S second
  12. #define P pair<int,int>
  13. #define PP pair<int,pair<int,int>>
  14. #define pb push_back
  15. #define in insert
  16. #define vec vector<int>
  17. #define vec2 vector<vector<int>>
  18. #define s(a,n) sort(a,a+n);
  19. #define sv(a) sort(a.begin(),a.end());
  20.  
  21. void swap(int* a,int* b)
  22. {
  23. 	int temp=*a;
  24. 	*a=*b;
  25. 	*b=temp;
  26. }
  27.  
  28. ll power(int x, unsigned int y) 
  29. { 
  30.     if (y == 0) 
  31.         return 1; 
  32.     else if (y % 2 == 0) 
  33.         return (power(x, y / 2) * power(x, y / 2))%MOD; 
  34.     else
  35.         return x * (power(x, y / 2) * power(x, y / 2))%MOD; 
  36. } 
  37. void solve()
  38. {
  39. 	int n;
  40. 	cin>>n;
  41. 	int a[n];
  42. 	int b[2*n];
  43. 	int k=0;
  44. 	f(i,0,n)
  45. 		cin>>a[i];
  46. 	f(i,0,n-1)
  47. 	{
  48. 		int gcd=__gcd(a[i],a[i+1]);
  49. 		if(gcd==1)
  50. 		{
  51. 			b[k++]=a[i];
  52. 		}
  53. 		else
  54. 		{
  55. 			b[k++]=a[i];
  56. 			b[k++]=1;
  57. 		}
  58. 	}
  59. 	b[k++]=a[n-1];
  60. 	cout<<k-n<<ex
  61. 	f(i,0,k)
  62. 		cout<<b[i]<<" ";
  63. 	cout<<ex
  64. }
  65.  
  66. int main()
  67. {
  68. 	FAST
  69.  
  70. 	solve();
  71. }
Success #stdin #stdout 0s 4412KB
comments (?)
stdin
copy 
3
2 7 28
stdout
copy 
1
2 7 1 28
https://ideone.com/PWC5Cv
language:
C++14 (clang 8.0)
created:
3 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!