Algorithms Weekly by Petr Mitrichev
Friday, May 30, 2014
Coming up with tough dynamic programming solutions
›
Let’s talk about the hard problem from TopCoder SRM 619 . Consider two sequences of N (up to 100) integers, each integer between 1 and ...
Sunday, May 25, 2014
This week in competitive programming
›
First, let's return to the previous week's Friday and the Warm-up Round of Yandex.Algorthm 2014 ( results , top 5 on the left). Y...
Monday, May 19, 2014
This week in competitive programming
›
The last week had two tournament rounds. On Saturday, TopCoder Open 2014 Round 2A took place ( problems , results , top 5 on the left, my...
Monday, May 12, 2014
This week in competitive programming
›
This week had two TopCoder SRMs which brought very good but still very disappointing results for me - two second places :) But I enjoyed so...
Monday, May 5, 2014
This week in competitive programming
›
The week started with the final round of the Kotlin Challenge ( problems in Russian , results in Russian , top 5 on the left). The compet...
Monday, April 28, 2014
This week in competitive programming
›
TopCoder SRM 617 took place on Monday ( problems , results , top 5 on the left, my screencast ). Instead of sharing a problem to solve, I...
Monday, April 21, 2014
This week in competitive programming
›
On Wednesday, Codeforces ran a normal round with an unusual title: Russian Code Cup 2014 Warmup ( problems , results , top 5 on the left)...
‹
›
Home
View web version