Welcome to Computing Club's Exec Selection Contest! This is the mirrored/unofficial version of the contest.
You have \(4\) hours to solve \(6\) problems with difficulty ranging from CCC S3 to CCC S5. Each problem is worth a total of \(100\) points.
These problems are not sorted by difficulty. You are recommended to read all \(6\) problems and try each of them.
In case of ties, the time of your last submission that scored points will be used as tiebreaker for this contest.
- Make sure you read all of the problems. There will be subtasks that allow you to get partial points, and every point counts.
- All problems have been tested with C++ and Python. The time limit for each problem will be at least 2x the reference solution's execution time. For most problems the Java time limit will be set to be equal to Python's time limit.
- As with any contest, discussing contest problems before the contest end date is strictly prohibited. The only exception is the post-contest discussion channel in the club server, which can only be accessed once your window is over.
|CBOJ Exec Selection Contest Problem 1 - Networking||12p||50.0%||8|
|CBOJ Exec Selection Contest Problem 2 - Pretty Sequence||15p||6.4%||3|
|CBOJ Exec Selection Contest Problem 3 - Lucky Modulo 7||15p||23.0%||5|
|CBOJ Exec Selection Contest Problem 4 - Bob and Books||15p||10.3%||4|
|CBOJ Exec Selection Contest Problem 5 - Interesting Words||15p||24.2%||4|
|CBOJ Exec Selection Contest Problem 6 - Cult||17p||18.8%||3|