jumbojavelin - bradendubois/competitive-programming GitHub Wiki
Jumbo Javelin
ID: jumbojavelin
Difficulty: 1.3
CPU Time: 1 second
Memory: 1024 MB
Solution
For this, we can sum the list (fusing them all together), and since there are n-1 fusings, we can subtract this from that sum to account for the lost length on each fusing.