GS Coding round question from 2018 . Help plz.

Правка en1, от sinmish, 2021-08-03 21:09:07

We are given an array of size N, we can delete a subset b1b2b3...bk from the array if 2^b1 + 2^b2 + …..2^bk = 2^x for non-negative integer x where ^ is the power operator. Find the minimum number of steps required to delete the complete array.

0 <= ai <= 1000000 1 <= N <= 1000000

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский sinmish 2021-08-03 21:09:40 4 Tiny change: ' 1000000\n1 <= N <' -> ' 1000000\n\n\n1 <= N <'
en1 Английский sinmish 2021-08-03 21:09:07 335 Initial revision (published)