Fifth BU ACM Contest
February 12th, 2007
sponsored by
February 12th, 2007
sponsored by
Message from the contest committee chair
This was my first contest as the contest committee chair, and it was the first one for this semester. Other than a minor printing center problem, things went fairly well, and we had over fifteen competitors.
I thought that the problems were fair other than the second one, which may have been a little to big for a two hour contest. I am not sure if it was the fact that the problems were not printed out or it was my poor English, but I was surprised at the amount of people that got one problem done. Problem 4 was by far the easiest and had the most submissions. You just needed to find the two factors of a number and then return the multiple of one less than each of them. Next would probably be problem 1, which used the greedy algorithm with limits and and had a light that you had to say was on whenever those limits were met. After that the next hardest I would consider problem 6, but many would disagree. It was a simple parsing problem that could be done with a stack. Then problem 5, which was not originally created by me, but taken from an ACM Regional and slightly modified. Where two people made a simple grid-based encoding scheme, and you had to convert a given cryptic message to a more understandable message. Problem 3 was a slightly more complicated problem that made you try to match two sites for each other based on common words. And finally problem 2 was the hardest. It involves taking any number of different lines in a two-dimensional world and returning the percent of the view that each color consumed for a 1D camera. The way that I had done this was using the angles and storing the segments of angles that had not been taken up yet by an object and moving away from the camera.
Overall I would consider this contest a success, but still I hope that the next one will have a greater turn out, and possibly some more successful submissions.
-Robert Frank
Contest Standings
Rank |
Name |
1 |
2 |
3 |
4 |
5 |
6 |
Total Time |
Problems Solved |
| 1 |
Jason Loew |
0:29 |
- |
- |
0:13 |
- |
- |
0:42 |
2 |
| 2 |
Alex Jaspersen |
1:04 |
- |
1:16 |
- |
- |
- |
2:20 |
2 |
| * |
Drew |
0:10 |
- |
- |
- |
- |
- |
0:10 |
1 |
| 3 |
James M Leddy |
- |
- |
- |
1:41 |
- |
- |
1:41 |
1 |
| 4 |
gstodda1 |
- |
- |
- |
1:54 |
- | - |
1:54 |
1 |
Honorable Mention
| Andres Concepcion David Lundgren Zach gregStoddard |
BenKreuter Kevin Briggs cdecruz1 ricky |
StarNull avadh patel Jiri Stehlik Jacob DAgostino |
* Competitors who were not eligible for prizes were not ranked
Problem Statements
Problem 1 - Problem 2 - Problem 3 - Problem 4 - Problem 5 - Problem 6
Testcases
There is a folder of testcases for each problem. The input files are labelled "1.input", "2.input", etc. and their corresponding output files are labelled "1.output", "2.output", etc.
Problem 1 - Problem 2 - Problem 3 - Problem 4 - Problem 5 - Problem 6
Solutions
All the solutions provided are in C++.
Problem 1 - Problem 2 - Problem 3 - Problem 4 - Problem 5 - Problem 6
Submissions
For the purpose of anonymity, submissons have been posted by ID number rather than by name.
1508 - 1942 - 2826 - 2968 - 3277 - 3323 - 3788 - 4123 - 4267 - 6325 - 6769 - 8995
Summary
| Contest Number |
BU5 |
| Date |
February 12th, 2007 |
| Location | Binghamton University, Academic A, Room G04 |
| Sponsors | Bloomberg |
| Number of problems |
6 |
| Number of competitors |
17 |
| Registration time |
7:45 PM |
| Contest start time |
7:50 PM |
| Contest end time |
9:50 PM |
| Supported Languages |
C/C++, Java, and C# |
| Timeout period |
5 seconds |
| Prizes |
First Prize iPod Nano, Second Prize $75, Third Prize $45 (Amazon gift certificates) |
| Other Prizes |
Bloomberg calendar post-its |
| Food and beverage |
Nirchi's pizza, soda |