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.
2838Given: 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.
2484Post New Manhattan Interview Questions
Where is the exe file in windows 7?
netmeeting in vista
What are the different types of classifiers?
What is customize theme?
How to create select option as menu wise in apache-wicket?
What are the exceptions available in android?
What is the construction of a solar cell?
how to calculate 1:5:8 ratio concrete cement, sand, metal and water please give me brief calculation
How to interact with drupal search system?
What are the components of the java platform?
How Many Types Of Deployment Models Are Used In Cloud?
Explain in which level does the original movie resides? : adobe flex action script
what is KV and XV valve
Explain how you can add stuff to the classpath when running things in groovy or groovysh?
What does #value mean in vlookup?