Hello Codeforces Community!

Today I get to find an amazing site OpenGenus to learn various algorithms, data structures and other technology related stuffs. This site is an open source community hence, you can either start a discussion on topic or write blogs, contribute on this site.

One of the amazing things about OpenGenus is that the site has its own search engine which is pretty fast. You can search about almost any algorithm within seconds.

Because I didn't find any related blogs on codeforces about this site, hence I have shared this with you all.

Hey guys! I am writing this blog because I am pissed on Codeforces Community.

Though platform is one of the best and popular online judge platforms. The contests held are really amazing. The quality of problems, the response time of site during contest are great. The editorials are super fast, short and precise.

But when it comes to asking doubts and problems I don't understand why people like to downvote others. Have no/low rating done something wrong? Many top rated coders get upvotes on shitty posts(I am not saying they never get downvotes). I think community just thinks that every low rated coders doubts are bullshit and can always be found on google.

But hey I try to spend 2/3 days to understand something. Try to read blogs and papers about it. When I couldn't understand something I try to ask it in a blog form so that the doubt and its answers will be available on internet for others who faces problems like me. I could have always asked anyone personally but I believe its worth sharing doubt because others might have same doubt too.

I think that's why coders create fake IDs just to comment or ask doubts so that they don't get downvotes. I know it wouldn't really affect there coding or rating if they get downvotes.

No offence to top rated coders. Your blogs are really helpful.

If you agree you comment down for upvotes.

PS: I am fond of writing blogs and editorials. So if I get enough votes I will try to write blogs from this ID.

(Downvote this blog if you like)

I don't understand for 1, 1, 1 XOR is not 0 but it is a winning position. I know how Nim game where last mover wins works but I am having hard time to understand this version.

Also, how to know which position is a winning position like in other version we see that when piles are empty XOR is 0 hence, XOR 0 is winning position.

Source

Can someone help in telling logic behind the logic of this code for this problem.

I found it difficult to implement brute force logic in Java.

Thanks