2002 ACM Greater New York Regional Collegiate Programming Contest

ACM Regional Collegiate
Programming Contest
Sponsored by
and
Barclay's Capital Management

Greater New York Region

Sunday, November 3, 2002
Columbia University in New York, NY

Problems

The problems are given as PDF documents. You can download all problems zipped together.

The standings and submission details are also available.

Problem	Judges' Input File	Correct Output	Correct submissions	Total submissions
A - Four Quarters B - The Drunk Jailer C - Lingo D - Number Base Conversion E - Unimodal Palindromic Decompositions F - Extended Lights Out G - Dehuff H - Picture Puzzle I - Strictly Inscribed Similar Triangles	(no input) problemb.in problemc.in problemd.in probleme.in problemf.in problemg.in problemh.in problemi.in	problema.out problemb.out problemc.out problemd.out probleme.out problemf.out problemg.out problemh.out problemi.out	16 52 14 12 10 5 0 2 0	28 75 154 25 23 12 8 4 0

Notes on several of the problems:

Problem B - The Drunk Jailer: This problem has a nice analytical solution. If there are n cells, then exactly floor( sqrt(n) ) prisoners escape. I am quite embarassed to admit that I wrote this problem, though I did not invent it, and I didn't realize it had an analytic solution until three days after the contest. See if you can derive the solution.
Problem C - Lingo: Most of the incorrect submissions were either missing the initial newline, or they forgot to read the initial newline in the dataset(s). If the first line of the output is wrong, the problem is marked as wrong.
Problem D - Number Base Conversion: Java does support arbitratry bases, but only up to base 36 (numbers and one set of letters).
All problems: All the judges' solutions were written in either C or C++ (strangely enough, none of the judges' solutions used Java). None of the judges' solutions used template libraries or "String" objects.

Back to the contest home page.

Last updated 6 November 2002. Please e-mail with comments, questions, or corrections.