Cannot understand the editorial (INVZCNT)

[harry_122]

INVZCNT Editorial

PROBLEM LINK: Practice Contest Author & Editoralist: Jafar Badour Tester: Teja Reddy PROBLEM EXPLANATION You are given a sequence of non-negative integers A_1, A_2, \ldots, A_N. A pair (x, y), where 1 \le x \lt y \le N, is an inversion if A_x \gt A_y. You should answer Q queries (numbered 1 through Q). For each valid i, in the i-th query: You are given a non-negative integer K_i. Consider a sequence B_1, B_2, \ldots, B_N, where B_j = A_j \oplus K for each valid j. You should find the numb…

can someone explain me in easy way , how they are solving this problem.

[rituraj22]

I had previously written an unofficial editorial for the same at INVZCNT Unofficial editorial

[jafarbadour]

I think it’s better to point out the part you are not understanding rather than saying it’s not understandable

[harry_122]

thanks bro, now i fully understood.

[harry_122]

sorry sir, actually first time doing xor problem thats why i confused, but now understood,
nice editorial thanks.