CodeForces #114 Div.1 B Wizards abd Huge Prize

• Good DP Problem. It would get buggy easily. Make sure to define the recurrence equation accurately and not to misread the problem sentence.
• solution

CodeForces #121 Div.1 E Thwarting Demonstrations

• Too easy for “E” task.
• solution

POJ 1113 Wall

• Simple.
• solution

POJ 3246 Game

• This problem is bad. It has too weak testcases since my solution should not be passed(O(n^(5/3)logn)). The essence is how to calculate differences smartly.
• solution