**CodeCon: F2023 TU**
This page contains details about the 2023 December 2 CodeCon programming contest.
This contest is for Taylor University students only and will take place in Euler 201.
There are two team divisions.
- Beginner: TU students who haven't taken COS 200+
- Advanced: All TU students
All members create a Kattis account with their Taylor email and then register.
# Results
Here are the results of the competition!
## Beginner Division
  
| Rank | Solved | Points | Team Name | Members |
| :---: | :---: | :---: | :--- | :--- |
| 1 | 8 | 991 | CtrlShiftElite | Rebekah Firestone
Kendrick Xavier Myers |
| 2 | 7 | 917 | Byte Brigade | Anthony Buyer
Maegen Hill
Carlos Sanabria |
| 3 | 6 | 606 | Pingüinos | Riana Schultz
Noah Wills
Grace Fandrich |
| 4 | 5 | 507 | Cyber Daemons | Kolby Tom
Scottie Housholder |
| 5 | 4 | 464 | Puzzle Programmers | Golden Khaw Tin Mang
Matthew Roderer |
| 6 | 4 | 611 | Grace and Andre | Grace Bolton
Andre Mugarura |
See more details on the [Kattis Standings Page](https://open.kattis.com/contests/yp994h/standings).
The questions for the Beginner Division were:
1. [Bílskúrar](https://open.kattis.com/contests/yp994h/problems/bilskurar)
1. [Eight Queens](https://open.kattis.com/contests/yp994h/problems/8queens)
1. [Who can win?](https://open.kattis.com/contests/yp994h/problems/vemkanvinna)
1. [Subway Planning](https://open.kattis.com/contests/yp994h/problems/subwayplanning)
1. [Fast Food Prizes](https://open.kattis.com/contests/yp994h/problems/fastfood)
1. [Frumtölutalning](https://open.kattis.com/contests/yp994h/problems/frumtolutalning)
1. [Röðunarrugl](https://open.kattis.com/contests/yp994h/problems/rodunarrugl)
1. [Mean Words](https://open.kattis.com/contests/yp994h/problems/meanwords)
1. [This Ain't Your Grandpa's Checkerboard](https://open.kattis.com/contests/yp994h/problems/thisaintyourgrandpascheckerboard)
1. [Aaah!](https://open.kattis.com/contests/yp994h/problems/aaah)
1. [Breaking Branches](https://open.kattis.com/contests/yp994h/problems/breakingbranches)
1. [Seven Wonders](https://open.kattis.com/contests/yp994h/problems/sevenwonders)
## Advanced Division
  
| Rank | Solved | Points | Team Name | Members |
| :---: | :---: | :---: | :--- | :--- |
| 1 | 6 | 519 | IDK, Graphs | Jordan Norris
Sterling Davis
Nathan Filson |
| 2 | 6 | 671 | Sammy 0000 0010 | Luke Stone
Carter McHugh
Ethan Reddy |
| 3 | 6 | 808 | seg_fault | Lance VanErmen
Noah Gegner
Nathan Erickson |
| 4 | 6 | 848 | Trifecta | Emersyn Funk
Keenan Clegg
Ryan Hanak |
| 5 | 6 | 1069 | SyntaxSorcerers | Ethan Hoyt
Justin Victor
Michael Jessup |
| 6 | 4 | 571 | 1WW | Nathan Turner
Luke Balkema
Jacob Beals |
| 7 | 3 | 239 | Insomniacs with Running Problems | Joshua Brown
Jack Hammond |
| 8 | 3 | 418 | CodeCone | SeongHo Park
Sameer Sikander |
See more details on the [Kattis Standings Page](https://open.kattis.com/contests/hq4jhe/standings).
The questions for the Advanced Division were:
1. [Boss Battle](https://open.kattis.com/problems/bossbattle)
1. [Conga Line](https://open.kattis.com/problems/congaline)
1. [Framvindustika](https://open.kattis.com/problems/framvindustika)
1. [Hittast](https://open.kattis.com/problems/hittast)
1. [Matarinnkaup](https://open.kattis.com/problems/matarinnkaup)
1. [The Bus Card](https://open.kattis.com/problems/busskortet)
1. [A Rational Sequence 2](https://open.kattis.com/problems/rationalsequence2)
# Images
# Timeline
The following are dates and times to keep in mind.
## Practice Session
The department will hold a practice session Tuesday, Nov 28, 7–9pm in Euler 217.
There you can learn some general strategies and practice some contest-like problems.
See the [Programming Contest Strategies document](https://gfx.cse.taylor.edu/events/programming-contest) for strategies and practice problems and the [Open Kattis Tutorial page](https://open.kattis.com/languages) for a list of accepted languages and tips on usage (more printable form [here](https://codecon.cse.taylor.edu/kattis-help/)).
## Competition Day
The following is the schedule for Saturday, 2023 December 2.
| | | |
| ---: | :--- | :--- |
| 10:00 am | Introduction | Euler 201 |
| 10:30 am | Practice Session | Euler 201 |
| 12:00 pm | Break for lunch | (on your own) |
| 1:00 pm | Competition Begins | Euler 201 |
| 5:00 pm | Competition Ends | Euler 201 |
| 5:15 pm | Ceremony | Euler 201 |
During the Introduction phase, we will cover the contest rules, the formal of the contest, and try some practice problems.
At noon, we will break for lunch (eat on your own), but every team needs to be back by 1pm when the competition begins!
All teams have 4hrs total or until 5pm, whichever is first, to finish as many of the problems as possible.
# Competition Details
Below are details about the competition.
## Contest Rules
- Two Divisions: Beginner, Advanced
- No student who has taken a COS 200+ course may participate in the Beginner division.
- Any student may be in the Advanced division.
- Teams consist of either 2 or 3 current Taylor University students
- No solo teams. No teams of 4 or more.
- Each team may use exactly one workstation with one keyboard and one mouse
- Teams can submit solutions using any of the languages listed in the Languages section below at any time during the competition
- Only resources allowed:
- Printed references (ex: books)
- No "cheat sheets" will be allowed
- Only certain websites
- C++: [cppreference](https://en.cppreference.com/w/), [cplusplus](https://www.cplusplus.com/reference/)
- Haskell: [documentation](https://www.haskell.org/documentation/)
- Java: [docs.oracle.com](https://docs.oracle.com/javase/10/docs/api/overview-summary.html)
- Prolog: [reference manual](https://www.swi-prolog.org/pldoc/doc_for?object=manual)
- Python 3: [Python 3.8 Documentation](https://docs.python.org/3.8/)
- This site and the programming contest server site
- **IMPORTANT:** General search engine searches (Google, Bing, DuckDuckGo, AltaVista, AOL, Ask Jeeves, etc.), developer debugging sites (StackOverflow, etc.), AI-assisted tools (Copilot, ChatGPT, TabNine, etc.), and other online resources will _**NOT**_ be allowed during the competition
- Scratch paper and pencils will be provided
- No phone-usage is allowed during the competition
## Problems and Judging
All teams (regardless of division) will be given 6–9 problems to solve in a 4 hour block of time.
Each problem will consist of a problem story, the specifications for the input, the specifications for the output, runtime and memory constraints for the problem, and at least one sample input and corresponding output.
Teams can submit solutions to problems in any order, and they are allowed to resubmit solutions until success.
A problem is considered solved if the team submits a program which can correctly pass all of the (hidden) tests within the runtime and memory constraints.
Although teams can submit solutions as often as they choose, teams are strongly encouraged to test their code on the workstation prior to submission, because each incorrect submission incurs a time penalty (see details in next paragraph).
Teams are ranked based on the number of problems solved correctly, breaking any ties with penalties.
Penalties are sum of time + 20 minutes for each wrong submission for all _solved_ problems.
This means that if several teams solved all of the problems, the team with the smallest sum of time and fewest number of wrong submissions would be declared the winning team.
## Languages
The programming contest server can accept solutions in many different languages.
Teams are allowed to submit solutions to problems using any of the accepted languages.
!!! WARNING
Although there are many possible languages, participants will be limited to the references sites listed above.
Teams are encouraged to bring printed reference materials.
!!! NOTE
If the language supports an exit code, any non-zero exit code will be interpreted as a Run Time Error
See [Open Kattis Tutorial page](https://open.kattis.com/languages) for details on which languages are accepted, which compiler / runtime environment will be used, what compiler / runtime flags will be passed, which libraries are allow, etc.