1270C - Make Good - CodeForces Solution


bitmasks constructive algorithms math *1400

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
 ll t;
 cin>>t;
 while (t--)
 {
   ll n;
   cin>>n;
   vector<ll>vec;
   ll sum=0;
   ll pxor=0;
   for (ll i = 0; i < n; i++)
   {
     ll x;
     cin>>x;
     sum+=x;
     pxor=(pxor^x);
   }

   cout<<3<<endl;
   cout<<pxor<<" "<<(pxor+sum)<<" "<<0<<endl;
   
 }
 
 return 0;
}


Comments

Submit
0 Comments
More Questions

545B - Equidistant String
1244C - The Football Season
1696B - NIT Destroys the Universe
1674A - Number Transformation
1244E - Minimizing Difference
1688A - Cirno's Perfect Bitmasks Classroom
219A - k-String
952A - Quirky Quantifiers
451B - Sort the Array
1505H - L BREAK into program
171E - MYSTERIOUS LANGUAGE
630D - Hexagons
1690D - Black and White Stripe
1688D - The Enchanted Forest
1674C - Infinite Replacement
712A - Memory and Crow
1676C - Most Similar Words
1681A - Game with Cards
151C - Win or Freeze
1585A - Life of a Flower
1662A - Organizing SWERC
466C - Number of Ways
1146A - Love "A"
1618D - Array and Operations
1255A - Changing Volume
1710C - XOR Triangle
415C - Mashmokh and Numbers
8A - Train and Peter
591A - Wizards' Duel
1703G - Good Key Bad Key