Question

Problem Description
Bob has found an array A of size N.
Now he wants to change the array such that the Bitwise Xor of every K consecutive elements becomes 0.
You need to help Bob find the minimum number of elements he needs to change.​

Answer 1

Answer:

Sorry I dont dont know this answer plese tell me after you know this answer plese tell me after