January 2014 Bronze Problem 2: Bessie Slows Down

Result: 1/10 *xxxxxxxxx

My solution is O(N log N), but I somehow made an error somewhere (probably rounding errors).

slowdown.cpp

January 2014 Bronze Problem 1: Ski Course Design

Result: 10/10 **********

My solution is O(N^2), but up to 83*99 iterations.

skidesign.cpp

December 2013 Bronze Problem 3: Wormholes

Result: incomplete

It's too difficult, but I had it partially done. Other partial work is in the recycling by now.

wormhole.cpp

December 2013 Bronze Problem 2: Cow Baseball

Result: 1/10 *xxxxxxxxx

N² log N time might be too slow.

baseball.cpp

December 2013 Bronze Problem 1: Record Keeping

Result: 10/10 **********

As long as there aren't any hash collisions, this is a fast solution.

records.cpp

November 2013 Bronze (Correction 2) Problem 1: Combination Lock

Result: 10/10 **********

This is more optimized than my previous correction though still in O(1) time.

combo2.cpp

November 2013 Bronze (Correction) Problem 1: Combination Lock

Result: 10/10 **********

Upon review, I beat the solution! Though N is no larger than 100, my solution runs in O(1) time and theirs runs in O(N^3) time.

combo2.cpp