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.
2422Given: 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.
1969Post New Manhattan Interview Questions
What MEPs is supported by WCF?
When is the top-of-page event triggered? : abap data dictionary
What are the advantages of wcf?
where v see useful video in electronic circuits? which site it is free for download?
Differentiate between a constructor and a destructor in c++.
What is session scope in spring?
Explain try, raise, and finally?
How do you delete a file using node.js?
a program using one dimensional array that searches a number if it is found on the list of given input numbers given by the user and locate its exact location in the list.
why not instantiating servet using new operator?
Give a relationship between concept, Hypothesis and Theory. What are the Salient features and classifications?
Explain what is bug triage?
What is the advantage of c?
What are tags for?
How can you create visualforce page in salesforce? : salesforce visualforce