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.
What do you understand by SAP HANA?
What are different String functions available in PIG?
What r the functional testing u perform?
What resources are used when a thread created?
What are the advantages of rpa?
What is ec2 keypair and what is its scope.
Why git and not svn?
When maximum discharge is obtained in nozzle ?
What are the necessary things needed for writing database test cases?
Explain Keep method in Tempdata in ASP.Net MVC?
What is font colour in ms word?
What are the user groups?
What are the uses of maven plugins?
what are the two (2) parameters available in python map?
