I hope that the late night debugging , early morning upsolving , day-night problem solving grind , gives you what you deserve :) this year. A very very happy new year all of you!!!

for n=30 and k=4 , it fails.. answer should be 29 27 23 15

Geometryforces!!! :(

xD

I made the array (p) 0 to r then started iterating from r (i=r to 0) , calculated the number x which has opposite bits of i (for example if i=9 (1001) then x=6 (110)) then swapped p[i] and p[x] , and also maintained boolean array (if a number is already swapped once then it will not swapped again). Hope it helps :P

though I guessed by intuition , each i from 1 to n-1 will have distance 2i , and n will have distance n. So the sequence would be like n , n-1 , n-2 , ..... , 1 , n , 1 , 2 , 3 , ..... n-1

Guessforces!

Hoping that the small baby in my DP (display picture not dynamic programming ^_^) will smile till end of September :).

lol sad

<1400 , above 1400 rating , you can participate , but you will be out of competition (basically unrated)

Hopefully I could be out of competition in the upcoming div4 :P