Due by 11:59pm on Friday, September 22, in my email inbox. Send your program as an attachment.
The late penalty is 5% per hour.
Using the language you selected, write a program to solve the Poly-polygonal Numbers problem from the 2000 archives of the ACM East-Central NA Regional Programmming Contest. The precise input and output format is specified (including filenames), and your output must match byte-for-byte. Your program must consist of one source file called "poly.zzz", where zzz is an appropriate extension for your language.
Your program can assume that the standard input and output are used (i.e., you do not need to handle file I/O).
You have the judge's solutions available as a guide, but you are not required to use the same algorithms. In fact, you will learn more if you solve it from scratch. Remember that this problem is just one of eight that were designed to be solved during one five-hour contest.
Grading will be on a 100-point scale, based on the number of test cases successfully completed.
Plagiarism Copying all or part of anyone else's code, regardless of the source, is prohibited. Exception: you may use code that I provide in class. Excessive collaboration is a more subtle form of plagiarism involving two or more students in the class; see below.
Collaboration Here's the rule:
You are encouraged to discuss ideas with other students but you may not share any code or answers.
That's it. If you turn in code or answers that are the same as (or very similar to) someone else's, then you have cheated. I don't care what your intentions were. If, after analyzing your code/answers, I think it is statistically very likely that sharing has occurred, I will divide the credit among the offending parties (on the first offense), assign a 0 (on the second offense), or assign an F for the course (on the third offense). Note: when determining whether two pieces of code are the same, I ignore irrelevant differences such as variable names, whitespace, comments, indentation, parentheses, brackets, literal strings, declaration order, and simple logical and/or algebraic code translations.
Unacceptable excuses