either solve this interesting problem or prove it is NP-Hard??

Правка en1, от gorssorser, 2024-01-21 15:44:40

you are given an Array A with N numbers, you will be dividing the array in two sets, such that if A[i] can only belong either to set 1 or set 2, you will take get a number x by taking or of all elements of set 1 and similarly a number y from set 2, you have to find the maximum value of X & Y.

(well i am not able to do either cause it is created by me only)

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский gorssorser 2024-01-21 15:45:46 22
en1 Английский gorssorser 2024-01-21 15:44:40 428 Initial revision (published)