norvig / pytudes

Line 104 in 994d790

"in1: Set[int] = set(data(1, int))\n",

Line 110 in 994d790

" if x != y)"

The puzzle description doesn't guarantee that each entry is unique; it's possible that a report contains the entry 1010 twice.

Line 123 in 994d790

" if x != z != y)"

If we want to find unique entries anyway, this comparison chain does not preclude x == y. Perhaps use x < y < z ?

Chaining comparisons and assumed uniqueness