2 Calculate the number of assignment pairs, where
3 one range fully contains the other.
8 def compare(elf0, elf1):
9 return elf1["start"] <= elf0["start"] <= elf1["end"]
12 with open("4.in") as fh:
17 for elf in line.split(","):
18 elf_s, elf_e = [int(x) for x in elf.split("-")]
24 elf0_overlaps = compare(elves[0], elves[1])
25 elf1_overlaps = compare(elves[1], elves[0])
27 if elf0_overlaps or elf1_overlaps: