1 cs61as-cl (Lewin Gan): 7 problems in 44152 sec. (9 submissions) 2 dnspies (David Spies): 7 problems in 49961 sec. (8 submissions) 3 cs61c-iq (James Li): 7 problems in 56334 sec. (8 submissions) 4 cs61a-ft (Yan Duan): 7 problems in 76571 sec. (13 submissions) 5 toriath (Ken Cheng): 6 problems in 61248 sec. (9 submissions) 6 ricshin (Eui Chul Shin): 6 problems in 62661 sec. (14 submissions) 7 cs70-al (Chenyu Zhao): 5 problems in 52200 sec. (9 submissions) 8 cs61b-gd (Wonjohn Choi): 5 problems in 59320 sec. (12 submissions) 9 cs61b-ct (Ben Sklaroff): 5 problems in 65861 sec. (11 submissions) 10 cs70-bp (Mehrdad Niknami): 3 problems in 30088 sec. (7 submissions) 11 cs61c-ez (Raphael Townshend): 3 problems in 34845 sec. (7 submissions) 12 cs188-iw (Alex Kaiser): 3 problems in 36253 sec. (7 submissions) 13 cs188-fc (Edwin Liao): 3 problems in 46371 sec. (9 submissions) 14 cs61b-ah (Samuel Ahn): 2 problems in 22024 sec. (4 submissions) 15 cs184-fo (Sergei Turin): 2 problems in 28800 sec. (3 submissions) 16 cs188-ow (Do Nguyen): 2 problems in 30195 sec. (2 submissions) 17 ctest-aa (Dmitry Kislyuk): 1 problems in 10802 sec. (1 submissions) 18 seshadri (Mahalingam Seshadri): 1 problems in 13372 sec. (2 submissions)
Successful entries show the number of attempts made to get a correct submission.
| Login | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
|---|---|---|---|---|---|---|---|---|
| cs184-fo | - | - | - | 2 | 1 | - | - | - |
| cs188-fc | - | 3 | - | - | 2 | 4 | - | - |
| cs188-iw | - | - | 2 | - | 1 | 4 | - | - |
| cs188-ow | 1 | - | - | - | - | - | 1 | - |
| cs61a-ft | 2 | 1 | 3 | 3 | 2 | 1 | 1 | - |
| cs61as-cl | 1 | 1 | 1 | 2 | 1 | 2 | 1 | - |
| cs61b-ah | - | - | 2 | - | 2 | - | - | - |
| cs61b-ct | - | 4 | 2 | 2 | 1 | 2 | - | - |
| cs61b-gd | 2 | - | 3 | 2 | 1 | 4 | - | - |
| cs61c-ez | - | - | 2 | 3 | 2 | - | - | - |
| cs61c-iq | 1 | 1 | 1 | 2 | 1 | 1 | 1 | - |
| cs70-al | - | 1 | 2 | 2 | 2 | 2 | - | - |
| cs70-bp | 1 | - | - | 3 | 3 | - | - | - |
| ctest-aa | - | - | - | 1 | - | - | - | - |
| dnspies | 1 | 1 | 1 | 1 | 2 | 1 | 1 | - |
| ricshin | - | 6 | 2 | 1 | 2 | 2 | 1 | - |
| seshadri | - | - | - | 2 | - | - | - | - |
| toriath | - | 1 | 1 | 1 | 1 | 4 | 1 | - |
Since 1991, the Computer Science Division has sponsored an informal programming contest each fall, the top placers of which form that year's Berkeley teams in the annual ACM International Collegiate Programming Contest (``ACM'' stands for the Association for Computing Machinery). Contests like this are becoming common. Here's an article on the subject.
As in the ACM contests, our contestants have five hours in which to write working solutions (in C, C++, or Java) to about eight programming problems. We score by the number of correct solutions, breaking ties on the basis of the total time required to complete the correct submissions and the number of incorrect submissions.
If you are interested in participating, watch for announcements on this page and elsewhere. In the meantime, we've provided some suggestions on how to prepare yourself for our local contest and the ACM contests.
Here are some problems that have been posed in other contests.
Page was last modified on Sat Sep 29 10:34:39 2012.