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.
No Answer is Posted For this Question
Be the First to Post Answer
In JCl , we have COND parameter.This holds comparison code and condition.It also has only and even parameters. ex: COND((4,GE),EVEN).what the comma mean here. is that 'and' or 'or'.
what is runtime exception and compiletime exception ?
What is meant by STACK?
Explain polymorphism. Provide an example.
how to avoid java script validation in client side validation?
what is dynamic polymorphism?
A, B and C are 8 bit nos. They are as follows: A 1 1 0 1 1 0 1 1 B 0 1 1 1 1 0 1 0 C 0 1 1 0 1 1 0 1 Find ( (A-B) u C )=? how to solve this need with steps
what are the topics choosen for jam round for interviews
Hi guys... I have one doubt ..Exception is a runtime error then why we have checked exception... Thanks in advance
what are importance in problem tracking
What are the other ways to create an object with out calling new keyword in java?
WAP to print all prime nos between 1 to 100 without using user input...pls reply within few hours...