LTH training#2 NWERC2018 (data structures)
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Turbo | 1/1 (100%) | 1.00 | 1.00 |
| B | Binary search tree | 1/1 (100%) | 1.00 | 1.00 |
| C | Bread Sorting | 0/0 (0%) | -- | -- |
| D | Polyline Simplification | 0/0 (0%) | -- | -- |
| E | Boxes | 0/0 (0%) | -- | -- |
| F | Compass Card Sales | 0/0 (0%) | -- | -- |
| G | Train Tickets | 0/0 (0%) | -- | -- |
| H | Guessing Camels | 0/0 (0%) | -- | -- |
| I | Association for Convex Main Office | 0/0 (0%) | -- | -- |