HINTS AND SOLUTION TO SPOJ QUESTIONS

K-Query Online Link to the question :  KQUERYO HINT : Question can be easily solved with Segment Trees with vector.  Read more a...

Wandering Queen Link to the question :  QUEEN HINT : This question requires bfs as can be clearly understood from the tag. We st...

Professor Farouk Question Link to the question :  PROFF HINT : Just simple brute force.  Add one digit at a time from righ...

Buying Apples! Link to the question :  ABA12C HINT : This is a problem of unbounded knapsack.  We will maintain an array ans[ k+...

K-query Link to the question :  KQUERY HINT : PREREQUISITE : BINARY INDEXED TREE This is an offline approach.  Store the arra...

Prime Path Link to the question :  PPATH RECOMMENDED QUESTION: Try your hands on this permutation question :  QUESTION HINT :...

Morenas Candy Shop ( Easy ) Link to the question :  MORENA HINT : Think of dp solution. We check if a[i] is > or <...

Two squares or not two squares Link to the question :  TWOSQRS HINT : Logic seems very clear. Just we need check if the num...

BATMAN3 Link to the question :  BAT3   HINT : I would suggest you to try the longest increasing sub sequence problem first. ...

The Yellow Brick Road Link to the question :  YELBRICK   HINTS : Very simple ad-hoc question. Just find the gcd of the leng...