It is up: http://apps.topcoder.com/wiki/display/tc/TCO+2013+Round+3B
It was a hard match to write, for some reason, even though 450 now looks very easy in hindsight.
Saturday, 6 July 2013
Subscribe to:
Post Comments (Atom)
Popular Posts
-
SRM 557 Explanation for division 1 Easy and match recap. Explanations for div2 easy and div2 medium. It feels like it has been ages since t...
-
I have finished writing the editorial for TopCoder SRM 589: http://apps.topcoder.com/wiki/display/tc/SRM+589 . As you most likely noticed. L...
-
Another week another Topcoder match. Not a great day. I had a bad flu and still do. Div1 500: The one with Xor Given a list of cards with nu... -
I figured I should post something about this SRM. I've been very busy these weeks because the semester is ending and I tried to win a t-...
-
While I wait for results, here is my perspective on this algorithm contest. It began with issues, it had to be postponed 15 minutes. TC has ...
-
Link to problem statement We got infinitely many bricks of dimensions 1x1x1 and C different colors. Count the number of towers of size 2x2... -
Finally solved it. It is a nice problem that is worth explaining in a post. You have a grid/board of at most 50x50 cells. Some cells contain...
-
So, let me explain a couple of problems from a Topcoder Member SRM that I wrote and never got an editorial. BTW, it was the last member SRM....
-
Saturday Morning Breakfast Cereal comics: Grace Hopper's ghost That Oracle engineer blog post Oracle would really not like anyone to se...
-
So it was a special round for coders of both divisions, problems ranged from the super easy problem A to the super difficult problems E,F,G....
0 comments:
Post a Comment