search

soorabsoni / Competitve-Programming

Happy Problem Solving
MIT License
0 stars 16 forks source link

MEX-OR | CodeChef Problem #29

Open kartik-ey1 opened 3 years ago

kartik-ey1 commented 3 years ago

The MEX (minimum excluded) of an array is the smallest non-negative integer that does not belong to the array. For instance:

The MEX of [2,2,1] is 0, because 0 does not belong to the array. The MEX of [3,1,0,1] is 2, because 0 and 1 belong to the array, but 2 does not. The MEX of [0,3,1,2] is 4 because 0,1,2 and 3 belong to the array, but 4 does not. Find the maximum possible MEX of an array of non-negative integers such that the bitwise OR of the elements in the array does not exceed X

link- https://www.codechef.com/OCT21C/problems/MEXOR

This a medium level problem based on solving skills. I want to contribute in this

kartik-ey1 commented 3 years ago

please assign it to me!

soorabsoni commented 3 years ago

Assigned it to you!