Patuljci

ID: patuljci

Difficulty: 1.7

CPU Time: 1 second

Memory: 1024 MB

Solution

For this, read in all 9 numbers and total them up. Then, iterate through a set of nested loops, checking each pair of dwarves possible; if the total minus their hats is equal to 100, output all the hats except these two and exit.