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.
2890Given: coordinates of rectangle-> left bottom and right top points. the rectangles create a hole.Find the maximum area of the hole. eg. 4 rectangles create a hole in between. find its area.
2542Post New Manhattan Interview Questions
To convert IDMS to DB2, how to deal with IDMS occurs and redefined clause?
What are the differences between sql override and update override?
What is the important part of JMS applications?
Explain what is backbone.js models?
How can you define field dependency? : salesforce admin
Why are global and device-level addressing systems necessary?
How would you relate spring mvc framework to mvc architecture?
What is the use of -l when listing a directory?
How will internal and external links be validated and updated? how often?
What is wpf textblock?
How do I upload a folder?
HOW ARE SAP FICO JOBS RIGHT NOW?
How do I change the default settings in word 2010?
How #define works?
What is the deal on sprintf_s return value?