Computing Club Exec Selection Contest 2
Welcome to Computing Club's second ever Exec Selection Contest!
You have \(3\) hours to solve \(5\) problems with difficulty ranging from CCC J1 to CCC S3. Each problem is worth a total of \(100\) points.
The execs for the 2023-2024 school year will be selected using your form responses and score from this contest.
These problems are not sorted by difficulty. You are recommended to read all \(5\) 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.
Additional Information:
- 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 C++'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.
Good luck!
Problems
Problem | Points | AC Rate | Users |
---|---|---|---|
CBOJ Exec Selection Contest 2 Problem 1 - Vowels | 3 | 35.4% | 13 |
CBOJ Exec Selection Contest 2 Problem 2 - Patryk and Primes | 5 | 23.7% | 10 |
CBOJ Exec Selection Contest 2 Problem 3 - Anita's Array | 7 | 10.2% | 5 |
CBOJ Exec Selection Contest 2 Problem 4 - George's Graph | 10 | 24.2% | 3 |
CBOJ Exec Selection Contest 2 Problem 5 - Obligatory Data Structure Problem | 12 | 12.5% | 3 |
Comments