fork(1) download
  1. #include <bits/stdc++.h>
  2. #include <ext/pb_ds/assoc_container.hpp>
  3. #include <ext/pb_ds/tree_policy.hpp>
  4.  
  5. #define tr(v,it) for(auto it=v.begin(); it!=v.end(); it++)
  6. #define mp(x,y) make_pair(x,y)
  7. #define pb(x) push_back(x)
  8. #define fs first
  9. #define sc second
  10. #define endl "\n"
  11. #define mod 1000000007
  12. #define pie 3.141592653589793
  13. #define INF 1e18
  14. #define ll long long int
  15. #define all(v) v.begin(),v.end()
  16. #define vi vector<ll>
  17. #define pi pair<ll,ll>
  18. #define vii vector<pi>
  19. #define ByFaizanAli ios::sync_with_stdio(0),cin.tie(0)
  20. #define ThankYou return 0
  21. using namespace std;
  22.  
  23. int main()
  24. {
  25. //freopen("input.txt","r",stdin);
  26. //freopen("output.txt","w",stdout);
  27. ByFaizanAli;
  28. // string n;
  29. ll t;
  30. cin>>t;
  31. while(t--)
  32. {
  33. ll n,i,j,k;
  34. cin>>n;
  35. ll a[n+1];
  36. for(i=0;i<n;i++)
  37. cin>>a[i];
  38. ll z=0;
  39. if(n==1)
  40. {
  41. cout<<"0"<<endl;;
  42. cout<<a[0]<<endl;
  43. continue;
  44. }
  45. for(i=0;i<n;i++)
  46. {
  47. ll c=1;
  48. for(j=0;j<n;j++)
  49. {
  50.  
  51. if(i!=j)
  52. {
  53. if(__gcd(a[i],a[j])==1)
  54. {
  55. c=0;
  56. break;
  57. }
  58. }
  59. }
  60. if(c)
  61. {
  62. z=1;
  63. if(a[i]==47)
  64. a[i]=43;
  65. else
  66. a[i]=47;
  67. break;
  68. }
  69. }
  70. cout<<z<<endl;
  71. for(i=0;i<n;i++)
  72. {
  73. cout<<a[i]<<" ";
  74. }
  75. cout<<endl;
  76. }
  77.  
  78.  
  79.  
  80. ThankYou;
  81.  
  82. }
Success #stdin #stdout 0s 15232KB
stdin
1
6
7 14 21 28 35 2
stdout
1
7 47 21 28 35 2