Algorithms Weekly by Petr Mitrichev

Warsaw greeted us with strange-looking clouds and friendly ICPC volunteers who took us to a bus to our hotel. We drove through some calm Wa...

(on pic: inside Sheremetyevo airport) I'm heading to Warsaw to see the 36th ACM ICPC World Finals ( Factsheet , Teams ). First of...

A live interview with myself, Tomek Czajka, Onufry Wojtaszczyk and Bartholomew Furrow is scheduled for 7pm Moscow time today (in other tim...

16:29 - and it’s over, and I guess so is this coverage. Thanks for following! Thanks a lot to TopCoder, to all organizers and problem prepa...

The most prestigious event for individual algorithmic programmers is taking place right now in Hollywood, Florida - it's TopCoder Open 2...

14:51 - The results have been announced. ainu7’s 600, Kankuro’s 900 and ACRush’s 250 and 900 failed. [[iwi]], rng_58 and ACRush advance to t...

The bounded knapsack problem is: you are given n types of items, you have u i items of i-th type, and each item of i-th type weighs w i a...