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.
1946Post New Manhattan Core Java Interview Questions
How can return codes be tested before execution of a job step?
state the working of discharge lamp?
what is the size of informix page?
Explain selection sorting?
What is scope and visibility in PL/SQL?
Explain about a time when you discovered a more efficient way to do a work task?
Does google have something like access?
Explain 48 decision trees?
What is query optimizer in sql server?
What is middlewares? What is the concept of middlewares in Express.js?
Mention what are the points to be considered while performing sap interface testing?
Is it possible to share data files between different components?
How is UFT 11.5 version different from UFT 12.0?
Can I run windows 7 and windows 10 on the same computer?
How do I resize multiple boxes in powerpoint?