KMXOR - Editorial

[codes_do_speak]

i have further modified the code …
plz check …
… CodeChef: Practical coding for everyone…
i have got many WA …
…
plz help …
thnx in advance !!!

[l_returns]

HERE is my unofficial editorial(I have described whole soln there)
my solution was almost same as this editorial soln…

[l_returns]

try this test case and have a look at editorial(unofficial) if u r not missing anything(specially corner cases that I mentioned)…

[gautam1212]

I m getting right answers in all the test cases mentioned above.Please have a look.
1 1 1 1
1 1 1 1 1
1 2 1 1 1
2 1 1 1 1 1
3 1 1 1 1
2 1 1 1 1 1
1 2 12 1 1
8 7
8 7 1 1

[l_returns]

your logic and output seems correct… dk what does codechef found wrong

[l_returns]

post queries about what you didn’t understood in editorials… and also you can have a look at my editorial for this question

#HERE

[rkk_1]

Your editorial is not showing.

[l_returns]

KMXOR - Editorial (Unofficial) (As i know many of you were near to the solution and you r getting wrong answers)

Hello Coders, As I know many of you were near to solution but got wrong answers in this question. Here is my solution and you can even ask your doubts in your logic here… Problem link : [Contest(div1)][1] [Contest(div2)][2] [Practice][3] Author : [Yuri][4] DIFFICULTY: Easy Short description of problem : Making XOR of N elements as big as possible by using integers from 1 to K. Explaination : First of we need to know the most significant bit which is 1 in binary representation of number K (i…

Here is the new link
Previous link was not working because old discuss was replaced.

[copycoder1906]

Thanks for good editorial