These are my messy solutions for Google Code Jam 2020 in Python 3. May only update after each round so no cheating :)
In each folder, the following files can be present:
- Vanilla files from the problem:
problem.md: A Markdown-version of the problemsample.in: Sample input directly fromproblem.md(Only in non-interactive problems)interactive_runner.py: Interactive runner offered by Code Jam. See explanation on Code Jam FAQ. (Only in interactive problems)testing_tool.py: Testing tool offered by an interactive problem. (Only in interactive problems)
- My files (Uploaded after round ends):
analysis.md: My analysis for the problemsolution-P|F|U[+].py: My best attempt with results marked in the name. E.g., the solution passed 1st but failed 2nd test set and did not have 3rd set checked would be namedsolution-PFU.py- Other files, if present, will be explained in
analysis.md
I usually do not read official analyses because I want to figure them out by myself. Therefore, it may take me weeks, months, even years to solve one problem.
It's good enough; it runs fast enough; I'm lazy; it has much handled for me.
| Round | Pts | Rank | Note |
|---|---|---|---|
| Qualification | 75 | 1562 | |
| 1A | 42 | 3029 |
- Vestigium
- Nesting Depth
- Parenting Partnering Returns
- ESAb ATAd
- Indicium
- Pattern Matching
- Pascal Walk
- Square Dance
Contributions are greatly appreciated! Do a pull request, or just start your own repository! Let me know if there are any errors in my solutions as well! Greatest appreciations in advance!
This work is licensed under GPLv3.
Problems are directly retrieved from Google Code Jam website.