ICPC World Finals 2025
Disclaimer This is an unofficial analysis of some possible ways to solve the problems of the ICPC World Finals 2025. They are not intended to give a complete solution, but rather to outline some approach that can be used to solve the problem. If some of the terminology or algorithms mentioned below are not familiar to you, your favorite search engine should be able to help. If you find an error, please send an e-mail to per.austrin@gmail.com about it.
— Bruce Merry, Arnav Sastry, Paul Wild
| A | A-Skew-ed Reasoning |
| B | Blackboard Game |
| C | Bride of Pipe Stream |
| D | Buggy Rover |
| E | Delivery Service |
| F | Herding Cats |
| G | Lava Moat |
| H | Score Values |
| I | Slot Machine |
| J | Stacking Cups |
| K | Treasure Map |
| L | Walking on Sunshine |
Congratulations to St. Petersburg State University
for the title as the 2025 ICPC World Champions!
A note about solution sizes: below the size of the smallest judge solutions for each problem is given. These numbers are just there to give an indication of the order of magnitude. The judge solutions were not written to be minimal (though some of us may overcompactify our code) and can trivially be made shorter by removing spacing, renaming variables, and so on.