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.

0 Answers   Manhattan,

---

What is the merger sort principle and its time complexity.

0 Answers   Verifone,

---

WHAT IS MAIN IMPORTANT THING IN SOFTWARE?

0 Answers   Infosys,

---

hii I inntrested abt scjp certification but i dont knw abt scjp plz send details abt scjp exam and syllabus.

0 Answers  

---

what is adodb??y it is used for connection of V.B and access??what is ado?dao?

0 Answers   TCS,

---

what is the difference between SCAN AND CHECK,LOKUP AND XFOOT? where we can use thease opcodes? Can any body tell me real time senariao with example?

0 Answers  

---

what is the difference between conversion and interface in bdc?

1 Answers  

---

Code for display the images from drive using vb 6.0?

2 Answers   IBM,

---

What is std::auto_ptr?

1 Answers   Amazon,

---

write algo for cobol program whichuse three flat file to extract some specific information 8 marks mainframe

0 Answers  

---

please any one pass file aid,xpeditor and endeavor tools

0 Answers  

---

Why we need new operator in java at the time of object declaration and why not in c++?

1 Answers   Zensar,

---