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.
eg: 3 box contain stick as:1,1,1.
if u take 1 stick from 3rd numbred box you will any how win
the match.
- 0 Answers
- 2888 Views
- Manhattan, I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Outline the two important features of a terminating recursion. Any ideas?
5. How do you round the addition or subtraction of two numbers in assembler?
£¢®£ž›;=9:B9<::C = ADITHI HOW TO GET?
what is the current salary package in India for a lamp programmer
what is the maximam caption size of lebel
Artficial language is provided which of the language?
what is the work of 1tier,2tier,&ntier? Plz Explain it!
For a binary tree with n nodes, How many nodes are there which has got both a parent and a child?
Difference between debugging, running, executing of an application
Fortran cannot have value by reference True or False?
What is a dialog based program
How you ll create customizing Tcode.
C 
