TC SRM 505
Funny contest, no problem solved, rating +26(1296). Remind yourself next time if the 250/300 is too hard take a shot at 500, and remember to favor math over string manipulation probs.
Codechef May 2011 Challenge
Tree product solved. Not so hard. Multiple TLE on the Great wall of Byteland. Haven't solved the issue.
May 4th, 2011
Yandex Open Quad I on Codeforces
Not bat, rank 385th, qualified for the next online round. 3/5 submitted, 2/3 right. First is really easy, but it seems that my brain got stuck. Look at the problem input as an stream helps sometimes, that is the important thing for this problem. For the 2nd, if read the statement carefully should be faster and easier to solve.
May 5th, 2011
Codechef May 2011 Challenge
The Great Wall of Byteland Solved. Instead of the O(n) recurrence algorithm, I computed a formula and used an O(logn) algo which worked. Sure the skill is growing, feeling happy for it.
The rest are just things I cannot remember. How time passes.
Comments (0)
