Algorithm Learning link __/summary/Knowledge points

1. Tree chain split: Portal 1
Transmission Door 2

2. Combination of various properties, theorem: Portal 1

3. Bit operation:

(1) Take out the integer n in the binary representation of the K-bit: (n>>k) & 1
(2) Remove the integer n in the binary representation of the 0~k-1 bit (after K-bit): N & ((1<<k)-1)
(3) Take the integer n in the binary representation of the K-bit counter: N xor (1<<k)
(4) to the integer n in the binary representation of the K-bit assignment 1:n | (1<<k)
(5) Assigning the K-bit value of integer N in binary notation 0:n & (~ (1<<k))

4. Tree-like array: Portal 1

5. Euler function: Portal 1
Transmission Door 2

6.FFT: Transmission Door 1