Interested to Buy Any Domain ? << Click Here >> for more details...
there are N number of matchboxes numbered 1...N.each
matchbox contain various number of stick.Two player can
alternatevely pick some amount of stick from the higest
stick containing box . The player is condidered win if
there is no stick after his move.Find the final move so
that the move player win.
Note:In case the number of stick is equal ,pick the stick
from the higest numbered box.
- 0 Answers
- 1954 Views
- Manhattan, I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Write a program in java to calculate the difference between the sum of the odd level and even level nodes of a binary tree.
Why java is used everywhere?
Where is the singleton class used?
Can a abstract class be declared final?
What environment variables do I need to set on my machine in order to be able to run java programs?
What is string immutability?
What are the notations in Java?
What value is a variable of the string type automatically initialized?
What is the format specifier?
What are the differences between processes and threads?
Is special character in java?
Can constructor be static or final?
Core Java 
