**CodeCon: F2022 TU**
This page contains details about the 2022 December 3 CodeCon programming contest.
This contest is for Taylor University students only and will take place in Euler 103, 201, 217, and 218.
# Results
Here are the results of the competition!
## Non-CSE Division
There were no Non-CSE Division teams this contest.
## Beginner Division
  
| Rank | Solved | Time | Team Name | Members |
| :---: | :---: | :---: | :--- | :--- |
| 1 | 6 | 372 | Denninglings | Cora Denning
Linus Denning |
| 2 | 6 | 507 | Team | Jude Heberlein
Ryan Hanak
Keenan Clegg |
| 3 | 6 | 688 | BrohoBoys | Jordan Norris
Nathan Samson |
| 4 | 6 | 844 | Palindrome | Dayne Pefley
Hannah Hartong
Caleb Hodel |
| 5 | 5 | 444 | The Three Musketeers | Carter McHugh
Isaac Elkin
Luke Stone |
| 6 | 5 | 689 | TheBig3 | Manzi Rugari
Mingyu Park
Eynkyu Lee |
| 7 | 4 | 185 | Duo | Joshua Brown
Nortan Rainey |
| 8 | 4 | 325 | THE LEGEND OF TYCHEAL | Michael Jessup
Kyle Hirschelman
Tim Stone |
| 9 | 4 | 397 | Pythons | Connor Schmidt
Brayden Potoski
Nathan Filson |
| 10 | 4 | 452 | Code B.E.E. | Brianna Rawlings
Emilie Engels
Emersyn Funk |
See more details on the [Kattis Standings Page](https://open.kattis.com/contests/fh34x7/standings).
The questions for the Beginner Division were:
1. [Doorman](https://open.kattis.com/contests/fh34x7/problems/doorman)
2. [FBI Universal Control Numbers](https://open.kattis.com/contests/fh34x7/problems/fbiuniversal)
3. [Reverse](https://open.kattis.com/contests/fh34x7/problems/ofugsnuid)
4. [Triple Texting](https://open.kattis.com/contests/fh34x7/problems/tripletexting)
5. [Vaccine Efficacy](https://open.kattis.com/contests/fh34x7/problems/vaccineefficacy)
6. [Which Base is it Anyway?](https://open.kattis.com/contests/fh34x7/problems/whichbase)
7. [Exoplanet Lighthouse](https://open.kattis.com/contests/fh34x7/problems/exoplanetlighthouse)
8. [Yoda](https://open.kattis.com/contests/fh34x7/problems/yoda)
9. [Zoom](https://open.kattis.com/contests/fh34x7/problems/zoom)
## Advanced Division
  
| Rank | Solved | Time | Team Name | Members |
| :---: | :---: | :---: | :--- | :--- |
| 1 | 5 | 704 | Trinity | Elisha Muwanguzi
Evan Mink
Owen Elliot |
| 2 | 3 | 342 | Grace Olson Gamers | Jada Bonnett
Alivia Gustrowsky |
| 3 | 3 | 496 | áǎà | Kate Mikels
Hanwen Luan
Sophia Ku |
| 4 | 3 | 523 | seg_fault | Lance VanErman
Nathan Erickson
Noah Gegner |
| 5 | 2 | 265 | Computationally Challenged | Ashley Moore
Mason Holland |
| 6 | 2 | 344 | KodeKon | Donghwan Hwang
Juyoung Jung |
See more details on the [Kattis Standings Page](https://open.kattis.com/contests/s2y6wo/standings).
The questions for the Advanced Division were:
1. [Path Tracing](https://open.kattis.com/contests/s2y6wo/problems/pathtracing)
2. [Pebble Solitaire](https://open.kattis.com/contests/s2y6wo/problems/pebblesolitaire)
3. [Peragrams](https://open.kattis.com/contests/s2y6wo/problems/peragrams)
4. [Poplava](https://open.kattis.com/contests/s2y6wo/problems/poplava)
5. [Powers of 2 (Easy)](https://open.kattis.com/contests/s2y6wo/problems/powersof2easy)
6. [Problem Classification](https://open.kattis.com/contests/s2y6wo/problems/problemclassification)
7. [Proofs](https://open.kattis.com/contests/s2y6wo/problems/proofs)
# Images
# Timeline
The following are dates and times to keep in mind.
## Practice Session
The department will hold a practice session on Thursday (Dec 1), 7pm in Euler 201.
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/help) 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, 2022 December 3.
| | | |
| ---: | :--- | :--- |
| 10:00 am | Introduction | Euler 217 |
| 10:30 am | Practice Session | Euler 201 |
| 12:00 pm | Break for lunch | (on your own) |
| 1:00 pm | Competition Begins | TBA |
| 5:00 pm | Competition Ends | TBA |
| 5:15 pm | Ceremony | Euler 109 |
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
- Three Divisions: Non-CSE, Beginner, Advanced
- The Non-CSE division is only for students who are not majoring in a Computer Science or Engineering degree (i.e., CS, CSDM, CCY, CEN).
- 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.), 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/help) 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.