Counting number of perfect squares in an subarrays

cs.stackexchange https://cs.stackexchange.com/questions/97283

题

A sequence is good if the bitwise AND of all its elements is a perfect square.

So counting number of "good" sequences, in a subarray .
For example : in [1, 2, 3]
There are 6 sub-sequences:

enter image description here

So there are 3 "good" sequences
Can you suggest an efficient approach to count them ?

没有正确的解决方案

许可以下： CC-BY-SA 和 归因
不隶属于 cs.stackexchange
scroll top