Slashdot Mirror
Google Code Jam Winner Announced
Wild-eyed Visionary writes "According to the San Jose Mercury News, Jimmy Mardell, 25, of Stockholm, Sweden, beat out more than 5,000 coders to win $10,000 in Google's second annual
Code Jam programming contest.
Second place: Christopher Hendrie (Canada),
third place: Eugene Vasilchenko (Russia),
fourth place: Tomasz Czajka (Poland).
Tom Rokicki, of dvips/Radical Eye Software fame, was the oldest finalist at age 40."
The Google Code Jam winner was certainly famous for his skills a long time before this... even ordinary kids in my suburban high school new about Jimmy Mardell 8 years ago.
Jimmy Mardell was one of the pioneers of assembly programming for the TI calculators way back when. Without his ZTetris program (with two player link capability, no less!), high school math class would have been really boring for me.
I credit Jimmy Mardell's work for sparking my interest in game programming. It's good to see he's still on top of things.
for great justice, this sig has been moved
The easy problem was, given a topographic map (as an array of strings of the same length, with 'A' to 'Z' giving the heights), a point on the map, and a cardinal direction, return the farthest point visible in that direction from that point.
The medium problem was, given an array of integers representing the coefficients of a polynomial, return the largest root. Note that this is harder than it sounds because it's difficult to solve correctly just using Newton's method.
The hard problem was, given an integer n and a fixed, precisely defined set of keystrokes available in a hypothetical editor, return the minimum number of keystrokes required to produce exactly n copies of the same character. This required an efficient search and correct choice of state space.