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
- 1942 Views
- Manhattan, I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
what is inner class?
Can a method be static?
How to add and remove nodes in Jtree?
What is arraylist e?
What is meant by stack and queue?
What does int argc char * argv [] mean?
Explain the difference between comparator and comparable in java?
What are the advantages and disadvantages of object cloning?
What is rmi and steps involved in developing an rmi object?
what is difference between perfom() & excute() ?
What is map and hashmap in java?
What is the role of garbage collector in java?
Core Java 
