We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Bit Manipulation
  4. Sum vs XOR
  5. Discussions

Sum vs XOR

  • kumar_cse_576
     + 0 comments

    easy cpp

    long sumXor(long n) {
int no0=0;
while(n!=0){
    if(!(n&1))no0++;
    n=n>>1;
}
return pow(2,no0);
}