Lyndon's Golf Contest 1
Welcome to DMOJ's first-ever code golf contest!
Each problem in this contest will test your ability to solve the task with the shortest possible source code. Please read the Scoring section for more detailed information.
All problems are created by
.Thanks to
, , , and for testing and feedback on the problems!Special thanks to
for helping us organize the contest!Contest Parameters
- This contest will run for 4 days, starting on November 18, 2022 12AM EST. You will have the full contest duration to participate in the contest.
- This contest will consist of 9 code golf style problems. They are not necessarily in increasing order of difficulty.
- Due to the nature of this contest, each problem can only be submitted to in a single language, one of C/C++, Python, Ruby, or Perl.
- Each problem will offer partial marks that are awarded to correct solutions with a sub-optimal byte count.
- Checkers: unless otherwise specified, identical. All output must terminate with a single
\n
character, and must not contain any leading or trailing whitespace.- Please note that all input files also terminate with
\n
before EOF.
- Please note that all input files also terminate with
- There is no submission limit.
- The scoreboard will be visible throughout the contest.
- This contest is unrated.
Scoring
For all problems in this contest, you will be scored on the number of bytes in your program's source code. Each problem will specify a formula that determines the amount of points you will earn for a given byte count. A lower byte count is guaranteed to result in a higher score, for a maximum of 100 points per problem. Whitespace is included in the byte count, which includes \n
characters. On Windows machines, newlines usually take the form of \r\n
, but they will be automatically converted to \n
before calculating your score.
Tips
- All problems reward partial marks, therefore it is recommended to read through and attempt every problem.
- The aim of code golf is to write the shortest code, not the shortest clean code. Don't be afraid to obfuscate code, exploit problem constraints, and look for test case flaws (if you can find one!).
- Submissions that pass by random chance, however, are not allowed, and such a submission may be rejudged before final scores are calculated.
- It is not only allowed, but encouraged to use the internet for any resources that may help you during the contest. For example, CGSE offers a tips page for general Python golfing.
Problems
Problem | Points | AC Rate | Users | Editorials |
---|---|---|---|---|
Lyndon's Golf Contest 1 P1 - As Easy As ABC | 0p | 45.2% | 185 | Editorial |
Lyndon's Golf Contest 1 P2 - A Cube Problem | 0p | 55.6% | 144 | Editorial |
Lyndon's Golf Contest 1 P3 - Boolean (Buffed) | 0p | 54.0% | 90 | Editorial |
Lyndon's Golf Contest 1 P4 - Symbolic Ruby | 0p | 40.0% | 24 | Editorial |
Lyndon's Golf Contest 1 P5 - Basic Triangle | 0p | 40.8% | 74 | Editorial |
Lyndon's Golf Contest 1 P6 - Alphanumeric Perl | 0p | 33.9% | 17 | Editorial |
Lyndon's Golf Contest 1 P7 - Fun Factoring | 0p | 42.0% | 42 | Editorial |
Lyndon's Golf Contest 1 P8 - Beautiful Brackets | 0p | 30.2% | 31 | Editorial |
Lyndon's Golf Contest 1 P9 - Fibonacci: The Finale | 0p | 54.0% | 75 | Editorial |
Comments
From what I've heard there are editorials that will be available when the problems are published. As for upsolving and retrieving submissions, currently you can click on the "Virtual Join" button to do those.