Disclaimer: I didn't actually sit this contest live because the alarm I set for 3.30 am (time it started) didn't go off (zzz) and I woke up the next morning both disappointed but happy I got more than 2 hours of sleep. The question reinterpreted: We are given a character, Zoma (Z), who recieves commands from Mezo (M). Imagine a flat line (practically a number line, think one where you learn integer addition on) and Z beginning at 0. Z may move left, L, changing his position by -1. Z may move right, R, changing his position by +1. Input: Line 1 is an integer, I will denote by N. Line 2 is a string, the string of commands M gives to Z. For example: LRRL, RRLLR, LLLLL, RRRRL The catch is that not all of these commands may be executed and i commands can be ignored, 0 <= i <= n. Solving the problem: Notice that the order of the actions Z executes for each particular case does not matter, and does not determine his final end point. E.g LRRL == RRLL == LL...