# UKSPC 2004 » Results

October 8, 2004
33 participants
4 problems plus one extra
Congratulations to every participant.
Special congratulations to solvers of 4 and 3 problems.
I will be forming teams this week and some of you will be invited to
participate in practices leading to November 6, 2004 Mid-Central Regionals.
There are strict eligibility rules for the participants, specifically for
graduate students, so possibly not everyone listed below may represent
UK in the regionals of the ACM contest.
Here are the scores sorted in descending order. The format is:
guest N: P, penalty, name
where P is the number of correctly-answered problems and penalty is
defined by:
penalty(N) = sum_{P: N solved P correctly} (time(P) + 20*60*rej(P))
where time(P) is the number of seconds after 17:00 (csurs4 time) when N's
correct solution to problem P was submitted; and rej(P) is the number
of solutions N submitted for problem P which were rejected.
I will write separatelly to distribute prizes to the participants
and to invite for practices.
Only students who solved at least one problem are listed.
guest 24: 4, 18273 - Joseph W. Ibershoff
guest 10: 3, 6883 - Steven Walter
guest 08: 3, 9113 - Kyle Vogel
guest 04: 3, 15488 - Stephen duBarry
guest 22: 3, 16343 - Santosh Cheekatmalla
guest 06: 3, 17431 - Isahiah Damron
guest 18: 3, 22598 - Drew Duncan
guest 11: 2, 10021 - Levon Ter-Isahakyan
guest 25: 2, 10749 - Jesse Stewart
guest 21: 2, 11915 - Zhang Zhen
guest 16: 2, 14194 - Eren Turgay
guest 19: 2, 16983 - Victor Ivanov
guest 28: 1, 6023 - William Berry
guest 20: 1, 10406 - Dai Peng
not all of the guest numbers below were actually used.
guest 02: 0, 0
guest 03: 0, 0
guest 05: 0, 0
guest 07: 0, 0
guest 09: 0, 0
guest 12: 0, 0
guest 13: 0, 0
guest 14: 0, 0
guest 15: 0, 0
guest 17: 0, 0
guest 23: 0, 0
guest 26: 0, 0
guest 27: 0, 0
guest 29: 0, 0
guest 30: 0, 0
guest 31: 0, 0
guest 32: 0, 0
guest 33: 0, 0
guest 34: 0, 0
guest 35: 0, 0
guest 36: 0, 0
guest 37: 0, 0
guest 38: 0, 0
guest 39: 0, 0
Per-problem statistics (number of correct solutions)
Words: solved 9 times
k-sequence: solved 10 times
GCD: solved 12 times
assembly: solved 3 times