1554C - Mikasa - CodeForces Solution


binary search bitmasks greedy implementation *1800

Please click on ads to support us..

C++ Code:

//ॐ नमः शिवाय
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
std::ios_base ::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
int T;
//T=1;
std::cin>>T;
for (int i1 = 1; i1 <= T;i1++)
{
    int n,m;
    cin>>n>>m;
    m+=1;
    int ans=0;
    for(int i=32;i>=0;i--){
        int bit1=n&(1LL<<i),bit2=m&(1LL<<i);
        if(bit1 && !bit2){
            break;
        }
        else if(!bit1 && bit2){
            ans+=(1LL<<i);
        }
    }
    cout<<ans<<endl;
}
    return 0;
}


Comments

Submit
0 Comments
More Questions

957. Prison Cells After N Days
946. Validate Stack Sequences
921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST
445. Add Two Numbers II
442. Find All Duplicates in an Array
437. Path Sum III
436. Find Right Interval
435. Non-overlapping Intervals
406. Queue Reconstruction by Height
380. Insert Delete GetRandom O(1)