Question

Coding
Bob Hates Xors
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 element
You need to help Bob find the minimum number of elements he needs to change.
À
Problem Constraints
• 15KENS 10-
• OSA 220-1​

Answer 1

Answer:

I also want to know the answer.

Step-by-step explanation:

I also want to know the answer. I also want to know the answer. I also want to know the answer.