HackerRank

sikander441 8 years ago + 0 comments

i am pretty sure uwi is a wizard!

sikander441 8 years ago + 1 comment

Nim Nim Nim John and Kate should be doing something else!! :3

yoogee 8 years ago + 1 comment

will save us a lot of trouble too ;)

sikander441 8 years ago + 1 comment

plus it's more fun than Nim and no one loses!! :P

phildonnia 8 years ago + 0 comments

New problem: Each time you use the zero-move, remove one article of clothing. Determine which player has a winning strategy.

OliVogg 8 years ago + 2 comments

After 3 hours this problem finally showed me the generality of NIM-like games. Google Grundy number and work through the long explanations and you will suddenly have a new useless skill in life... :>

I dread the math we are going to have to do tomorrow...

akansh97531 8 years ago + 1 comment

[deleted]

OliVogg 8 years ago + 3 comments

Well now... if I told you that I would get a lot of downvotes ;)

Edit: LOL, looks like I will get downvotes no matter what I say here... :) OK, so here is all that I will say... try modelling the zero-sum state in a special way...

akansh97531 8 years ago + 0 comments

thanks a lot man!!, i was calculating it wrong :)

wesnerm 8 years ago + 0 comments

I got the correct solution, but I am intrigued by your comment. It seems like you came up with an alternate formula. I believe the one that I have is standard.

giaym 8 years ago + 0 comments

yeah that was a hint on a "hard" problem hence the downvotes, rather easy if you know what to do

christian_maech1 8 years ago + 1 comment

So frustratring until you figure it out... only took me 29 tries. For those asking for a link: https://www.hackerrank.com/topics/game-theory-and-grundy-numbers

tienducitt 8 years ago + 1 comment

I have find out the Nim game already, but I still can not figure out how zero-move make the game different? Any hint, guy?

jagadeesh52423 8 years ago + 0 comments

I too feeling the same. How can that 0 move can modify the answer?

ypahalajani 8 years ago + 2 comments

TC 1 and 2 passed long time ago.. Getting WA for rest :(

vikas5895 8 years ago + 1 comment

same

eduardovp 8 years ago + 1 comment

Try accounting for the zero-move.

yashLadha 8 years ago + 0 comments

failing in tc 3 only. help plz

xruzty 8 years ago + 1 comment

first I thought Grundy of a single pile subgame is 0 if n=0, or n+1 if n!=0.

But then, how to account for the fact that zero move can only be used once per pile per person ??!!

Any hints??

GT_18 8 years ago + 0 comments

same prob but i m not getting what's wrong in this??

ezio07 8 years ago + 2 comments

Im happy to have 70 points till now.As i know i cant even touch this and other upcoming ones.Lol

arunganesh1 8 years ago + 0 comments

same here. i just retired yesterday and came here only to see the discussions

ab_code 8 years ago + 2 comments

no need to comment if you dont want to touch this one! :P

ezio07 8 years ago + 1 comment

hackerrank pe bhi stalking :p

Psp98 8 years ago + 0 comments

same here..Hahaha..!

karansiwach360 8 years ago + 1 comment

Still his submissions aren't stopping :p

ezio07 8 years ago + 0 comments

Finding some "jugaad" to pass few testcases.Indeed,not a good coder like you. :p

Something went wrong!

Zero-Move Nim

Challenge Walkthrough

Review the problem statement

Choose a language

Enter your code

Test your code

Submit to see results