If anyone was wondering, here is my personal post about the 550 problem from yesterday's TopCoder round.
In summary, this problem required modular arithmetic and a trick I've seen used to solve the Coin Change Problem. Let me know if you have any comments or questions!