วีดีโอ

That is how ordered multiset works. Here is a place you can look: codeforces.com/blog/entry/88193

@@MrCoderPro No I am asking like you are first of all building a dp state for different curr,intelli inorder to get solution I got thae things when v[i] == 0 but I didnt get the point of deletion of upper bounds when v[i] >0 and v[i] < 0

ahhhh!! got it thank you your code was very easy to understand btw did you have any more links like that blog you sent for diffeent advanced data structure application.

It is to prevent overcounting.

You can look up the data structures with "codeforces blog", as Codeforces has good blogs about them. If you want me to make a blog, I can try to make one as well!

Thank you! I'm planning to extend to doing more videos outside of just Codeforces contests!

Sure, you can do that. It would be insane if you do a post contest discussion type. Like a full video.

@@himanshupokhriyal6883 I don't really understand what you mean by a post contest discussion video. Do you mean like a place to discuss problems and solutions? If you mean to make all the problems I have solved into one video, my concern is that people when they look up a specific problem, they won't be able to find it. I have all the problems for a single contest in a playlist however.

Like today the codechef contest went right. And you make a recorded video or Live that would be insane I feel.

@@himanshupokhriyal6883 Basically my reaction to the contest?

Sorry, will try better next time. Thanks!

I'm from the United States.

If you look at the samples and convert the numbers to input numbers to binary, you may notice a pattern. The outputs are always powers of 2, and the least significant bit is what you take 2 to the power of.

@@MrCoderPro then why did u take the lsb of x xor y

@@seanyong3399 I came up with that by looking at the samples.

Will do, thanks for the suggestion!

This is :) Will make more videos soon!