You have an array \(A\) of length \(N\). You have to divide the array into atmost \(M\) consecutive segments such that the maximum bitwise OR of these segments is minimum.
Find the minimum possible maximum Bitwise OR of these segments if you divide optimally.
Input Format:
- The first line contains an integer \(T\), denoting the number of test cases.
- The first line contains two integers, \(N\) and \(M\).
- The next line contains \(N\) space-separated integers, elements of array \(A\).
Output Format:
For each test case, print the minimum possible maximum Bitwise OR of these segments if you divide optimally.
Constraints:
2 1 1 4 3 2 12 9 7
4 13
First test case:
We can divide \(A\) into \([4]\). Bitwise OR of these segments is \(4\). Hence, the answer is \(4\), which is the minimum possible.
Second test case:
We can divide \(A\) into \([12,9]\) and \([7]\). Bitwise OR of these segments is \(13,7\). Hence, the answer is \(13\), which is the minimum possible.
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Login to unlock the editorial
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor