Programmer Think

Title Link Given a set of natural numbers \ (\ {a_1,a_2,\cdots a_n \} \) with an initial size of \ (n \), two operations are continuously carried out: if \ (x \) is in the set, add \ (2x \) to the set; If \ (x,y \) is in the set (allow \ (x=y \)), add \ (x\operatorname{xor}y \) to the set. Find how many numbers less than or equal to \ (m \) wi ...