SPOJ Solutions

GCPC11J - Time to live  is an easy BFS problem, which can be solved by applying BFS twice. If you are not familiar with the term Breadth Fi...

I am assuming that you have already understood the problem statement otherwise go back and read the problem statement once again:  PROBLEM ...

ONEZERO - Ones and zeros  is an easy BFS + Modular Arithmetic problem. I am assuming that you have already understood the problem stateme...

MCOINS - Coins Game  is an easy bottom-up DP problem. I am assuming that you have already understood the problem statement, otherwise go ...

This is an easy DP problem, which can be solved using bottom-up DP. Let us take an array a[] which keeps the number of coins ith monster ...

I am assuming that you have already understood the problem statement otherwise go back and read the problem statement once again: PROBLEM S...

I' am assuming that you've already understood the problem otherwise go back and read the problem once again :  PROBLEM STATEMENT . ...