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.
1991Post New Manhattan Core Java Interview Questions
Is there any demerits of using pointer?
What is workspace in go programming?
How to calculate approximate load loss of a distribution transformer by knowing %ge imp of transformer?
Mention what should be the approach for writing a bdc program?
Name some implementations of JAX-RS API?
Have You Worked Earlier? If yes then why did you leave that Company?
As a fresher in oracle finance can a get a job in oracle finance n what type of questions can they ask me as a fresher...oracle finance...
What is cdma? Explain the technology?
what is erp manufacturing perspective??
Is it possible to develop a single web application using ASP.NET webforms and ASP.MVC?
What is difference between selenium and QTP tools Which is best tool... Which is most used tool
What is command substitution?
Advantages/Disadvantages of earthing of neutral bus on MSB instead of separate neutral earthing for transformer/DG sets feeding to MSB
What is factory method in spring?
Why did lightening arrestor solid copper rod head is sharp on mobile tower top?