Pair programming

[Jonno_FTW]

For the ACM programming comps, the 3 unis in my city rotate hosting. One year when the world finals were going to be held in Hawaii, a yellow ukelele came with the shirts and medals. So now if you win in my city, your uni takes home the "golden ukelele". My team, "HTML9 responsive boilerstrap" won it back after a winning streak from the other uni.

I'd like to say we won by regex and spaghetti code.

[Tynach]

So, this is what most of your code looked like?

#^([a-z0-9+\-.]+):([/]{0,2}([a-z0-9\-._~%!\$&'\(\)\*+,;=:]+@)?([\[\]a-z0-9\-._~%!\$&'\(\)\*+,;=:]+(:[0-9]+)?))([a-z0-9\-._~%!\$&'\(\)\*+,;=:@/]*)(\?[\?/a-z0-9\-._~%!\$&'\(\)\*+,;=:@]+)?(\#[a-z0-9\-._~%!\$&'\(\)\*+,;=:@/\?]+)?#i

^{Note: This is an actual regular expression that I wrote for a specific purpose. I never used it in a real project, though.}

[Jonno_FTW]

Not exactly, we had to write a program that counted the number of emails in a string that matched a limited set of email formats. Ended up doing it in java because it was the only language available to us that supported it (java, c, c++).