数论

HDU 6129 Just do it

记一次打表没看出规律 Time Limit: 5000/2500 MS (Java/Others) There is a nonnegative integer sequence $ a_1...n$ of length $ n$. HazelFan wants to do a type of transformation called prefix-XOR, which means a1...n changes into b1...n, where bi equals to the $ XOR$ value of $ a_1,...,a_i$. He will repeat it for $ m$ times, please tell him the final sequence. (更多…)

luoyayu