Help with Problem involving XOR

Правка en3, от deepkamal, 2020-12-07 17:42:57

How to solve the following problem ? Given an array of size N having integer elements A[1], A[2] , …, A[N] find the maximum value of ( (A[1] xor X) + (A[2] xor X) + (A[3] xor X)+ … + (A[N-1] xor X) + (A[N] xor X) ) for some X belonging to [L,R] . constraints- N <= 100000, 1 <= A[i], L, R <= 1000000000 .

Теги #bit, #help

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский deepkamal 2020-12-10 19:45:52 75
en3 Английский deepkamal 2020-12-07 17:42:57 1 Tiny change: ' <= 100000\n1 <= A[i' -> ' <= 100000,\n1 <= A[i'
en2 Английский deepkamal 2020-12-07 17:41:51 5 Tiny change: 'an array on size of N having ' -> 'an array of size N having '
en1 Английский deepkamal 2020-12-07 17:41:11 342 Initial revision (published)