This contest was so entertaining! Nice work navigating those edge cases and battling to see who is the boss of Adelaide!
| Number of Questions | Number of Teams |
|---|---|
| 1 | 19 |
| 3 | 14 |
| 5 | 8 |
| 7 | 4 |
| 8 | 1 |
| Question | Value | |
|---|---|---|
| Most Solved | A. Artificial Intelligence | 19 |
| Least Solved | F. Tower of Tom’s | |
| G. Footy Fanatics | 0 | |
| Highest AC Rate | B. End of the Line | 77.3% |
| Lowest AC Rate | C. Grid City | 12.5% |
| Question | Solved By | Time |
|---|---|---|
| A. Artificial Intelligence | COODERS | 00:03:42 |
| B. End of the Line | SEGFAULT_SQUAD | 00:10:45 |
| C. Grid City | SEGFAULT_SQUAD | 02:41:41 |
| D. Run It Back Rundle | SEGFAULT_SQUAD | 00:34:55 |
| E. The Mall’s Balls’ Balls | BYTE ME | 01:47:59 |
| F. Tower of Tom’s | - | - |
| G. Footy Fanatics | - | - |
| H. Typical! | ACRONYM | 00:15:51 |
| I. Fringe Benefits I | LEGDAY TOMORROW | 02:14:18 |
| J. Fringe Benefits II | SHAYUDOESNOTSUCK | 04:17:47 |
| K. Surf the Barossa | SEGFAULT_SQUAD | 01:00:44 |
| L. Invalid Crashout | KERMITS | 04:52:06 |
| M. The Merger | POWERPUFF GIRLS | 04:06:47 |
| Place | Team |
|---|---|
| 1st 🥇 | SEGFAULT_SQUAD |
| 2nd 🥈 | KERMITS |
| 3rd 🥉 | SHAYUDOESNOTSUCK |
| 4th | THE_SEMICOLONS |
| 5th | POWERPUFF GIRLS |
| 6th | YBG CLAN |
| 7th | BYTE ME |
| 8th | LEGDAY TOMORROW |
| 9th | Parpoe’s Team |
| 10th | CHIPPY CHIPS |
| Question | Codeforces | Leetcode |
|---|---|---|
| A. Artificial Intelligence | 800 | Easy |
| B. End of the Line | 1000 | Easy |
| C. Grid City | 1600 | Hard |
| D. Run It Back Rundle | 1200 | Medium |
| E. The Mall’s Balls’ Balls | 1400 | Medium |
| F. Tower of Tom’s | 1000 | Easy |
| G. Footy Fanatics | 1400 | Medium |
| H. Typical! | 800 | Easy |
| I. Fringe Benefits I | 1200 | Medium |
| J. Fringe Benefits II | 2000 | Post-Leetcode |
| K. Surf the Barossa | 1000 | Easy |
| L. Invalid Crashout | 1600 | Hard |
| M. The Merger | 1600 | Medium |
Given $n$ students’ AI exam scores, we want to distribute the points among the students so the maximum number of students pass (which is defined as scoring $\ge50$ points).
It’s optimal to greedily give as many students exactly $50$ points as possible, as any additional points can be given to others without decreasing the number of passing students. Be careful though, you may be able to create more units of $50$ points than students who took the exam!
Formally, the solution to this problem can be expressed as:
$$ \min\left(n, \left\lfloor \frac{\sum_{i=1}^{n}X_i}{50}\right\rfloor\right) $$