Thanks for the detailed explanation. This was very helpful.

Thanks for the reply, I understood the thing you said about the higher bit taking the priority. Since if one number has a bit ON and the some other has that very bit OFF than we don't really care about the bits on the right side. But I am not able to understand that why in this very particular problem we can't go from bit 0 to bit 30. Is it not consistent with the submasking procedure. Or is there something else? Am I missing some fundamental theory knowledge for submasking?

Spheniscine Can you explain why we start with the highest bit first rather than the lowest and then choose the next higher bit to check for it's feasibility in the final answer?

Didn't know electrical issues could screw up a contest. Well the round was supposed to be educational after all XD

Thanks you for the explanation. This one is really helpful.

Hey madlogic, I am quite confused with "the rest have 2 options", I don't understand how it goes with the sample test 1 in the problem statement. I read your solution; nicely written, and understood it quite well. But I am not able to understand how it goes with "the rest have 2 options". Where am I going wrong?

Adding the extra 0.01 (or even 0.001) works, but how does it work? 055D

I don't understand the meaning of the word "relaxed" here. Can you please explain Ji_Kuai

Thanks a lot!

Where can I find the proof of the recurrence relation in the "Throwing dice" editorial?

Ari Can you explain a little more about your approach to use monotonic deque in Div. 1 A? Like why it works for this problem? Thanks.

Monogon Irrespective of the fact that the contest is now unrated, I just want to say that it was a great problemset. Great Work. Hope to get more contests from you in the future :)

Integer Overflow.

You can do it like this, find the minimum sum that can be achieved using k non-negative integers, i.e. k*(k-1)/2. If the value (n-k)/2 is equal or greater that this sum then it is always possible to choose some distinct non-negative number in order to achieve this sum. My solution — https://mirror.codeforces.com/contest/1327/submission/78464332;

I hope to be an expert after this contest.

Um_nik, sir why there aren't any solution in the tutorials? I mean one could have a better understanding of the your tutorial after looking at a solution implementing the same idea as provided in the tutorial, I guess.

Can anyone tell me what's the mistake in my solution. it's an iterative one. https://atcoder.jp/contests/abc135/submissions/6591877

iamrk can you show your solution?