NA Programming Camp 2026 - Unofficial Mirror (coaches etc.)
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Useful Algorithm | 1/5 (20%) | 5.00 | 5.00 |
| B | Triangulation | 0/0 (0%) | -- | -- |
| C | Path Planning 2 | 1/11 (9%) | 3.67 | 3.00 |
| D | Minimum Spanning Tree | 4/5 (80%) | 1.25 | 1.25 |
| E | Colorful Segments 2 | 7/25 (28%) | 2.50 | 2.14 |
| F | Matrix | 12/21 (57%) | 1.75 | 1.75 |