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
- 1566 Views
- Manhattan, I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
What is numeric function?
how to use this key word in java programming?
What is Java Classloader?
1 Answers Phantom Technologies,
What is boolean flag in java?
Which package has light weight components in java programming?
What do you understand by looping in java? Explain the different types of loops.
How many types of methods are there?
Is java 11 paid version?
What is number data type?
What data structures are used to perform recursion?
0 Answers Akamai Technologies,
What is difference between length and length() method in java ?
which one is more efficient int x; 1. if(x==null) 2.if(null==x) state which one either 1 or 2?
Core Java 
